Liouville's proof of existence of
transcendental numbers
By Yatir Halevi on Wednesday, September
18, 2002 - 07:46 pm:
How did Liouville 'construct' a transcendental number?
Yatir
By Michael Doré on Thursday, September 19, 2002 - 01:00 am:
He discovered the following result, called Liouville's
theorem (or at least this is one result called Liouville's theorem - there's
a different one in complex analysis).
Suppose a is algebraic of degree n (that is it is the root of a nth
degree irreducible polynomial with integer coefficients). Then you can find
c > 0 such that for all rational p/q (with q > 0) we have
|a-p/q| > c/qn.
To prove this, let P be an irreducible polynomial of degree n with integer
coefficients such that P(a) = 0. P has bounded gradient in
[a-1,a+1] so there exists c > 0 such that for any rational
p/q in [a-1,a+1] we have:
|a- p/q| > c |P(a) - P(p/q)|
(Note that we don't need to worry about rationals outside [a-1,a+1]
since these have |a- p/q| ³ 1 so can't possibly affect the theorem.)
Now just note that |qn P(p/q)| is a non-negative integer and it is not zero
(as P is irreducible) so it is at least 1. And P(a) = 0. Hence:
|a- p/q| > c/qn
as required.
This theorem allows us to construct many transcendental numbers. The key is to
find a number which is so well approximated by rationals that the conclusion of
Liouville's theorem cannot possibly hold for any n, thus proving the number
is transcendental. For example it is an easy exercise now to show that
1/20! + 1/21! + 1/22! + ¼is transcendental. Historically this
was the first number to be proved as such.
Most transcendental numbers aren't well enough approximated by rationals to
allow Liouville's theorem to prove they're transcendental. Still I rather like
the above proof of Liouville's theorem as it combines analysis and algebra in
a nice way.
By Yatir Halevi on Thursday, September 19,
2002 - 05:28 am:
Michael, could you please explain how to prove that the number
you gave as an example is transcendental?
Yatir
By Michael Doré on Thursday, September 19, 2002 - 11:24 am:
Consider more generally the sum
where ai are strictly increasing positive integers with
ai|ai+1. Suppose this is algebraic of degree n. We will use Liouville
to derive a necessary condition on the ais.
We can find c > 0 such that |x - p/q| > c/qn for any rational p/q. Take
. Then q = am. We get:
and this must hold for all m.
Let's estimate the thing on the left hand side. We have ai ³ 2i-m-1 am+1
for all i ³ m+1. So:
|
¥ å
i=m+1
|
1/(2i-m-1 am+1 ) > c/amn
|
Using the formula for a geometric progression this gives us:
2/am+1 > c/amn
for all n.
In other words, if x is algebraic of degree n then there exists A > 0
such that am+1 < A amn for all m.
So to ensure that x is not algebraic we just need to make sure this condition
is violated for every positive integer n. For instance if (for every n)
am+1 /amn tends to infinity as m tends to infinity, then the condition
is certainly violated. If you set am = 2m! then
am+1 /amn = 2(m+1)! - n*m! which tends to infinity as m tends to
infinity (for any fixed n).
Hence
is transcendental. You can replace 2 with
any other base, such as 10, if you want. Thus the number
1.110001000000000000000001000000000000000000000000000000000000000000000
000000000000000000000000000000000000000000000001... is transcendental.