The Stacks project

\begin{equation*} \DeclareMathOperator\Coim{Coim} \DeclareMathOperator\Coker{Coker} \DeclareMathOperator\Ext{Ext} \DeclareMathOperator\Hom{Hom} \DeclareMathOperator\Im{Im} \DeclareMathOperator\Ker{Ker} \DeclareMathOperator\Mor{Mor} \DeclareMathOperator\Ob{Ob} \DeclareMathOperator\Sh{Sh} \DeclareMathOperator\SheafExt{\mathcal{E}\mathit{xt}} \DeclareMathOperator\SheafHom{\mathcal{H}\mathit{om}} \DeclareMathOperator\Spec{Spec} \newcommand\colim{\mathop{\mathrm{colim}}\nolimits} \newcommand\lim{\mathop{\mathrm{lim}}\nolimits} \newcommand\Qcoh{\mathit{Qcoh}} \newcommand\Sch{\mathit{Sch}} \newcommand\QCohstack{\mathcal{QC}\!\mathit{oh}} \newcommand\Cohstack{\mathcal{C}\!\mathit{oh}} \newcommand\Spacesstack{\mathcal{S}\!\mathit{paces}} \newcommand\Quotfunctor{\mathrm{Quot}} \newcommand\Hilbfunctor{\mathrm{Hilb}} \newcommand\Curvesstack{\mathcal{C}\!\mathit{urves}} \newcommand\Polarizedstack{\mathcal{P}\!\mathit{olarized}} \newcommand\Complexesstack{\mathcal{C}\!\mathit{omplexes}} \newcommand\Pic{\mathop{\mathrm{Pic}}\nolimits} \newcommand\Picardstack{\mathcal{P}\!\mathit{ic}} \newcommand\Picardfunctor{\mathrm{Pic}} \newcommand\Deformationcategory{\mathcal{D}\!\mathit{ef}} \end{equation*}

Lemma 10.114.1. Let $n \in \mathbf{N}$. Let $N$ be a finite nonempty set of multi-indices $\nu = (\nu _1, \ldots , \nu _ n)$. Given $e = (e_1, \ldots , e_ n)$ we set $e \cdot \nu = \sum e_ i\nu _ i$. Then for $e_1 \gg e_2 \gg \ldots \gg e_{n-1} \gg e_ n$ we have: If $\nu , \nu ' \in N$ then

\[ (e \cdot \nu = e \cdot \nu ') \Leftrightarrow (\nu = \nu ') \]

Proof. Say $N = \{ \nu _ j\} $ with $\nu _ j = (\nu _{j1}, \ldots , \nu _{jn})$. Let $A_ i = \max _ j \nu _{ji} - \min _ j \nu _{ji}$. If for each $i$ we have $e_{i - 1} > A_ ie_ i + A_{i + 1}e_{i + 1} + \ldots + A_ ne_ n$ then the lemma holds. For suppose that $e \cdot (\nu - \nu ') = 0$. Then for $n \ge 2$,

\[ e_1(\nu _1 - \nu '_1) = \sum \nolimits _{i = 2}^ n e_ i(\nu '_ i - \nu _ i). \]

We may assume that $(\nu _1 - \nu '_1) \ge 0$. If $(\nu _1 - \nu '_1) > 0$, then

\[ e_1(\nu _1 - \nu '_1) \ge e_1 > A_2e_2 + \ldots + A_ ne_ n \ge \sum \nolimits _{i = 2}^ n e_ i|\nu '_ i - \nu _ i| \ge \sum \nolimits _{i = 2}^ n e_ i(\nu '_ i - \nu _ i). \]

This contradiction implies that $\nu '_1 = \nu _1$. By induction, $\nu '_ i = \nu _ i$ for $2 \le i \le n$. $\square$


Comments (2)

Comment #2830 by Dario WeiƟmann on

Typo in the proof: "For suppose that ... " should read "Suppose that ... "

Comment #2929 by on

Google:"For I will consider my Cat Jeoffry."


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 051M. Beware of the difference between the letter 'O' and the digit '0'.