Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Bounded primitive integral element for Hermite-Minkowski

Statement

Assume the Axiom of Choice (The Axiom of Choice). Fix an integer n≥2 and a real number B≥1. Let K be a number field of degree n=[K:Q] whose discriminant satisfies ∣dK∣≤B. Then there is an integral element α∈OK with K=Q(α) such that every conjugate of α has modulus at most B+2.

Facts & Assumptions

Given: The Axiom of Choice, an integer n≥2, a real number B≥1, and a number field K of degree n with ∣dK∣≤B. Write (r1,r2) for the signature of K, so n=r1+2r2, and D:=∣dK∣, so 1≤D≤B.

[A1]

The Axiom of Choice implies the Axiom of Countable Choice (AC implies DC implies countable choice), which is the choice hypothesis of the volume fact [F5], invoked in steps 2.2 and 2.3; the strict Minkowski theorem [F2] is applied under the Axiom of Choice assumed in the statement, and no other selection is made in this proof.

[F1]

σ(OK) is a full lattice in Rn with covol⁡(σ(OK))=2−r2∣dK∣ (Number-field integer rings and ideals are full lattices, Covolume of an integral ideal lattice, Full Euclidean lattice and covolume).

[F2]

Minkowski convex-body theorem, strict form: under the Axiom of Choice, a Lebesgue measurable convex centrally symmetric C⊆Rn with λn(C)>2ncovol⁡(Λ) contains a nonzero point of the full lattice Λ (Minkowski convex-body theorem, strict form, Full Euclidean lattice and covolume).

[F3]

The unscaled Minkowski embedding is σ(x)=(σ1(x),…,σr1(x),τ1(x),…,τr2(x)) with each complex coordinate τj(x) split into its real and imaginary parts, and it is injective (Unscaled Minkowski embedding).

[F4]

The embeddings of K into C over Q are the r1 real embeddings σi, and the two members τj,τˉj of each complex conjugate pair. For every 0≠α∈OK the norm is NK/Q(α)=∏i=1r1σi(α)∏j=1r2τj(α)τˉj(α), this product is nonzero because embeddings are injective field homomorphisms, and NK/Q(α)∈Z; hence ∣NK/Q(α)∣≥1 and ∣NK/Q(α)∣=∏i∣σi(α)∣∏j∣τj(α)∣2 (Norm and trace from embeddings, with the inseparable exponent in the norm formula, Trace and norm of an algebraic integer).

[F6]

A product of convex sets is convex, and a product of sets each symmetric about the origin is centrally symmetric; bounded open intervals and open discs are convex and symmetric about the origin (A convex subset of Rm contains every line segment between two of its points).

[F7]

For the finite tower Q⊆Q(α)⊆K, restriction Hom⁡Q(K,C)→Hom⁡Q(Q(α),C) is surjective and every fibre has cardinality [K:Q(α)]s, the separable degree (Restriction partitions embeddings in a finite tower into extension fibres).

[F8]

Fields of characteristic zero are perfect and algebraic extensions of perfect fields are separable; hence K/Q(α) is separable and [K:Q(α)]s=[K:Q(α)] (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect, Every algebraic extension of a perfect field is separable).

[F9]

For N=1, the Gregory--Leibniz finite-remainder formula has partial sum 1−1/3=2/3 and remainder ∫01x4/(1+x2) dx>0. For example, the integrand is at least 1/32 on [1/2,1], so the remainder is at least 1/64. Thus π/4>2/3 and π>8/3>2 (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).

[F10]

A finite tower of field extensions satisfies [K:Q]=[K:Q(α)][Q(α):Q] (Tower law for finite extensions: [L:F]=[L:K][K:F]).

[F11]

A rational algebraic integer is an integer (The rational algebraic integers are exactly the integers).

Proof

1.1F3given

Exactly one of the cases r1≥1 and r1=0 holds; in the second case n=r1+2r2=2r2≥2 gives r2≥1. We treat the two cases in turn and produce the same conclusion in each.

1.2F3given

Case r1≥1. Let X be the set of (x1,…,xr1,z1,…,zr2)∈Rr1×Cr2 with ∣x1∣<D+1, ∣xi∣<1 for 2≤i≤r1, and ∣zj∣<1 for all j; in the real coordinates of [F3] this is ∣x1∣<D+1, ∣xi∣<1, (Re⁡zj)2+(Im⁡zj)2<1.

1.3F3given

Case r1=0. Here n=2r2 with r2≥1. Let Y be the set of (z1,…,zr2)∈Cr2 with ∣Re⁡z1∣<1, ∣Im⁡z1∣<D+1, and ∣zj∣<1 for j≥2; written in real coordinates, Y is the product of the rectangle (−1,1)×(−D+1,D+1) in the first complex coordinate with r2−1 open unit discs.

2.1F6step 1.2

X is a product of bounded open intervals and open discs, hence open and therefore Lebesgue measurable, and by [F6] it is convex and centrally symmetric.

2.2A1F5step 1.2

By [F5] and step 1.2, λn(X)=(2D+1)⋅2r1−1⋅πr2=2r1πr2D+1.

2.3A1F5F6step 1.3

Y is open and hence measurable, convex and centrally symmetric by [F6], and by [F5] it has λn(Y)=(2⋅2D+1)⋅πr2−1=4πr2−1D+1.

2.4step 1.3givenalgebra

Every (z1,…,zr2)∈Y has ∣z1∣2=(Re⁡z1)2+(Im⁡z1)2<1+(D+1)=D+2≤B+2 by the defining coordinate bounds and D≤B. Thus ∣z1∣<B+2.

3.1F1F9step 2.2algebra

By [F1] and step 2.2, λn(X)/(2ncovol⁡(σ(OK)))=(π/2)r21+1/D. If r2=0, the square-root factor is greater than 1; if r2>0, [F9] gives π/2>1 and again the ratio is greater than 1. Thus λn(X)>2ncovol⁡(σ(OK)).

3.2F1F2F9step 2.3algebra

By [F1] and step 2.3, λn(Y)/(2ncovol⁡(σ(OK)))=2(π/2)r2−11+1/D>1, since r2≥1, [F9] gives π/2>1, and D≥1. Applying [F2] gives in this case an element 0≠α∈OK with σ(α)∈Y.

4.1F1F2step 2.1step 3.1

Applying [F2] with Λ=σ(OK) and C=X, whose hypotheses are verified in steps 2.1 and 3.1, gives in this case an element 0≠α∈OK with σ(α)∈X.

4.2F4step 3.2

In the totally complex case with r2≥2, every j≥2 has 0<∣τj(α)∣<1. There is at least one such factor, so Q:=∏j≥2∣τj(α)∣2<1. By [F4], ∣NK/Q(α)∣=∣τ1(α)∣2Q≥1, hence ∣τ1(α)∣>1.

4.3F4F10F11step 3.2step 2.4

If r1=0 and r2=1, then [K:Q]=2. The element from step 3.2 is nonzero and satisfies ∣Re⁡τ1(α)∣<1. If α∈Q, [F11] makes α∈Z; since an embedding fixes Q, this would give ∣α∣<1 and hence α=0, a contradiction. Therefore α∉Q, so [Q(α):Q]>1. By the tower law [F10] this degree divides [K:Q]=2, and thus K=Q(α). Its two complex embeddings give the two conjugates, which are distinct because α generates K; both have modulus less than B+2 by step 2.4 and conjugation.

5.1F4step 4.1

For this α in the real-embedding case and every i≥2 one has ∣σi(α)∣<1, and for every j one has ∣τj(α)∣<1. There are r1−1+2r2=n−1≥1 factors in P:=∏i≥2∣σi(α)∣∏j∣τj(α)∣2, each positive and less than 1, so P<1 and ∣NK/Q(α)∣=∣σ1(α)∣P. Since the norm has absolute value at least 1 by [F4], necessarily ∣σ1(α)∣>1.

5.2F7F8step 1.3step 4.2

If r1=0 and r2≥2, every embedding other than τ1 and τˉ1 sends α to a value of modulus <1. The values τ1(α) and τˉ1(α) have modulus >1 by step 4.2 and are distinct: equality would make τ1(α) real, contrary to ∣Re⁡τ1(α)∣<1. Thus the fibre of [F7] over τ1∣Q(α) is the singleton {τ1}, so [K:Q(α)]s=1, and [F8] gives [K:Q(α)]=1, that is, K=Q(α).

6.1F4step 1.2step 5.1

So in this case every embedding φ of K other than σ1 sends α to a complex number of modulus <1, while ∣σ1(α)∣>1; in particular φ(α)=σ1(α) holds only for φ=σ1. Also ∣σ1(α)∣<D+1≤B+2 by step 1.2, and D+1≤B+2 since D≤B.

7.1F7F8step 6.1

The fibre of the restriction map [F7] over σ1∣Q(α) is the set {φ:φ(α)=σ1(α)}, and the fibre is nonempty because it contains σ1; by step 6.1 it is the singleton {σ1}. Hence [K:Q(α)]s=1 by [F7], and [F8] upgrades this to [K:Q(α)]=1, that is, K=Q(α).

8.1step 5.1step 2.4step 6.1step 5.2step 4.3step 7.1∎

Steps 7.1, 5.2, and 4.3 cover respectively the real-embedding case, the totally complex case with r2≥2, and the totally complex quadratic case; each gives K=Q(α) for the constructed integral α. In the real-embedding case step 6.1 bounds the distinguished real conjugate and all others have modulus <1. In the totally complex cases step 2.4 bounds τ1(α) and its conjugate, while all other conjugates have modulus <1 by the chosen window. Since B≥1, these bounds are all at most B+2.

Remarks

The two windows are the ones used by Milne: the real case enlarges the first real coordinate, and the totally complex case enlarges the imaginary part of the first complex coordinate while keeping its real part in (−1,1). For r2≥2, the norm makes the first conjugate pair the unique values outside the unit circle, and the asymmetry separates the pair. For r2=1, the strict real-coordinate bound rules out a rational integral element, and degree two then makes the nonzero element primitive. The uniform bound B+2 absorbs both coordinate bounds. This lemma is the analytic input to the Hermite-Minkowski finiteness theorem proved later on this page; the finiteness of the possible minimal polynomials there is a separate, purely algebraic step.

Depends on

Used by

Dependency tree · two levels

98 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