Transcendental number

From Wikipedia, the free encyclopedia
  (Redirected from Transcendental numbers)
Jump to: navigation, search

In mathematics, a transcendental number is a real or complex number that is not algebraic—that is, it is not a root of a non-zero polynomial equation with rational coefficients. The most prominent examples of transcendental numbers are π and e. Though only a few classes of transcendental numbers are known (in part because it can be extremely difficult to show that a given number is transcendental), transcendental numbers are not rare. Indeed, almost all real and complex numbers are transcendental, since the algebraic numbers are countable while the sets of real and complex numbers are both uncountable. All real transcendental numbers are irrational, since all rational numbers are algebraic. The converse is not true: not all irrational numbers are transcendental; e.g., the square root of 2 is irrational but not a transcendental number, since it is a solution of the polynomial equation x2 − 2 = 0.

History[edit]

The name "transcendental" comes from Leibniz in his 1682 paper where he proved that sin(x) is not an algebraic function of x.[1][2] Euler was probably the first person to define transcendental numbers in the modern sense.[3]

Joseph Liouville first proved the existence of transcendental numbers in 1844,[4] and in 1851 gave the first decimal examples such as the Liouville constant

\sum_{k=1}^\infty 10^{-k!} = 0.1100010000000000000000010000\ldots

in which the nth digit after the decimal point is 1 if n is equal to k! (k factorial) for some k and 0 otherwise.[5] Liouville showed that this number is what we now call a Liouville number; this essentially means that it can be more closely approximated by rational numbers than can any irrational algebraic number. Liouville showed that all Liouville numbers are transcendental.[6]

Johann Heinrich Lambert conjectured that e and π were both transcendental numbers in his 1761 paper proving the number π is irrational. 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 proved that the algebraic numbers are countable and the real numbers are uncountable. He also gave a new method for constructing transcendental numbers.[7] In 1878, Cantor published a construction that proves there are as many transcendental numbers as there are real numbers.[8] Cantor's work established the ubiquity of transcendental numbers.

In 1882, Ferdinand von Lindemann published a proof that the number π is transcendental. He first showed that e to any nonzero algebraic power is transcendental, and since eiπ = −1 is algebraic (see Euler's identity), iπ and therefore π 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 constructions involving compass and straightedge, 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 is an algebraic number, that is not zero or one, and b is an irrational algebraic number, 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 in his work on lower bounds for linear forms in any number of logarithms (of algebraic numbers).[9]

Properties[edit]

The set of transcendental numbers is uncountably infinite. Since the polynomials with integer coefficients are countable, and since each such polynomial has a finite number of zeroes, the algebraic numbers must also be countable. But Cantor's diagonal argument proves that the real numbers (and therefore also the complex numbers) are uncountable; so the set of all transcendental numbers must also be uncountable.

No rational number is transcendental and all real transcendental numbers are irrational. A rational number can be written as p/q, where p and q are integers. Thus, p/q is the root of qx − p = 0. However, some irrational numbers are not transcendental. For example, the square root of 2 is irrational and not transcendental (because it is a solution of the polynomial equation x2 − 2 = 0). The same is true for the square root of other non-perfect squares.

Any non-constant algebraic function of a single variable yields a transcendental value when applied to a transcendental argument. For example, from knowing that π is transcendental, we can immediately deduce that numbers such as 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 number when applied to transcendental numbers if these numbers are not algebraically independent. For example, π 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 ab must be transcendental. To see this, consider the polynomial (xa)(xb) = x2 − (a + b)x + ab. If (a + b) and ab 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, 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 is transcendental.

The non-computable numbers are a strict subset of the transcendental numbers.

All Liouville numbers are transcendental, but not vice versa. Any Liouville number must have unbounded partial quotients in its continued fraction expansion. Using a counting argument one can show that there exist transcendental numbers which have bounded partial quotients and hence are not Liouville numbers.

Using the explicit continued fraction expansion of e, one can show that e is not a Liouville number (although the partial quotients in its continued fraction expansion are unbounded). Kurt Mahler showed in 1953 that π is also not a Liouville number. It is conjectured that all infinite continued fractions with bounded terms that are not eventually periodic are transcendental (eventually periodic continued fractions correspond to quadratic irrationals).[10]

A related class of numbers are closed-form numbers, which may be defined in various ways, including rational numbers (and in some definitions all algebraic numbers), but also allow exponentiation and logarithm.

Numbers proven to be transcendental[edit]

Numbers proven to be transcendental:

2^\sqrt{2}, the Gelfond–Schneider constant (or Hilbert number).

{1+\cfrac{1}{2+\cfrac{1}{3+\cfrac{1}{4+\cfrac{1}{5+\cfrac{1}{6+\ddots}}}}}}
  • sin(a), cos(a) and tan(a), and their multiplicative inverses csc(a), sec(a) and cot(a), for any nonzero algebraic number a (by the Lindemann–Weierstrass theorem).
  • ln(a) if a is algebraic and not equal to 0 or 1, for any branch of the logarithm function (by the Lindemann–Weierstrass theorem).
  • W(a) if a is algebraic and nonzero, for any branch of the Lambert W Function (by the Lindemann–Weierstrass theorem).
  • Γ(1/3),[11] Γ(1/4),[12] and Γ(1/6).[12]
  • 0.12345678910111213141516..., the Champernowne constant.[13][14]
  • Ω, Chaitin's constant (since it is a non-computable number).[15]
  • The Fredholm number[16][17]
\sum_{n=0}^\infty 2^{-2^n}
more generally, any number of the form
\sum_{n=0}^\infty \beta^{2^n}
with 0 < |β| < 1 and β algebraic.[18]
  • The aforementioned Liouville constant
\sum_{n=1}^\infty 10^{-n!};
more generally any number of the form
\sum_{n=1}^\infty \beta^{n!}
with 0 < |β| < 1 and β algebraic
\sum_{k=0}^\infty 10^{-\left\lfloor \beta^{k} \right\rfloor};
where \beta\mapsto\lfloor \beta \rfloor is the floor function.

Possibly transcendental numbers[edit]

Numbers which have yet to be proven to be either transcendental or algebraic:

Conjectures:

Sketch of a proof that e is transcendental[edit]

The first proof that the base of the natural logarithms, e, 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 e is algebraic. Then there exists a finite set of integer coefficients c0, c1, ..., cn satisfying the equation:

c_{0}+c_{1}e+c_{2}e^{2}+\cdots+c_{n}e^{n}=0, \qquad c_0, c_n \neq 0.

Now for a positive integer k, we define the following polynomial:

 f_k(x) = x^{k} \left [(x-1)\cdots(x-n) \right ]^{k+1},

and multiply both sides of the above equation by

\int^{\infty}_{0} f_k e^{-x}\,dx,

to arrive at the equation:

c_{0} \left (\int^{\infty}_{0} f_k e^{-x}\,dx\right )+ c_1e\left ( \int^{\infty}_{0}f_k e^{-x}\,dx\right )+\cdots+ c_{n}e^{n} \left (\int^{\infty}_{0}f_k e^{-x}\,dx\right ) = 0.

This equation can be written in the form

P+Q=0

where

P =c_{0}\left ( \int^{\infty}_{0}f_k e^{-x}\,dx\right )+ c_{1}e\left (\int^{\infty}_{1}f_k e^{-x}\,dx\right )+ c_{2}e^{2}\left (\int^{\infty}_{2}f_k e^{-x}\,dx\right ) +\cdots+ c_{n}e^{n}\left (\int^{\infty}_{n}f_k e^{-x}\,dx\right )
Q=c_{1}e\left (\int^{1}_{0} f_k e^{-x}\,dx\right )+c_{2}e^{2} \left (\int^{2}_{0} f_k e^{-x}\,dx\right )+\cdots+c_{n}e^{n}\left (\int^{n}_{0} f_k e^{-x}\,dx \right )

Lemma 1. For an appropriate choice of k, \tfrac{P}{k!} is a non-zero integer.

Proof. Each term in P is an integer times a sum of factorials, which results from the relation

\int^{\infty}_{0}x^{j}e^{-x}\,dx=j!

which is valid for any positive integer j (consider the Gamma function).

It is non-zero because for every a satisfying 0< an, the integrand in

c_{a}e^{a}\int^{\infty}_{a} f_k e^{-x}\,dx

is e−x times a sum of terms whose lowest power of x is k+1 after substituting x for x - a in the integral. Then this becomes a sum of integrals of the form

\int^{\infty}_{0}x^{j}e^{-x}\,dx

with k+1 ≤ j, and it is therefore an integer divisible by (k+1)!. After dividing by k!, we get zero modulo (k+1). However, we can write:

\int^{\infty}_{0} f_k e^{-x}\,dx = \int^{\infty}_{0} \left ([(-1)^{n}(n!)]^{k+1}e^{-x}x^k + \cdots \right ) dx

and thus

{\frac{1}{k!}}c_{0}\int^{\infty}_{0}  f_k e^{-x}\,dx = c_{0}[(-1)^{n}(n!)]^{k+1} \qquad \mod (k+1).
By choosing k so that k+1 is prime and larger than n and |c0|, we get that \tfrac{P}{k!} is non-zero modulo (k+1) and is thus non-zero.

Lemma 2. \left|\tfrac{Q}{k!}\right|<1 for sufficiently large k.

Proof. Note that

f_k e^{-x} = x^{k}[(x-1)(x-2)\cdots(x-n)]^{k+1}e^{-x} = \left ([x(x-1)\cdots(x-n)]^k \right ) \left ((x-1)\cdots(x-n)e^{-x}\right )

Using upper bounds G and H for |x(x-1)\cdots(x-n)| and |(x-1)\cdots(x-n)e^{-x}| on the interval [0,n] we can infer that

|Q|<G^{k}H(|c_{1}|e+2|c_{2}|e^{2}+\cdots+n|c_{n}|e^{n})

and since

\lim_{k\to\infty}\frac{G^k}{k!}=0

it follows that

\lim_{k\to\infty}\frac{Q}{k!}=0

which is sufficient to finish the proof of this lemma.

Noting that one can choose k so that both Lemmas hold we get the contradiction we needed to prove the transcendence of e.

The transcendence of π[edit]

A similar strategy, different from Lindemann's original approach, can be used to show that the number π is transcendental. Besides the gamma-function and some estimates as in the proof for e, facts about symmetric polynomials play a vital role in the proof.

For detailed information concerning the proofs of the transcendence of π and e see the references and external links.

Mahler's classification[edit]

Kurt Mahler in 1932 partitioned the transcendental numbers into 3 classes, called S, T, and U.[24] Definition of these classes draws on an extension of the idea of a Liouville number (cited above).

Measure of irrationality of a real number[edit]

One way to define a Liouville number is to consider how small a given real number x makes linear polynomials |qx − p| without making them exactly 0. Here p, q are integers with |p|, |q| bounded by a positive integer H.

Let ω(x, 1, H) be the minimum non-zero absolute value these polynomials take and take:

\omega(x, 1, H) = - \frac{\log m(x, 1, H)}{\log H}
\omega(x, 1)= \limsup_{H\to\infty} \omega(x,1,H).

ω(x, 1) is often called the measure of irrationality of a real number x. For rational numbers, ω(x, 1) = 0 and is at least 1 for irrational real numbers. A Liouville number is defined to have infinite measure of irrationality. Roth's theorem says that irrational real algebraic numbers have measure of irrationality 1.

Measure of transcendence of a complex number[edit]

Next consider the values of polynomials at a complex number x, when these polynomials have integer coefficients, degree at most n, and height at most H, with n, H being positive integers.

Let ω(x,n,H) be the minimum non-zero absolute value such polynomials take at x and take:

\omega(x, n, H) = - \frac{\log m(x, n, H)}{n\log H}
\omega(x, n)= \limsup_{H\to\infty} \omega(x,n,H).

Suppose this is infinite for some minimum positive integer n. A complex number x in this case is called a U number of degree n.

Now we can define

\omega (x) =\limsup_{n\to\infty}\omega(x,n).

ω(x) is often called the measure of transcendence of x. If the ω(x,n) are bounded, then ω(x) is finite, and x is called an S number. If the ω(x,n) are finite but unbounded, x is called a T number. x is algebraic if and only if ω(x) = 0.

Clearly the Liouville numbers are a subset of the U numbers. William LeVeque in 1953 constructed U numbers of any desired degree.[25][26] The Liouville numbers and hence the U numbers are uncountable sets. They are sets of measure 0.[27]

T numbers also comprise a set of measure 0.[28] It took about 35 years to show their existence. Wolfgang M. Schmidt in 1968 showed that examples exist. It follows that almost all complex numbers are S numbers.[29] Mahler proved that the exponential function sends all non-zero algebraic numbers to S numbers:[30][31] this shows that e is an S number and gives a proof of the transcendence of π. The most that is known about π is that it is not a U number. Many other transcendental numbers remain unclassified.

Two numbers x, y are called algebraically dependent if there is a non-zero polynomial P in 2 indeterminates with integer coefficients such that P(xy) = 0. There is a powerful theorem that 2 complex numbers that are algebraically dependent belong to the same Mahler class.[26][32] This allows construction of new transcendental numbers, such as the sum of a Liouville number with e or π.

It is often speculated that S stood for the name of Mahler's teacher Carl Ludwig Siegel and that T and U are just the next two letters.

Koksma's equivalent classification[edit]

Jurjen Koksma in 1939 proposed another classification based on approximation by algebraic numbers.[24][33]

Consider the approximation of a complex number x by algebraic numbers of degree ≤ n and height ≤ H. Let α be an algebraic number of this finite set such that |x − α| has the minimum positive value. Define ω*(x,H,n) and ω*(x,n) by:

|x-\alpha| = H^{-n\omega^*(x,H,n)-1}.
\omega^*(x,n) = \limsup_{H\to\infty} \omega^*(x,n,H).

If for a smallest positive integer n, ω*(x,n) is infinite, x is called a U*-number of degree n.

If the ω*(x,n) are bounded and do not converge to 0, x is called an S*-number,

A number x is called an A*-number if the ω*(x,n) converge to 0.

If the ω*(x,n) are all finite but unbounded, x is called a T*-number,

Koksma's and Mahler's classifications are equivalent in that they divide the transcendental numbers into the same classes.[33] The A*-numbers are the algebraic numbers.[29]

LeVeque's construction[edit]

Let

\lambda= \tfrac{1}{3} + \sum_{k=1}^\infty 10^{-k!}

It can be shown that the nth root of λ (a Liouville number) is a U-number of degree n.[34]

This construction can be improved to create an uncountable family of U-numbers of degree n. Let Z be the set consisting of every other power of 10 in the series above for λ. The set of all subsets of Z is uncountable. Deleting any of the subsets of Z from the series for λ creates uncountably many distinct Liouville numbers, whose nth roots are U-numbers of degree n.

Type[edit]

The supremum of the sequence {ω(xn)} is called the type. Almost all real numbers are S numbers of type 1, which is minimal for real S numbers. Almost all complex numbers are S numbers of type 1/2, which is also minimal. The claims of almost all numbers were conjectured by Mahler and in 1965 proved by Vladimir Sprindzhuk.[25]

See also[edit]

Notes[edit]

  1. ^ Gottfried Wilhelm Leibniz, Karl Immanuel Gerhardt, Georg Heinrich Pertz (1858). Leibnizens mathematische Schriften 5. A. Asher & Co. pp. 97–98. [1]
  2. ^ Nicolás Bourbaki (1994). Elements of the History of Mathematics. Springer. p. 74. 
  3. ^ Paul Erdős, Dudley (December 1943). "Some Remarks and Problems in Number Theory Related to the Work of Euler". Mathematics Magazine 76 (5): 292–299. doi:10.2307/2690369. JSTOR 2690369. 
  4. ^ Aubrey J. Kempner (October 1916). "On Transcendental Numbers". Transactions of the American Mathematical Society (American Mathematical Society) 17 (4): 476–482. doi:10.2307/1988833. JSTOR 1988833. 
  5. ^ Weisstein, Eric W. "Liouville's Constant", MathWorld
  6. ^ J. Liouville (1851). "Sur des classes très étendues de quantités dont la valeur n'est ni algébrique, ni même réductible à des irrationnelles algébriques". J. Math. Pures et Appl. 16: 133–142. 
  7. ^ Georg Cantor (1874). "Über eine Eigenschaft des Inbegriffes aller reelen algebraischen Zahlen". J. Reine Angew. Math. 77: 258–262. 
  8. ^ Georg Cantor (1878). "Ein Beitrag zur Mannigfaltigkeitslehre". J. Reine Angew. Math. 84: 242–258.  (Cantor's construction builds a one-to-one correspondence between the set of transcendental numbers and the set of real numbers. In this article, Cantor only applies his construction to the set of irrational numbers. See p. 254.)
  9. ^ J J O'Connor and E F Robertson: Alan Baker. The MacTutor History of Mathematics archive 1998.
  10. ^ Boris Adamczewski and Yann Bugeaud (March 2005). "On the complexity of algebraic numbers, II. Continued fractions". Acta Mathematica 195 (1): 1–20. doi:10.1007/BF02588048. 
  11. ^ Le Lionnais, F. Les nombres remarquables (ISBN 2-7056-1407-9). Paris: Hermann, p. 46, 1979. via Wolfram Mathworld, Transcendental Number
  12. ^ a b Chudnovsky, G. V. (1984). Contributions to the Theory of Transcendental Numbers. Providence, RI: American Mathematical Society. ISBN 0-8218-1500-8.  via Wolfram Mathworld, Transcendental Number
  13. ^ K. Mahler (1937). "Arithmetische Eigenschaften einer Klasse von Dezimalbrüchen". Proc. Konin. Neder. Akad. Wet. Ser. A. (40): 421–428. 
  14. ^ Mahler (1976) p.12
  15. ^ Information and Randomness: An Algorithmic Perspective. Texts in Theoretical Computer Science (2nd rev. and ext. ed.). Springer-Verlag. 2002. p. 239. ISBN 3-540-43466-6. Zbl 1055.68058.  |first1= missing |last1= in Authors list (help)
  16. ^ Allouche & Shallit (2003) pp.385,403
  17. ^ Shallit, Jeffrey (1999). "Number theory and formal languages". In Hejhal, Dennis A.; Friedman, Joel; Gutzwiller, Martin C. et al. Emerging applications of number theory. Based on the proceedings of the IMA summer program, Minneapolis, MN, USA, July 15--26, 1996. The IMA volumes in mathematics and its applications 109. Springer-Verlag. pp. 547–570. ISBN 0-387-98824-6. 
  18. ^ Loxton, J. H. (1988). "13. Automata and transcendence". In Baker, A.. New Advances in Transcendence Theory. Cambridge University Press. pp. 215–228. ISBN 0-521-33545-0. Zbl 0656.10032. 
  19. ^ Mahler, Kurt (1929). "Arithmetische Eigenschaften der Lösungen einer Klasse von Funktionalgleichungen". Math. Annalen 101: 342–366. doi:10.1007/bf01454845. JFM 55.0115.01. 
  20. ^ Allouche & Shallit (2003) p.387
  21. ^ Pytheas Fogg, N. (2002). Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics 1794. Editors Berthé, Valérie; Ferenczi, Sébastien; Mauduit, Christian; Siegel, A. Berlin: Springer-Verlag. ISBN 3-540-44141-7. Zbl 1014.11015. 
  22. ^ Weisstein, Eric W., "Irrational Number", MathWorld.
  23. ^ Modular functions and transcendence questions, Yu. V. Nesterenko, Sbornik: Mathematics(1996), 187(9):1319
  24. ^ a b Bugeaud (2012) p.250
  25. ^ a b Baker (1975) p. 86.
  26. ^ a b LeVeque (2002) p.II:172
  27. ^ Burger and Tubbs, p. 170.
  28. ^ Burger and Tubbs, p. 172.
  29. ^ a b Bugeaud (2012) p.251
  30. ^ LeVeque (2002) pp.II:174–186
  31. ^ Burger and Tubbs, p. 182.
  32. ^ Burger and Tubbs, p. 163.
  33. ^ a b Baker (1975) p.87
  34. ^ Baker(1979), p. 90.

References[edit]

External links[edit]