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.
Number-field integer rings and ideals are full lattices
Statement
Let be a number field (Number field) of degree , let be its ring of integers (Ring of integers), and let be the unscaled Minkowski embedding (Unscaled Minkowski embedding). Then:
- is a full lattice in (Full Euclidean lattice and covolume);
- for every nonzero fractional -ideal (Fractional ideals), the image is a full lattice in .
No choice principle is used: both lattices are exhibited by explicit -bases. The proof fixes one basis for the given ring of integers, considers one ideal or subgroup at a time, and at each finite induction stage selects one lift from a single nonempty fiber; it does not select simultaneously from an arbitrary family of nonempty sets.
Facts & Assumptions
Given: A number field of degree , its ring of integers , and the unscaled Minkowski embedding .
For every ordered -basis of the real matrix whose -th column is is invertible, and (Unscaled Minkowski embedding, Embedding determinant formula).
is a free -module of rank (The ring of integers has rank the degree).
Every additive subgroup of is for a unique nonnegative integer , with when the subgroup is nonzero (Every subgroup of is for exactly one natural number ).
An ideal is an additive subgroup with for all , ; in particular an ideal of is a -submodule of , and for every (Left, right and two-sided ideals).
A fractional ideal of is a nonzero -submodule for which some satisfies (Fractional ideals).
A full lattice is by definition the -span of a real basis of (Full Euclidean lattice and covolume).
Proof
For every ordered -basis of , let have columns . By [F1], is invertible; hence these images form a real basis of .
Choose a -basis of , which exists by [F2]. A rational relation among the , multiplied by a positive common denominator, would be an integer relation, so -independence makes them -independent. There are of them, so they form a -basis of .
We prove by induction on that every additive subgroup of has a finite -basis with at most members. The claim holds for , since its only subgroup is , with empty basis.
Let , assume the claim for , and project onto its first coordinate. By [F3], the image is for a nonnegative integer . If , lies in the last coordinates, so induction gives a basis with at most members.
By steps 1.1 and 1.2, the vectors form a real basis. Additivity of gives , so this is a full lattice by [F6]. This proves clause 1.
If , choose whose first coordinate is . The kernel of the projection, viewed in , has a basis by induction, with . Every has first coordinate for a unique , so ; hence span . If with integer coefficients, the first coordinate gives , hence , and independence of the basis of gives every . Together with the case, this proves the induction claim.
Let be a nonzero integral ideal. It is an additive subgroup by [F4]. Using the basis of from step 1.2 to identify it with , steps 1.3, 2.1, and 3.1 give a -basis of with . Choose ; then by [F4].
For any nonzero , coordinate multiplication by the values of the embeddings at defines a block-diagonal real map . Its real blocks are the nonzero scalars ; a complex block is represented by , whose determinant is because each embedding is injective. Thus is invertible. In particular, for the element chosen in step 4.1, and . Applying to the basis in step 2.2 gives a real basis, whose integer span is a full lattice by [F6]; hence spans .
Since are -independent, they are -independent: a rational relation, after multiplication by a positive common denominator, is an integer relation and therefore has all coefficients zero. Additivity gives , so these images span it over . Step 5.1 forces , while step 4.1 gives . Thus , the form a -basis of , and [F1] makes their images a real basis. Therefore is a full lattice.
Let be a nonzero fractional -ideal. By [F5], choose with . The set is an ideal because is an -submodule, and it is nonzero because multiplication by in the field is injective. Thus step 6.1 shows that is a full lattice.
The real-coordinate multiplication is invertible by the block calculation of step 5.1. From and we obtain . If is a lattice basis of from step 7.1, then is a real basis and its integer span is ; thus is a full lattice by [F6]. This proves clause 2.
Clause 1 is step 2.2 and clause 2 is step 8.1, so both assertions of the statement hold.
Depends on
- Unscaled Minkowski embedding
- Full Euclidean lattice and covolume
- Embedding determinant formula
- The ring of integers has rank the degree
- Every subgroup of $(\mathbb{Z}, +)$ is $\langle n \rangle = n\mathbb{Z}$ for exactly one natural number $n$
- Left, right and two-sided ideals
- Fractional ideals
- Number field
- Ring of integers
Used by
Dependency tree · two levels
41 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)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)