Complete quotient

From formulasearchengine
Jump to navigation Jump to search

In the metrical theory of regular continued fractions, the kth complete quotient ζk is obtained by ignoring the first k partial denominators ai. For example, if a regular continued fraction is given by

then the successive complete quotients ζk are given by

A recursive relationship

From the definition given above we can immediately deduce that

or, equivalently,

Complete quotients and the convergents of x

Denoting the successive convergents of the regular continued fraction x = [a0a1a2, …] by A0A1/B1A2/B2, … (as explained more fully in the article fundamental recurrence formulas), it can be shown that

for all k ≥ 0.

This result can be better understood by recalling that the successive convergents of an infinite regular continued fraction approach the value x in a sort of zig-zag pattern:

so that when k is even we have Ak/Bk < x < Ak+1/Bk+1, and when k is odd we have Ak+1/Bk+1 < x < Ak/Bk. In either case, the k + 1st complete quotient ζk+1 is the unique real number that expresses x in the form of a semiconvergent.

Complete quotients and equivalent real numbers

An equivalence relation defined by LFTs

Consider the set of linear fractional transformations (LFTs) defined by

where a, b, c, and d are integers, and ad − bc = ±1. Since this set of LFTs contains an identity element (0 + x)/1, and since it is closed under composition of functions, and every member of the set has an inverse in the set, these LFTs form a group (the group operation being composition of functions), GL(2,Z).

We can define an equivalence relation on the set of real numbers by means of this group of linear fractional transformations. We will say that two real numbers x and y are equivalent (written x ~ y) if

for some integers a, b, c, and d such that ad − bc = ±1.

Clearly this relation is symmetric, reflexive, and transitive, so it is an equivalence relation and it can be used to separate the real numbers into equivalence classes. All the rational numbers are equivalent, because each rational number is equivalent to zero. What can be said about the irrational numbers? Do they also fall into a single equivalence class?

A theorem about "equivalent" irrational numbers

Amazingly enough, two irrational numbers x and y are equivalent under this scheme if and only if the infinitely long "tails" in their expansions as regular continued fractions are exactly the same. More precisely, the following theorem can be proved.

Let x and y be two irrational (real) numbers, and let the kth complete quotient in the regular continued fraction expansions of x and y be denoted by ζk and ψk, respectively, Then x ~ y (under the equivalence defined in the preceding section) if and only if there are positive integers m and n such that ζm = ψn.

An example

The golden ratio φ is the irrational number with the very simplest possible expansion as a regular continued fraction: φ = [1; 1, 1, 1, …]. The theorem tells us first that if x is any real number whose expansion as a regular continued fraction contains the infinite string [1, 1, 1, 1, …], then there are integers a, b, c, and d (with ad − bc = ±1) such that

Conversely, if a, b, c, and d are integers (with ad − bc = ±1), then the regular continued fraction expansion of every real number y that can be expressed in the form

eventually reaches a "tail" that looks just like the regular continued fraction for φ.


  • {{#invoke:citation/CS1|citation

|CitationClass=book }}