Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

80 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