Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation
Builds on Pell's equationIrrationality of square roots of non-squaresDirichlet's approximation theoremPigeonhole principleInfinite pigeonhole principleBrahmagupta–Fibonacci identity
Proof
- Since is not a perfect square, is irrational by the irrationality of square roots of non-squares.
- Claim: there are infinitely many pairs of integers with and .
- For a positive integer , Dirichlet's approximation theorem gives integers , with and . So at least one such pair exists.
- Suppose only finitely many pairs had this property. By step 1, for each of them. Let be the least value of over them.
- Choose with . Step 3 gives a pair with the property and . It is not in the finite list, a contradiction. This proves the claim.
- For each pair of step 2, .
- So .
- Also , since otherwise would be rational.
- So takes values in the finite set of nonzero integers with . By the infinite pigeonhole principle, some such equals for infinitely many pairs of step 2.
- Each such pair gives a pair of residues , and there are only of these. By the pigeonhole principle, there are two different pairs among them with and .
- Put and . Then .
- Modulo , step 10 gives and . So and for integers and .
- Expanding both sides, as in the Brahmagupta–Fibonacci identity, gives .
- By steps 12 and 13, . Since , .
- Suppose . Then , so . Put ; then and .
- Then , so and . This gives , contrary to step 10. So .
- So Pell's equation has a solution with . Replacing by and by , we may take and .
- For infinitely many solutions, put . Then .
- Define integers , for by , , and .
- By induction on , and . Both follow by multiplying out .
- Multiplying the two formulas of step 20 gives . So each is a solution.
- Since , the numbers are pairwise different. So the pairs are pairwise different, and Pell's equation has infinitely many integer solutions.
Idea
Dirichlet's theorem gives infinitely many fractions near , and for them stays bounded. So one value repeats infinitely often, and two of these pairs agree modulo . Dividing one by the other, in the form , gives a solution of norm . Powers of one solution then give infinitely many.
Reading path
To understand this page from the ground up, read these 120 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 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
Where this leads
4 pages build on this one.
Further reading
- Web https://kconrad.math.uconn.edu/blurbs/ugradnumthy/pelleqn2.pdf, Lemma 2.1 and Theorem 2.3
About this page
| Tag | EYTD2KSD8X |
|---|---|
| URI | m2://EYTD2KSD8X |
| Kind | proof |
| Writing | W0 stub |
| MSC | 11D09 |
| Proves | Existence of nontrivial solutions of Pell's equation |
| Uses | Pell's equation, Irrationality of square roots of non-squares, Dirichlet's approximation theorem, Pigeonhole principle, Infinite pigeonhole principle, Brahmagupta–Fibonacci identity |
| 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.