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.
Full Euclidean lattice and covolume
Definition
Fix . A full lattice in is a subgroup of the form
where are linearly independent over , that is, they form a real basis of . Write for the matrix whose -th column is ; determinants of square matrices are as in For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix. The covolume of is
The value is positive: linear independence of the columns makes invertible, so .
Remarks
Basis independence. Suppose is a second integer basis of , with matrix . Each is an integer combination of the and each is an integer combination of the , so there are matrices with and . Substituting gives , hence because is invertible, and symmetrically . Taking determinants, with both factors integers, so and therefore . Thus the covolume does not depend on the chosen basis, and the definition above is unambiguous.
Discrete subgroups. A subgroup is a full lattice in the sense above exactly when it is discrete in the Euclidean topology and spans ; this equivalence is Milne's Lemma 4.14 together with the identification of full lattices with discrete spanning subgroups (Milne, Ch. 4, pp.73-75). The half-open fundamental parallelotope of a full lattice tiles by -translates with volume , and bounded sets meet in finitely many points; both facts are proved in this batch and used below.
Depends on
Used by
- Minkowski convex-body theorem at equality Corollary
- Mixing scaled and unscaled Minkowski covolumes fails Counterexample
- Successive minima of a convex body Definition
- Attained successive minima and adapted flag Lemma
- Blichfeldt lattice-point principle Lemma
- Bounded primitive integral element for Hermite-Minkowski Lemma
- Fundamental parallelotope and finite bounded intersections Lemma
- Successive-minima volume deformation and collision avoidance Lemma
- Covolume of an integral ideal lattice Theorem
- Minkowski convex-body theorem, strict form Theorem
- Minkowski second theorem on successive minima Theorem
- Number-field integer rings and ideals are full lattices Theorem
- Small nonzero element in a number-field ideal Theorem
Dependency tree · two levels
10 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
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- Brian Conrad and Aaron Landesman, Math 154 Algebraic Number Theory (standard reference, not scraped)