Liouville number

Short description: Class of irrational numbers

In number theory, a Liouville number is a real number [math]\displaystyle{ x }[/math] with the property that, for every positive integer [math]\displaystyle{ n }[/math], there exists a pair of integers [math]\displaystyle{ (p,q) }[/math] with [math]\displaystyle{ q\gt 1 }[/math] such that [math]\displaystyle{ 0 \lt \left|x-\frac{p}{q}\right| \lt \frac{1}{q^{n}} . }[/math]

Liouville numbers are "almost rational", and can thus be approximated "quite closely" by sequences of rational numbers. Precisely, these are transcendental numbers that can be more closely approximated by rational numbers than any algebraic irrational number can be. In 1844, Joseph Liouville showed that all Liouville numbers are transcendental, thus establishing the existence of transcendental numbers for the first time. It is known that π and e are not Liouville numbers.

The existence of Liouville numbers (Liouville's constant)

Liouville numbers can be shown to exist by an explicit construction.

For any integer [math]\displaystyle{ b\ge 2 }[/math] and any sequence of integers [math]\displaystyle{ (a_1,a_2,\dots) }[/math] such that [math]\displaystyle{ a_k\in\{0,1,2,\dots,b-1\} }[/math] for all [math]\displaystyle{ k }[/math] and [math]\displaystyle{ a_k\ne 0 }[/math] for infinitely many [math]\displaystyle{ k }[/math], define the number [math]\displaystyle{ x = \sum_{k=1}^\infty \frac{a_k}{b^{k!}}. }[/math]

In the special case when [math]\displaystyle{ b=10 }[/math], and [math]\displaystyle{ a_k=1 }[/math] for all [math]\displaystyle{ k }[/math], the resulting number [math]\displaystyle{ x }[/math] is called Liouville's constant:

L = 0.11000100000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001...

It follows from the definition of [math]\displaystyle{ x }[/math] that its base-[math]\displaystyle{ b }[/math] representation is

[math]\displaystyle{ x = \left(0.a_{1}a_{2}000a_{3}00000000000000000a_{4}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a_{5}\ldots\right)_b\; }[/math]

where the [math]\displaystyle{ n }[/math]th term is in the [math]\displaystyle{ (n!) }[/math]th place.

Since this base-[math]\displaystyle{ b }[/math] representation is non-repeating it follows that [math]\displaystyle{ x }[/math] is not a rational number. Therefore, for any rational number [math]\displaystyle{ p/q }[/math], [math]\displaystyle{ |x-p/q|\gt 0 }[/math].

Now, for any integer [math]\displaystyle{ n\ge 1 }[/math], [math]\displaystyle{ p_n }[/math] and [math]\displaystyle{ q_n }[/math] can be defined as follows: [math]\displaystyle{ q_n = b^{n!}\,; \quad p_n = q_n \sum_{k=1}^n \frac{a_k}{b^{k!}} = \sum_{k=1}^n {a_k}{b^{n!-k!}} \; . }[/math]

Then, [math]\displaystyle{ \begin{align} 0 \lt \left|x - \frac{p_n}{q_n}\right| & = \left|x - \frac{q_n\sum_{k=1}^n \frac{a_k}{b^{k!}}}{q_n}\right| = \left|x - \sum_{k=1}^n \frac{a_k}{b^{k!}}\right| = \left|\sum_{k=1}^\infty \frac{a_k}{b^{k!}} - \sum_{k=1}^n \frac{a_k}{b^{k!}}\right| = \left|\left(\sum_{k=1}^n \frac{a_k}{b^{k!}} + \sum_{k=n+1}^\infty \frac{a_k}{b^{k!}}\right) - \sum_{k=1}^n \frac{a_k}{b^{k!}}\right| = \sum_{k=n+1}^\infty \frac{a_k}{b^{k!}} \\[6pt] & \le \sum_{k=n+1}^\infty \frac{b-1}{b^{k!}} \lt \sum_{k=(n+1)!}^\infty \frac{b-1}{b^k} = \frac{b-1}{b^{(n+1)!}} + \frac{b-1}{b^{(n+1)!+1}} + \frac{b-1}{b^{(n+1)!+2}} + ... = \frac{b-1}{b^{(n+1)!}b^{0}} + \frac{b-1}{b^{(n+1)!}b^{1}} + \frac{b-1}{b^{(n+1)!}b^{2}} + ... = \frac{b-1}{b^{(n+1)!}} \sum_{k=0}^\infty \frac{1}{b^k} \\[6pt] & = \frac{b-1}{b^{(n+1)!}}\cdot\frac{b}{b-1} = \frac{b}{b^{(n+1)!}} \le \frac{b^{n!}}{b^{(n+1)!}} = \frac{1}{b^{(n+1)! - n!}} = \frac{1}{b^{(n+1)n! - n!}} = \frac{1}{b^{n(n!) + n! - n!}} = \frac{1}{b^{(n!)n}} = \frac{1}{{q_n}^n} \end{align} }[/math]

Therefore, any such [math]\displaystyle{ x }[/math] is a Liouville number.

Notes on the proof

1. The inequality [math]\displaystyle{ \sum_{k=n+1}^\infty \frac{a_k}{b^{k!}} \le \sum_{k=n+1}^\infty \frac{b-1}{b^{k!}} }[/math] follows since a_k ∈ {0, 1, 2, ..., b−1} for all k, so at most a_k = b−1. The largest possible sum would occur if the sequence of integers (a₁, a₂, ...) were (b−1, b−1, ...), i.e. a_k = b−1, for all k. [math]\displaystyle{ \sum_{k=n+1}^\infty \frac{a_k}{b^{k!}} }[/math] will thus be less than or equal to this largest possible sum.
2. The strong inequality [math]\displaystyle{ \begin{align} \sum_{k=n+1}^\infty \frac{b-1}{b^{k!}} \lt \sum_{k=(n+1)!}^\infty \frac{b-1}{b^k} \end{align} }[/math] follows from the motivation to eliminate the series by way of reducing it to a series for which a formula is known. In the proof so far, the purpose for introducing the inequality in #1 comes from intuition that [math]\displaystyle{ \sum_{k=0}^\infty \frac{1}{b^{k}} = \frac{b}{b-1} }[/math] (the geometric series formula); therefore, if an inequality can be found from [math]\displaystyle{ \sum_{k=n+1}^\infty \frac{a_k}{b^{k!}} }[/math] that introduces a series with (b−1) in the numerator, and if the denominator term can be further reduced from [math]\displaystyle{ b^{k!} }[/math]to [math]\displaystyle{ b^{k} }[/math], as well as shifting the series indices from 0 to [math]\displaystyle{ \infty }[/math], then both series and (b−1) terms will be eliminated, getting closer to a fraction of the form [math]\displaystyle{ \frac{1}{b^{\text{exponent}\times n}} }[/math], which is the end-goal of the proof. This motivation is increased here by selecting now from the sum [math]\displaystyle{ \sum_{k=n+1}^\infty \frac{b-1}{b^{k!}} }[/math] a partial sum. Observe that, for any term in [math]\displaystyle{ \sum_{k=n+1}^\infty \frac{b-1}{b^{k!}} }[/math], since b ≥ 2, then [math]\displaystyle{ \frac{b-1}{b^{k!}} \lt \frac{b-1}{b^{k}} }[/math], for all k (except for when n=1). Therefore, [math]\displaystyle{ \begin{align} \sum_{k=n+1}^\infty \frac{b-1}{b^{k!}} \lt \sum_{k=n+1}^\infty \frac{b-1}{b^k} \end{align} }[/math] (since, even if n=1, all subsequent terms are smaller). In order to manipulate the indices so that k starts at 0, partial sum will be selected from within [math]\displaystyle{ \sum_{k=n+1}^\infty \frac{b-1}{b^k} }[/math] (also less than the total value since it's a partial sum from a series whose terms are all positive). Choose the partial sum formed by starting at k = (n+1)! which follows from the motivation to write a new series with k=0, namely by noticing that [math]\displaystyle{ b^{(n+1)!} = b^{(n+1)!}b^0 }[/math].
3. For the final inequality [math]\displaystyle{ \frac{b}{b^{(n+1)!}} \le \frac{b^{n!}}{b^{(n+1)!}} }[/math], this particular inequality has been chosen (true because b ≥ 2, where equality follows if and only if n=1) because of the wish to manipulate [math]\displaystyle{ \frac{b}{b^{(n+1)!}} }[/math] into something of the form [math]\displaystyle{ \frac{1}{b^{\text{exponent}\times n}} }[/math]. This particular inequality allows the elimination of (n+1)! and the numerator, using the property that (n+1)! – n! = (n!)n, thus putting the denominator in ideal form for the substitution [math]\displaystyle{ q_n = b^{n!} }[/math].

Irrationality

Here the proof will show that the number [math]\displaystyle{ ~ x = c / d ~, }[/math] where c and d are integers and [math]\displaystyle{ ~ d \gt 0 ~, }[/math] cannot satisfy the inequalities that define a Liouville number. Since every rational number can be represented as such[math]\displaystyle{ ~ c / d ~, }[/math] the proof will show that no Liouville number can be rational.

More specifically, this proof shows that for any positive integer n large enough that [math]\displaystyle{ ~ 2^{n - 1} \gt d \gt 0~ }[/math] [equivalently, for any positive integer [math]\displaystyle{ ~ n \gt 1 + \log_2(d) ~ }[/math])], no pair of integers [math]\displaystyle{ ~(\,p,\,q\,)~ }[/math] exists that simultaneously satisfies the pair of bracketing inequalities

[math]\displaystyle{ 0 \lt \left|x - \frac{\,p\,}{q}\right| \lt \frac{1}{\;q^n\,}~. }[/math]

If the claim is true, then the desired conclusion follows.

Let p and q be any integers with [math]\displaystyle{ ~q \gt 1~. }[/math] Then,

[math]\displaystyle{ \left| x - \frac{\,p\,}{q} \right| = \left| \frac{\,c\,}{d} - \frac{\,p\,}{q} \right| = \frac{\,|c\,q - d\,p|\,}{ d\,q } }[/math]

If [math]\displaystyle{ \left| c\,q - d\,p \right| = 0~, }[/math] then

[math]\displaystyle{ \left| x - \frac{\,p\,}{q}\right|= \frac{\,|c\,q - d\,p|\,}{ d\,q } = 0 ~, }[/math]

meaning that such pair of integers [math]\displaystyle{ ~(\,p,\,q\,)~ }[/math] would violate the first inequality in the definition of a Liouville number, irrespective of any choice of n .

If, on the other hand, since [math]\displaystyle{ ~\left| c\,q - d\,p \right| \gt 0 ~, }[/math] then, since [math]\displaystyle{ c\,q - d\,p }[/math] is an integer, we can assert the sharper inequality [math]\displaystyle{ \left| c\,q - d\,p \right| \ge 1 ~. }[/math] From this it follows that

[math]\displaystyle{ \left| x - \frac{\,p\,}{q}\right|= \frac{\,| c\,q - d\,p |\,}{d\,q} \ge \frac{1}{\,d\,q\,} }[/math]

Now for any integer [math]\displaystyle{ ~n \gt 1 + \log_2(d)~, }[/math] the last inequality above implies

[math]\displaystyle{ \left| x - \frac{\,p\,}{q} \right| \ge \frac{1}{\,d\,q\,} \gt \frac{1}{\,2^{n-1}q\,} \ge \frac{1}{\;q^n\,} ~. }[/math]

Therefore, in the case [math]\displaystyle{ ~ \left| c\,q - d\,p \right| \gt 0 ~ }[/math] such pair of integers [math]\displaystyle{ ~(\,p,\,q\,)~ }[/math] would violate the second inequality in the definition of a Liouville number, for some positive integer n.

Therefore, to conclude, there is no pair of integers [math]\displaystyle{ ~(\,p,\,q\,)~, }[/math] with [math]\displaystyle{ ~ q \gt 1 ~, }[/math] that would qualify such an [math]\displaystyle{ ~ x = c / d ~, }[/math] as a Liouville number.

Hence a Liouville number, if it exists, cannot be rational.

(The section on Liouville's constant proves that Liouville numbers exist by exhibiting the construction of one. The proof given in this section implies that this number must be irrational.)

Uncountability

Consider, for example, the number

3.1400010000000000000000050000....

3.14(3 zeros)1(17 zeros)5(95 zeros)9(599 zeros)2(4319 zeros)6...

where the digits are zero except in positions n! where the digit equals the nth digit following the decimal point in the decimal expansion of π.

As shown in the section on the existence of Liouville numbers, this number, as well as any other non-terminating decimal with its non-zero digits similarly situated, satisfies the definition of a Liouville number. Since the set of all sequences of non-null digits has the cardinality of the continuum, the same thing occurs with the set of all Liouville numbers.

Moreover, the Liouville numbers form a dense subset of the set of real numbers.

Liouville numbers and measure

From the point of view of measure theory, the set of all Liouville numbers [math]\displaystyle{ L }[/math] is small. More precisely, its Lebesgue measure, [math]\displaystyle{ \lambda(L) }[/math], is zero. The proof given follows some ideas by John C. Oxtoby.

For positive integers [math]\displaystyle{ n\gt 2 }[/math] and [math]\displaystyle{ q\geq2 }[/math] set:

[math]\displaystyle{ V_{n,q}=\bigcup\limits_{p=-\infty}^\infty \left(\frac{p}{q}-\frac{1}{q^n},\frac{p}{q}+\frac{1}{q^n}\right) }[/math]

then

[math]\displaystyle{ L\subseteq \bigcup_{q=2}^\infty V_{n,q}. }[/math]

Observe that for each positive integer [math]\displaystyle{ n\geq2 }[/math] and [math]\displaystyle{ m\geq1 }[/math], then

[math]\displaystyle{ L\cap (-m,m)\subseteq \bigcup\limits_{q=2}^\infty V_{n,q}\cap(-m,m)\subseteq \bigcup\limits_{q=2}^\infty\bigcup\limits_{p=-mq}^{mq} \left( \frac{p}{q}-\frac{1}{q^n},\frac{p}{q}+\frac{1}{q^n}\right). }[/math]

Since

[math]\displaystyle{ \left|\left(\frac{p}{q}+\frac{1}{q^n}\right)-\left(\frac{p}{q}-\frac{1}{q^n}\right)\right|=\frac{2}{q^n} }[/math]

and [math]\displaystyle{ n\gt 2 }[/math] then

[math]\displaystyle{ \begin{align} \mu(L\cap (-m,\, m)) & \leq\sum_{q=2}^\infty\sum_{p=-mq}^{mq}\frac{2}{q^n} = \sum_{q=2}^\infty \frac{2(2mq+1)}{q^n} \\[6pt] & \leq (4m+1)\sum_{q=2}^\infty\frac{1}{q^{n-1}} \leq (4m+1) \int^\infty_1 \frac{dq}{q^{n-1}}\leq\frac{4m+1}{n-2}. \end{align} }[/math]

Now

[math]\displaystyle{ \lim_{n\to\infty}\frac{4m+1}{n-2}=0 }[/math]

and it follows that for each positive integer [math]\displaystyle{ m }[/math], [math]\displaystyle{ L\cap (-m,m) }[/math] has Lebesgue measure zero. Consequently, so has [math]\displaystyle{ L }[/math].

In contrast, the Lebesgue measure of the set of all real transcendental numbers is infinite (since the set of algebraic numbers is a null set).

One could show even more - the set of Liouville numbers has Hausdorff dimension 0 (a property strictly stronger than having Lebesgue measure 0).

Structure of the set of Liouville numbers

For each positive integer n, set

[math]\displaystyle{ ~ U_n = \bigcup\limits_{q=2}^\infty ~ \bigcup\limits_{p=-\infty}^\infty ~ \left\{ x \in \mathbb R : 0 \lt \left |x- \frac{p}{\,q\,} \right |\lt \frac{1}{\;q^n\,}\right\} = \bigcup\limits_{q=2}^\infty ~ \bigcup\limits_{p=-\infty}^\infty ~ \left(\frac{p}{q}-\frac{1}{q^n}~,~\frac{p}{\,q\,} + \frac{1}{\;q^n\,}\right) \setminus \left\{\frac{p}{\,q\,}\right\} ~ }[/math]

The set of all Liouville numbers can thus be written as

[math]\displaystyle{ ~ L ~=~ \bigcap\limits_{n=1}^\infty U_n ~=~ \bigcap\limits_{n \in \mathbb{N}_1} ~ \bigcup\limits_{ q \geqslant 2} ~ \bigcup \limits_{ p \in \mathbb{Z} }\,\left(\,\left(\,\frac{\,p\,}{q} - \frac{1}{\;q^n\,}~,~ \frac{\,p\,}{q} + \frac{1}{\;q^n\,} \,\right) \setminus \left\{\,\frac{\,p\,}{q}\,\right\} \,\right) ~. }[/math]

Each [math]\displaystyle{ ~ U_n ~ }[/math] is an open set; as its closure contains all rationals (the [math]\displaystyle{ ~p / q~ }[/math] from each punctured interval), it is also a dense subset of real line. Since it is the intersection of countably many such open dense sets, L is comeagre, that is to say, it is a dense G_δ set.

Irrationality measure

The Liouville–Roth irrationality measure (irrationality exponent, approximation exponent, or Liouville–Roth constant) of a real number [math]\displaystyle{ x }[/math] is a measure of how "closely" it can be approximated by rationals. Generalizing the definition of Liouville numbers, instead of allowing any [math]\displaystyle{ n }[/math] in the power of [math]\displaystyle{ q }[/math], we find the largest possible value for [math]\displaystyle{ \mu }[/math] such that [math]\displaystyle{ 0\lt \left| x- \frac{p}{q} \right| \lt \frac{1}{q^\mu} }[/math] is satisfied by an infinite number of coprime integer pairs [math]\displaystyle{ (p,q) }[/math] with [math]\displaystyle{ q\gt 0 }[/math]. This maximum value of [math]\displaystyle{ \mu }[/math] is defined to be the irrationality measure of [math]\displaystyle{ x }[/math]. For any value [math]\displaystyle{ \mu }[/math] less than this upper bound, the infinite set of all rationals [math]\displaystyle{ p/q }[/math] satisfying the above inequality yield an approximation of [math]\displaystyle{ x }[/math]. Conversely, if [math]\displaystyle{ \mu }[/math] is greater than the upper bound, then there are at most finitely many [math]\displaystyle{ (p,q) }[/math] with [math]\displaystyle{ q\gt 0 }[/math] that satisfy the inequality; thus, the opposite inequality holds for all larger values of [math]\displaystyle{ q }[/math]. In other words, given the irrationality measure [math]\displaystyle{ \mu }[/math] of a real number [math]\displaystyle{ x }[/math], whenever a rational approximation [math]\displaystyle{ x\approx p/q }[/math], [math]\displaystyle{ p,q\in\N }[/math] yields [math]\displaystyle{ n+1 }[/math] exact decimal digits, then

[math]\displaystyle{ \frac{1}{10^n} \ge \left| x- \frac{p}{q} \right| \ge \frac{1}{q^{\mu+\varepsilon}} }[/math]

for any [math]\displaystyle{ \varepsilon \gt 0 }[/math], except for at most a finite number of "lucky" pairs [math]\displaystyle{ (p,q) }[/math].

As a consequence of Dirichlet's approximation theorem every irrational number has irrationality measure at least 2. On the other hand, an application of Borel-Cantelli lemma shows that almost all numbers have an irrationality measure equal to 2.

Below is a table of known upper and lower bounds for the irrationality measures of certain numbers.

Number [math]\displaystyle{ x }[/math]	Irrationality measure [math]\displaystyle{ \mu(x) }[/math]		Simple continued fraction [math]\displaystyle{ [a_0;a_1,a_2,...] }[/math]	Notes
	Lower bound	Upper bound
Rational number [math]\displaystyle{ \frac{p}q }[/math] where [math]\displaystyle{ p,q \in \mathbb{Z} }[/math] and [math]\displaystyle{ q\neq0 }[/math]	1		Finite continued fraction.	Every rational number [math]\displaystyle{ \frac{p}q }[/math] has an irrationality measure of exactly 1. Examples include 1, 2 and 0.5
Irrational algebraic number [math]\displaystyle{ a }[/math]	2		Infinite continued fraction. Periodic if quadratic irrational.	By the Thue–Siegel–Roth theorem the irrationality measure of any irrational algebraic number is exactly 2. Examples include square roots like [math]\displaystyle{ \sqrt{2}, \sqrt{3} }[/math] and [math]\displaystyle{ \sqrt{5} }[/math] and the golden ratio [math]\displaystyle{ \varphi }[/math].
[math]\displaystyle{ e^{2/k}, k\in\mathbb{Z}^+ }[/math]	2		Infinite continued fraction.	If the elements [math]\displaystyle{ a_n }[/math] of the continued fraction expansion of an irrational number [math]\displaystyle{ x }[/math] satisfy [math]\displaystyle{ a_n\lt cn+d }[/math] for positive [math]\displaystyle{ c }[/math] and [math]\displaystyle{ d }[/math], the irrationality measure [math]\displaystyle{ \mu(x)=2 }[/math]. Examples include [math]\displaystyle{ e }[/math] or [math]\displaystyle{ I_0(1)/I_1(1) }[/math] where the continued fractions behave predictably: [math]\displaystyle{ e=[2;1,2,1,1,4,1,1,6,1,1,...] }[/math] and [math]\displaystyle{ I_0(1)/I_1(1)=[2;4,6,8,10,12,14,16,18,20,22...] }[/math]
[math]\displaystyle{ \tanh\left(\frac{1}{k}\right), k\in\mathbb{Z}^+ }[/math]	2
[math]\displaystyle{ \tan\left(\frac{1}{k}\right), k\in\mathbb{Z}^+ }[/math]	2
[math]\displaystyle{ h_q(1) }[/math]	2	2.49846...	Infinite continued fraction.	[math]\displaystyle{ q\in\{\pm2,\pm3,\pm4,...\} }[/math], [math]\displaystyle{ h_q(1) }[/math] is a [math]\displaystyle{ q }[/math]-harmonic series.
[math]\displaystyle{ \text{ln}_q(2) }[/math]	2	2.93832...		[math]\displaystyle{ q\in\left\{\pm\frac{1}{2},\pm\frac{1}{3},\pm\frac{1}{4},...\right\} }[/math], [math]\displaystyle{ \ln_q(x) }[/math] is a [math]\displaystyle{ q }[/math]-logarithm.
[math]\displaystyle{ \ln_q(1-z) }[/math]	2	3.76338...		[math]\displaystyle{ q\in\left\{\pm\frac{1}{2},\pm\frac{1}{3},\pm\frac{1}{4},...\right\} }[/math], [math]\displaystyle{ 0\lt |z|\leq1 }[/math]
[math]\displaystyle{ \ln(2) }[/math]	2	3.57455...	[math]\displaystyle{ [0;1,2,3,1,6,3,1,1,2,1,...] }[/math]
[math]\displaystyle{ \ln(3) }[/math]	2	5.11620...	[math]\displaystyle{ [1;10,7,9,2,2,1,3,1,1,32,...] }[/math]
[math]\displaystyle{ \zeta(3) }[/math]	2	5.51389...	[math]\displaystyle{ [1;4,1,18,1,1,1,4,1,9,9,...] }[/math]
[math]\displaystyle{ \pi^2 }[/math] and [math]\displaystyle{ \zeta(2) }[/math]	2	5.09541...	[math]\displaystyle{ [9;1,6,1,2,47,1,8,1,1,2,...] }[/math] and [math]\displaystyle{ [1;1,1,1,4,2,4,7,1,4,2,...] }[/math]	[math]\displaystyle{ \pi^2 }[/math] and [math]\displaystyle{ \zeta(2)=\pi^2/6 }[/math] are linearly dependent over [math]\displaystyle{ \mathbb{Q} }[/math].
[math]\displaystyle{ \pi }[/math]	2	7.10320...	[math]\displaystyle{ [3;7,15,1,292,1,1,1,2,1,3,...] }[/math]	It has been proven that if the Flint Hills series [math]\displaystyle{ \displaystyle\sum^\infty_{n=1}\frac{\csc^2 n}{n^3} }[/math] (where n is in radians) converges, then [math]\displaystyle{ \pi }[/math]'s irrationality measure is at most 2.5; and that if it diverges, the irrationality measure is at least 2.5.
[math]\displaystyle{ \arctan(1/3) }[/math]	2	6.09675...	[math]\displaystyle{ [0;3,9,3,1,5,1,6,3,1,2,...] }[/math]	Of the form [math]\displaystyle{ \arctan(1/k) }[/math]
[math]\displaystyle{ \arctan(1/5) }[/math]	2	4.788...	[math]\displaystyle{ [0;5,15,6,3,5,3,4,2,65,1,...] }[/math]
[math]\displaystyle{ \arctan(1/6) }[/math]	2	6.24...	[math]\displaystyle{ [0;6,18,7,1,1,4,5,62,2,1,...] }[/math]
[math]\displaystyle{ \arctan(1/7) }[/math]	2	4.076...	[math]\displaystyle{ [0;7,21,8,1,3,1,8,2,6,1,...] }[/math]
[math]\displaystyle{ \arctan(1/10) }[/math]	2	4.595...	[math]\displaystyle{ [0;10,30,12,1,1,7,3,2,1,3,...] }[/math]
[math]\displaystyle{ \arctan(1/4) }[/math]	2	5.793...	[math]\displaystyle{ [0;4,12,5,12,1,1,1,3,2,1,...] }[/math]	Of the form [math]\displaystyle{ \arctan(1/2^k) }[/math]
[math]\displaystyle{ \arctan(1/8) }[/math]	2	3.673...	[math]\displaystyle{ [0;8,24,10,24,1,77,1,1,5,1,...] }[/math]
[math]\displaystyle{ \arctan(1/16) }[/math]	2	3.068...	[math]\displaystyle{ [0;16,48,20,49,1,4,1,3,1,1,...] }[/math]
[math]\displaystyle{ \pi/\sqrt{3} }[/math]	2	4.60105...	[math]\displaystyle{ [1;1,4,2,1,2,3,7,3,3,30,...] }[/math]	Of the form [math]\displaystyle{ \sqrt{2k-1}\arctan\left({\frac{\sqrt{2k-1}}{k-1}}\right) }[/math]
[math]\displaystyle{ \sqrt{7}\arctan({\sqrt{7}/3}) }[/math]	2	3.94704...	[math]\displaystyle{ [1;1,10,2,1,1,2,3,6,1,3,...] }[/math]
[math]\displaystyle{ \sqrt{11}\arctan({\sqrt{11}/5}) }[/math]	2	3.76069...	[math]\displaystyle{ [1;1,16,2,1,1,3,1,6,1,24,...] }[/math]
[math]\displaystyle{ \sqrt{15}\arctan({\sqrt{15}/7}) }[/math]	2	3.66666...	[math]\displaystyle{ [1;1,22,2,1,1,5,2,3,10,2,...] }[/math]
[math]\displaystyle{ \sqrt{19}\arctan({\sqrt{19}/9}) }[/math]	2	3.60809...	[math]\displaystyle{ [1;1,28,2,1,1,6,1,72,2,1,...] }[/math]
[math]\displaystyle{ \sqrt{23}\arctan({\sqrt{23}/11}) }[/math]	2	3.56730...	[math]\displaystyle{ [1;1,34,2,1,1,8,1,1,5,2,...] }[/math]
[math]\displaystyle{ \sqrt{7}\ln\left(\frac{4+\sqrt{7}}{3}\right) }[/math]	2	6.64610...	[math]\displaystyle{ [2;9,1,1,2,2,8,2,1,3,2,...] }[/math]	Of the form [math]\displaystyle{ \sqrt{2k+1}\ln\left(\frac{\sqrt{2k+1}+1}{\sqrt{2k+1}-1}\right) }[/math]
[math]\displaystyle{ \sqrt{11}\ln\left(\frac{6+\sqrt{11}}{5}\right) }[/math]	2	5.82337...	[math]\displaystyle{ [2;15,1,1,2,3,1,2,10,1,4,...] }[/math]
[math]\displaystyle{ \sqrt{13}\ln\left(\frac{7+\sqrt{13}}{6}\right) }[/math]	2	3.51433...	[math]\displaystyle{ [2;18,1,1,2,4,2,5,33,6,2,...] }[/math]
[math]\displaystyle{ \sqrt{15}\ln\left(\frac{8+\sqrt{15}}{7}\right) }[/math]	2	5.45248...	[math]\displaystyle{ [2;21,1,1,2,5,4,3,2,1,1,...] }[/math]
[math]\displaystyle{ \sqrt{17}\ln\left(\frac{9+\sqrt{17}}{8}\right) }[/math]	2	3.47834...	[math]\displaystyle{ [2;24,1,1,2,6,92,3,3,1,16,...] }[/math]
[math]\displaystyle{ \sqrt{19}\ln\left(\frac{10+\sqrt{19}}{9}\right) }[/math]	2	5.23162...	[math]\displaystyle{ [2;27,1,1,2,6,1,3,1,2,1,...] }[/math]
[math]\displaystyle{ \sqrt{21}\ln\left(\frac{11+\sqrt{21}}{10}\right) }[/math]	2	3.45356...	[math]\displaystyle{ [2;30,1,1,2,7,1,1,3,4,63,...] }[/math]
[math]\displaystyle{ \sqrt{23}\ln\left(\frac{12+\sqrt{23}}{11}\right) }[/math]	2	5.08120...	[math]\displaystyle{ [2;33,1,1,2,8,2,2,1,9,4,...] }[/math]
[math]\displaystyle{ 5\ln(3/2) }[/math]	2	3.43506...	[math]\displaystyle{ [2;36,1,1,2,9,8,5,1,38,1,...] }[/math]
[math]\displaystyle{ \frac{\pi}{\sqrt{3}}\pm\ln(3) }[/math]	2	4.5586...	[math]\displaystyle{ [2;1,10,2,2,1,1,17,1,4,1,...] }[/math] and [math]\displaystyle{ [0;1,2,1,1,22,14,3,1,1,1,...] }[/math]
[math]\displaystyle{ \sqrt{3}\ln(2+\sqrt{3})\pm\frac{\pi}{\sqrt{3}} }[/math]	2	6.1382...	[math]\displaystyle{ [4;10,1,1,5,7,2,2,1,31,2,...] }[/math] and [math]\displaystyle{ [0;2,7,7,1,1,1,3,9,9,1,...] }[/math]
[math]\displaystyle{ \ln(5)+\frac{\pi}2 }[/math]	2	59.976...	[math]\displaystyle{ [3;5,1,1,4,1,2,19,1,3,...] }[/math]
[math]\displaystyle{ T_2(1/b), b\geq2 }[/math]	2	4	Infinite continued fraction.	[math]\displaystyle{ T_2(1/b):=\sum_{n=1}^\infty t_nb^{n-1} }[/math] where [math]\displaystyle{ t_n }[/math] is the [math]\displaystyle{ n }[/math]-th term of the Thue–Morse sequence.
Champernowne constants [math]\displaystyle{ C_b }[/math] in base [math]\displaystyle{ b\geq2 }[/math]	[math]\displaystyle{ b }[/math]		Infinite continued fraction.	Examples include [math]\displaystyle{ C_{10}=0.1234567891011...=[0;8,9,1,149083,1,...] }[/math]
Liouville numbers [math]\displaystyle{ L }[/math]	[math]\displaystyle{ \infty }[/math]		Infinite continued fraction, not behaving predictable.	The Liouville numbers are precisely those numbers having infinite irrationality measure.

Irrationality base

The irrationality base is a measure of irrationality introduced by J. Sondow as an irrationality measure for Liouville numbers. It is defined as follows:

Let [math]\displaystyle{ \alpha }[/math] be an irrational number. If there exists a real number [math]\displaystyle{ \beta \geq 1 }[/math] with the property that for any [math]\displaystyle{ \varepsilon \gt 0 }[/math], there is a positive integer [math]\displaystyle{ q(\varepsilon) }[/math] such that

[math]\displaystyle{ \left| \alpha-\frac{p}{q} \right| \gt \frac 1 {(\beta+\varepsilon)^q} \text{ for all integers } p,q \text{ with } q \geq q(\varepsilon) }[/math],

then [math]\displaystyle{ \beta }[/math] is called the irrationality base of [math]\displaystyle{ \alpha }[/math] and is represented as [math]\displaystyle{ \beta(\alpha) }[/math]

If no such [math]\displaystyle{ \beta }[/math] exists, then [math]\displaystyle{ \alpha }[/math] is called a super Liouville number.

Example: The series [math]\displaystyle{ \varepsilon_{2e}=1+\frac{1}{2^1}+\frac{1}{4^{2^1}}+\frac{1}{8^{4^{2^1}}}+\frac{1}{16^{8^{4^{2^1}}}}+\frac{1}{32^{16^{8^{4^{2^1}}}}}+\ldots }[/math] is a super Liouville number, while the series [math]\displaystyle{ \tau_2 = \sum_{n=1}^\infty{\frac{1}{^{n}2}} = \frac{1}{2} + \frac{1}{2^2} + \frac{1}{2^{2^2}} + \frac{1}{2^{2^{2^2}}} + \frac{1}{2^{2^{2^{2^2}}}} + \ldots }[/math] is a Liouville number with irrationality base 2. ([math]\displaystyle{ {^{b}a} }[/math] represents tetration.)

Liouville numbers and transcendence

Establishing that a given number is a Liouville number provides a useful tool for proving a given number is transcendental. However, not every transcendental number is a Liouville number. The terms in the continued fraction expansion of every Liouville number are unbounded; using a counting argument, one can then show that there must be uncountably many transcendental numbers which are not Liouville. Using the explicit continued fraction expansion of e, one can show that e is an example of a transcendental number that is not Liouville. Mahler proved in 1953 that π is another such example.

The proof proceeds by first establishing a property of irrational algebraic numbers. This property essentially says that irrational algebraic numbers cannot be well approximated by rational numbers, where the condition for "well approximated" becomes more stringent for larger denominators. A Liouville number is irrational but does not have this property, so it can't be algebraic and must be transcendental. The following lemma is usually known as Liouville's theorem (on diophantine approximation), there being several results known as Liouville's theorem.

Below, the proof will show that no Liouville number can be algebraic.

Lemma: If α is an irrational number which is the root of an irreducible polynomial f of degree n > 0 with integer coefficients, then there exists a real number A > 0 such that, for all integers p, q, with q > 0,

[math]\displaystyle{ \left| \alpha - \frac{p}{q} \right | \gt \frac{A}{q^n} }[/math]

Proof of Lemma: Let M be the maximum value of |f ′(x)| (the absolute value of the derivative of f) over the interval [α − 1, α + 1]. Let α₁, α₂, ..., α_m be the distinct roots of f which differ from α. Select some value A > 0 satisfying

[math]\displaystyle{ A\lt \min \left(1, \frac{1}{M}, \left| \alpha - \alpha_1 \right|, \left| \alpha - \alpha_2 \right|, \ldots , \left| \alpha-\alpha_m \right| \right) }[/math]

Now assume that there exist some integers p, q contradicting the lemma. Then

[math]\displaystyle{ \left| \alpha - \frac{p}{q}\right| \le \frac{A}{q^n} \le A\lt \min\left(1, \frac{1}{M}, \left| \alpha - \alpha_1 \right|, \left|\alpha - \alpha_2 \right|, \ldots , \left| \alpha-\alpha_m \right| \right) }[/math]

Then p/q is in the interval [α − 1, α + 1]; and p/q is not in {α₁, α₂, ..., α_m}, so p/q is not a root of f; and there is no root of f between α and p/q.

By the mean value theorem, there exists an x₀ between p/q and α such that

[math]\displaystyle{ f(\alpha)-f(\tfrac{p}{q}) = (\alpha - \frac{p}{q}) \cdot f'(x_0) }[/math]

Since α is a root of f but p/q is not, it follows that |f ′(x₀)| > 0 and can rearrange:

[math]\displaystyle{ \left|\alpha -\frac{p}{q}\right |= \frac{\left | f(\alpha)- f(\tfrac{p}{q})\right |}{|f'(x_0)|} = \left | \frac{f(\tfrac{p}{q})}{f'(x_0)} \right | }[/math]

Now, f is of the form [math]\displaystyle{ \sum_{i=0}^n }[/math] c_i xⁱ where each c_i is an integer; so expressing |f(p/q)| as

[math]\displaystyle{ \left|f \left (\frac{p}{q} \right) \right| = \left| \sum_{i=0}^n c_i p^i q^{-i} \right| = \frac{1}{q^n} \left| \sum_{i=0}^n c_i p^i q^{n-i} \right | \ge \frac {1}{q^n} }[/math]

N.B. the last inequality holds because p/q is not a root of f and the c_i are integers.

Thus, |f(p/q)| ≥ 1/qⁿ. Since |f ′(x₀)| ≤ M by the definition of M, and 1/M > A by the definition of A, then

[math]\displaystyle{ \left | \alpha - \frac{p}{q} \right | = \left|\frac{f(\tfrac{p}{q})}{f'(x_0)}\right| \ge \frac{1}{Mq^n} \gt \frac{A}{q^n} \ge \left| \alpha - \frac{p}{q} \right| }[/math]

which is a contradiction; therefore, no such p, q exist; proving the lemma.

Proof of assertion: As a consequence of this lemma, let x be a Liouville number; as noted in the article text, x is then irrational. If x is algebraic, then by the lemma, there exists some integer n and some positive real A such that for all p, q

[math]\displaystyle{ \left| x - \frac{p}{q} \right|\gt \frac{A}{q^{n}} }[/math]

Let r be a positive integer such that 1/(2^r) ≤ A. If m = r + n, and since x is a Liouville number, then there exist integers a, b where b > 1 such that

[math]\displaystyle{ \left|x-\frac ab\right|\lt \frac1{b^m}=\frac1{b^{r+n}}=\frac1{b^rb^n} \le \frac1{2^r}\frac1{b^n} \le \frac A{b^n} }[/math]

which contradicts the lemma. Hence a Liouville number cannot be algebraic, and therefore must be transcendental.

See also

• Brjuno number
• Diophantine approximation

External links

• The Beginning of Transcendental Numbers