Accuracy of Convergents of Continued Fraction Expansion of Irrational Number

Theorem
Let $x$ be an irrational number.

Let $(a_0, a_1, \ldots)$ be its continued fraction expansion.

Let $\left \langle {C_n}\right \rangle_{n \geq 0}$ be its sequence of convergents.

Let $p_0, p_1, p_2, \ldots$ and $q_0, q_1, q_2, \ldots$ be its numerators and denominators.

Then:
 * $\forall k \ge 1: \left\vert{x - \dfrac {p_{k + 1} } {q_{k + 1} } }\right\vert < \dfrac 1 {q_{k + 1} q_{k + 2} } \le \dfrac 1 {2 q_k q_{k + 1} } < \left\vert{x - \dfrac {p_k} {q_k} }\right\vert$

Thus:
 * The of the inequality gives an indication of how close each convergent gets to its true value.


 * The gives a bound that limits its accuracy.

Proof
The Continued Fraction Algorithm gives the following system of equations:

and

Now from the Continued Fraction Algorithm:
 * $x_{n + 1} = \left[{a_{n + 1}, a_{n + 2}, a_{n + 3}, \ldots}\right]$

So:
 * $a_{n + 1} < x_{n + 1} < a_{n + 1} + 1$

Therefore:
 * $\left\vert{x - \dfrac {p_n} {q_n} }\right\vert < \dfrac 1 {q_n \left({a_{n + 1} q_n + q_{n - 1} }\right)} = \dfrac 1 {q_n q_{n + 1} }$

This gives the of the inequality when $n = k + 1$.

We also have:
 * $\left\vert{x - \dfrac {p_n} {q_n} }\right\vert > \dfrac 1 {q_n \left({\left({a_{n + 1} + 1}\right) q_n + q_{n - 1} }\right)}$

This gives the of the inequality when $n = k$.

For the middle inequality, note that:
 * $q_{k + 2} = a_{k + 2} q_{k + 1} + q_k > q_k + q_k = 2 q_k$

So:
 * $\dfrac 1 {q_{k + 1} q_{k + 2} } \le \dfrac 1 {2 q_k q_{k + 1} }$

Also see

 * Accuracy of Convergents of Continued Fraction