Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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 n≥1. A full lattice in Rn is a subgroup Λ⊆Rn of the form

Λ=Zb1⊕⋯⊕Zbn={∑i=1nmibi:mi∈Z},

where b1,…,bn∈Rn are linearly independent over R, that is, they form a real basis of Rn. Write B=(b1 ⋯ bn) for the n×n matrix whose i-th column is bi; determinants of square matrices are as in For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix. The covolume of Λ is

covol⁡(Λ):=∣det⁡B∣.

The value is positive: linear independence of the columns makes B invertible, so det⁡B≠0.

Remarks

Basis independence. Suppose c1,…,cn is a second integer basis of Λ, with matrix C=(c1 ⋯ cn). Each cj is an integer combination of the bi and each bi is an integer combination of the cj, so there are matrices A,A′∈Mn(Z) with C=BA and B=CA′. Substituting gives B=BAA′, hence AA′=In because B is invertible, and symmetrically A′A=In. Taking determinants, (det⁡A)(det⁡A′)=1 with both factors integers, so det⁡A=±1 and therefore ∣det⁡C∣=∣det⁡B∣ ∣det⁡A∣=∣det⁡B∣. Thus the covolume does not depend on the chosen basis, and the definition above is unambiguous.

Discrete subgroups. A subgroup Λ⊆Rn is a full lattice in the sense above exactly when it is discrete in the Euclidean topology and spans Rn; 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 P={∑itibi:0≤ti<1} of a full lattice tiles Rn by Λ-translates with volume covol⁡(Λ), and bounded sets meet Λ in finitely many points; both facts are proved in this batch and used below.

Depends on

Used by

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