transcendental (mathematics)

In mathematics, a transcendental number is a number that is not algebraic—that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are and .

Though only a few classes of transcendental numbers are known—partly 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 comprise a countable set, while the set of real numbers and the set of complex numbers are both uncountable sets, and therefore larger than any countable set. All transcendental real numbers (also known as real transcendental numbers or transcendental irrational numbers) are irrational numbers, since all rational numbers are algebraic. The converse is not true: not all irrational numbers are transcendental. Hence, the set of real numbers consists of non-overlapping rational, algebraic non-rational and transcendental real numbers. For example, the square root of 2 is an irrational number, but it is not a transcendental number as it is a root of the polynomial equation . The golden ratio (denoted $\varphi$ or $\phi$) is another irrational number that is not transcendental, as it is a root of the polynomial equation . The quality of a number being transcendental is called transcendence.

History

The name "transcendental" comes from the Latin ''transcendĕre'' 'to climb over or beyond, surmount', and was first used for the mathematical concept in Leibniz's 1682 paper in which he proved that is not an algebraic function of . Euler, in the 18th century, was probably the first person to define transcendental ''numbers'' in the modern sense.

Johann Heinrich Lambert conjectured that and were both transcendental numbers in his 1768 paper proving the number is irrational, and proposed a tentative sketch of a proof of 's transcendence.

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

:$\begin L_b &= \sum_^\infty 10^ \\ &= 10^ + 10^ + 10^ + 10^ + 10^ + 10^ + 10^ + 10^ + \ldots \\ &= 0.\textbf\textbf000\textbf00000000000000000\textbf00000000000000000000000000000000000000000000000000000\ldots \\ \end$

in which the th digit after the decimal point is if is equal to ( factorial) for some and otherwise. In other words, the th digit of this number is 1 only if is one of the numbers , etc. Liouville showed that this number belongs to a class of transcendental numbers that can be more closely approximated by rational numbers than can any irrational algebraic number, and this class of numbers are called Liouville numbers, named in his honour. Liouville showed that all Liouville numbers are transcendental.

The first number to be proven transcendental without having been specifically constructed for the purpose of proving transcendental numbers' existence was , 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. Although this was already implied by his proof of the countability of the algebraic numbers, Cantor also published a construction that proves there are as many transcendental numbers as there are real numbers. Cantor's work established the ubiquity of transcendental numbers.

In 1882, Ferdinand von Lindemann published the first complete proof of the transcendence of . He first proved that is transcendental if is a non-zero algebraic number. Then, since is algebraic (see Euler's identity), must be transcendental. But since is algebraic, therefore must be transcendental. This approach was generalized by Karl Weierstrass to what is now known as 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 is an algebraic number that is not zero or one, and is an irrational algebraic number, is 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).

Properties

A transcendental number is a (possibly complex) number that is not the root of any integer polynomial. Every real transcendental number must also be irrational, since a rational number is the root of an integer polynomial of degree one. The set of transcendental numbers is uncountably infinite. Since the polynomials with rational coefficients are countable, and since each such polynomial has a finite number of zeroes, the algebraic numbers must also be countable. However, Cantor's diagonal argument proves that the real numbers (and therefore also the complex numbers) are uncountable. Since the real numbers are the union of algebraic and transcendental numbers, it is impossible for both subsets to be countable. This makes the transcendental numbers uncountable.

No rational number is transcendental and all real transcendental numbers are irrational. The irrational numbers contain all the real transcendental numbers and a subset of the algebraic numbers, including the quadratic irrationals and other forms of algebraic irrationals.

Applying any non-constant single-variable algebraic function to a transcendental argument yields a transcendental value. For example, from knowing that is transcendental, it can be immediately deduced that numbers such as , and 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 are both transcendental, but is obviously not. It is unknown whether , for example, is transcendental, though at least one of and must be transcendental. More generally, for any two transcendental numbers and , at least one of and must be transcendental. To see this, consider the polynomial . If and 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, and , 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 , one can show that 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).

Numbers proven to be transcendental

Numbers proven to be transcendental:

* if is algebraic and nonzero (by the Lindemann–Weierstrass theorem).
* (by the Lindemann–Weierstrass theorem).
* , Gelfond's constant, as well as (by the Gelfond–Schneider theorem).
* where is algebraic but not 0 or 1, and is irrational algebraic (by the Gelfond–Schneider theorem), in particular:
::, the Gelfond–Schneider constant (or Hilbert number)
*, , , , , and , and their hyperbolic counterparts, for any nonzero algebraic number , expressed in radians (by the Lindemann–Weierstrass theorem).
*The fixed point of the cosine function (also referred to as the Dottie number ) – the unique real solution to the equation , where is in radians (by the Lindemann–Weierstrass theorem).
* if is algebraic and not equal to 0 or 1, for any branch of the logarithm function (by the Lindemann–Weierstrass theorem).
* if and are positive integers not both powers of the same integer (by the Gelfond–Schneider theorem).
* The Bessel function , its first derivative, and the quotient are transcendental when ''ν'' is rational and ''x'' is algebraic and nonzero, and all nonzero roots of and are transcendental when ''ν'' is rational.
* if is algebraic and nonzero, for any branch of the Lambert W Function (by the Lindemann–Weierstrass theorem), in particular: the omega constant
* , the square super-root of any natural number is either an integer or transcendental (by the Gelfond–Schneider theorem)
* , , via Wolfram Mathworld
Transcendental Number
/ref> and . The numbers \Gamma /3/math>, \Gamma /4/math> and \Gamma /6/math> are also known to be transcendental. The numbers \Gamma /44/\pi and \Gamma /32/\pi are also transcendental.
* 0.64341054629..., Cahen's constant.
* The Champernowne constants, the irrational numbers formed by concatenating representations of all positive integers.
* , Chaitin's constant (since it is a non-computable number).
* The so-called ''Fredholm constants,'' such as.
*:$\sum_^\infty 10^ = 0.\textbf\textbf0\textbf000\textbf0000000\textbf\ldots$
:which also holds by replacing 10 with any algebraic ..
* Gauss's constant and the lemniscate constant.
* The aforementioned Liouville constant for any algebraic .
* The Prouhet–Thue–Morse constant.
* The Komornik–Loreti constant.
* Any number for which the digits with respect to some fixed base form a Sturmian word.
* For
::$\sum_^\infty 10^;$
:where $\beta\mapsto\lfloor \beta \rfloor$ is the floor function.
* 3.300330000000000330033... and its reciprocal 0.30300000303..., two numbers with only two different decimal digits whose nonzero digit positions are given by the Moser–de Bruijn sequence and its double.
* The number , where and are Bessel functions and is the Euler–Mascheroni constant.
* Nesterenko proved in 1996 that $\pi,e^\pi$ and \Gamma /4/math> are algebraically independent.

Possible transcendental numbers

Numbers which have yet to be proven to be either transcendental or algebraic:
* Most sums, products, powers, etc. of the number and the number , e.g. , , , , , , , , are not known to be rational, algebraic, irrational or transcendental. A notable exception is (for any positive integer ) which has been proven transcendental.
* The Euler–Mascheroni constant '':'' In 2010 M. Ram Murty and N. Saradha found an infinite list of numbers containing such that all but at most one of them are transcendental. In 2012 it was shown that at least one of and the Euler–Gompertz constant is transcendental.
* Apéry's constant (which Apéry proved is irrational).
* Catalan's constant, not even proven to be irrational.
* Khinchin's constant, also not proven to be irrational.
* The Riemann zeta function at other odd integers, , , ... (not proven to be irrational).
* The Feigenbaum constants and , also not proven to be irrational.
* Mills' constant, also not proven to be irrational.
* The Copeland–Erdős constant, formed by concatenating the decimal representations of the prime numbers.
* $\Gamma(1/5)$ has not been proven to be irrational.

Conjectures:
* Schanuel's conjecture,
* Four exponentials conjecture.

Sketch of a proof that is transcendental

The first proof that the base of the natural logarithms, , 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 is algebraic. Then there exists a finite set of integer coefficients ''c''₀, ''c''₁, ..., ''c_n'' satisfying the equation:

:$c_+c_e+c_e^+\cdots+c_e^=0, \qquad c_0, c_n \neq 0.$

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

: f_k(x) = x^ \left x-1)\cdots(x-n) \right ,

and multiply both sides of the above equation by

:$\int^_ f_k e^\,dx,$

to arrive at the equation:

:$c_ \left (\int^_ f_k e^\,dx\right )+ c_1e\left ( \int^_f_k e^\,dx\right )+\cdots+ c_e^ \left (\int^_f_k e^\,dx\right ) = 0.$

By splitting respective domains of integration, this equation can be written in the form

:$P+Q=0$

where

:$\begin P &= c_\left ( \int^_f_k e^\,dx\right )+ c_e\left (\int^_f_k e^\,dx\right )+ c_e^\left (\int^_f_k e^\,dx\right ) +\cdots+ c_e^\left (\int^_f_k e^\,dx\right ) \\ Q &= c_e\left (\int^_ f_k e^\,dx\right )+c_e^ \left (\int^_ f_k e^\,dx\right )+\cdots+c_e^\left (\int^_ f_k e^\,dx \right ) \end$

Lemma 1. For an appropriate choice of ''k'', $\tfrac$ is a non-zero integer.

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

:$\int^_x^e^\,dx=j!$

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

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

:$c_e^\int^_ f_k e^\,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

:$A_\int^_x^e^\,dx$ Where ''A''_j-k is integer.

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^_ f_k e^\,dx = \int^_ \left ( \left -1)^(n!) \right e^x^k + \cdots \right ) dx

and thus

:c_\int _^f_e^\,dx\equiv c_ -1)^(n!)\not\equiv 0.

So when dividing each integral in ''P'' by ''k!'', the initial one is not divisible by ''k''+1, but all the others are, as long as ''k''+1 is prime and larger than ''n'' and , ''c''₀, . It follows that $\tfrac$ itself is not divisible by the prime ''k''+1 and therefore cannot be zero.

Lemma 2. $\left, \tfrac\<1$ for sufficiently large $k$.

Proof. Note that

:\begin
f_k e^ &= x^ x-1)(x-2)\cdots(x-n)e^\\
&= \left (x(x-1)\cdots(x-n) \right)^k \cdot \left ((x-1)\cdots(x-n)e^\right)\\
&= u(x)^k \cdot v(x)
\end

where $u(x)$ and $v(x)$ are continuous functions of $x$ for all $x$, so are bounded on the interval ,n/math>. That is, there are constants $G, H > 0$ such that

:$\left , f_k e^ \right , \leq , u(x), ^k \cdot , v(x), < G^k H \quad \text 0 \leq x \leq n.$

So each of those integrals composing $Q$ is bounded, the worst case being

:$\left, \int_^f_e^\,dx\ \leq \int_^ \left , f_e^ \right , \,dx \leq \int_^G^k H\,dx = nG^k H.$

It is now possible to bound the sum $Q$ as well:

:$, Q, < G^ \cdot nH \left (, c_1, e+, c_2, e^2+\cdots+, c_n, e^ \right ) = G^k \cdot M,$

where $M$ is a constant not depending on $k$. It follows that

:$\left, \frac \ < M \cdot \frac \to 0 \quad \text k \to \infty,$

finishing the proof of this lemma.

Choosing a value of $k$ satisfying both lemmas leads to a non-zero integer ($P/k!$) added to a vanishingly small quantity ($Q/k!$) being equal to zero, is an impossibility. It follows that the original assumption, that can satisfy a polynomial equation with integer coefficients, is also impossible; that is, is transcendental.

The transcendence of

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 , facts about symmetric polynomials play a vital role in the proof.

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

See also

* Transcendental number theory, the study of questions related to transcendental numbers
* Gelfond–Schneider theorem
* Diophantine approximation
* Periods, a set of numbers (including both transcendental and algebraic numbers) which may be defined by integral equations.

Notes

References

*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*

External links

602440, Transcendental number (mathematics)}
*
*
*
*
Proof that ''e'' is transcendental
*

*
Proof that ''e'' is transcendental (PDF)

* http://www.mathematik.uni-muenchen.de/~fritsch/pi.pdf

{{Authority control

Articles containing proofs