Math 2.0

Number theory Proof

Proof that the convergents of an irrational number converge to it

Builds on Continued fraction expansion of a real numberConvergents of a continued fractionFloor functionThe continued fraction of a rational number terminatesMathematical induction

Proof

Let xnx_n and ana_n be the complete quotients and partial quotients of the continued fraction expansion of xx: x0=xx_0 = x, an=⌊xn⌋a_n = \floor{x_n}, xn+1=1/(xn−an)x_{n+1} = 1/(x_n - a_n). Let pnp_n and qnq_n be given by the recurrences in the definition of convergents.

  1. Since xx is irrational, its expansion is infinite by the termination theorem. So xnx_n and ana_n exist for all n≥0n \ge 0.
  2. Each xnx_n is irrational. Indeed x0=xx_0 = x, and if xn+1x_{n+1} were rational then xn=an+1/xn+1x_n = a_n + 1/x_{n+1} would be rational.
  3. So xnx_n is not an integer, and xn>⌊xn⌋=anx_n > \floor{x_n} = a_n for each nn. For n≥1n \ge 1 this gives xn>an≥1x_n > a_n \ge 1.
  4. Claim A: pnqn−1−pn−1qn=(−1)n+1p_n q_{n-1} - p_{n-1} q_n = (-1)^{n+1} for n≥−1n \ge -1. We argue by induction on nn.
  5. For n=−1n = -1: p−1q−2−p−2q−1=1⋅1−0⋅0=1p_{-1} q_{-2} - p_{-2} q_{-1} = 1 \cdot 1 - 0 \cdot 0 = 1.
  6. For n≥0n \ge 0, the recurrences give pnqn−1−pn−1qn=(anpn−1+pn−2)qn−1−pn−1(anqn−1+qn−2)p_n q_{n-1} - p_{n-1} q_n = (a_n p_{n-1} + p_{n-2}) q_{n-1} - p_{n-1} (a_n q_{n-1} + q_{n-2}). This equals −(pn−1qn−2−pn−2qn−1)-(p_{n-1} q_{n-2} - p_{n-2} q_{n-1}), so the sign flips at each step. This proves claim A.
  7. Claim B: x=xn+1pn+pn−1xn+1qn+qn−1x = \dfrac{x_{n+1} p_n + p_{n-1}}{x_{n+1} q_n + q_{n-1}} for n≥−1n \ge -1, with a positive denominator. We argue by induction on nn.
  8. For n=−1n = -1 the right side is x0⋅1+0x0⋅0+1=x0=x\dfrac{x_0 \cdot 1 + 0}{x_0 \cdot 0 + 1} = x_0 = x.
  9. Claim C: qn≥1q_n \ge 1 for n≥0n \ge 0, qn≥qn−1≥0q_n \ge q_{n-1} \ge 0 for n≥0n \ge 0, and qn≥nq_n \ge n for n≥1n \ge 1. Indeed q0=a0⋅0+1=1q_0 = a_0 \cdot 0 + 1 = 1 and q1=a1q0+q−1=a1≥1q_1 = a_1 q_0 + q_{-1} = a_1 \ge 1. For n≥2n \ge 2, qn=anqn−1+qn−2≥qn−1+1q_n = a_n q_{n-1} + q_{n-2} \ge q_{n-1} + 1, using an≥1a_n \ge 1 and qn−2≥1q_{n-2} \ge 1.
  10. In claim B the denominators are positive: xn+1>0x_{n+1} > 0, qn≥1q_n \ge 1 and qn−1≥0q_{n-1} \ge 0 for n≥0n \ge 0.
  11. Induction step for claim B. Assume it for n−1n - 1, where n≥0n \ge 0: x=xnpn−1+pn−2xnqn−1+qn−2x = \dfrac{x_n p_{n-1} + p_{n-2}}{x_n q_{n-1} + q_{n-2}}. Substitute xn=an+1/xn+1x_n = a_n + 1/x_{n+1} and multiply the numerator and the denominator by xn+1>0x_{n+1} > 0.
  12. The numerator becomes xn+1(anpn−1+pn−2)+pn−1=xn+1pn+pn−1x_{n+1}(a_n p_{n-1} + p_{n-2}) + p_{n-1} = x_{n+1} p_n + p_{n-1}. In the same way the denominator becomes xn+1qn+qn−1x_{n+1} q_n + q_{n-1}. This proves claim B.
  13. Let n≥0n \ge 0. By claim B, x−pnqn=qnpn−1−pnqn−1qn(xn+1qn+qn−1)x - \dfrac{p_n}{q_n} = \dfrac{q_n p_{n-1} - p_n q_{n-1}}{q_n (x_{n+1} q_n + q_{n-1})}, after putting both fractions over a common denominator.
  14. By claim A, the numerator in step 13 is −(−1)n+1=(−1)n-(-1)^{n+1} = (-1)^n. So ∣x−pnqn∣=1qn(xn+1qn+qn−1)\abs{x - \dfrac{p_n}{q_n}} = \dfrac{1}{q_n (x_{n+1} q_n + q_{n-1})}.
  15. By step 3, xn+1>an+1x_{n+1} > a_{n+1}. Since qn≥1q_n \ge 1, we get xn+1qn+qn−1>an+1qn+qn−1=qn+1x_{n+1} q_n + q_{n-1} > a_{n+1} q_n + q_{n-1} = q_{n+1}.
  16. By steps 14 and 15, ∣x−pn/qn∣<1qnqn+1\abs{x - p_n/q_n} < \dfrac{1}{q_n q_{n+1}}.
  17. By claim C, qn+1≥qn≥1q_{n+1} \ge q_n \ge 1, so 1qnqn+1≤1qn2\dfrac{1}{q_n q_{n+1}} \le \dfrac{1}{q_n^2}.
  18. By claim C, qn≥nq_n \ge n for n≥1n \ge 1, so ∣x−pn/qn∣<1/n2\abs{x - p_n/q_n} < 1/n^2 for n≥1n \ge 1. This tends to 00, so pn/qn→xp_n / q_n \to x as n→∞n \to \infty.

Idea

The number xx is the convergent formula with the last partial quotient replaced by the exact complete quotient xn+1x_{n+1}. The determinant identity pnqn−1−pn−1qn=±1p_n q_{n-1} - p_{n-1} q_n = \pm 1 then makes the error exactly 1/(qn(xn+1qn+qn−1))1/(q_n(x_{n+1} q_n + q_{n-1})). Since xn+1>an+1x_{n+1} > a_{n+1}, this is less than 1/(qnqn+1)1/(q_n q_{n+1}), and the denominators grow.

Reading path

To understand this page from the ground up, read these 46 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that the continued fraction of a real number is finite exactly when the number is rational, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that the reals are Archimedean from the completeness axiom.

  1. Construction of the reals from Cauchy sequences concept
  2. Continued fraction definition
  3. Element definition
  4. Euclidean algorithm concept
  5. Integers object
  6. Mathematical induction concept
  7. Ordered field definition
  8. Proposition concept
  9. Rational numbers object
  10. Real numbers object
  11. Set bounded above definition
  12. Simple continued fraction definition
  13. Set definition
  14. Ring of integers statement
  15. Archimedean ordered field definition
  16. Implication definition
  17. Predicate definition
  18. The reals form a field statement
  19. Supremum definition
  20. Continued fraction expansion of a real number definition
  21. Convergents of a continued fraction definition
  22. Ordered pair definition
  23. The rationals form a field statement
  24. Universal quantifier definition
  25. Completeness axiom statement
  26. Cartesian product definition
  27. Subset definition
  28. The rationals form an ordered field statement
  29. Binary relation definition
  30. Order on the reals definition
  31. Antisymmetric relation definition
  32. Reflexive relation definition
  33. Transitive relation definition
  34. Preorder definition
  35. Partial order definition
  36. Total order definition
  37. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  38. The reals form an ordered field statement
  39. Proof of the approximation property of the supremum proof
  40. Approximation property of the supremum statement
  41. Proof that the reals are Archimedean from the completeness axiom proof
  42. The reals are Archimedean statement
  43. Floor function definition
  44. Proof that the continued fraction of a real number is finite exactly when the number is rational proof
  45. The continued fraction of a rational number terminates statement
  46. Proof that the convergents of an irrational number converge to it proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Simple_continued_fraction, Infinite continued fractions and convergents
About this page
TagHXM3DCYJHW
URIm2://HXM3DCYJHW
Kindproof
WritingW0 stub
MSC11A55
ProvesConvergents converge to the number
UsesContinued fraction expansion of a real number, Convergents of a continued fraction, Floor function, The continued fraction of a rational number terminates, Mathematical induction
MethodsMathematical induction
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.