Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge 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.

Number-field integer rings and ideals are full lattices

Statement

Let K be a number field (Number field) of degree n=[K:Q], let OK be its ring of integers (Ring of integers), and let σ:K→Rn be the unscaled Minkowski embedding (Unscaled Minkowski embedding). Then:

  1. σ(OK) is a full lattice in Rn (Full Euclidean lattice and covolume);
  2. for every nonzero fractional OK-ideal I (Fractional ideals), the image σ(I) is a full lattice in Rn.

No choice principle is used: both lattices are exhibited by explicit Z-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 K of degree n=[K:Q], its ring of integers OK, and the unscaled Minkowski embedding σ.

[F1]

For every ordered Q-basis α1,…,αn of K the real n×n matrix A whose j-th column is σ(αj) is invertible, and ∣det⁡A∣=2−r2∣disc⁡(α1,…,αn)∣≠0 (Unscaled Minkowski embedding, Embedding determinant formula).

[F2]

OK is a free Z-module of rank n (The ring of integers has rank the degree).

[F3]

Every additive subgroup of Z is dZ for a unique nonnegative integer d, with d>0 when the subgroup is nonzero (Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n).

[F4]

An ideal I⊴R is an additive subgroup with ri∈I for all r∈R, i∈I; in particular an ideal a of OK is a Z-submodule of OK, and uOK⊆a for every u∈a (Left, right and two-sided ideals).

[F5]

A fractional ideal of OK is a nonzero OK-submodule I⊆K for which some 0≠d∈OK satisfies dI⊆OK (Fractional ideals).

[F6]

A full lattice is by definition the Z-span Zb1⊕⋯⊕Zbn of a real basis b1,…,bn of Rn (Full Euclidean lattice and covolume).

Proof

1.1F1givenalgebra

For every ordered Q-basis α1,…,αn of K, let A have columns σ(αj). By [F1], A is invertible; hence these images form a real basis of Rn.

1.2F2algebrachoose

Choose a Z-basis α1,…,αn of OK, which exists by [F2]. A rational relation among the αi, multiplied by a positive common denominator, would be an integer relation, so Z-independence makes them Q-independent. There are n=[K:Q] of them, so they form a Q-basis of K.

1.3given

We prove by induction on m≥0 that every additive subgroup of Zm has a finite Z-basis with at most m members. The claim holds for m=0, since its only subgroup is {0}, with empty basis.

2.1F3step 1.3

Let m>0, assume the claim for m−1, and project H≤Zm onto its first coordinate. By [F3], the image is dZ for a nonnegative integer d. If d=0, H lies in the last m−1 coordinates, so induction gives a basis with at most m−1 members.

2.2F6step 1.1step 1.2algebra

By steps 1.1 and 1.2, the vectors σ(α1),…,σ(αn) form a real basis. Additivity of σ gives σ(OK)=Zσ(α1)⊕⋯⊕Zσ(αn), so this is a full lattice by [F6]. This proves clause 1.

3.1step 1.3step 2.1choosealgebra

If d>0, choose h∈H whose first coordinate is d. The kernel H0 of the projection, viewed in Zm−1, has a basis k1,…,ks by induction, with s≤m−1. Every g∈H has first coordinate qd for a unique q∈Z, so g−qh∈H0; hence h,k1,…,ks span H. If ah+∑ibiki=0 with integer coefficients, the first coordinate gives ad=0, hence a=0, and independence of the basis of H0 gives every bi=0. Together with the d=0 case, this proves the induction claim.

4.1F2F4step 1.2step 1.3step 3.1choose

Let a⊆OK be a nonzero integral ideal. It is an additive subgroup by [F4]. Using the basis of OK from step 1.2 to identify it with Zn, steps 1.3, 2.1, and 3.1 give a Z-basis β1,…,βr of a with r≤n. Choose 0≠u∈a; then uOK⊆a by [F4].

5.1F4F6step 4.1step 2.2algebra

For any nonzero v∈K, coordinate multiplication by the values of the embeddings at v defines a block-diagonal real map Lv. Its real blocks are the nonzero scalars σi(v); a complex block τj(v)=a+ib is represented by (a−bba), whose determinant is a2+b2=∣τj(v)∣2>0 because each embedding is injective. Thus Lv is invertible. In particular, for the element u chosen in step 4.1, σ(ux)=Luσ(x) and Lu(σ(OK))=σ(uOK)⊆σ(a). Applying Lu to the basis in step 2.2 gives a real basis, whose integer span is a full lattice by [F6]; hence σ(a) spans Rn.

6.1F1F6step 4.1step 5.1algebra

Since β1,…,βr are Z-independent, they are Q-independent: a rational relation, after multiplication by a positive common denominator, is an integer relation and therefore has all coefficients zero. Additivity gives σ(a)=Zσ(β1)+⋯+Zσ(βr), so these images span it over R. Step 5.1 forces r≥n, while step 4.1 gives r≤n. Thus r=n, the βi form a Q-basis of K, and [F1] makes their images a real basis. Therefore σ(a)=Zσ(β1)⊕⋯⊕Zσ(βn) is a full lattice.

7.1F5step 6.1choose

Let I be a nonzero fractional OK-ideal. By [F5], choose 0≠d∈OK with b:=dI⊆OK. The set b is an ideal because I is an OK-submodule, and it is nonzero because multiplication by d≠0 in the field K is injective. Thus step 6.1 shows that σ(b) is a full lattice.

8.1F5F6step 5.1step 7.1algebra

The real-coordinate multiplication Ld is invertible by the block calculation of step 5.1. From b=dI and σ(dx)=Ldσ(x) we obtain Ld(σ(I))=σ(b). If γ1,…,γn is a lattice basis of σ(b) from step 7.1, then Ld−1γ1,…,Ld−1γn is a real basis and its integer span is σ(I); thus σ(I) is a full lattice by [F6]. This proves clause 2.

9.1step 2.2step 8.1∎

Clause 1 is step 2.2 and clause 2 is step 8.1, so both assertions of the statement hold.

Depends on

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