Proof that the solutions of Pell's equation are powers of the fundamental solution
Builds on Pell's equationFundamental solution of Pell's equationIrrationality of square roots of non-squaresThe reals are Archimedean
Proof
Let .
- Since is not a perfect square, is irrational by the irrationality of square roots of non-squares. So with integers implies and .
- For in , put and . By step 1 these are well defined.
- The set is closed under products. For and , and . So and .
- So a pair of integers solves Pell's equation exactly when , and products of such numbers again have norm .
- Lemma 1: if and , then and . Indeed . So and . Then and , so .
- Lemma 2: let and be solutions with and . Then , because . Hence .
- Let . By the definition of the fundamental solution, and , so , and .
- By step 3, lies in and . So lies in and has norm for each .
- Let . Since and , we have .
- Since , the powers increase. By induction on , . By the Archimedean property, the powers are unbounded.
- So there is a largest natural number with , and for it .
- Put . By steps 3 and 8, with integers , , and .
- Dividing step 11 by gives .
- Suppose . By Lemma 1, and , so is a solution with and . By the minimality of , .
- If , then , so and . If , then by Lemma 2. Both contradict step 13.
- So , that is, .
- Uniqueness: if also with , then . Since the powers of strictly increase, .
Idea
Solutions of Pell's equation are the numbers of norm , and these are closed under products and inverses. Divide a given solution by the largest power of below it. The quotient is a solution between and , and no solution other than lies there, because is the smallest solution above .
Reading path
To understand this page from the ground up, read these 123 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of the approximation property of the supremum, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof that a composition of injections is injective, Proof of Euclid's lemma, Proof of the Brahmagupta–Fibonacci identity, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of strong induction from ordinary induction, Proof of the fundamental theorem of arithmetic, Proof of the complement principle, Proof of the pigeonhole principle, Proof that a composition of surjections is surjective, Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation, Proof of the existence of prime factorization, Proof of Dirichlet's approximation theorem by the pigeonhole principle, Proof of the rule of sum, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof that the reals are Archimedean from the completeness axiom, Proof of the bijection principle, Proof of the irrationality of square roots of non-squares, Proof of the existence of a prime divisor, Proof of the infinite pigeonhole principle.
- Cardinality of a finite set definition
- Construction of the reals from Cauchy sequences concept
- Definition by recursion concept
- Diophantine equation concept
- Divisibility definition
- Element definition
- Group concept
- Integers object
- Mathematical induction concept
- Natural numbers object
- Ordered field definition
- Peano axioms concept
- Proposition concept
- Rational numbers object
- Real numbers object
- Set bounded above definition
- Pell's equation definition
- Greatest common divisor definition
- Prime number definition
- Set definition
- Ring definition
- Ring of integers statement
- Archimedean ordered field definition
- Successor function definition
- Conjunction definition
- Implication definition
- Predicate definition
- Irrational number definition
- The reals form a field statement
- Supremum definition
- Coprime integers definition
- Prime factorization definition
- Empty set object
- Ordered pair definition
- Commutative ring definition
- Intersection definition
- Addition of natural numbers definition
- The rationals form a field statement
- The successor function is injective statement
- Zero is not a successor statement
- Existential quantifier definition
- Universal quantifier definition
- Completeness axiom statement
- Cartesian product definition
- Disjoint sets definition
- Proof of the Brahmagupta–Fibonacci identity proof
- Proof of the commutativity of addition by induction proof
- Subset definition
- Order on the natural numbers definition
- The rationals form an ordered field statement
- Uniqueness quantifier definition
- Binary relation definition
- Brahmagupta–Fibonacci identity statement
- Order on the reals definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Function definition
- Strong induction statement
- Preorder definition
- Codomain definition
- Function composition definition
- Identity function definition
- Injective function definition
- Image of a set definition
- Proof of the well-ordering principle from strong induction proof
- Partial order definition
- Surjective function definition
- Left inverse definition
- Right inverse definition
- Proof that a composition of injections is injective proof
- Well-ordering principle statement
- Total order definition
- Proof that a composition of surjections is surjective proof
- Bijective function definition
- Composition of injections is injective statement
- Proof of the existence of a prime divisor proof
- Proof of the division algorithm proof
- Proof of the rule of sum proof
- Composition of surjections is surjective statement
- Equinumerous sets definition
- Proof that a function is bijective iff it has a two-sided inverse proof
- Existence of a prime divisor statement
- Division algorithm statement
- Proof that the reals form an ordered field, with the Cauchy sequence construction proof
- Rule of sum statement
- Finite set definition
- Bijective iff it has a two-sided inverse statement
- Proof of the existence of prime factorization proof
- Proof of Bézout's identity proof
- The reals form an ordered field statement
- Proof of the complement principle proof
- Infinite set definition
- Proof of the bijection principle proof
- Bézout's identity statement
- Existence of prime factorization statement
- Proof of the approximation property of the supremum proof
- Complement principle statement
- Proof of the infinite pigeonhole principle proof
- Bijection principle statement
- Proof of the generalized Euclid's lemma proof
- Approximation property of the supremum statement
- Generalized Euclid's lemma statement
- Proof of the pigeonhole principle proof
- Proof that the reals are Archimedean from the completeness axiom proof
- Pigeonhole principle statement
- Proof of Euclid's lemma proof
- The reals are Archimedean statement
- Infinite pigeonhole principle statement
- Euclid's lemma statement
- Floor function definition
- Proof of Dirichlet's approximation theorem by the pigeonhole principle proof
- Proof of the fundamental theorem of arithmetic proof
- Dirichlet's approximation theorem statement
- Fundamental theorem of arithmetic statement
- Proof of the irrationality of square roots of non-squares proof
- Irrationality of square roots of non-squares statement
- Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation proof
- Existence of nontrivial solutions of Pell's equation statement
- Fundamental solution of Pell's equation definition
- Proof that the solutions of Pell's equation are powers of the fundamental solution proof
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | ENV6YZEMXB |
|---|---|
| URI | m2://ENV6YZEMXB |
| Kind | proof |
| Writing | W0 stub |
| MSC | 11D09 |
| Proves | Solutions of Pell's equation are powers of the fundamental solution |
| Uses | Pell's equation, Fundamental solution of Pell's equation, Irrationality of square roots of non-squares, The reals are Archimedean |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.