Math 2.0

Number theory Proof

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 ℤ[d]={a+bd:a,b∈ℤ}\mathbb{Z}[\sqrt{d}] = \set{a + b\sqrt{d} : a, b \in \Z}.

  1. Since dd is not a perfect square, d\sqrt{d} is irrational by the irrationality of square roots of non-squares. So a+bd=a′+b′da + b\sqrt{d} = a' + b'\sqrt{d} with integers a,b,a′,b′a, b, a', b' implies a=a′a = a' and b=b′b = b'.
  2. For γ=a+bd\gamma = a + b\sqrt{d} in ℤ[d]\mathbb{Z}[\sqrt{d}], put γˉ=a−bd\bar\gamma = a - b\sqrt{d} and N(γ)=γγˉ=a2−db2N(\gamma) = \gamma \bar\gamma = a^2 - d b^2. By step 1 these are well defined.
  3. The set ℤ[d]\mathbb{Z}[\sqrt{d}] is closed under products. For γ=a+bd\gamma = a + b\sqrt{d} and δ=c+ed\delta = c + e\sqrt{d}, γδ=(ac+dbe)+(ae+bc)d\gamma\delta = (ac + dbe) + (ae + bc)\sqrt{d} and γˉδˉ=(ac+dbe)−(ae+bc)d\bar\gamma \bar\delta = (ac + dbe) - (ae + bc)\sqrt{d}. So γδ‾=γˉδˉ\overline{\gamma\delta} = \bar\gamma \bar\delta and N(γδ)=N(γ)N(δ)N(\gamma\delta) = N(\gamma) N(\delta).
  4. So a pair (a,b)(a, b) of integers solves Pell's equation exactly when N(a+bd)=1N(a + b\sqrt{d}) = 1, and products of such numbers again have norm 11.
  5. Lemma 1: if N(η)=1N(\eta) = 1 and η=a+bd>1\eta = a + b\sqrt{d} > 1, then a>1a > 1 and b≥1b \ge 1. Indeed ηˉ=1/η∈(0,1)\bar\eta = 1/\eta \in (0, 1). So a=(η+ηˉ)/2>0a = (\eta + \bar\eta)/2 > 0 and bd=(η−ηˉ)/2>0b\sqrt{d} = (\eta - \bar\eta)/2 > 0. Then b≥1b \ge 1 and a2=1+db2>1a^2 = 1 + db^2 > 1, so a>1a > 1.
  6. Lemma 2: let (a,b)(a, b) and (c,e)(c, e) be solutions with a,b,c,e≥1a, b, c, e \ge 1 and a<ca < c. Then b<eb < e, because db2=a2−1<c2−1=de2d b^2 = a^2 - 1 < c^2 - 1 = d e^2. Hence a+bd<c+eda + b\sqrt{d} < c + e\sqrt{d}.
  7. Let ε=x1+y1d\varepsilon = x_1 + y_1\sqrt{d}. By the definition of the fundamental solution, x1>1x_1 > 1 and y1>0y_1 > 0, so ε>1\varepsilon > 1, and N(ε)=1N(\varepsilon) = 1.
  8. By step 3, εˉ=x1−y1d\bar\varepsilon = x_1 - y_1\sqrt{d} lies in ℤ[d]\mathbb{Z}[\sqrt{d}] and εεˉ=1\varepsilon \bar\varepsilon = 1. So ε−n=εˉ n\varepsilon^{-n} = \bar\varepsilon^{\,n} lies in ℤ[d]\mathbb{Z}[\sqrt{d}] and has norm 11 for each n≥0n \ge 0.
  9. Let ξ=x+yd\xi = x + y\sqrt{d}. Since x≥1x \ge 1 and y≥0y \ge 0, we have ξ≥1\xi \ge 1.
  10. Since ε>1\varepsilon > 1, the powers ε0=1<ε<ε2<⋯\varepsilon^0 = 1 < \varepsilon < \varepsilon^2 < \cdots increase. By induction on nn, εn≥1+n(ε−1)\varepsilon^n \ge 1 + n(\varepsilon - 1). By the Archimedean property, the powers εn\varepsilon^n are unbounded.
  11. So there is a largest natural number nn with εn≤ξ\varepsilon^n \le \xi, and for it εn≤ξ<εn+1\varepsilon^n \le \xi < \varepsilon^{n+1}.
  12. Put ζ=ξε−n=ξεˉ n\zeta = \xi \varepsilon^{-n} = \xi \bar\varepsilon^{\,n}. By steps 3 and 8, ζ=a+bd\zeta = a + b\sqrt{d} with integers aa, bb, and N(ζ)=1N(\zeta) = 1.
  13. Dividing step 11 by εn>0\varepsilon^n > 0 gives 1≤ζ<ε1 \le \zeta < \varepsilon.
  14. Suppose ζ>1\zeta > 1. By Lemma 1, a>1a > 1 and b≥1b \ge 1, so (a,b)(a, b) is a solution with a>1a > 1 and b>0b > 0. By the minimality of x1x_1, a≥x1a \ge x_1.
  15. If a=x1a = x_1, then db2=a2−1=dy12d b^2 = a^2 - 1 = d y_1^2, so b=y1b = y_1 and ζ=ε\zeta = \varepsilon. If a>x1a > x_1, then ζ>ε\zeta > \varepsilon by Lemma 2. Both contradict step 13.
  16. So ζ=1\zeta = 1, that is, x+yd=εn=(x1+y1d)nx + y\sqrt{d} = \varepsilon^n = (x_1 + y_1\sqrt{d})^n.
  17. Uniqueness: if also ξ=εm\xi = \varepsilon^m with m≥0m \ge 0, then εm=εn\varepsilon^m = \varepsilon^n. Since the powers of ε\varepsilon strictly increase, m=nm = n.

Idea

Solutions of Pell's equation are the numbers a+bda + b\sqrt{d} of norm 11, and these are closed under products and inverses. Divide a given solution by the largest power of ε=x1+y1d\varepsilon = x_1 + y_1\sqrt{d} below it. The quotient is a solution between 11 and ε\varepsilon, and no solution other than 11 lies there, because ε\varepsilon is the smallest solution above 11.

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.

  1. Cardinality of a finite set definition
  2. Construction of the reals from Cauchy sequences concept
  3. Definition by recursion concept
  4. Diophantine equation concept
  5. Divisibility definition
  6. Element definition
  7. Group concept
  8. Integers object
  9. Mathematical induction concept
  10. Natural numbers object
  11. Ordered field definition
  12. Peano axioms concept
  13. Proposition concept
  14. Rational numbers object
  15. Real numbers object
  16. Set bounded above definition
  17. Pell's equation definition
  18. Greatest common divisor definition
  19. Prime number definition
  20. Set definition
  21. Ring definition
  22. Ring of integers statement
  23. Archimedean ordered field definition
  24. Successor function definition
  25. Conjunction definition
  26. Implication definition
  27. Predicate definition
  28. Irrational number definition
  29. The reals form a field statement
  30. Supremum definition
  31. Coprime integers definition
  32. Prime factorization definition
  33. Empty set object
  34. Ordered pair definition
  35. Commutative ring definition
  36. Intersection definition
  37. Addition of natural numbers definition
  38. The rationals form a field statement
  39. The successor function is injective statement
  40. Zero is not a successor statement
  41. Existential quantifier definition
  42. Universal quantifier definition
  43. Completeness axiom statement
  44. Cartesian product definition
  45. Disjoint sets definition
  46. Proof of the Brahmagupta–Fibonacci identity proof
  47. Proof of the commutativity of addition by induction proof
  48. Subset definition
  49. Order on the natural numbers definition
  50. The rationals form an ordered field statement
  51. Uniqueness quantifier definition
  52. Binary relation definition
  53. Brahmagupta–Fibonacci identity statement
  54. Order on the reals definition
  55. Commutativity of addition statement
  56. Proof of strong induction from ordinary induction proof
  57. Antisymmetric relation definition
  58. Reflexive relation definition
  59. Transitive relation definition
  60. Function definition
  61. Strong induction statement
  62. Preorder definition
  63. Codomain definition
  64. Function composition definition
  65. Identity function definition
  66. Injective function definition
  67. Image of a set definition
  68. Proof of the well-ordering principle from strong induction proof
  69. Partial order definition
  70. Surjective function definition
  71. Left inverse definition
  72. Right inverse definition
  73. Proof that a composition of injections is injective proof
  74. Well-ordering principle statement
  75. Total order definition
  76. Proof that a composition of surjections is surjective proof
  77. Bijective function definition
  78. Composition of injections is injective statement
  79. Proof of the existence of a prime divisor proof
  80. Proof of the division algorithm proof
  81. Proof of the rule of sum proof
  82. Composition of surjections is surjective statement
  83. Equinumerous sets definition
  84. Proof that a function is bijective iff it has a two-sided inverse proof
  85. Existence of a prime divisor statement
  86. Division algorithm statement
  87. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  88. Rule of sum statement
  89. Finite set definition
  90. Bijective iff it has a two-sided inverse statement
  91. Proof of the existence of prime factorization proof
  92. Proof of Bézout's identity proof
  93. The reals form an ordered field statement
  94. Proof of the complement principle proof
  95. Infinite set definition
  96. Proof of the bijection principle proof
  97. Bézout's identity statement
  98. Existence of prime factorization statement
  99. Proof of the approximation property of the supremum proof
  100. Complement principle statement
  101. Proof of the infinite pigeonhole principle proof
  102. Bijection principle statement
  103. Proof of the generalized Euclid's lemma proof
  104. Approximation property of the supremum statement
  105. Generalized Euclid's lemma statement
  106. Proof of the pigeonhole principle proof
  107. Proof that the reals are Archimedean from the completeness axiom proof
  108. Pigeonhole principle statement
  109. Proof of Euclid's lemma proof
  110. The reals are Archimedean statement
  111. Infinite pigeonhole principle statement
  112. Euclid's lemma statement
  113. Floor function definition
  114. Proof of Dirichlet's approximation theorem by the pigeonhole principle proof
  115. Proof of the fundamental theorem of arithmetic proof
  116. Dirichlet's approximation theorem statement
  117. Fundamental theorem of arithmetic statement
  118. Proof of the irrationality of square roots of non-squares proof
  119. Irrationality of square roots of non-squares statement
  120. Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation proof
  121. Existence of nontrivial solutions of Pell's equation statement
  122. Fundamental solution of Pell's equation definition
  123. 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

  1. Web https://kconrad.math.uconn.edu/blurbs/ugradnumthy/pelleqn1.pdf, Theorem 5.3
About this page
TagENV6YZEMXB
URIm2://ENV6YZEMXB
Kindproof
WritingW0 stub
MSC11D09
ProvesSolutions of Pell's equation are powers of the fundamental solution
UsesPell's equation, Fundamental solution of Pell's equation, Irrationality of square roots of non-squares, The reals are Archimedean
Changed4 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.