Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Dirichlets Unit Theorem Regulators and S Units — Examples

1 · Prerequisites

2 · Summary

The examples compute the unit group or the regulator in the three rank patterns the theorem allows. Rank zero is Q and the imaginary quadratic fields: the groups {±1}, {±1,±i} and {±1,±ω,±ω2} are found by solving the norm equation N(u)=±1 with the quadratic norm formula. Rank one is the real quadratic field Q(d), where the units of the maximal order are governed by the negative Pell equation through the period of the continued fraction of d, the fundamental unit is (1+5)/2 for d=5, and RK=log⁡ε. Rank two is the totally real cubic field of 2cos⁡(2π/9): the elements α and α−1 have norm −1 and 1, their logarithmic vectors are independent, and the two independent units pin down the full rank.

Two computations make the regulator's conventions and invariance visible. The deleted-row minors of the cubic logarithmic matrix all have absolute value 0.849287…, and the unimodular tuple (α(α−1),α−1) reproduces them exactly, illustrating the GL2(Z) step of the well-definedness theorem; replacing the fundamental unit (1+5)/2 of Q(5) by the Pell generator 9+45 of the order Z[5] would multiply the regulator by six. The page ends with the S-units of Q, equal to {±p1n1⋯pmnm} of rank m, and with the counterexample showing that Z[5]×=±⟨(2+5)⟩ is a subgroup of index three in OQ(5)×.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Units of Q and the imaginary quadratic fields

Example

Assume the Axiom of Choice. For K=Q one has OK=Z and OK×={±1}. For K=Q(i) one has OK=Z[i] and OK×={±1,±i}=μ4(K). For K=Q(−3), with ω=(1+−3)/2, one has OK=Z[(1+−3)/2]=Z[ω] and OK×=μ6(K)={±1,±ω,±ω2}. All three unit groups are finite of rank 0.

Facts & Assumptions

Given: The Axiom of Choice and the three number fields Q, Q(i)=Q(−1) and Q(−3), with the element ω:=(1+−3)/2 (number field).

[F1]

The ring of integers OQ is the integral closure of Z in Q (Ring of integers); a rational number integral over Z is an integer (The rational algebraic integers are exactly the integers), and conversely every integer n is a root of the monic polynomial X−n. Hence OQ=Z.

[F2]

For squarefree d≠1 one has OQ(d)=Z[(1+d)/2] if d≡1(mod4) and OQ(d)=Z[d] otherwise (Integers in a quadratic field). Since −1≡3(mod4) and −3≡1(mod4), this gives OQ(i)=Z[−1]=Z[i] and OQ(−3)=Z[(1+−3)/2]=Z[ω].

[F3]

For a number field K and u∈OK, the element u is a unit of OK if and only if NK/Q(u)=±1 (A number-field unit is exactly an algebraic integer of norm plus or minus one).

[F4]

Let d∈Q be nonsquare and put K=Q(d). A degree-2 polynomial over Q is irreducible exactly when it has no rational root (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field), and d is not a square in Q, so X2−d is the minimal polynomial of d over Q (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element) and [K:Q]=2. By the correspondence between F-embeddings and distinct roots of the minimal polynomial (F-embeddings of F(α) into an algebraically closed field correspond to the distinct roots of mα), the two Q-embeddings of K into C send d to d and to −d; since char⁡Q=0, norm and trace are the product and sum over these embeddings (Norm and trace from embeddings, with the inseparable exponent in the norm formula). Hence for α=a+bd with a,b∈Q, NK/Q(α)=(a+bd)(a−bd)=a2−db2.

[F6]

For n≥1, μn(K)={x∈K:xn=1} is the set of n-th roots of unity in K, and μ(K) denotes the group of all roots of unity in K, the union of the subgroups μn(K) (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

[F7]

If x∈K satisfies xn=1 for some n≥1, then x is a root of the monic polynomial Tn−1∈Z[T], hence is integral over Z (Integral elements over a commutative ring and algebraic integers) and lies in OK, the integral closure of Z in K (Ring of integers); also x−1=xn−1∈OK, so x∈OK×. In particular every root of unity in K is a unit of OK, that is μ(K)⊆OK×.

[F8]

The unit rank r1+r2−1 is 0 exactly for Q and for imaginary quadratic fields, and in the rank-zero cases OK×=μ(K) is finite (Unit ranks by signature); a quadratic field Q(d) with d<0 has no real embedding and two complex conjugate embeddings, hence signature (0,1) (Archimedean embeddings and signature).

[A1]

The Axiom of Choice is assumed; it is used only through the rank-zero unit structure [F8] (The Axiom of Choice).

Verification

technique · compute the unit group of each of the three rings of integers by solving the norm equation $N(u)=\pm1$ with the elementary norm formula for quadratic fields, and identify the results with the groups of fourth and sixth roots of unity
1.1F1F5F6F7

OQ=Z and OQ×=Z×={±1}: the rational units are the units of Z, and ±1 are roots of unity while every element of μ(Q) is a unit of Z by [F7], so μ(Q)={±1} as well.

1.2F2

By [F2] and the congruences −1≡3(mod4), −3≡1(mod4) one has OQ(i)=Z[i]={a+bi:a,b∈Z} and OQ(−3)=Z[ω]={a+bω:a,b∈Z}, where ω=(1+−3)/2.

1.3F4

Applying [F4] with the nonsquare rational d=−1 to a+bi=a+b−1 with a,b∈Z⊆Q gives NQ(i)/Q(a+bi)=a2+b2.

1.4F4algebra

Writing a+bω=(a+b/2)+(b/2)−3 with a,b∈Z and applying [F4] with the nonsquare rational d=−3 gives NQ(−3)/Q(a+bω)=(a+b/2)2+3(b/2)2=a2+ab+b2.

2.1F3step 1.3algebra

By [F3] and step 1.3, a+bi∈Z[i] is a unit if and only if a2+b2=±1. Since a2+b2≥0, this is the equation a2+b2=1 with a,b∈Z; then a2≤1, ∣a∣≤1, and b2=1−a2, so either a=0 and b=±1 or b=0 and a=±1. Hence OQ(i)×={1,−1,i,−i}.

2.2F3step 1.4algebra

By [F3] and step 1.4, a+bω∈Z[ω] is a unit if and only if a2+ab+b2=±1. Since 4(a2+ab+b2)=(2a+b)2+3b2≥0, the value −1 cannot occur, and a2+ab+b2=1 is equivalent to (2a+b)2+3b2=4; then 3b2≤4 with b∈Z forces b∈{−1,0,1}. If b=0 then (2a)2=4 gives a=±1; if b=1 then (2a+1)2=1 gives a=0 or a=−1; if b=−1 then (2a−1)2=1 gives a=1 or a=0.

3.1step 2.2algebra

Direct computation in Z[ω] gives ω2=−1+−32=ω−1 and ω3=ω⋅ω2=ω2−ω=(ω−1)−ω=−1, hence ω6=1. Since 1,ω,ω−1,−1 have pairwise different coordinates in the Z-basis (1,ω) of Z[ω], the elements ω,ω2,ω−1 are all different from 1, and the six units found in step 2.2 are exactly ω0,ω1,ω2,ω3=−1,ω4=−ω,ω5=−(ω−1).

3.2F6F7step 2.1

Each of the four elements 1,−1,i,−i of OQ(i)× satisfies x4=1, so OQ(i)×⊆μ4(Q(i)) by [F6], while μ4(Q(i))⊆OQ(i)× by [F7]; hence OQ(i)×=μ4(Q(i))={±1,±i}.

4.1F6F7step 2.2step 3.1

Each of the six units found in step 2.2 is a power of ω by step 3.1, hence satisfies x6=1; therefore OQ(−3)×⊆μ6(Q(−3)) by [F6], and μ6(Q(−3))⊆OQ(−3)× by [F7]; hence OQ(−3)×=μ6(Q(−3))={±1,±ω,±ω2}, because ω3=−1 gives {ω0,…,ω5}={±1,±ω,±ω2}.

5.1F8step 1.1step 3.2step 4.1

Finally Q has signature (1,0) and both imaginary quadratic fields have signature (0,1), so [F8] gives unit rank r1+r2−1=0 for all three fields and exhibits the unit groups as finite torsion groups μ(K); the computed groups {±1}, {±1,±i} and {±1,±ω,±ω2} have 2, 4 and 6 elements.

6.1A1F8∎

Choice accounting: AC is used only through the rank-zero structure [F8]; the norm computations, the enumeration of the norm-one solutions, and the powers of ω are elementary computations in Z and Z[ω] and use no choice.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Real quadratic units and Pell's equation

Example

Assume the Axiom of Choice. Let d>1 be squarefree and K=Q(d). If d≡2,3(mod4) then OK=Z[d], and the unit group is ±⟨ud⟩, where ud is the least positive solution of the negative Pell equation x2−dy2=−1 when that equation is solvable, and ud=εd is the fundamental Pell solution of x2−dy2=1 otherwise; in the solvable case εd=ud2 and the norm-one Pell subgroup ±⟨εd⟩ has index 2 in OK×. If d≡1(mod4) then OK=Z[(1+d)/2] strictly contains Z[d]; the unit group of the order Z[d] is as above, while the fundamental unit of OK may be a half-integer element solving x2−dy2=±4 that does not lie in Z[d], in which case Z[d]× (in particular the norm-one Pell subgroup ±⟨εd⟩) is a proper subgroup of OK×. For d=5 the fundamental unit of OK is ε=(1+5)/2 (norm −1), so OK×={±εn:n∈Z}, while in Z[5] one has 2+5=ε3, the fundamental Pell solution is ε5=9+45=ε6, and Z[5]×=±⟨2+5⟩=±⟨ε3⟩ has index 3 in OK×.

Facts & Assumptions

Given: The Axiom of Choice, a squarefree integer d>1, the field K=Q(d), the order Z[d] with its Pell norm Nd (The norm on the explicit order Z[D]), the fundamental Pell solution εd of x2−dy2=1 (The fundamental Pell solution), and, when the negative Pell equation x2−dy2=−1 is solvable, its least positive solution ud.

[F1]

If d≡2,3(mod4) then OK=Z[d], and if d≡1(mod4) then OK=Z[(1+d)/2], which strictly contains Z[d] (Integers in a quadratic field).

[F2]

For u∈OK, u is a unit of OK if and only if NK/Q(u)=±1, and for a real quadratic field the norm of x+yd is x2−dy2 (A number-field unit is exactly an algebraic integer of norm plus or minus one, Integers in a quadratic field).

[F3]

The Pell norm is multiplicative: Nd(αβ)=Nd(α)Nd(β) for α,β∈Z[d] (The Pell norm is multiplicative); consequently an element α∈Z[d] is a unit of the order Z[d] if and only if Nd(α)=±1 (The norm on the explicit order Z[D], The units of a ring are the invertible elements of its multiplicative monoid, and R× is a group under multiplication; 0∈R× only in the zero ring).

[F4]

The integral solutions of x2−dy2=1 are exactly the elements ±εdk with k∈Z, and the positive solutions are εdk with k≥1; also εd>1 (All integral Pell solutions are ±εDk, All positive Pell solutions are powers of the fundamental solution, The fundamental Pell solution). The equation x2−dy2=1 has a positive nontrivial solution (Every Pell equation has a positive nontrivial integral solution).

[F5]

The negative Pell equation x2−dy2=−1 is solvable if and only if the period length ℓ of the continued fraction of d is odd; when it is solvable, the numerator-denominator pair (pℓ−1,qℓ−1) gives the least positive solution, and the least positive solution of x2−dy2=1 is (p2ℓ−1,q2ℓ−1) (Negative Pell is soluble exactly for odd period length, Generalized and negative Pell equations).

[F6]

For a real quadratic field K, OK×≅{±1}×Z; in particular there is a unit γ>1 with OK×={±γn:n∈Z} (Unit ranks by signature).

[F7]

For d=5: 2<5<3 gives ⌊5⌋=2, and 5+2=4+15+2, so the complete quotients of 5 are α1=5+2 and α2=α1; hence the digit sequence is 2,4,4,4,…, that is 5=[2;4‾], with period length ℓ=1 (Complete quotients in the continued-fraction algorithm, Finite and infinite regular continued fractions, Eventually periodic regular continued fractions). The convergent recurrence gives p0/q0=2/1 and p1/q1=9/4 (Convergents of a regular continued fraction), and direct computation gives 22−5⋅12=−1, 92−5⋅42=1 and (2+5)2=9+45.

[A1]

The Axiom of Choice is assumed; it is used only through the rank-one structure of OK× in [F6]; the Pell solution theory quoted above is choice-free (The Axiom of Choice).

Verification

technique · identify units with Pell-type solutions of norm $\pm1$; in the solvable case compare the least negative solution with the fundamental positive solution to prove $\varepsilon_d=u_d^2$, and for $d=5$ enumerate the norm-$\pm4$ units of the maximal order and compare with the order's Pell units
1.1F1

The ring-of-integers formula gives OK=Z[d] when d≡2,3(mod4) and OK=Z[(1+d)/2]⊋Z[d] when d≡1(mod4).

1.2F3

An element α=x+yd∈Z[d] is a unit of the order Z[d] if and only if Nd(α)=x2−dy2=±1: if Nd(α)=±1 then α−1=±(x−yd)∈Z[d], while for a unit α one has Nd(α)Nd(α−1)=Nd(1)=1 with both factors in Z, so Nd(α)=±1.

1.3F2F3F4

Seen in K, every unit of Z[d] has norm ±1 (its Pell norm is the field norm), and conversely a norm-±1 element of Z[d] is a unit; thus the units of the order are exactly the integral solutions of x2−dy2=±1, with the norm-one solutions forming ±⟨εd⟩.

1.4F1F2algebra

Take d=5 and ε:=(1+5)/2∈OK. Its norm is ((1+5)/2)((1−5)/2)=(1−5)/4=−1, so ε∈OK×; direct multiplication gives ε2=(3+5)/2 and ε3=2+5.

2.1F4F5step 1.3

Suppose first that x2−dy2=−1 is solvable, and let ud=x0+y0d be its least positive solution, whose coordinates are the numerator and denominator of the convergent in [F5]. Then ud2 is a positive solution of x2−dy2=1, so ud2=εdn for a unique integer n≥1.

2.2F1F2step 1.2

For d≡1(mod4) the elements of OK=Z[(1+d)/2] are the numbers (x+yd)/2 with x≡y(mod2), of norm (x2−dy2)/4; such an element is a unit exactly when x2−dy2=±4, and it fails to lie in Z[d] exactly when x and y are both odd.

3.1F3step 2.1algebra

The exponent n is odd: if n=2m, then ud2=(εdm)2 in the domain Z[d], so ud=±εdm and taking norms gives N(ud)=N(εdm)=+1, contradicting N(ud)=−1.

3.2step 2.2step 1.4algebra

The units of OK for d=5 are the elements (x+y5)/2 with x≡y(mod2) and x2−5y2=±4; for a unit u>1 one has y>0, and x=u±1/u>0 according as N(u)=±1, so x,y are positive integers. Checking the admissible positive pairs in order of y: for y=1 the equation gives x2=5±4, so x=1 (the unit ε) or x=3 (the unit ε2); for y=2 it gives x2=20±4, so x=4 (the unit 2+5=ε3); for y≥3 one has x2≥5⋅9−4=41, hence x≥7 and (x+y5)/2≥(7+35)/2>ε3>ε. Therefore ε is the least unit >1 of OK.

4.1F3step 2.1step 3.1

In fact n=1. If n≥3, write n=2m+1 and put w:=udεd−m. Both ud and εd are units of Z[d] by [F3], so w is a unit of that order as well; in particular w=x+yd for integers x,y. From step 2.1, ud2=εdn, and therefore w2=ud2εd−2m=εd and ud=wεdm=w(w2)m=wn. Since ud>0 and εd>1, the definition of w gives w>0, and w2=εd>1 gives w>1. By [F3] the order norm Nd(w) is +1 or −1. If Nd(w)=+1, multiplicativity in [F3] and ud=wn give Nd(ud)=Nd(w)n=+1, contradicting Nd(ud)=−1; hence Nd(w)=−1. Thus w=x+yd is a positive integral solution of x2−dy2=−1: its conjugate is −1/w, so x=(w−1/w)/2>0 and y=(w+1/w)/(2d)>0. As n≥3 and w>1, ud=wn>w; moreover x=(w−1/w)/2<(ud−1/ud)/2, so this solution has smaller first coordinate than the least positive solution ud, a contradiction. Therefore n=1 and εd=ud2.

4.2F6step 3.2

Since OK×={±γn} for some γ>1 and the least unit >1 in such a group is γ, step 3.2 gives γ=ε, so OK×={±εn:n∈Z}.

5.1step 1.3step 4.1

Consequently, in the solvable case every norm-one unit is ±εdm=±ud2m and every norm-(−1) unit is ±ud2m+1, because multiplying it by ud−1 gives norm 1; thus Z[d]×=±⟨ud⟩, and the norm-one subgroup ±⟨εd⟩=±⟨ud2⟩ consists of the even powers of ud, of index 2.

6.1F3F4step 1.3step 5.1

If instead x2−dy2=−1 is unsolvable, every unit of Z[d] has norm +1, so Z[d]×=±⟨εd⟩; setting ud:=εd gives Z[d]×=±⟨ud⟩ in both cases.

7.1F1step 6.1step 2.2

The order Z[d] is a subring of OK, so its unit group is a subgroup of OK× and equals the units computed in steps 5.1 and 6.1; if the fundamental unit of OK (its least unit >1) is an element with x,y both odd, then it is not in Z[d], so Z[d]×⊊OK×, and since ±⟨εd⟩⊆Z[d]× also ±⟨εd⟩⊊OK×.

7.2F5F7step 6.1step 1.4

In the order, [F5] applied with the period length ℓ=1 computed in [F7] makes the pair (p0,q0)=(2,1) the least positive solution of x2−5y2=−1 and the pair (p1,q1)=(9,4) the least positive solution of x2−5y2=1, whose associated element is the fundamental Pell unit ε5=9+45; by steps 5.1 and 6.1 applied to d=5, Z[5]×=±⟨2+5⟩, and by step 1.4 this is ±⟨ε3⟩, while the identity (2+5)2=9+45 of [F7] gives 9+45=ε6=ε5.

8.1step 6.1step 4.2step 7.2

Finally Z[5]×=±⟨ε3⟩⊆±⟨ε⟩=OK× with index [⟨ε⟩:⟨ε3⟩]=3, because the multiples of 3 in Z have index 3; a generator of the larger group, for instance ε, is not in the smaller order, so the two unit groups are not equal and the order's norm-one Pell subgroup is proper in OK×.

9.1A1F6step 7.1step 8.1∎

Scope and choice accounting: the general statements of the example are steps 5.1, 6.1 and 7.1, and the failure of equality is witnessed by d=5 in steps 7.2 and 8.1; AC is used only through the rank-one structure [F6], all computations here being elementary arithmetic in Z[5].

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Two independent units in a real cubic field

Example

Assume the Axiom of Choice. Let α=2cos⁡(2π/9), the root in (1,2) of f(X)=X3−3X+1. Then K=Q(α) is a totally real cubic field with signature (r1,r2)=(3,0), so the unit rank is r1+r2−1=2. The elements α (norm −1) and α−1 (norm 1) are units of OK whose logarithmic vectors λ(α),λ(α−1)∈H are linearly independent over R; hence ⟨α,α−1⟩ is a rank-2 subgroup of OK× of finite index, confirming the rank.

Facts & Assumptions

Given: The Axiom of Choice, the real number θ:=2π/9, the element α:=2cos⁡θ, and the polynomial f(X)=X3−3X+1 (cosine, number field).

[F1]

π>0 and π/2 is the smallest positive zero of cosine (Pi as twice the smallest positive zero of cosine).

[F2]

For every real x one has cos⁡(x+π)=−cos⁡x and cos⁡π=−1 (Quarter-turn values and shifts by pi/2 and pi).

[F3]

For every real x one has cos⁡(−x)=cos⁡x (Parity and the Pythagorean identity for sine and cosine).

[F4]

For every real x one has cos⁡3x=4cos⁡3x−3cos⁡x (Triple-angle identities for sine, cosine, and tangent).

[F5]

For every real x one has cos⁡2x=2cos⁡2x−1 (Double-angle and quadratic power-reduction identities).

[F7]

Cosine is strictly decreasing on [0,π], with range [−1,1] (Signs, monotonicity intervals, and ranges of sine and cosine).

[F8]

If a rational number p/q in lowest terms is a root of a polynomial with integer coefficients anXn+⋯+a0, then p divides a0 and q divides an (Rational root theorem).

[F9]

A polynomial of degree 2 or 3 over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).

[F10]

A continuous real function on a closed bounded interval attains every value between its endpoint values (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b)).

[F11]

Sending an embedding of F(α) into an algebraically closed field to the image of α is a bijection onto the set of distinct roots of the minimal polynomial of α; in particular the number of embeddings equals the number of distinct roots (F-embeddings of F(α) into an algebraically closed field correspond to the distinct roots of mα).

[F12]

For a separable finite extension the field norm is the product of the images under the distinct embeddings: NK/Q(u)=∏σσ(u) (Norm and trace from embeddings, with the inseparable exponent in the norm formula).

[F13]

If f(t)=tn+a1tn−1+⋯+an splits over a commutative ring as f(t)=∏i=1n(t−αi), then ak=(−1)kek(α1,…,αn) for each k; in particular an=(−1)nα1⋯αn (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).

[F14]

For u∈OK, the element u is a unit of OK if and only if NK/Q(u)=±1 (A number-field unit is exactly an algebraic integer of norm plus or minus one).

[F15]

OK is the integral closure of Z in K; an element of K that is a root of a monic polynomial in Z[X] is integral over Z and hence lies in OK, and OK is a subring of K containing 1 (Integral elements over a commutative ring and algebraic integers, Ring of integers).

[F16]

The unit rank of K is r1+r2−1, where (r1,r2) is the signature; a totally real cubic field has signature (3,0) and unit rank 2 (Unit ranks by signature, Archimedean embeddings and signature).

[F17]

The logarithmic embedding is the map λ(x)=(log⁡∣σ1x∣,…,2log⁡∣τx∣,… ) on K×, and λ(uv)=λ(u)+λ(v) for u,v∈K× (Logarithmic embedding of a number field, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm); for a totally real field its values are the vectors of the logarithms of the absolute values of the conjugates.

[F18]

The image λ(OK×) is contained in the hyperplane H={x:∑ixi=0} (Unit logarithms lie in the trace-zero hyperplane).

[F19]

OK×≅μ(K)×Zr1+r2−1; in particular the unit group is finitely generated of rank r1+r2−1 with finite torsion subgroup μ(K) (Dirichlet unit theorem).

[F20]

A system of fundamental units (ε1,…,εr) of K exists, its logarithms λ(εi) form a Z-basis of λ(OK×), and every unit has a unique expression u=ζε1m1⋯εrmr with ζ∈μ(K) and mi∈Z (System of fundamental units).

[F21]

For n≥1 and A∈Mn(Z) with det⁡A≠0, the subgroup L=AZn generated by the columns has finite index ∣det⁡A∣ in Zn (The index of a full-rank subgroup of Zn is the absolute determinant of a generating matrix).

[A1]

The Axiom of Choice is assumed; it is used only through the unit theorem [F19] and the existence of a system of fundamental units [F20] (The Axiom of Choice).

Verification

technique · verify by the triple-angle identity that $2\cos(2\pi/9)$ is the root of $X^3-3X+1$ in $(1,2)$, locate the three real conjugates by the intermediate value theorem, read the norms off Vieta's formulas, and detect the linear independence of the two logarithmic vectors through exact signs of the logarithms of the conjugates; finite index follows from the integrality of the coordinates in a fundamental system
1.1F1algebra

π>0, hence 0<θ<π/3<π for θ=2π/9.

1.2F2F3F5F7algebra

With c:=cos⁡(π/3) one has cos⁡(2π/3)=cos⁡(π−π/3)=cos⁡((−π/3)+π)=−cos⁡(−π/3)=−cos⁡(π/3)=−c by the shift and parity identities, while the double-angle identity gives cos⁡(2π/3)=2c2−1; hence 2c2−1=−c, that is (2c−1)(c+1)=0. Since π/3<π and cosine is strictly decreasing on [0,π] with cos⁡π=−1, one has c>−1, so c=1/2.

1.3algebra

Values of f: f(2)=3, f(1)=−1, f(0)=1, f(−1)=3, f(−2)=−1.

2.1step 1.2

Hence cos⁡(2π/3)=−1/2.

2.2F6F7step 1.1step 1.2algebra

Moreover 1<α<2: from 0<θ<π/3 and strict decrease of cosine on [0,π] together with cos⁡0=1 and cos⁡(π/3)=1/2 one gets 1/2<cos⁡θ<1, hence 1<α<2.

2.3F8F9step 1.3

The polynomial f is irreducible over Q: by [F8] a rational root of the monic integer polynomial f must be an integer dividing the constant term 1, hence equal to 1 or −1; but f(1)=−1≠0 and f(−1)=3≠0, so f has no rational root, and since deg⁡f=3 it is irreducible by [F9].

3.1F4step 2.1algebra

The triple-angle identity gives α3−3α=(2cos⁡θ)3−3(2cos⁡θ)=2(4cos⁡3θ−3cos⁡θ)=2cos⁡(3θ)=2cos⁡(2π/3)=−1, so f(α)=α3−3α+1=0.

4.1F10step 3.1step 2.2step 1.3algebra

The polynomial f has exactly one root in (1,2), namely α: by step 1.3 and [F10] the sign change from f(1)<0 to f(2)>0 gives a root in (1,2), and for 1<x<y one has f(y)−f(x)=(y−x)(x2+xy+y2−3)>0, so f is strictly increasing on (1,∞) and the root is unique; steps 3.1 and 2.2 show that α is such a root.

5.1F10step 4.1algebra

By step 1.3 and [F10] there are also roots in (−2,−1) and in (0,1), and these three roots are distinct because the intervals are disjoint; a cubic has at most three roots, so these are all the roots of f and all of them are real.

6.1F11F16step 3.1step 5.1step 2.3

Therefore f is the minimal polynomial of α over Q (monic, irreducible, with f(α)=0 by step 3.1), so K=Q(α) has degree 3 over Q; by [F11] the three embeddings K→C send α to the three roots of f, which are all real by step 5.1, so K is totally real with signature (3,0) and unit rank r1+r2−1=2 by [F16].

7.1F12F13step 6.1step 1.3algebra

By [F12] and [F13] applied to f(t)=∏i=13(t−αi), where α1,α2,α3 are the three conjugates of α given by the embeddings of step 6.1, one has NK/Q(α)=α1α2α3=(−1)3a3=−1 because the constant coefficient of f is a3=1; and NK/Q(α−1)=∏i=13(αi−1)=(−1)3∏i=13(1−αi)=−f(1)=−(−1)=1, using f(1)=1−3+1=−1.

7.2step 2.2step 5.1step 6.1algebra

Writing the three real embeddings as σ1=id,σ2,σ3, the conjugates satisfy σ1(α)=α∈(1,2), 0<σ2(α)<1 and −2<σ3(α)<−1 by steps 2.2 and 5.1; hence log⁡∣σ1α∣=log⁡α>0, log⁡∣σ1(α−1)∣=log⁡(α−1)<0, log⁡∣σ2α∣<0, log⁡∣σ2(α−1)∣=log⁡(1−σ2α)<0, log⁡∣σ3α∣>0 and log⁡∣σ3(α−1)∣>0.

8.1F14F15step 7.1

The elements α and α−1 lie in OK: α is a root of the monic polynomial f∈Z[X], hence integral over Z and in OK by [F15], and α−1∈OK because OK is a subring of K; by [F14] with the norms of step 7.1, both are units of OK.

8.2step 7.2algebra

The vectors λ(α) and λ(α−1) are linearly independent over R: if aλ(α)+bλ(α−1)=0, then reading the first coordinate and dividing by log⁡α≠0 gives a+b r1=0 with r1:=log⁡(α−1)/log⁡α<0 by step 7.2, while reading the second coordinate and dividing by log⁡∣σ2α∣≠0 gives a+b r2=0 with r2:=log⁡∣σ2(α−1)∣/log⁡∣σ2α∣>0, a quotient of two negative numbers; subtracting the two equations gives b(r1−r2)=0, and r1≠r2 because their signs differ, so b=0 and then a=0 from the first equation.

9.1F17F18step 8.1

By [F17] the map λ turns products into sums, and by [F18] both λ(α) and λ(α−1) lie in H, since α and α−1 are units of OK by step 8.1.

9.2F17step 8.2

Hence the subgroup ⟨α,α−1⟩ is free abelian of rank 2: if αm(α−1)n=1 for integers m,n, then mλ(α)+nλ(α−1)=λ(1)=0 by [F17] and step 8.2 forces m=n=0; thus the homomorphism Z2→OK×, (m,n)↦αm(α−1)n, has trivial kernel, and its image is exactly ⟨α,α−1⟩.

10.1F20F21step 8.2step 9.2

The image has finite index in λ(OK×): by [F20] fix a system of fundamental units ε1,ε2 and write α=ζε1m1ε2m2 and α−1=ζ′ε1n1ε2n2 with ζ,ζ′∈μ(K) and integers mi,ni; since λ kills μ(K), λ(α)=m1λ(ε1)+m2λ(ε2) and λ(α−1)=n1λ(ε1)+n2λ(ε2), so with respect to the Z-basis (λ(ε1),λ(ε2)) of λ(OK×) the two vectors have the integer coordinate columns (m1,m2)T and (n1,n2)T, and the matrix A=(m1n1m2n2) has det⁡A≠0 because a zero determinant would make the two coordinate columns, hence λ(α) and λ(α−1), linearly dependent over R, contradicting step 8.2; therefore the subgroup Zλ(α)+Zλ(α−1)=AZ2 has finite index in λ(OK×) by [F21].

11.1F19step 10.1

Consequently ⟨α,α−1⟩ has finite index in OK×: the canonical map OK×/⟨α,α−1⟩→λ(OK×)/(Zλ(α)+Zλ(α−1)) is surjective onto a finite group by step 10.1, and its kernel (μ(K)⟨α,α−1⟩)/⟨α,α−1⟩≅μ(K)/(μ(K)∩⟨α,α−1⟩) is a quotient of the finite group μ(K) of [F19]; hence the quotient is finite, as claimed.

12.1A1F19F20∎

Choice accounting: AC is used only through the unit theorem [F19], which supplies the finite generation and rank, and through the existence of the system of fundamental units [F20]; the trigonometric, polynomial, norm and logarithm computations, and the independence argument via signs, are elementary and use no further choice.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Regulator of a real quadratic field

Example

Assume the Axiom of Choice. Let K=Q(d) be a real quadratic field with fundamental unit ε>1 (the least unit of OK greater than 1). Then K has signature (2,0), so its unit rank is r1+r2−1=1 and ε is a system of fundamental units; its logarithmic vector is λ(ε)=(log⁡ε,log⁡∣σ2ε∣)=(log⁡ε,−log⁡ε), and the absolute deleted-row determinant of the 2×1 logarithmic matrix is log⁡ε, so RK=log⁡ε. The factor 2 of the doubled-complex convention never enters, since a real quadratic field has no complex place. For K=Q(5) the fundamental unit is ε=(1+5)/2 and RK=log⁡((1+5)/2)≈0.4812118251; the positive generator 9+45=ε6 of the norm-one Pell subgroup of the order Z[5] has log⁡(9+45)=6RK≈2.8872709504, so using that generator of the nonmaximal order as if it were the fundamental unit of the maximal order would multiply the regulator by six.

Facts & Assumptions

Given: The Axiom of Choice, a squarefree integer d>1, the field K=Q(d), its fundamental unit ε (the least unit of OK greater than 1), and its two real embeddings σ1,σ2 (Real quadratic units and Pell's equation, Logarithmic embedding of a number field).

[F1]

The logarithmic embedding is λ(x)=(log⁡∣σ1x∣,…,log⁡∣σr1x∣,2log⁡∣τ1x∣,…,2log⁡∣τr2x∣) on K×, with one coordinate for each real embedding and one doubled coordinate for each complex place, and it is well defined (Logarithmic embedding of a number field).

[F2]

log⁡:(0,∞)→R is strictly increasing with log⁡1=0, and log⁡(xy)=log⁡x+log⁡y, log⁡(1/x)=−log⁡x for x,y>0 (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[F3]

A quadratic field K=Q(d) with d>0 has two real embeddings a+bd↦a±bd and no complex place, so its signature is (2,0); its unit rank is 1, and OK×≅{±1}×Z with torsion subgroup μ(K)={±1} (Unit ranks by signature).

[F4]

For u∈OK, u is a unit of OK if and only if NK/Q(u)=±1; for the real quadratic field NK/Q(x)=x σ2(x) (A number-field unit is exactly an algebraic integer of norm plus or minus one, Real quadratic units and Pell's equation).

[F5]

A system of fundamental units of K is a tuple (ε1,…,εr) of units with λ(OK×)=Zλ(ε1)⊕⋯⊕Zλ(εr) (System of fundamental units).

[F6]

The regulator is RK=∣det⁡Ak∣, where the columns of A are the logarithmic vectors of a system of fundamental units and Ak is obtained by deleting row k; RK is independent of the deleted row and of the chosen system and is positive. The definition records that for a real quadratic field the regulator is log⁡ε for its fundamental unit ε>1 (Regulator of a number field, The regulator is well defined).

[F7]

For K=Q(5): the element ε=(1+5)/2 has norm −1, so it is a unit; it is the least unit >1 of OK and OK×={±εn:n∈Z}; moreover 2+5=ε3, the fundamental Pell solution is 9+45=ε6, and Z[5]×=±⟨2+5⟩=±⟨ε3⟩ (Real quadratic units and Pell's equation).

[A1]

The Axiom of Choice is assumed; it is used only through the rank-one structure [F3] and the unit-theoretic inputs of [F7] (The Axiom of Choice).

Verification

technique · identify the fundamental unit as a system of fundamental units for the rank-one real quadratic field, compute its logarithmic vector from $|N(\varepsilon)|=1$, read off the deleted-row determinant, and specialize to $\mathbb Q(\sqrt5)$ where the maximal-order fundamental unit and the Pell generator of $\mathbb Z[\sqrt5]$ differ by a sixth power
1.1F1F3

K has signature (2,0) and λ(x)=(log⁡∣σ1x∣,log⁡∣σ2x∣) for x∈K×: there are two real embeddings and no complex place by [F3], so [F1] has no doubled coordinate, and no logarithm of a nonzero element is undefined.

1.2F1F2F3F5algebra

The fundamental unit generates the unit group: by [F3] the group OK× has torsion subgroup {±1} and free part of rank 1, so there is a unit γ>1 with OK×={±γn:n∈Z}; every unit v>1 is then γn with n≥1, and γn=γ⋅γn−1≥γ because γn−1≥1 for n≥1, so γ is the least unit >1 and hence γ=ε; therefore OK×={±εn} and, by [F2] and [F1], λ(−1)=0 and λ(εn)=nλ(ε) for every n∈Z, so λ(OK×)=Zλ(ε). Thus (ε) is a system of fundamental units of K in the sense of [F5].

2.1F1F2F4step 1.1algebra

Logarithmic vector: σ1 may be taken to be the identity, so ∣σ1ε∣=ε>0; and ∣σ2ε∣=1/ε, because ε is a unit and NK/Q(ε)=ε σ2(ε)=±1 by [F4], so σ2(ε)=±1/ε. Hence λ(ε)=(log⁡ε,log⁡(1/ε))=(log⁡ε,−log⁡ε) by [F2], a nonzero vector in the hyperplane {(ξ1,ξ2):ξ1+ξ2=0}.

3.1F2F6step 1.2step 2.1algebra

Regulator: the logarithmic matrix of the system (ε) is the 2×1 matrix A with entries log⁡ε and −log⁡ε, so deleting row 1 gives the 1×1 determinant −log⁡ε and deleting row 2 gives log⁡ε; by [F6] and step 1.2, RK=∣det⁡Ak∣=log⁡ε, which is positive because ε>1 and log⁡ is strictly increasing with log⁡1=0 by [F2]. In particular the two deleted rows give the same absolute value, and the factor 2 of the complex coordinates of [F1] is absent.

4.1F7step 3.1algebra

For K=Q(5): by [F7] the fundamental unit is ε=(1+5)/2≈1.6180339887, so RK=log⁡((1+5)/2)≈0.4812118251.

5.1F2F5F7step 3.1step 4.1algebra

By [F7], the full order unit group is Z[5]×=±⟨ε3⟩, and its norm-one Pell subgroup is ±⟨ε6⟩=±⟨9+45⟩. The Pell generator has logarithmic coordinate log⁡(9+45)=log⁡(ε6)=6log⁡ε=6RK≈2.8872709504, so its rank-one deleted-row determinant is six times the field regulator, which is defined using the maximal-order fundamental unit ε.

6.1A1F3F6F7step 3.1step 5.1∎

Conclusion and choice accounting: for every real quadratic field the fundamental unit ε>1 is a system of fundamental units, its logarithmic vector is (log⁡ε,−log⁡ε), and RK=log⁡ε; the doubled-complex normalization is vacuous here, and for K=Q(5) the value is RK=log⁡((1+5)/2)≈0.4812118251, six times smaller than the determinant 6RK obtained from the Pell generator 9+45 of the order Z[5]. Choice enters only through the rank-one unit structure [F3] and the d=5 input [F7]; the logarithm computations and the determinant of the 2×1 matrix use no choice.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

A unimodular change of generators preserves the regulator determinants

Example

Assume the Axiom of Choice. Let α=2cos⁡(2π/9), the root in (1,2) of X3−3X+1, with conjugates x=σ1α∈(1,2), y=σ2α∈(0,1) and z=σ3α∈(−2,−1), and let u1:=α, u2:=α−1 be the two independent units of the cubic field example. Then:

  1. the tuples (u1,u2) and (u1u2,u2) generate the same lattice Zλ(u1)+Zλ(u2) in the hyperplane H; the second logarithmic matrix is A(1011) with the matrix acting on columns, a unimodular integer matrix of determinant 1;
  2. every deleted-row 2×2 determinant of the logarithmic matrix has the same value for the two tuples, namely ±(a2+ab+b2) with a=log⁡x, b=log⁡y, and its absolute value is 0.849287… in both cases (the three deleted rows have the signs −, +, −);
  3. interchanging u1 and u2, that is right multiplication by the unimodular integer matrix (0110) of determinant −1, reverses the sign of every deleted-row determinant and leaves its absolute value unchanged, which is why the regulator is defined from an absolute determinant.

Facts & Assumptions

Given: The Axiom of Choice, the element α=2cos⁡(2π/9), the field K=Q(α), its three real embeddings σ1,σ2,σ3 with conjugates x=σ1α, y=σ2α, z=σ3α, and the units u1=α, u2=α−1 (Two independent units in a real cubic field, Logarithmic embedding of a number field).

[F1]

The cubic example gives: f(X)=X3−3X+1 is irreducible with α∈(1,2) one of its three real roots; K is totally real of signature (3,0), so r1+r2=3 and the logarithms of the three embeddings are the coordinates of λ; the conjugates satisfy x∈(1,2), y∈(0,1), z∈(−2,−1); f is strictly increasing on (1,∞), so x is its only root there; NK/Q(α)=−1 and NK/Q(α−1)=1; α and α−1 are units of OK; and λ(α), λ(α−1) are R-linearly independent (Two independent units in a real cubic field).

[F2]

The logarithmic embedding is λ(w)=(log⁡∣σ1w∣,…,log⁡∣σr1w∣,2log⁡∣τ1w∣,… ) on K×; for the totally real K of [F1] it is λ(w)=(log⁡∣σ1w∣,log⁡∣σ2w∣,log⁡∣σ3w∣), and it is well defined because nonzero elements have nonzero images under every embedding (Logarithmic embedding of a number field).

[F3]

log⁡ is additive over products, so for u,v∈K× the coordinatewise additivity λ(uv)=λ(u)+λ(v) holds, the absolute values of the conjugates being multiplicative (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[F4]

Every value λ(u) of a unit u∈OK× lies in the hyperplane H={ξ:∑i=13ξi=0} (Unit logarithms lie in the trace-zero hyperplane).

[F5]

The regulator of K is RK=∣det⁡Ak∣, where A has the columns λ(ε1),…,λ(εr) for a system of fundamental units and Ak is obtained by deleting row k; deleting rows may be done before or after finite matrix products. The definition records that a change of fundamental system multiplies A on the right by a matrix in GL⁡r(Z), "which is why the absolute determinant, and not the signed one, is the invariant" (Regulator of a number field, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[F6]

Let m≥1 and let B be an (m+1)×m real matrix of rank m whose columns have coordinate sum zero. Then for the deleted-row determinants Δk one has Δk≠0 and Δk=(−1)k−1Δ1; in particular all ∣Δk∣ are equal (Deleted-row minors of a zero-column-sum matrix agree up to sign).

[F7]

For square matrices of the same size over a commutative ring, det⁡(BC)=det⁡(B)det⁡(C) (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F9]

Assume the Axiom of Choice. For two systems of fundamental units of a number field K the regulator RK is the same number: the absolute deleted-row determinant does not depend on the deleted row nor on the chosen system, and it is positive (The regulator is well defined).

[A1]

The Axiom of Choice is assumed; it is used only through the unit-theoretic inputs quoted in [F1] and [F9] and the hyperplane input [F4] (The Axiom of Choice).

Verification

technique · derive the exact algebraic relations among the three real conjugates from the polynomial $X^3-3X+1$, translate them into relations among the logarithmic coordinates, and compare the deleted-row determinants of the two tuples through the explicit unimodular matrices
1.1F1F2F3F4

The setting is as in [F1]-[F4]: λ(α)=(a,b,c) and λ(α−1) are vectors in the hyperplane H of R3, where a=log⁡x, b=log⁡y, c=log⁡∣z∣; these logarithms are defined because x>1, 0<y<1 and ∣z∣>1; and λ is additive, λ(u1u2)=λ(u1)+λ(u2).

1.2F1algebra

Conjugate relations I: if r is any root of f, then r2−2 is again a root: from r3=3r−1 one computes r4=3r2−r, r5=−r2+9r−3, r6=9r2−6r+1, hence (r2−2)3=3r2−7 and (r2−2)3−3(r2−2)+1=(3r2−7)−3r2+6+1=0. Thus φ(r):=r2−2 maps the set {x,y,z} of the three distinct roots into itself. Now x>2, because f is strictly increasing on (1,∞) by [F1] and f(2)=22−32+1=1−2<0<f(x); hence x2−2∈(0,2), and the only roots in (0,2) are y∈(0,1) and x∈(1,2), with x2−2≠x because x2−x−2=0 would give x∈{−1,2}; therefore φ(x)=y. Similarly φ(y)=y2−2∈(−2,−1) is the root in (−2,−1), namely z. Finally z∈(−2,−3), since for s<t<−1 one has f(t)−f(s)=(t−s)(s2+st+t2−3)>0, so f is strictly increasing on (−∞,−1), and f(−2)=−1<0<f(−3)=1, so φ(z)=z2−2∈(1,2), and the only root in (1,2) is x; hence φ(z)=x.

2.1F1step 1.2algebra

Conjugate relations II: for every root r of f one has r(r2−3)=−1, hence 1/r=3−r2. Applying this to r=x and using x2−2=y gives 1/x=3−x2=1−y; applied to r=y and using y2−2=z it gives 1/y=1−z; applied to r=z and using z2−2=x it gives 1/z=1−x.

3.1F1F2F3step 2.1algebra

Logarithmic coordinates: since 1−y>0 is the inverse of x, log⁡(1−y)=−a, that is log⁡∣y−1∣=−a; since 1−z>0 is the inverse of y, log⁡∣z−1∣=−b; and since 1/z=1−x is negative with x−1>0, log⁡∣z∣=−log⁡(x−1), that is log⁡(x−1)=−c. Moreover a+b+c=log⁡∣xyz∣=log⁡∣NK/Q(α)∣=log⁡1=0 because NK/Q(α)=−1. Therefore λ(α)=(a,b,c) and λ(α−1)=(log⁡(x−1),log⁡∣y−1∣,log⁡∣z−1∣)=(−c,−a,−b) with a+b+c=0.

4.1F5F6step 3.1algebra

The logarithmic matrix of the tuple (u1,u2) is A=(a−cb−ac−b),a+b+c=0. Deleting row 1 gives Δ1=b(−b)−(−a)c=−b2+ac=−(a2+ab+b2); deleting row 2 gives Δ2=a(−b)−(−c)c=−ab+c2=a2+ab+b2; and deleting row 3 gives Δ3=a(−a)−(−c)b=−a2+bc=−(a2+ab+b2), where c=−a−b is used in each reduction. In particular all three deleted-row determinants are nonzero and have absolute value Q:=a2+ab+b2.

5.1F3F5F7step 4.1algebra

The second tuple has the same lattice and the same determinants: by additivity λ(u1u2)=λ(u1)+λ(u2), so Zλ(u1)+Zλ(u2)=Z(λ(u1)+λ(u2))+Zλ(u2), an equality of subgroups of H. In coordinates, the logarithmic matrix of (u1u2,u2) is A′=AC with C=(1011) acting on columns, whose inverse C−1=(10−11) is integral and whose determinant is 1; deleting row k commutes with right multiplication, so Ak′=AkC and det⁡Ak′=det⁡(Ak)det⁡(C)=det⁡Ak by [F7]. Thus the determinants of the two tuples are equal, not merely equal in absolute value, and ∣det⁡Ak′∣=Q as well.

6.1F7F8step 4.1step 5.1algebra

Swapping the two units, that is passing to (u2,u1), replaces A by A′′=AP with P=(0110), whose inverse is itself and whose determinant is −1; then det⁡Ak′′=det⁡(Ak)det⁡(P)=−det⁡Ak, so the sign of every deleted-row determinant is reversed and the absolute value Q is unchanged. Both C and P are invertible over Z, so by [F8] their determinants are units of Z, that is ±1, in agreement with the direct computations det⁡C=1 and det⁡P=−1.

6.2step 3.1step 4.1step 5.1algebra

Numerical value: evaluating cosine gives cos⁡(2π/9)≈0.7660444431, so x=α=2cos⁡(2π/9)≈1.5320888862, y=x2−2≈0.3472963553, and z=y2−2 satisfies ∣z∣≈1.8793852416 because z∈(−2,−1) by step 1.2; hence a=log⁡x≈0.4266320894, b=log⁡y satisfies ∣b∣≈1.0575768136, and Q=a2+ab+b2≈0.8492874506. So every deleted-row determinant of the two tuples has absolute value the number Q of the display, the signs for the tuple (u1,u2) being −, +, − as computed in step 4.1.

7.1A1F1F4F5F9step 5.1step 6.2∎

Relation to the regulator definition and choice accounting: the computation is the explicit GL⁡2(Z) step that [F5] and [F9] single out — right multiplication by an integral matrix of determinant ±1 changes the deleted-row determinants by that same factor, so the absolute value is the invariant and the regulator is defined from it. Nothing here asserts that (u1,u2) or (u1u2,u2) is a system of fundamental units: the common number Q is the absolute deleted-row determinant of the rank-two subgroup lattice generated by the tuple, and it coincides with the field regulator only when the tuple generates all of λ(OK×). AC enters only through the unit-theoretic inputs quoted in [F1] and [F9] and the hyperplane input [F4]; the algebraic relations among conjugates, the logarithmic matrix computations and the determinant identities use no choice.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

S-units of Q

Example

Assume the Axiom of Choice. Let S={p1,…,pm} be a finite set of primes, let M={p1e1⋯pmem:e1,…,em∈N} be the multiplicative subset of Z generated by S (the empty product gives 1, so that M={1} when m=0), and let Z[S−1]=M−1Z be the localisation of Z at M. Then, under the canonical embedding of Z[S−1] in Q, Z[S−1]×={±p1n1⋯pmnm:n1,…,nm∈Z}≅{±1}×Zm, the group law on the right being addition of the exponent vector. This agrees with the S-unit theorem for K=Q: applied to the finite set SQ={(p1),…,(pm)} of nonzero prime ideals of OQ=Z it gives OQ,SQ×≅μ(Q)×Zm, of rank r1+r2−1+∣SQ∣=1+0−1+m=m.

Facts & Assumptions

Given: The Axiom of Choice, a finite set S={p1,…,pm} of primes (Prime and composite integers: p is prime when p>1 and its only positive divisors are 1 and p), the multiplicative subset M⊆Z generated by S, and the localisation R:=Z[S−1]=M−1Z (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions).

[F1]

M is multiplicative and its elements are exactly the products p1e1⋯pmem with all ei∈N, including the empty product 1. Elements of R are classes a/b with a∈Z, b∈M, with a/b+a′/b′=(ab′+a′b)/(bb′) and (a/b)(a′/b′)=(aa′)/(bb′); two classes are equal, a/b=a′/b′, exactly when u(ab′−a′b)=0 for some u∈M; the localisation map a↦a/1 is a ring homomorphism, and every s∈M maps to a unit, (s/1)−1=1/s (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions).

[F2]

A product of two nonzero integers is nonzero, so ut=0 with u,t∈Z and u≠0 forces t=0; since 0∉M, the equality criterion of [F1] reduces to ab′=a′b (The integers have no zero divisors; multiplicative cancellation).

[F5]

For every prime q the principal ideal (q)=qZ is a nonzero prime ideal of Z, indeed a maximal one: Z/(q) is a field (For every prime p, the two operations on Z/p make it a field) and a quotient ring is a field exactly when the ideal is maximal (R/M is a field if and only if M is a maximal ideal), while a maximal ideal is prime (Every maximal ideal of a commutative ring is prime); the ideal is nonzero because q≠0 and proper because q>1. Distinct primes give distinct ideals, since q∈(q′) forces q′=q. The localisation Z(q) of Z at the prime ideal (q) consists of the fractions m/n with q∤n, and every element of Z outside (q) becomes a unit there (Localisation at a prime ideal: Rp=(R∖p)−1R, Multiplicative subsets and the localisation S−1R as equivalence classes of fractions). Moreover, assuming the Axiom of Choice, Z=OQ is a Dedekind domain (Rings of integers are Dedekind domains), each localisation Zp at a nonzero prime is a discrete valuation ring (Localizing a Dedekind domain at a nonzero prime gives a DVR), and every nonzero fractional ideal I carries prime-ideal valuations defined by Ip=pvp(I)Zp (Fractional ideals, Prime-ideal valuations on fractional ideals); the nonzero ideals of the discrete valuation ring Zp are the powers pnZp with n≥0 (Ideals in a DVR are powers of the maximal ideal), and for a nonzero rational the principal fractional ideal (x)=xZ localises to (x)p=xZp (Localisation of a module at a multiplicative subset).

[F6]

For a number field K (Number field) and a finite set S of nonzero prime ideals of OK, OK,S={0}∪{x∈K×:vp(x)≥0 for every nonzero prime p∉S} consists of zero and the nonzero elements whose principal fractional ideal involves no prime outside S in a denominator, and OK,S×={x∈K×:vp(x)=0 for every nonzero prime p∉S}; no infinite place belongs to S, and the rank formula is r1+r2−1+∣S∣ (S-integers and S-units of a number field).

[F7]

Assume the Axiom of Choice. For a number field K of signature (r1,r2) and a finite set S of nonzero prime ideals, OK,S×≅μ(K)×Zr1+r2−1+∣S∣ (S-unit theorem).

[F8]

OQ=Z: the ring of integers OQ is the integral closure of Z in Q (Ring of integers), a rational number integral over Z is an integer (The rational algebraic integers are exactly the integers), and every integer n is a root of the monic polynomial X−n. Also Q has a single archimedean place, which is real, so its signature is (1,0) (Archimedean embeddings and signature).

[F9]

For a field K and n≥1, μn(K)={x∈K:xn=1} and μ(K) is the group of all roots of unity in K, the union of the μn(K) (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

[A1]

The Axiom of Choice is assumed. It is used through the S-unit theorem [F7] and through the Dedekind structure of Z quoted in [F5], where the ring-of-integers corollary is itself AC-qualified; the localisation, exponent and sign computations of the verification use no choice (The Axiom of Choice).

Verification

technique · identify the localisation with a subring of $\mathbb Q$, express membership in it and in its unit group through the exponents of the prime factorisation of a rational, and then compare the resulting monomial group with the $S$-unit theorem applied to $K=\mathbb Q$
1.1F1F2algebra

The localisation R embeds in Q by φ(a/b)=a/b: the map is well defined because if a/b=a′/b′ in R, then u(ab′−a′b)=0 for some u∈M by [F1] and hence ab′=a′b by [F2], so the two rationals agree; it respects the fraction arithmetic of [F1], which is the arithmetic of the field Q; and it is injective, since φ(a/b)=0 forces a=0, and then 1⋅(a⋅1−0⋅b)=0 gives a/b=0/1 by [F1]. Hence R is identified with the subring {a/b∈Q:a∈Z, b∈M} of Q, in which 1/s is the inverse of s for every s∈M.

1.2F3algebra

Fix x∈Q× and write its prime factorisation as x=±∏q primeqeq(x),eq(x)∈Z, with all but finitely many exponents zero; existence and uniqueness of the triple (sign, exponent vector) is [F3], applied to the numerator and denominator of x in lowest terms. Writing x=a/b in lowest terms with b>0 and fixing a prime q, one has eq(x)=vq(a)−vq(b); if q∤b this is the nonnegative integer vq(a), while if q∣b then vq(b)>0 and vq(a)=0 by coprimality, so eq(x)<0. Thus eq(x)≥0 if and only if q∤b.

1.3F5algebra

For a prime q, the localisation Z(q) consists of the fractions m/n with q∤n by [F5], so for x=a/b∈Q× in lowest terms with b>0 one has x∈Z(q) if and only if q∤b: if q∤b then x=a/b has the required form, while if x=a/b=m/n with q∤n, then an=bm, and q∣b would give q∣an and hence q∣a, contradicting coprimality.

1.4F5algebra

For a nonzero prime ideal p of Z and x∈Q×, [F5] writes vp(x)=vp((x)) as the unique integer n with xZp=(x)p=pnZp. The powers pnZp with n≥0 are exactly the ideals of the discrete valuation ring Zp, and for n<0 the fractional ideal pnZp properly contains Zp; hence vp(x)≥0 if and only if xZp⊆Zp, that is, if and only if x∈Zp.

2.1F1F3F5step 1.1step 1.2algebra

An element x∈Q× lies in R if and only if eq(x)≥0 for every prime q∉S. If x=a/b with a∈Z and b∈M, then b has no prime divisor outside S, so for q∉S one has eq(x)=vq(a)−vq(b)=vq(a)−0≥0, where the exponents are those of the factorisations of a and b; conversely, if eq(x)≥0 for all q∉S and x=a/b is in lowest terms with b>0, then a prime q∣b satisfies vq(a)=0 and vq(x)=−vq(b)<0, so q∈S; hence every prime divisor of b lies in S, that is b∈M, and x=a/b∈R.

2.2F3F4F8F9step 1.2algebra

For the comparison with the S-unit theorem, evaluate its torsion factor and its signature input. Q is a number field with signature (1,0) and OQ=Z by [F8]; the roots of unity in Q are ±1, since x=a/b∈Q× in lowest terms with xn=1 gives an=bn, whence ∣a∣n=∣b∣n and, by uniqueness of prime factorisation, ∣a∣=∣b∣, while coprimality forces ∣a∣=∣b∣=1; conversely ±1 are roots of unity. Thus μ(Q)={±1} by [F9].

2.3F5F6F8step 1.3step 1.4

The same group is obtained from the S-unit theorem. By [F5] the ideals (p1),…,(pm) are nonzero prime ideals of OQ=Z by [F8], so SQ:={(p1),…,(pm)} is a finite set of nonzero prime ideals. The two rings agree on Q×, and both contain 0. Indeed, let 0≠x=a/b∈R with a∈Z and b∈M, and let p∉SQ be a nonzero prime ideal: then b∉p, because otherwise some prime pi with pi∣b lies in p, so (pi)⊆p, and maximality of (pi) with p proper forces p=(pi)∈SQ, a contradiction. Hence b/1 is a unit of Zp and x=(a/1)(b/1)−1∈Zp, so vp(x)≥0 by step 1.4 and x∈OQ,SQ. Conversely, let 0≠x=a/b∈OQ,SQ be in lowest terms with b>0, and suppose a prime q∉S divides b; then (q) is a nonzero prime ideal of Z and (q)∉SQ by the distinctness in [F5], so v(q)(x)≥0 and step 1.4 gives x∈Z(q), contradicting step 1.3. Therefore every prime divisor of b lies in S, that is b∈M and x=a/b∈R. Thus OQ,SQ=R as subrings of Q, and their unit groups inside Q coincide: OQ,SQ×=R×.

3.1F1step 2.1algebra

Consequently an element x∈Q× is a unit of R if and only if eq(x)=0 for every prime q∉S: a unit of R lies in R together with its inverse, so step 2.1 gives eq(x)≥0 and eq(x−1)=−eq(x)≥0 for q∉S, and conversely the two inequalities eq(x)≥0, −eq(x)≥0 for q∉S place both x and x−1 in R.

4.1F3step 3.1algebra

Therefore R×={x∈Q×:eq(x)=0 for all q∉S}={±p1n1⋯pmnm:ni∈Z}: for the first description, an element with vanishing exponents outside S has prime factorisation involving only primes of S and a sign, and conversely a monomial ±p1n1⋯pmnm has all exponents outside S equal to zero; the sign and the exponents in such an expression are unique by the uniqueness clause of [F3].

5.1F3step 4.1algebra

The assignment (ε,n1,…,nm)↦εp1n1⋯pmnm is an isomorphism {±1}×Zm→R×: it is a group homomorphism because the exponents add, it is surjective by step 4.1, and it is injective because εp1n1⋯pmnm=1 forces ε=1 and n1=⋯=nm=0 by the uniqueness of the factorisation of the positive integer obtained after moving negative exponents to the other side.

6.1F7step 5.1step 2.3step 2.2

By the S-unit theorem [F7] applied to K=Q and SQ, OQ,SQ×≅μ(Q)×Zr1+r2−1+∣SQ∣={±1}×Z1+0−1+m={±1}×Zm, of rank m. Combined with step 2.3 this agrees with the explicit computation of steps 4.1 and 5.1, and the m generators are the classes of p1,…,pm.

7.1A1F5F7step 1.1step 5.1∎

Scope and boundary cases: for m=0 the set M={1} and R=Z, and the computation returns Z×={±1}≅{±1}×Z0 by [F4], while SQ=∅ has rank 0; for m≥1 the exponents ni range over Z and negative exponents are allowed, the generators being units because pi/1∈M has inverse 1/pi in R. Choice enters through the S-unit theorem [F7] and through the AC-qualified Dedekind interface of [F5]; the identification of R with a subring of Q, the exponent bookkeeping and the enumeration of signs use no choice.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Units of Z[√5] are a proper subgroup of the units of its maximal order

Statement refuted

Let d>1 be squarefree. Whenever d≡1(mod4) the Pell order Z[d] is a proper subring of the maximal order OQ(d), and one might expect that this inclusion of rings is the only difference between them, so that their unit groups still coincide: Z[d]×=OQ(d)×, with the fundamental Pell solution εd of x2−dy2=1 generating the full unit group of the maximal order. This is false. At d=5, with ε=(1+5)/2, one has OQ(5)=Z[ε], the element 2+5=ε3 generates the unit group of the Pell order, Z[5]×={±(2+5)n:n∈Z}={±ε3n:n∈Z}, while OQ(5)×={±εn:n∈Z}; the Pell order's unit group is a proper subgroup of index 3, and ε itself is a unit of the maximal order that is not in Z[5].

Facts & Assumptions

Given: The Axiom of Choice, the field K=Q(5), the Pell order Z[5] with its Pell norm N5 (The norm on the explicit order Z[D]), the fundamental Pell solution ε5 of x2−5y2=1 (The fundamental Pell solution), and the element ε:=(1+5)/2.

[F1]

OK=Z[(1+5)/2]=Z[ε], which strictly contains Z[5], and its elements are the numbers (x+y5)/2 with x,y∈Z and x≡y(mod2), of field norm NK/Q((x+y5)/2)=(x2−5y2)/4 (Integers in a quadratic field, Real quadratic units and Pell's equation).

[F2]

For u∈OK, the element u is a unit of the ring OK if and only if NK/Q(u)=±1 (A number-field unit is exactly an algebraic integer of norm plus or minus one).

[F3]

The Pell norm on Z[5] is multiplicative, and α=x+y5∈Z[5] is a unit of the order Z[5] if and only if N5(α)=x2−5y2=±1 (The norm on the explicit order Z[D]). The norm-one integral solutions are exactly the elements ±ε5k, k∈Z, and the positive ones are ε5k for k≥1 (All integral Pell solutions are ±εDk, All positive Pell solutions are powers of the fundamental solution, Integral Pell solutions form an abelian group).

[F4]

For d=5: the element ε=(1+5)/2∈OK has NK/Q(ε)=−1, so it is a unit of OK; direct multiplication gives ε2=(3+5)/2 and ε3=2+5; 2+5 is the least positive solution of x2−5y2=−1 and ε5=9+45=(2+5)2; the unit group of the Pell order is Z[5]×=±⟨2+5⟩=±⟨ε3⟩; and ε is the least unit >1 of OK (Real quadratic units and Pell's equation, The fundamental Pell solution).

[F5]

Assume the Axiom of Choice. The maximal order has OK×≅{±1}×Z with torsion subgroup {±1}; explicitly there is a unit γ>1 with OK×={±γn:n∈Z}, and then γ is the least unit >1 of OK (Unit ranks by signature).

[A1]

The Axiom of Choice is assumed; it is used only through the rank-one unit structure [F5] (The Axiom of Choice).

Counterexample

technique · direct; identify the units of the two orders by solving the norm equations $x^2-5y^2=\pm1$ and $x^2-5y^2=\pm4$, and compare the two cyclic groups through the common generator $\varepsilon$
1.1F1

The maximal order is OK=Z[ε] with ε=(1+5)/2, and Z[5]⊊OK; its elements are the (x+y5)/2 with x≡y(mod2), of nonzero norm when the element is nonzero because the norm is a product of the two embeddings.

1.2F2F4algebra

The element ε is a unit of OK: its norm is NK/Q(ε)=1+52⋅1−52=1−54=−1, so [F2] applies; also ε>1 because 5>1, and direct multiplication gives ε2=(1+5)24=3+52,ε3=ε⋅ε2=(1+5)(3+5)4=8+454=2+5.

2.1F3F4step 1.2

The units of the Pell order are Z[5]×=±⟨2+5⟩=±⟨ε3⟩: an element x+y5 of Z[5] is a unit of that order exactly when x2−5y2=±1 by [F3], the norm-one solutions are ±ε5k, and 2+5 is the least positive norm-(−1) solution, so every norm-±1 solution is ±(2+5)n=±ε3n.

2.2F4F5step 1.2

The maximal order has OK×={±εn:n∈Z}: by [F5] there is a unit γ>1 with OK×={±γn:n∈Z}, and then every unit v>1 is γn with n≥1, hence v≥γ, so γ is the least unit >1 of OK; by [F4] the element ε>1 is the least unit >1 of OK, so γ=ε.

3.1step 1.1step 2.1step 2.2algebra

The inclusion of unit groups is proper: the element ε lies in OK× by step 1.2, while ε=(1+5)/2 is not of the form x+y5 with x,y∈Z and so does not lie in Z[5], hence not in Z[5]×; therefore Z[5]×=±⟨ε3⟩⊊±⟨ε⟩=OK×.

3.2step 2.1step 2.2algebra

The index is 3: the assignment n↦εn is an isomorphism Z→⟨ε⟩⊆OK×, since ε>1 forces εn−m=1 only for n=m. It maps 3Z onto ⟨ε3⟩, so [⟨ε⟩:⟨ε3⟩]=[Z:3Z]=3; multiplying by the common sign group {±1} does not change the index, hence [OK×:Z[5]×]=3.

4.1A1F4F5step 2.1step 2.2step 3.2∎

Conclusion: the maximal order OK of K=Q(5) has unit group {±εn} generated modulo its sign subgroup by ε=(1+5)/2, while the Pell order Z[5] has unit group {±(2+5)n}={±ε3n}, a proper subgroup of index 3. The fundamental Pell solution ε5=9+45=ε6 generates the norm-one Pell subgroup of the order up to sign; the maximal-order fundamental unit is ε. The counterexample is the sharpened form of the design's warning for this pair: it identifies both groups and the exact index rather than merely exhibiting one missing unit. Choice is used only through the rank-one structure [F5]; all arithmetic in Z[5] and the comparisons of the two generators are elementary.

Sources