A simple continued fraction writes a real number as , with integral and positive integral for . Repeatedly taking the integer part and inverting the remainder constructs the expansion.
For example, . Rational inputs terminate; irrational inputs give infinite expansions. Truncations are continued fraction convergents, whose numerator and denominator satisfy short recurrences and provide particularly effective best rational approximations. The expansion of a quadratic irrational number is eventually periodic, linking these approximations with Pell equations.
For the continued fraction convergent in lowest terms, is its convergent denominator. With and , it satisfies .
For , the first denominators are . Their growth measures the increasing cost of representing a better best rational approximation. The determinant identity proves that neighboring continued fraction convergents are reduced and tightly linked; in particular, their difference has absolute value .
The partial quotients of a simple continued fraction are its integer coefficients: and for . Repeatedly subtract the integer part and invert the positive remainder to obtain the next coefficient.
For , this gives , since . For , it gives . Truncation after gives a continued fraction convergent. A large next partial quotient makes the current convergent particularly accurate because the next reciprocal tail is small.
Fix an irrational number and let be its convergent denominators, with . Ostrowski numeration writes each nonnegative integer uniquely as a finite sum , subject to , for , and .
The digit restrictions remove the ambiguities caused by . For , all partial quotients equal one, so this becomes the representation by nonconsecutive Fibonacci numbers, with the duplicate initial weight removed. The numeration is useful for linking integer expansions to irrational rotations and Sturmian words.
Given consecutive continued fraction convergents and , the intermediate fractions for are semiconvergents, where is the next partial quotient. The endpoint is the next convergent. These fractions matter in best rational approximation when a denominator bound cuts between consecutive convergents.
For a quadratic irrational , write its complete quotient as . The recurrence , , computes its continued fraction. For , the successive pairs after the initial quotient are , and then the cycle repeats. They give the displayed period of length six.
The finite negative continued fraction is
For , it describes a negative-framed chain of unknots: the diagonal framings are and adjacent linking numbers are one. Repeated slam-dunk moves give rational surgery coefficient . The corresponding chain matrix is negative definite. To check this, the successive determinants of its negative have recurrence , starting with , ; they are positive and increasing, so Sylvester's criterion applies.
A continued fraction with integer and positive integer for . Its partial numerators are all one. The continued fraction convergents have the standard two-term numerator and denominator recurrences.
The map on , with . Its digit gives the successive partial quotients of a continued fraction. This is distinct from the geometric Gauss map assigning surface normals.
On each branch with digit , the displayed extension of the Gauss continued-fraction map is invertible almost everywhere: and , with . Its invariant joint probability density function is . The branch Jacobian determinant is , which cancels the transformation of . Integrating out gives the Gauss measure density.
The inverse branch of the th iterate of the Gauss continued-fraction map on a fixed digit cylinder has the displayed form, with continued fraction convergents . Its derivative has absolute value . Since , the maximum-to-minimum derivative ratio is at most four. The density of the Gauss measure changes this ratio by at most a further factor two. The cylinders shrink to irrational points, so this uniform distortion bound and the Lebesgue density theorem prove ergodicity of the map.
The invariant measure for the Gauss continued-fraction map with density on . Inverse branches give transformed density , which telescopes to the same density.
For a simple continued fraction, the complete quotients satisfy , and whenever the denominator is nonzero. Thus .
Starting from , define
whenever is not an integer. This produces .
A simple continued fraction terminates exactly when its value is rational. For a reduced rational , each reciprocal step is one step of the Euclidean algorithm and replaces the denominator by a strictly smaller nonnegative remainder.
The th continued fraction convergent of is its truncation , written in lowest terms with positive denominator. The recurrences are and , initialized by and .
For , the convergents begin . For an infinite simple continued fraction, . Thus the successive convergent denominators quantify the improving accuracy rather than merely recording a symbolic truncation.
Between consecutive continued fraction convergents, intermediate convergents have the form for . The final value is the next convergent.
For nonsquare , write the complete quotients after the initial term as . They exceed one, while their algebraic conjugates lie between minus one and zero. Thus . Comparing coefficients in gives , and the last determinant has absolute value one. These small residues are useful candidates for smooth numbers in congruence-of-squares factorization.
A reduced fraction is a best approximation of the second kind to a real number if for every competing fraction with . It minimizes the error after multiplication by the denominator; this differs from best rational approximation of the first kind, which minimizes .
For the simple continued fraction of an irrational number, the continued fraction convergents with have this property. The initial convergent needs an exception when the fractional part of exceeds , since then is closer. For example, if , the initial convergent is beaten by . The next convergent is , and the subsequent continued fraction convergents have the usual best-approximation property.
A continued-fraction matrix packages the recurrences for continued fraction convergents into matrix multiplication. Put
If , with , , and , then
For the identity is immediate. Right multiplication by replaces the first column by times the old first column plus the old second column, proving the convergent recurrences by mathematical induction.
Each factor has determinant , so . Any common divisor of and must therefore divide . Thus each continued fraction convergent is a fraction with coprime numerator and denominator.
If , then appending a positive tail gives
Because each matrix is symmetric, reversing the partial quotients transposes their product. If the convergents of are , then the last two convergents of are
For positive , define , , , and
Then
and is the corresponding finite generalized continued fraction.
When and are positive integers, adjacent convergents satisfy
Even and odd convergents are monotone from opposite sides, their separation is , and . They therefore have a common limit , with
If every , then and . Binet's formula
shows that the convergents tend to and gives sharp scaled errors through .
The Lagrange theorem says that a real number has an eventually periodic simple continued fraction exactly when it is a quadratic irrational.
The simple continued fraction of a quadratic irrational is eventually periodic. For a nonsquare positive integer , the continued fraction of is periodic after its integer part.
A continued fraction is purely periodic when its repeating block begins at its first partial quotient:
Let , and let be its algebraic conjugate, the other fixed point of the Möbius transformation represented by . Then
The identity follows by transposing the continued-fraction matrix and substituting in its fixed-point equation.
Successive complete quotients repeat after two steps:
Rationalizing successive complete quotients gives
If are the convergents of , then
For the even convergents of ,
Since the second factor has norm one, every such convergent satisfies .

Ancestors (5)

  1. Diophantine approximation
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)