Transcendental number
From Free net encyclopedia
In mathematics, a transcendental number is any complex number that is not algebraic, that is, not the solution of a non-zero polynomial equation with integer (or, equivalently, rational) coefficients. The most prominent examples of transcendental numbers are π and e.
Transcendental numbers are never rational. However, not all irrational numbers are transcendental: the square root of 2 is irrational, but is a solution of the polynomial x2 − 2 = 0.
The set of all transcendental numbers is uncountable. The proof is simple: Since the polynomials with integer coefficients are countable, and since each such polynomial has a finite number of zeroes, the set of algebraic numbers is countable. But Cantor's diagonal argument establishes that the reals (and therefore also the complex numbers) are uncountable; so the set of all transcendental numbers must also be uncountable. In a very real sense, then, there are many more transcendental numbers than algebraic ones. However, only a few classes of transcendental numbers are known and proving that a given number is transcendental can be extremely difficult.
Contents |
History
The existence of transcendental numbers was first proved in 1844 by Joseph Liouville, who exhibited examples, including the Liouville constant:
- <math>
\sum_{k=1}^\infty 10^{-k!} = 0.110001000000000000000001000\ldots </math> in which the nth digit after the decimal point is 1 if n is a factorial (i.e., 1, 2, 6, 24, 120, 720, ...., etc.) and 0 otherwise. Liouville showed that this number is what we now call a Liouville number; this essentially means that it can be particularly well approximated by rational numbers. Liouville then showed that all Liouville numbers are transcendental. (We now know that not all transcendental numbers are Liouville numbers, for instance π is not a Liouville number.)
The first number to be proven transcendental without having been specifically constructed for the purpose was e, by Charles Hermite in 1873. In 1874, Georg Cantor found the argument described above establishing the ubiquity of transcendental numbers.
In 1882, Ferdinand von Lindemann published a proof that the number π is transcendental. He first showed that <math>e</math> to any algebraic power is transcendental, and since <math>e^{i\pi} = -1 </math> is algebraic (see Euler's identity), <math>i\pi</math> and therefore <math>\pi</math> must be transcendental. This approach was generalized by Karl Weierstrass to the Lindemann–Weierstrass theorem.
The transcendence of π allowed the proof of the impossibility of several ancient geometric problems involving compass and straightedge construction, including the most famous one, squaring the circle.
In 1900, David Hilbert posed an influential question about transcendental numbers, Hilbert's seventh problem: if a ≠ 0,1 is algebraic and b is irrational algebraic, is ab necessarily transcendental? The affirmative answer was provided in 1934 by the Gelfond-Schneider theorem. This work was extended by Alan Baker in the 1960s.
Known transcendental numbers and open problems
Here is a list of some numbers known to be transcendental:
- ea if a is algebraic and nonzero. In particular, e itself is transcendental. These facts are generalized by the Lindemann-Weierstrass theorem.
- π
- eπ Gelfond's constant. (A consequence of the Gelfond-Schneider theorem.)
- 2√Template:Overline, the Gelfond-Schneider constant, or more generally ab where a ≠ 0,1 is algebraic and b is algebraic but not rational (Gelfond-Schneider theorem and Hilbert's seventh problem).
- sin(1)
- ln(a) if a is positive, rational and ≠ 1
- Γ(1/3), Γ(1/4), and Γ(1/6) (see gamma function).
- the Champernowne constant is an example of a transcendental number that is normal in base 10.
- Ω, Chaitin's constant, and more generally: every non-computable number is transcendental (since all algebraic numbers are computable).
- 2.536027081689339..., Herkommer number
- Prouhet-Thue-Morse constant
- <math>\sum_{k=0}^\infty 10^{-\lfloor \beta^{k} \rfloor};\qquad \beta > 1\; , </math>
- where <math>\beta\mapsto\lfloor \beta \rfloor</math> is the floor function. For example if β = 2 then this number is 0.11010001000000010000000000000001000…
Any non-constant algebraic function of a single variable yields a transcendental value when applied to a transcendental argument. So for example, from knowing that π is transcendental, we can immediately deduce that 5π, (π-3)/√2, (√π-√3)8 and (π5+7)1/7 are transcendental as well.
However, an algebraic function of several variables may yield an algebraic value when applied to transcendental numbers if these numbers are not algebraically independent: π and 1−π are both transcendental, but π+(1−π)=1 is obviously not. It is unknown whether π+e, for example, is transcendental, though at least one of π+e and π e must be transcendental. More generally, for any two transcendental numbers a and b, at least one of a+b and a b must be transcendental. To see this, consider the polynomial (x−a) (x−b) = x2 − (a+b) x + a b. If (a+b) and a b were both algebraic, then this would be a polynomial with algebraic coefficients. Because algebraic numbers form an algebraically closed field, this would imply that the roots of the polynomial, which happen to be a and b, must be algebraic. But this is a contradiction, and thus it must be the case that at least one of the coefficients was transcendental.
Numbers for which it is unknown whether they are transcendental or not include
- π+e, πe, ππ, ee, πe
- the Euler-Mascheroni constant γ (which has not even been proven to be irrational)
- Catalan's constant, also not known to be irrational
- ζ(3), Apéry's constant
Proof sketch that <math>e</math> is transcendental
The first proof that <math>e</math> is transcendental dates from 1873. We will now follow the strategy of David Hilbert (1862–1943) who gave a simplification of the original proof of Charles Hermite. The idea is the following:
Assume, for purpose of finding a contradiction, that <math>e</math> is algebraic. Then there exists a finite set of integer coefficients <math>c_{0},c_{1},\ldots,c_{n},</math> satisfying the equation:
- <math>c_{0}+c_{1}e+c_{2}e^{2}+\ldots+c_{n}e^{n}=0</math>
and such that <math>c_0</math> and <math>c_n</math> are both non-zero.
Depending on the value of n, we specify a sufficently large positive integer k (to meet our needs later), and multiply both sides of the above equation by <math>\int^{\infty}_{0}</math>, where the notation <math>\int^{b}_{a}</math> will be used in this proof as shorthand for the integral:
- <math>\int^{b}_{a}:=\int^{b}_{a}x^{k}[(x-1)(x-2)\cdots(x-n)]^{k+1}e^{-x}dx</math>.
We have arrived at the equation:
- <math>c_{0}\int^{\infty}_{0}+c_{1}e\int^{\infty}_{0}+\cdots+c_{n}e^{n}\int^{\infty}_{0} = 0</math>
which can now be written in the form
- <math>P_{1}+P_{2}=0\;</math>
where
- <math>P_{1}=c_{0}\int^{\infty}_{0}+c_{1}e\int^{\infty}_{1}+c_{2}e^{2}\int^{\infty}_{2}+\cdots+c_{n}e^{n}\int^{\infty}_{n}</math>
- <math>P_{2}=c_{1}e\int^{1}_{0}+c_{2}e^{2}\int^{2}_{0}+\cdots+c_{n}e^{n}\int^{n}_{0}</math>
The plan of attack now is to show that for k sufficiently large, the above relations are impossible to satisfy because
- <math>\frac{P_{1}}{k!}</math> is a non-zero integer and <math>\frac{P_{2}}{k!}</math> is not.
The fact that <math>\frac{P_{1}}{k!}</math> is a nonzero integer results from the relation
- <math>\int^{\infty}_{0}x^{j}e^{-x}=j!</math>
which is valid for any positive integer j and can be proved using integration by parts and mathematical induction.
To show that
- <math>\left|\frac{P_{2}}{k!}\right|<1</math> for sufficiently large k
we first note that <math>x^{k}[(x-1)(x-2)\cdots(x-n)]^{k+1}e^{-x}</math> is the product of the functions <math>[x(x-1)(x-2)\cdots(x-n)]^{k}</math> and <math>(x-1)(x-2)\cdots(x-n)e^{-x}</math>. Using upper bounds for <math>|x(x-1)(x-2)\cdots(x-n)|</math> and <math>|(x-1)(x-2)\cdots(x-n)e^{-x}|</math> on the interval [0,n] and employing the fact
- <math>\lim_{k\to\infty}\frac{G^k}{k!}=0</math> for every real number G
is then sufficient to finish the proof.
A similar strategy, different from Lindemann's original approach, can be used to show that the number <math>\pi</math> is transcendental. Besides the gamma-function and some estimates as in the proof for <math>e</math>, facts about symmetric polynomials play a vital role in the proof.
For detailed information concerning the proofs of the transcendence of <math>\pi</math> and <math>e</math> see the references and external links.
See also
- Transcendence theory, the study of questions related to transcendental numbers
References
- David Hilbert, "Über die Transcendenz der Zahlen <math>e</math> und <math>\pi</math>", Mathematische Annalen 43:216–219 (1893).
- Alan Baker, Transcendental Number Theory, Cambridge University Press, 1975, ISBN 052139791X.
External links
- Template:De icon Proof that <math>e</math> is transcendental (PDF)
- Template:De icon Proof that <math>\pi</math> is transcendental (PDF)cs:Transcendentní číslo
da:Transcendente tal de:Transzendente Zahl es:Número trascendente eu:Zenbaki transzendente fr:Nombre transcendant ko:초월수 it:Numero trascendente he:מספר טרנסצנדנטי lt:Transcendentinis skaičius hu:Transzcendens szám nl:Transcendent getal ja:超越数 pl:Liczba przestępna pt:Número transcendente ru:Трансцендентное число sl:Transcendentno število sv:Transcendent tal th:จำนวนอดิศัย uk:Трансцедентні числа zh:超越數