NAG-002179 · Accepted whole
Primitive vectors and saturated lattices
5 Tropicalization, multiplicities and balancing
Open in the English reader · PDF page 861
Statement · exact TeX
\begin{lemma}[\bi{Primitive vectors and saturated lattices}
{本原向量与饱和子格}]
\label{cand:elementarylatticesplitting}
\bi{A primitive vector of $\mathbf Z^n$ extends to a lattice
basis. A saturated subgroup $A\subset\mathbf Z^n$ is generated
by part of a basis and has a free quotient. The group
$\mathrm{GL}_n(\mathbf Z)$ is generated by row interchanges,
sign changes, and adding an integer multiple of one row to another.}
{$\mathbf Z^n$ 的本原向量可补成格基。饱和子群
$A\subset\mathbf Z^n$ 由某个基的一部分生成,商群为自由群。
$\mathrm{GL}_n(\mathbf Z)$ 由行交换、变号及将一行的整数倍
加到另一行这些操作生成。}
\end{lemma}
Full selected proof · exact TeX
\begin{proof}
\bi{The Euclidean algorithm, applied successively to coordinate
pairs, uses these invertible row operations to send a vector
to $(d,0,\ldots,0)$, where $d$ is the greatest common divisor
of its coordinates. For a primitive vector $d=1$; applying
the inverse row-operation matrix to the standard basis proves
the first assertion. If $A\ne0$ is saturated, divide a nonzero
element by the greatest common divisor of its coordinates.
Saturation puts the resulting primitive vector $a$ in $A$.
The image of $A$ in $\mathbf Z^n/\mathbf Za\simeq\mathbf Z^{n-1}$
is saturated: if a nonzero integer multiple of a class lies
in that image, a representative has that multiple in $A$,
since $\mathbf Za\subset A$, and hence belongs to $A$.
Induction and lifting a quotient basis now give a basis whose
first members generate $A$.}
{对坐标对逐次使用欧几里得算法,可用上述可逆行操作将向量
化为 $(d,0,\ldots,0)$,其中 $d$ 为各坐标的最大公因数。
对本原向量有 $d=1$;将逆行操作矩阵用于标准基,即得第一
断言。若 $A\ne0$ 饱和,将其中一个非零元素除以各坐标的
最大公因数,饱和性保证所得本原向量 $a$ 仍在 $A$ 中。
$A$ 在 $\mathbf Z^n/\mathbf Za\simeq\mathbf Z^{n-1}$ 中的
像也饱和:若某类的非零整数倍属于该像,则因
$\mathbf Za\subset A$,其代表的该倍数属于 $A$,从而代表
本身属于 $A$。归纳并提升商格的基,就得到以部分基生成
$A$ 的格基。}
\bi{For an invertible integral matrix, the greatest common
divisor of its first column is one, since any common divisor
would divide its determinant $\pm1$. Row operations reduce
that column to the first standard vector. The lower-right
block is again invertible over $\mathbf Z$; reduce it by
induction, and then clear the remaining entries of the first
row using the lower identity rows. This reduces the entire
matrix to the identity and proves the generation assertion.}
{对整可逆矩阵,第一列各项的最大公因数为一,否则该公因数
也整除行列式 $\pm1$。以行操作将该列化为第一个标准向量。
右下块仍在 $\mathbf Z$ 上可逆,归纳将其化为单位阵,再用
下方单位行消去第一行的其余项,便将整个矩阵化为单位阵。
这证明所述生成性。}
\end{proof}
Typeset reader excerpt

Typed proof inputs
- BASE-LINEAR · standing context or base
- BASE-LINEAR · standing context or base (requires)
- BASE-RINGS · standing context or base
- BASE-RINGS · standing context or base (requires)
Proof map
Verified map inputs · NAG-002179
No addressable selected proof input is recorded in this projection.
Standing context and base inputs
BASE-LINEARBASE-RINGS
NAG-002179 · Primitive vectors and saturated lattices · Chapter argument