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 be squarefree and . If then , and the unit group is , where is the least positive solution of the negative Pell equation when that equation is solvable, and is the fundamental Pell solution of otherwise; in the solvable case and the norm-one Pell subgroup has index in . If then strictly contains ; the unit group of the order is as above, while the fundamental unit of may be a half-integer element solving that does not lie in , in which case (in particular the norm-one Pell subgroup ) is a proper subgroup of . For the fundamental unit of is (norm ), so , while in one has , the fundamental Pell solution is , and has index in .
Facts & Assumptions
Given: The Axiom of Choice, a squarefree integer , the field , the order with its Pell norm (The norm on the explicit order ), the fundamental Pell solution of (The fundamental Pell solution), and, when the negative Pell equation is solvable, its least positive solution .
If then , and if then , which strictly contains (Integers in a quadratic field).
For , is a unit of if and only if , and for a real quadratic field the norm of is (A number-field unit is exactly an algebraic integer of norm plus or minus one, Integers in a quadratic field).
The Pell norm is multiplicative: for (The Pell norm is multiplicative); consequently an element is a unit of the order if and only if (The norm on the explicit order , The units of a ring are the invertible elements of its multiplicative monoid, and is a group under multiplication; only in the zero ring).
The integral solutions of are exactly the elements with , and the positive solutions are with ; also (All integral Pell solutions are , All positive Pell solutions are powers of the fundamental solution, The fundamental Pell solution). The equation has a positive nontrivial solution (Every Pell equation has a positive nontrivial integral solution).
The negative Pell equation is solvable if and only if the period length of the continued fraction of is odd; when it is solvable, the numerator-denominator pair gives the least positive solution, and the least positive solution of is (Negative Pell is soluble exactly for odd period length, Generalized and negative Pell equations).
For a real quadratic field , ; in particular there is a unit with (Unit ranks by signature).
For : gives , and , so the complete quotients of are and ; hence the digit sequence is , that is , with period length (Complete quotients in the continued-fraction algorithm, Finite and infinite regular continued fractions, Eventually periodic regular continued fractions). The convergent recurrence gives and (Convergents of a regular continued fraction), and direct computation gives , and .
The Axiom of Choice is assumed; it is used only through the rank-one structure of in [F6]; the Pell solution theory quoted above is choice-free (The Axiom of Choice).
Verification
The ring-of-integers formula gives when and when .
An element is a unit of the order if and only if : if then , while for a unit one has with both factors in , so .
Seen in , every unit of has norm (its Pell norm is the field norm), and conversely a norm- element of is a unit; thus the units of the order are exactly the integral solutions of , with the norm-one solutions forming .
Take and . Its norm is , so ; direct multiplication gives and .
Suppose first that is solvable, and let be its least positive solution, whose coordinates are the numerator and denominator of the convergent in [F5]. Then is a positive solution of , so for a unique integer .
For the elements of are the numbers with , of norm ; such an element is a unit exactly when , and it fails to lie in exactly when and are both odd.
The exponent is odd: if , then in the domain , so and taking norms gives , contradicting .
The units of for are the elements with and ; for a unit one has , and according as , so are positive integers. Checking the admissible positive pairs in order of : for the equation gives , so (the unit ) or (the unit ); for it gives , so (the unit ); for one has , hence and . Therefore is the least unit of .
In fact . If , write and put . Both and are units of by [F3], so is a unit of that order as well; in particular for integers . From step 2.1, , and therefore and . Since and , the definition of gives , and gives . By [F3] the order norm is or . If , multiplicativity in [F3] and give , contradicting ; hence . Thus is a positive integral solution of : its conjugate is , so and . As and , ; moreover , so this solution has smaller first coordinate than the least positive solution , a contradiction. Therefore and .
Since for some and the least unit in such a group is , step 3.2 gives , so .
Consequently, in the solvable case every norm-one unit is and every norm- unit is , because multiplying it by gives norm ; thus , and the norm-one subgroup consists of the even powers of , of index .
If instead is unsolvable, every unit of has norm , so ; setting gives in both cases.
The order is a subring of , so its unit group is a subgroup of and equals the units computed in steps 5.1 and 6.1; if the fundamental unit of (its least unit ) is an element with both odd, then it is not in , so , and since also .
In the order, [F5] applied with the period length computed in [F7] makes the pair the least positive solution of and the pair the least positive solution of , whose associated element is the fundamental Pell unit ; by steps 5.1 and 6.1 applied to , , and by step 1.4 this is , while the identity of [F7] gives .
Finally with index , because the multiples of in have index ; 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 .
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 in steps 7.2 and 8.1; AC is used only through the rank-one structure [F6], all computations here being elementary arithmetic in .
Depends on
- All integral Pell solutions are $\pm \varepsilon_D^k$
- Unit ranks by signature
- The Axiom of Choice
- Complete quotients in the continued-fraction algorithm
- Convergents of a regular continued fraction
- Eventually periodic regular continued fractions
- The fundamental Pell solution
- Generalized and negative Pell equations
- The norm on the explicit order $\mathbb{Z}[\sqrt{D}]$
- Finite and infinite regular continued fractions
- Ring of integers
- A number-field unit is exactly an algebraic integer of norm plus or minus one
- The Pell norm is multiplicative
- The units of a ring are the invertible elements of its multiplicative monoid, and $R^{\times}$ is a group under multiplication; $0 \in R^{\times}$ only in the zero ring
- Integral Pell solutions form an abelian group
- All positive Pell solutions are powers of the fundamental solution
- Every Pell equation has a positive nontrivial integral solution
- Negative Pell is soluble exactly for odd period length
- Integers in a quadratic field
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
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021) (standard reference, not scraped)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)