In number theory, Lochs's theorem concerns the rate of convergence of the continued fraction expansion of a typical real number. A proof of the theorem was published in 1964 by Gustav Lochs.
The theorem states that for almost all real numbers in the interval (0,1), the number of terms m of the number's continued fraction expansion that are required to determine the first n places of the number's decimal expansion behaves asymptotically as follows:
\limn\toinfty
m | = | |
n |
6ln(2)ln(10) | |
\pi2 |
≈ 0.97027014
As this limit is only slightly smaller than 1, this can be interpreted as saying that each additional term in the continued fraction representation of a "typical" real number increases the accuracy of the representation by approximately one decimal place. The decimal system is the last positional system for which each digit carries less information than one continued fraction quotient; going to base-11 (changing
ln(10)
ln(11)
The reciprocal of this limit,
\pi2 | |
6ln(2)ln(10) |
≈ 1.03064083
is twice the base-10 logarithm of Lévy's constant.
A prominent example of a number not exhibiting this behavior is the golden ratio—sometimes known as the "most irrational" number—whose continued fraction terms are all ones, the smallest possible in canonical form. On average it requires approximately 2.39 continued fraction terms per decimal digit.[1]
The proof assumes basic properties of continued fractions.Let
T:x\mapsto1/x\mod1
Let
\rho(t)=
1 | |
(1+t)ln2 |
Since the probability density function is bounded above and below, a set is negligible with respect to the Lebesgue measure iff to the Gauss distribution.
Lemma. .
Proof. Since , we have iffLet us consider the set of all that have . That is, where
[0;\N,...,\N,an>ecn,\N,...]
an>ecn
The union over sums to , which at the limit is zero.
Thus the set of such has Gauss measure zero.
Now, expand the term using basic continued fraction properties:The second is . The third term is . Both disappear after dividing by
n