How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The index of a full-rank subgroup of is the absolute determinant of a generating matrix
Statement
Let .
- Let and let be the subgroup generated by the columns of . If , then the quotient group is finite of order ; if , then is infinite.
- Every subgroup is for some .
So a subgroup of has finite index exactly when it is generated by the columns of a square integer matrix of nonzero determinant, and its index is then the absolute determinant of every such matrix.
Facts & Assumptions
Given: A natural number , and for clause 1 a matrix with .
Abelian groups and -modules have the same objects and morphisms, so a subgroup of is a -submodule and the quotient group is the quotient module (Abelian groups and -modules have the same objects and morphisms). The ring is a commutative ring with identity in which a product of nonzero elements is nonzero, so it is an integral domain, and every subgroup of is cyclic, so every ideal of is principal: is a principal ideal domain (The integers form a commutative ring, The integers have no zero divisors; multiplicative cancellation, Every subgroup of is for exactly one natural number , Principal ideal domain).
For every over a PID there are invertible with and , every ; equivalence means with and (Every matrix over a PID has a Smith normal form, Matrix equivalence and Smith normal form over a PID).
Over a commutative ring , a square matrix is invertible exactly when its determinant is a unit, the determinant of a triangular matrix is the product of its diagonal entries, and the units of are and (For same-sized finite square matrices over a commutative ring, , A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit, The determinant of a triangular matrix is the product of its diagonal entries, is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
For every module homomorphism there is an isomorphism (First isomorphism theorem for modules: ).
For a submodule of a free module of finite rank over a PID there is a basis of the ambient module and nonzero elements with such that is a basis of the submodule (Simultaneous bases for a submodule of a finite free module over a PID).
Proof
By [F1] the quotient is a quotient of -modules, and by [F2] applied over the PID there are with , every .
By [F3], and are units of , hence , so ; and is diagonal, so , which is when and when .
Since is invertible over , , so . The map is an automorphism of carrying onto , so it induces an isomorphism .
Write for , and let send to the tuple of residues , a surjective homomorphism whose kernel is . By [F4], , and with step 2.1 this group is isomorphic to .
If then by step 1.2, so and every is nonzero; each is then finite of order , so by step 3.1 the quotient is finite of order .
If then by step 1.2, so and ; the summand is infinite, so by step 3.1 the quotient is infinite. This proves clause 1.
For clause 2, let be any subgroup of . By [F1] it is a -submodule of the free module of rank over the PID , so [F5] gives a basis of and nonzero , , with a basis of . Let be the matrix whose first columns are and whose remaining columns are zero; its entries are integers because the and the are. Then is the set of integer combinations of those columns, which is exactly , so clause 2 holds; combining it with clause 1 gives the final sentence of the Statement.
Remark
The corollary is what makes the determinant a counting invariant: clause 2 says every subgroup of is a column lattice, and for with nonzero determinant the columns of generate a subgroup of of index exactly , and the Smith invariant factors refine that single number into the isomorphism type of the quotient. Nothing here needs a Euclidean volume: the count comes from the invariant factors, and the determinant enters only because it is unchanged up to sign by multiplication with matrices invertible over .
Depends on
- Every matrix over a PID has a Smith normal form
- Matrix equivalence and Smith normal form over a PID
- Simultaneous bases for a submodule of a finite free module over a PID
- Abelian groups and $\mathbb Z$-modules have the same objects and morphisms
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit
- The determinant of a triangular matrix is the product of its diagonal entries
- $(\mathbb{Z}, \cdot, 1)$ is a commutative monoid whose group of units is $\{1, -1\}$; equivalently $u \mid 1$ holds exactly for $u = 1$ and $u = -1$
- First isomorphism theorem for modules: $M/\ker f\cong\operatorname{im}f$
- The integers form a commutative ring
- The integers have no zero divisors; multiplicative cancellation
- Every subgroup of $(\mathbb{Z}, +)$ is $\langle n \rangle = n\mathbb{Z}$ for exactly one natural number $n$
- Principal ideal domain
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
77 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- M. Brussel, Finitely Generated Modules over a PID, Theorem 4.2.1 (standard reference, not scraped)