Here are some elementary results that are of fundamental importance in the further development of the analytic theory of continued fractions.
Partial numerators and denominators If one of the partial numerators is zero, the infinite continued fraction b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{a_i}{b_i} is really just a finite continued fraction with fractional terms, and therefore a
rational function of to and to . Such an object is of little interest from the point of view adopted in mathematical analysis, so it is usually assumed that all . There is no need to place this restriction on the partial denominators .
The determinant formula When the th convergent of a continued fraction x_n = b_0 + \underset{i=1}\overset{n}\operatorname{K} \frac{a_i}{b_i} is expressed as a simple fraction we can use the
determinant formula {{NumBlk|:|A_{n-1}B_n - A_nB_{n-1} = \left(-1\right)^na_1a_2\cdots a_n = \prod_{i=1}^n (-a_i)|}} to relate the numerators and denominators of successive convergents and to one another. The proof for this can be easily seen by
induction.
Base case Inductive step {{block indent|1= Assume that () holds for . Then we need to see the same relation holding true for . Substituting the value of and in () we obtain: \begin{align} &=b_n A_{n-1} B_{n-1} + a_n A_{n-1} B_{n-2} - b_n A_{n-1} B_{n-1} - a_n A_{n-2} B_{n-1} \\ &=a_n(A_{n-1}B_{n-2} - A_{n-2} B_{n-1}) \end{align} which is true because of our induction hypothesis. A_{n-1}B_n - A_nB_{n-1} = \left(-1\right)^na_1a_2\cdots a_n = \prod_{i=1}^n (-a_i) Specifically, if neither nor is zero () we can express the difference between the th and th convergents like this: x_{n-1} - x_n = \frac{A_{n-1}}{B_{n-1}} - \frac{A_n}{B_n} = \left(-1\right)^n \frac{a_1a_2\cdots a_n}{B_nB_{n-1}} = \frac{\prod_{i=1}^n (-a_i)}{B_nB_{n-1}}. }}
The equivalence transformation If {{math|{
ci} {
c1,
c2,
c3, ...}}} is any infinite sequence of non-zero
complex numbers we can prove, by induction, that b_0 + \cfrac{a_1}{b_1 + \cfrac{a_2}{b_2 + \cfrac{a_3}{b_3 + \cfrac{a_4}{b_4 + \ddots\,}}}} = b_0 + \cfrac{c_1a_1}{c_1b_1 + \cfrac{c_1c_2a_2}{c_2b_2 + \cfrac{c_2c_3a_3}{c_3b_3 + \cfrac{c_3c_4a_4}{c_4b_4 + \ddots\,}}}} where equality is understood as equivalence, which is to say that the successive convergents of the continued fraction on the left are exactly the same as the convergents of the fraction on the right. The equivalence transformation is perfectly general, but two particular cases deserve special mention. First, if none of the are zero, a sequence {{math|{
ci}}} can be chosen to make each partial numerator a 1: b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{a_i}{b_i} = b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{1}{c_i b_i} where , , , and in general . Second, if none of the partial denominators are zero we can use a similar procedure to choose another sequence {{math|{
di}}} to make each partial denominator a 1: b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{a_i}{b_i} = b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{d_i a_i}{1} where and otherwise . These two special cases of the equivalence transformation are enormously useful when the general
convergence problem is analyzed.
Notions of convergence As mentioned in the introduction, the continued fraction x = b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{a_i}{b_i} converges if the sequence of convergents {{math|{
xn}}} tends to a finite limit. This notion of convergence is very natural, but it is sometimes too restrictive. It is therefore useful to introduce the notion of general convergence of a continued fraction. Roughly speaking, this consists in replacing the \operatorname{K}_{i = n}^\infty \tfrac{a_i}{b_i} part of the fraction by , instead of by 0, to compute the convergents. The convergents thus obtained are called
modified convergents. We say that the continued fraction
converges generally if there exists a sequence \{w_n^*\} such that the sequence of modified convergents converges for all \{w_n\} sufficiently distinct from \{w_n^*\}. The sequence \{w_n^*\} is then called an
exceptional sequence for the continued fraction. See Chapter 2 of for a rigorous definition. There also exists a notion of
absolute convergence for continued fractions, which is based on the notion of absolute convergence of a series: a continued fraction is said to be
absolutely convergent when the series f = \sum_n \left( f_n - f_{n-1}\right), where f_n = \operatorname{K}_{i = 1}^n \tfrac{a_i}{b_i} are the convergents of the continued fraction,
converges absolutely. The
Śleszyński–Pringsheim theorem provides a sufficient condition for absolute convergence. Finally, a continued fraction of one or more complex variables is
uniformly convergent in an
open neighborhood when its convergents
converge uniformly on ; that is, when for every there exists such that for all , for all z \in \Omega,
Even and odd convergents It is sometimes necessary to separate a continued fraction into its even and odd parts. For example, if the continued fraction diverges by oscillation between two distinct limit points and , then the sequence {{math|{
x0,
x2,
x4, ...}}} must converge to one of these, and {{math|{
x1,
x3,
x5, ...}}} must converge to the other. In such a situation it may be convenient to express the original continued fraction as two different continued fractions, one of them converging to , and the other converging to . The formulas for the even and odd parts of a continued fraction can be written most compactly if the fraction has already been transformed so that all its partial denominators are unity. Specifically, if x = \underset{i=1}\overset{\infty}\operatorname{K} \frac{a_i}{1} is a continued fraction, then the even part and the odd part are given by x_\text{even} = \cfrac{a_1}{1+a_2-\cfrac{a_2a_3} {1+a_3+a_4-\cfrac{a_4a_5} {1+a_5+a_6-\cfrac{a_6a_7} {1+a_7+a_8-\ddots}}}} and x_\text{odd} = a_1 - \cfrac{a_1a_2}{1+a_2+a_3-\cfrac{a_3a_4} {1+a_4+a_5-\cfrac{a_5a_6} {1+a_6+a_7-\cfrac{a_7a_8} {1+a_8+a_9-\ddots}}}} respectively. More precisely, if the successive convergents of the continued fraction are {{math|{
x1,
x2,
x3, ...}}}, then the successive convergents of as written above are {{math|{
x2,
x4,
x6, ...}}}, and the successive convergents of are {{math|{
x1,
x3,
x5, ...}}}.
Conditions for irrationality If and are positive integers with for all sufficiently large , then x = b_0 + \underset{i=1}\overset{\infty}\operatorname{K} \frac{a_i}{b_i} converges to an irrational limit.
Fundamental recurrence formulas The partial numerators and denominators of the fraction's successive convergents are related by the
fundamental recurrence formulas: \begin{align} A_{-1}& = 1& B_{-1}& = 0\\ A_0& = b_0& B_0& = 1\\ A_{n+1}& = b_{n+1} A_n + a_{n+1} A_{n-1}& B_{n+1}& = b_{n+1} B_n + a_{n+1} B_{n-1} \end{align} The continued fraction's successive convergents are then given by x_n=\frac{A_n}{B_n}. These
recurrence relations are due to
John Wallis (1616–1703) and
Leonhard Euler (1707–1783). These recurrence relations are simply a different notation for the relations obtained by Pietro Antonio Cataldi (1548-1626). As an example, consider the simple continued fraction in canonical form that represents the
golden ratio: \varphi = 1 + \cfrac{1}{1 + \cfrac{1}{1 + \cfrac{1}{1 + \cfrac{1}{1 + \ddots\,}}}} Applying the fundamental recurrence formulas we find that the successive numerators are {{math|{1, 2, 3, 5, 8, 13, ...}}} and the successive denominators are {{math|{1, 1, 2, 3, 5, 8, ...}}}, the
Fibonacci numbers. Since all the partial numerators in this example are equal to one, the determinant formula assures us that the
absolute value of the difference between successive convergents approaches zero quite rapidly. == Linear fractional transformations ==