Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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.

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].

Depends on

Used by

Dependency tree · two levels

63 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