Transcendental number (original) (raw)

In mathematics, a non-algebraic number

In mathematics, a transcendental number is a real or complex number that is not algebraic: that is, not the root of a non-zero polynomial with integer (or, equivalently, rational) coefficients. The best-known transcendental numbers are π and e.[1][2] The quality of a number being transcendental is called transcendence.

Though only a few classes of transcendental numbers are known, because it can be difficult to show that a 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 real numbers ⁠ R {\displaystyle \mathbb {R} } $\mathbb {R}$ ⁠ and complex numbers ⁠ C {\displaystyle \mathbb {C} } $\mathbb {C}$ ⁠ are both uncountable, and therefore larger than any countable set.

All transcendental real numbers (also known as real transcendental numbers or transcendental irrational numbers) are irrational , since all rational numbers are algebraic.[3][4][5][6] The converse is not true: Not all irrational numbers are transcendental. Hence, the set of real numbers consists of non-overlapping sets of rational, algebraic irrational, and transcendental real numbers.[3] 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 _x_2 − 2 = 0.

The name "transcendental" comes from Latin trānscendere 'to climb over or beyond, surmount',[7] and was first used for the mathematical concept in Leibniz's 1682 paper in which he proved that sin x is not an algebraic function of x.[8] Euler, in the eighteenth century, was probably the first person to define transcendental numbers in the modern sense.[9]

Johann Heinrich Lambert conjectured that e and π were both transcendental numbers in his 1768 paper proving the number π is irrational, and proposed a tentative sketch proof that π is transcendental.[10]

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

L b = ∑ n = 1 ∞ 10 − n ! = 10 − 1 + 10 − 2 + 10 − 6 + 10 − 24 + 10 − 120 + 10 − 720 + 10 − 5040 + 10 − 40320 + … = 0. 1 1 000 1 00000000000000000 1 00000000000000000000000000000000000000000000000000000 … {\displaystyle {\begin{aligned}L_{b}&=\sum _{n=1}^{\infty }10^{-n!}\\[2pt]&=10^{-1}+10^{-2}+10^{-6}+10^{-24}+10^{-120}+10^{-720}+10^{-5040}+10^{-40320}+\ldots \\[4pt]&=0.{\textbf {1}}{\textbf {1}}000{\textbf {1}}00000000000000000{\textbf {1}}00000000000000000000000000000000000000000000000000000\ \ldots \end{aligned}}} ${\begin{aligned}L_{b}&=\sum _{n=1}^{\infty }10^{-n!}\[2pt]&=10^{-1}+10^{-2}+10^{-6}+10^{-24}+10^{-120}+10^{-720}+10^{-5040}+10^{-40320}+\ldots \[4pt]&=0.{\textbf {1}}{\textbf {1}}000{\textbf {1}}00000000000000000{\textbf {1}}00000000000000000000000000000000000000000000000000000\ \ldots \end{aligned}}$

in which the nth digit after the decimal point is 1 if n = k! (k factorial) for some k and 0 otherwise.[12] In other words, the nth digit of this number is 1 only if n is one of 1! = 1, 2! = 2, 3! = 6, 4! = 24, 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 is called the Liouville numbers. Liouville showed that all Liouville numbers are transcendental.[13]

The first number to be proven transcendental without having been specifically constructed for the purpose of proving transcendental numbers' existence 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.[14] 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.[a]Cantor's work established the ubiquity of transcendental numbers.

In 1882 Ferdinand von Lindemann published the first complete proof that π is transcendental. He first proved that ea is transcendental if a is a non-zero algebraic number. Then, since eiπ = −1 is algebraic (see Euler's identity), iπ must be transcendental. But since i is algebraic, π must therefore be transcendental. This approach was generalized by Karl Weierstrass to what is now known as the Lindemann–Weierstrass theorem. The transcendence of π implies that geometric constructions involving compass and straightedge only cannot produce certain results, for example squaring the circle.

In 1900 David Hilbert posed a question about transcendental numbers, Hilbert's seventh problem: If a is an algebraic number that is not 0 or 1, 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).[16]

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 every rational number is the root of some integer polynomial of degree one.[17] 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 5 π {\displaystyle 5\pi } $5\pi$ , π − 3 2 {\displaystyle {\tfrac {\pi -3}{\sqrt {2}}}} ${\tfrac {\pi -3}{\sqrt {2}}}$ , ( π − 3 ) 8 {\displaystyle ({\sqrt {\pi }}-{\sqrt {3}})^{8}} $({\sqrt {\pi }}-{\sqrt {3}})^{8}$ , and π 5 + 7 4 {\displaystyle {\sqrt[{4}]{\pi ^{5}+7}}} ${\sqrt[{4}]{\pi ^{5}+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 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 (x − a)(x − b) = _x_2 − (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, 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 simple 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 have a "simple" structure, and that are not eventually periodic are transcendental[18] (in other words, algebraic irrational roots of at least third degree polynomials do not have apparent pattern in their continued fraction expansions, since eventually periodic continued fractions correspond to quadratic irrationals, see Hermite's problem).

Numbers proven to be transcendental

[edit]

Numbers proven to be transcendental:

The trigonometric functions sin(x), cos(x) and their hyperbolic counterparts, for any nonzero algebraic number x, expressed in radians (by the Lindemann–Weierstrass theorem).
Non-zero results of the inverse trigonometric functions arcsin(x), arccos(x) and their hyperbolic counterparts, for any algebraic number x (by the Lindemann–Weierstrass theorem).
π − 1 arctan ⁡ ( x ) {\displaystyle \pi ^{-1}{\arctan(x)}} $\pi ^{-1}{\arctan(x)}$ , for rational x such that x ∉ { 0 , ± 1 } {\displaystyle x\notin \{0,\pm {1}\}} $x\notin \{0,\pm {1}\}$ .[20]
The Dottie number d (the fixed point of the cosine function) – the unique real solution to the equation cos ⁡ ( x ) = x {\displaystyle \cos(x)=x} $\cos(x)=x$ , where x is in radians (by the Lindemann–Weierstrass theorem).[21]
W ( a ) {\displaystyle W(a)} $W(a)$ if a is algebraic and nonzero, for any branch of the Lambert W function (by the Lindemann–Weierstrass theorem), in particular the omega constant Ω.
W ( r , a ) {\displaystyle W(r,a)} $W(r,a)$ if both a and the order r are algebraic such that a ≠ 0 {\displaystyle a\neq 0} $a\neq 0$ , for any branch of the generalized Lambert W function.[22]
x s {\displaystyle {\sqrt {x}}_{s}} ${\sqrt {x}}_{s}$ , the square super-root of any natural number is either an integer or transcendental (by the Gelfond–Schneider theorem).
Values of the gamma function of rational numbers that are of the form Γ ( n / 2 ) , Γ ( n / 3 ) , Γ ( n / 4 ) {\displaystyle \Gamma (n/2),\Gamma (n/3),\Gamma (n/4)} $\Gamma (n/2),\Gamma (n/3),\Gamma (n/4)$ or Γ ( n / 6 ) {\displaystyle \Gamma (n/6)} $\Gamma (n/6)$ .[23]
Algebraic combinations of π and Γ ( 1 / 3 ) {\displaystyle \Gamma (1/3)} $\Gamma (1/3)$ or of π and Γ ( 1 / 4 ) {\displaystyle \Gamma (1/4)} $\Gamma (1/4)$ such as the lemniscate constant ϖ {\displaystyle \varpi } $\varpi$ (following from their respective algebraic independences).[19]
The values of Beta function B ( a , b ) {\displaystyle \mathrm {B} (a,b)} $\mathrm {B} (a,b)$ if a , b {\displaystyle a,b} $a,b$ and a + b {\displaystyle a+b} $a+b$ are non-integer rational numbers.[24]
The Bessel function of the first kind J ν ( x ) {\displaystyle J_{\nu }(x)} $J_{\nu }(x)$ , its first derivative, and the quotient J ν ′ ( x ) J ν ( x ) {\displaystyle {\tfrac {J'_{\nu }(x)}{J_{\nu }(x)}}} ${\tfrac {J'_{\nu }(x)}{J_{\nu }(x)}}$ are transcendental when ν is rational and x is algebraic and nonzero,[25] and all nonzero roots of J ν ( x ) {\displaystyle J_{\nu }(x)} $J_{\nu }(x)$ and J ν ′ ( x ) {\displaystyle J'_{\nu }(x)} $J'_{\nu }(x)$ are transcendental when ν is rational.[26]
The number π 2 Y 0 ( 2 ) J 0 ( 2 ) − γ {\displaystyle {\tfrac {\pi }{2}}{\tfrac {Y_{0}(2)}{J_{0}(2)}}-\gamma } ${\tfrac {\pi }{2}}{\tfrac {Y_{0}(2)}{J_{0}(2)}}-\gamma$ , where Y α ( x ) {\displaystyle Y_{\alpha }(x)} $Y_{\alpha }(x)$ and J α ( x ) {\displaystyle J_{\alpha }(x)} $J_{\alpha }(x)$ are Bessel functions and γ is the Euler–Mascheroni constant.[27][28]
Values of the Fibonacci zeta function at positive even arguments.[29]
Any Liouville number, in particular: Liouville's constant ∑ k = 1 ∞ 1 10 k ! {\displaystyle \sum _{k=1}^{\infty }{\frac {1}{10^{k!}}}} $\sum _{k=1}^{\infty }{\frac {1}{10^{k!}}}$ .
Numbers with irrationality measure larger than 2, such as the Champernowne constant C 10 {\displaystyle C_{10}} $C_{10}$ and Cahen's constant (by Roth's theorem).
Numbers artificially constructed not to be algebraic periods.[30]
Any non-computable number, in particular: Chaitin's constant.
Constructed irrational numbers which are not simply normal in any base.[31]
Any number for which the digits with respect to some fixed base form a Sturmian word.[32]
The Prouhet–Thue–Morse constant [33] and the related rabbit constant.[34]
The Komornik–Loreti constant.[35]
The paperfolding constant (also named as "Gaussian Liouville number").[36]
The values of the infinite series with fast convergence rate as defined by Y. Gao and J. Gao, such as ∑ n = 1 ∞ 3 n 2 3 n {\displaystyle \sum _{n=1}^{\infty }{\frac {3^{n}}{2^{3^{n}}}}} $\sum _{n=1}^{\infty }{\frac {3^{n}}{2^{3^{n}}}}$ .[37]
Any number of the form ∑ n = 0 ∞ E n ( β r n ) F n ( β r n ) {\displaystyle \sum _{n=0}^{\infty }{\frac {E_{n}(\beta ^{r^{n}})}{F_{n}(\beta ^{r^{n}})}}} $\sum _{n=0}^{\infty }{\frac {E_{n}(\beta ^{r^{n}})}{F_{n}(\beta ^{r^{n}})}}$ (where E n ( z ) {\displaystyle E_{n}(z)} $E_{n}(z)$ , F n ( z ) {\displaystyle F_{n}(z)} $F_{n}(z)$ are polynomials in variables n {\displaystyle n} $n$ and z {\displaystyle z} $z$ , β {\displaystyle \beta } $\beta$ is algebraic and β ≠ 0 {\displaystyle \beta \neq 0} $\beta \neq 0$ , r {\displaystyle r} $r$ is any integer greater than 1).[38]
Numbers of the form ∑ k = 0 ∞ 10 − b k {\displaystyle \sum _{k=0}^{\infty }10^{-b^{k}}} $\sum _{k=0}^{\infty }10^{-b^{k}}$ and ∑ k = 0 ∞ 10 − ⌊ b k ⌋ {\displaystyle \sum _{k=0}^{\infty }10^{-\left\lfloor b^{k}\right\rfloor }} $\sum _{k=0}^{\infty }10^{-\left\lfloor b^{k}\right\rfloor }$ For b > 1 where b ↦ ⌊ b ⌋ {\displaystyle b\mapsto \lfloor b\rfloor } $b\mapsto \lfloor b\rfloor$ is the floor function.[11][39][40][41][42][43]
The numbers α = 3.3003300000... {\displaystyle \alpha =3.3003300000...} $\alpha =3.3003300000...$ and α − 1 = 0.3030000030... {\displaystyle \alpha ^{-1}=0.3030000030...} $\alpha ^{-1}=0.3030000030...$ with only two different decimal digits whose nonzero digit positions are given by the Moser–de Bruijn sequence and its double.[44]
The values of the Rogers-Ramanujan continued fraction R ( q ) {\displaystyle R(q)} $R(q)$ where q ∈ C {\displaystyle {q}\in \mathbb {C} } ${q}\in \mathbb {C}$ is algebraic and 0 < | q | < 1 {\displaystyle 0<|q|<1} $0<|q|<1$ .[45] The lemniscatic values of theta function ∑ n = − ∞ ∞ q n 2 {\displaystyle \sum _{n=-\infty }^{\infty }q^{n^{2}}} $\sum _{n=-\infty }^{\infty }q^{n^{2}}$ (under the same conditions for q {\displaystyle {q}} ${q}$ ) are also transcendental.[46]
j(q) where q ∈ C {\displaystyle {q}\in \mathbb {C} } ${q}\in \mathbb {C}$ is algebraic but not imaginary quadratic (i.e, the exceptional set of this function is the number field whose degree of extension over Q {\displaystyle \mathbb {Q} } $\mathbb {Q}$ is 2).
The constants ϵ k {\displaystyle \epsilon _{k}} $\epsilon _{k}$ and ν k {\displaystyle \nu _{k}} $\nu _{k}$ in the formula for first index of occurrence of Gijswijt's sequence, where k is any integer greater than 1.[47]

Conjectured transcendental numbers

[edit]

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

Most nontrivial combinations of two or more transcendental numbers are themselves not known to be transcendental or even irrational: eπ, e + π, ππ, e e, π e, _π_√2, e _π_2. It has been shown that both e + π and π/e do not satisfy any polynomial equation of degree ≤ 8 and integer coefficients of average size 109.[48][49] At least one of the numbers e e and e _e_2 is transcendental.[50] Since the field of algebraic numbers is algebraically closed and e and π are roots of the polynomial _x_2 − (e + π)x + eπ, at least one of the numbers eπ and e + π is transcendental. Schanuel's conjecture would imply that all of the above numbers are transcendental and algebraically independent.[51]
The Euler–Mascheroni constant γ_:_ In 2010 it has been shown that an infinite list of Euler-Lehmer constants (which includes γ/4) contains at most one algebraic number.[52][53] In 2012 it was shown that at least one of γ and the Gompertz constant δ is transcendental.[54]
The values of the Riemann zeta function ζ(n) at odd positive integers n ≥ 3 {\displaystyle n\geq 3} $n\geq 3$ ; in particular Apéry's constant ζ(3), which is known to be irrational. For the other numbers ζ(5), ζ(7), ζ(9), ... even this is not known. For any non-negative integer k, at least one of the numbers ζ(4_k_+3) and ∑ n = 1 ∞ 1 n 4 k + 3 ( e 2 π n − 1 ) {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{4k+3}(e^{2\pi n}-1)}}} $\sum _{n=1}^{\infty }{\frac {1}{n^{4k+3}(e^{2\pi n}-1)}}$ is transcendental.[55]
The values of the Dirichlet beta function β(n) at even positive integers n ≥ 2 {\displaystyle n\geq 2} $n\geq 2$ ; in particular Catalan's Constant β(2). (None of them are known to be irrational.)[56]
Values of the Gamma Function Γ(1/n) for positive integers n = 5 {\displaystyle n=5} $n=5$ and n ≥ 7 {\displaystyle n\geq 7} $n\geq 7$ are not known to be irrational, let alone transcendental.[57][55] For n ≥ 2 {\displaystyle n\geq 2} $n\geq 2$ at least one the numbers Γ(1/n) and Γ(2/n) is transcendental.[24]
Any number given by some kind of limit that is not obviously algebraic.[55]

Proofs for specific numbers

[edit]

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 _c_0, c_1, ..., cn satisfying the equation: c 0 + c 1 e + c 2 e 2 + ⋯ + c n e n = 0 , c 0 , c n ≠ 0 . {\displaystyle c_{0}+c_{1}e+c_{2}e^{2}+\cdots +c_{n}e^{n}=0,\qquad c_{0},c_{n}\neq 0~.} $c_{0}+c_{1}e+c_{2}e^{2}+\cdots +c_{n}e^{n}=0,\qquad c_{0},c_{n}\neq 0~.$ It is difficult to make use of the integer status of these coefficients when multiplied by a power of the irrational e, but we can absorb those powers into an integral which “mostly” will assume integer values. For a positive integer k, define the polynomial f k ( x ) = x k [ ( x − 1 ) ⋯ ( x − n ) ] k + 1 , {\displaystyle f_{k}(x)=x^{k}\left[(x-1)\cdots (x-n)\right]^{k+1},} ![{\displaystyle f{k}(x)=x^{k}\left[(x-1)\cdots (x-n)\right]^{k+1},}](https://wikimedia.org/api/rest_v1/media/math/render/svg/588cc6364e878ac16d2e26e682c190d1b9aa5fc9)and multiply both sides of the above equation by ∫ 0 ∞ f k ( x ) e − x d x , {\displaystyle \int _{0}^{\infty }f_{k}(x)\,e^{-x}\,\mathrm {d} x\ ,} $\int _{0}^{\infty }f_{k}(x)\,e^{-x}\,\mathrm {d} x\ ,$ to arrive at the equation: c 0 ( ∫ 0 ∞ f k ( x ) e − x d x ) + c 1 e ( ∫ 0 ∞ f k ( x ) e − x d x ) + ⋯ + c n e n ( ∫ 0 ∞ f k ( x ) e − x d x ) = 0 . {\displaystyle c_{0}\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{1}e\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+\cdots +c_{n}e^{n}\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)=0~.} $c_{0}\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{1}e\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+\cdots +c_{n}e^{n}\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)=0~.$

By splitting respective domains of integration, this equation can be written in the form P + Q = 0 {\displaystyle P+Q=0} $P+Q=0$ where P = c 0 ( ∫ 0 ∞ f k ( x ) e − x d x ) + c 1 e ( ∫ 1 ∞ f k ( x ) e − x d x ) + c 2 e 2 ( ∫ 2 ∞ f k ( x ) e − x d x ) + ⋯ + c n e n ( ∫ n ∞ f k ( x ) e − x d x ) Q = c 1 e ( ∫ 0 1 f k ( x ) e − x d x ) + c 2 e 2 ( ∫ 0 2 f k ( x ) e − x d x ) + ⋯ + c n e n ( ∫ 0 n f k ( x ) e − x d x ) {\displaystyle {\begin{aligned}P&=c_{0}\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{1}e\left(\int _{1}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{2}e^{2}\left(\int _{2}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+\cdots +c_{n}e^{n}\left(\int _{n}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)\\Q&=c_{1}e\left(\int _{0}^{1}f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{2}e^{2}\left(\int _{0}^{2}f_{k}(x)e^{-x}\,\mathrm {d} x\right)+\cdots +c_{n}e^{n}\left(\int _{0}^{n}f_{k}(x)e^{-x}\,\mathrm {d} x\right)\end{aligned}}} ${\begin{aligned}P&=c_{0}\left(\int _{0}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{1}e\left(\int _{1}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{2}e^{2}\left(\int _{2}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)+\cdots +c_{n}e^{n}\left(\int _{n}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x\right)\\Q&=c_{1}e\left(\int _{0}^{1}f_{k}(x)e^{-x}\,\mathrm {d} x\right)+c_{2}e^{2}\left(\int _{0}^{2}f_{k}(x)e^{-x}\,\mathrm {d} x\right)+\cdots +c_{n}e^{n}\left(\int _{0}^{n}f_{k}(x)e^{-x}\,\mathrm {d} x\right)\end{aligned}}$ Here P will turn out to be an integer, but more importantly it grows quickly with k.

There are arbitrarily large k such that P k ! {\displaystyle \ {\tfrac {P}{k!}}\ } $\ {\tfrac {P}{k!}}\$ is a non-zero integer.

Proof. Recall the standard integral (case of the Gamma function) ∫ 0 ∞ t j e − t d t = j ! {\displaystyle \int _{0}^{\infty }t^{j}e^{-t}\,\mathrm {d} t=j!} $\int _{0}^{\infty }t^{j}e^{-t}\,\mathrm {d} t=j!$ valid for any natural number j {\displaystyle j} $j$ . More generally,

if g ( t ) = ∑ j = 0 m b j t j {\displaystyle g(t)=\sum _{j=0}^{m}b_{j}t^{j}} $g(t)=\sum _{j=0}^{m}b_{j}t^{j}$ then ∫ 0 ∞ g ( t ) e − t d t = ∑ j = 0 m b j j ! {\displaystyle \int _{0}^{\infty }g(t)e^{-t}\,\mathrm {d} t=\sum _{j=0}^{m}b_{j}j!} $\int _{0}^{\infty }g(t)e^{-t}\,\mathrm {d} t=\sum _{j=0}^{m}b_{j}j!$ .

This would allow us to compute P {\displaystyle P} $P$ exactly, because any term of P {\displaystyle P} $P$ can be rewritten as c a e a ∫ a ∞ f k ( x ) e − x d x = c a ∫ a ∞ f k ( x ) e − ( x − a ) d x = { t = x − a x = t + a d x = d t } = c a ∫ 0 ∞ f k ( t + a ) e − t d t {\displaystyle c_{a}e^{a}\int _{a}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x=c_{a}\int _{a}^{\infty }f_{k}(x)e^{-(x-a)}\,\mathrm {d} x=\left\{{\begin{aligned}t&=x-a\\x&=t+a\\\mathrm {d} x&=\mathrm {d} t\end{aligned}}\right\}=c_{a}\int _{0}^{\infty }f_{k}(t+a)e^{-t}\,\mathrm {d} t} $c_{a}e^{a}\int _{a}^{\infty }f_{k}(x)e^{-x}\,\mathrm {d} x=c_{a}\int _{a}^{\infty }f_{k}(x)e^{-(x-a)}\,\mathrm {d} x=\left\{{\begin{aligned}t&=x-a\\x&=t+a\\\mathrm {d} x&=\mathrm {d} t\end{aligned}}\right\}=c_{a}\int _{0}^{\infty }f_{k}(t+a)e^{-t}\,\mathrm {d} t$ through a change of variables. Hence P = ∑ a = 0 n c a ∫ 0 ∞ f k ( t + a ) e − t d t = ∫ 0 ∞ ( ∑ a = 0 n c a f k ( t + a ) ) e − t d t {\displaystyle P=\sum _{a=0}^{n}c_{a}\int _{0}^{\infty }f_{k}(t+a)e^{-t}\,\mathrm {d} t=\int _{0}^{\infty }{\biggl (}\sum _{a=0}^{n}c_{a}f_{k}(t+a){\biggr )}e^{-t}\,\mathrm {d} t} $P=\sum _{a=0}^{n}c_{a}\int _{0}^{\infty }f_{k}(t+a)e^{-t}\,\mathrm {d} t=\int _{0}^{\infty }{\biggl (}\sum _{a=0}^{n}c_{a}f_{k}(t+a){\biggr )}e^{-t}\,\mathrm {d} t$ That latter sum is a polynomial in t {\displaystyle t} $t$ with integer coefficients, i.e., it is a linear combination of powers t j {\displaystyle t^{j}} $t^{j}$ with integer coefficients. Hence the number P {\displaystyle P} $P$ is a linear combination (with those same integer coefficients) of factorials j ! {\displaystyle j!} $j!$ ; in particular P {\displaystyle P} $P$ is an integer.

Smaller factorials divide larger factorials, so the smallest j ! {\displaystyle j!} $j!$ occurring in that linear combination will also divide the whole of P {\displaystyle P} $P$ . We get that j ! {\displaystyle j!} $j!$ from the lowest power t j {\displaystyle t^{j}} $t^{j}$ term appearing with a nonzero coefficient in ∑ a = 0 n c a f k ( t + a ) {\displaystyle \textstyle \sum _{a=0}^{n}c_{a}f_{k}(t+a)} $\textstyle \sum _{a=0}^{n}c_{a}f_{k}(t+a)$ , but this smallest exponent j {\displaystyle j} $j$ is also the multiplicity of t = 0 {\displaystyle t=0} $t=0$ as a root of this polynomial. f k ( x ) {\displaystyle f_{k}(x)} $f_{k}(x)$ is chosen to have multiplicity k {\displaystyle k} $k$ of the root x = 0 {\displaystyle x=0} $x=0$ and multiplicity k + 1 {\displaystyle k+1} $k+1$ of the roots x = a {\displaystyle x=a} $x=a$ for a = 1 , … , n {\displaystyle a=1,\dots ,n} $a=1,\dots ,n$ , so that smallest exponent is t k {\displaystyle t^{k}} $t^{k}$ for f k ( t ) {\displaystyle f_{k}(t)} $f_{k}(t)$ and t k + 1 {\displaystyle t^{k+1}} $t^{k+1}$ for f k ( t + a ) {\displaystyle f_{k}(t+a)} $f_{k}(t+a)$ with a > 0 {\displaystyle a>0} $a>0$ . Therefore k ! {\displaystyle k!} $k!$ divides P {\displaystyle P} $P$ .

To establish the last claim in the lemma, that P {\displaystyle P} $P$ is nonzero, it is sufficient to prove that k + 1 {\displaystyle k+1} $k+1$ does not divide P {\displaystyle P} $P$ . To that end, let k + 1 {\displaystyle k+1} $k+1$ be any prime larger than n {\displaystyle n} $n$ and | c 0 | {\displaystyle |c_{0}|} $|c_{0}|$ . We know from the above that ( k + 1 ) ! {\displaystyle (k+1)!} $(k+1)!$ divides each of c a ∫ 0 ∞ f k ( t + a ) e − t d t {\displaystyle \textstyle c_{a}\int _{0}^{\infty }f_{k}(t+a)e^{-t}\,\mathrm {d} t} $\textstyle c_{a}\int _{0}^{\infty }f_{k}(t+a)e^{-t}\,\mathrm {d} t$ for 1 ⩽ a ⩽ n {\displaystyle 1\leqslant a\leqslant n} $1\leqslant a\leqslant n$ , so in particular all of those are divisible by k + 1 {\displaystyle k+1} $k+1$ . It comes down to the first term c 0 ∫ 0 ∞ f k ( t ) e − t d t {\displaystyle \textstyle c_{0}\int _{0}^{\infty }f_{k}(t)e^{-t}\,\mathrm {d} t} $\textstyle c_{0}\int _{0}^{\infty }f_{k}(t)e^{-t}\,\mathrm {d} t$ . We have (see falling and rising factorials) f k ( t ) = t k [ ( t − 1 ) ⋯ ( t − n ) ] k + 1 = [ ( − 1 ) n ( n ! ) ] k + 1 t k + higher degree terms {\displaystyle f_{k}(t)=t^{k}{\bigl [}(t-1)\cdots (t-n){\bigr ]}^{k+1}={\bigl [}(-1)^{n}(n!){\bigr ]}^{k+1}t^{k}+{\text{higher degree terms}}} $f_{k}(t)=t^{k}{\bigl [}(t-1)\cdots (t-n){\bigr ]}^{k+1}={\bigl [}(-1)^{n}(n!){\bigr ]}^{k+1}t^{k}+{\text{higher degree terms}}$ and those higher degree terms all give rise to factorials ( k + 1 ) ! {\displaystyle (k+1)!} $(k+1)!$ or larger. Hence P ≡ c 0 ∫ 0 ∞ f k ( t ) e − t d t ≡ c 0 [ ( − 1 ) n ( n ! ) ] k + 1 k ! ( mod ( k + 1 ) ) {\displaystyle P\equiv c_{0}\int _{0}^{\infty }f_{k}(t)e^{-t}\,\mathrm {d} t\equiv c_{0}{\bigl [}(-1)^{n}(n!){\bigr ]}^{k+1}k!{\pmod {(k+1)}}} $P\equiv c_{0}\int _{0}^{\infty }f_{k}(t)e^{-t}\,\mathrm {d} t\equiv c_{0}{\bigl [}(-1)^{n}(n!){\bigr ]}^{k+1}k!{\pmod {(k+1)}}$ That right hand side is a product of nonzero integer factors less than the prime k + 1 {\displaystyle k+1} $k+1$ , therefore that product is not divisible by k + 1 {\displaystyle k+1} $k+1$ , and the same holds for P {\displaystyle P} $P$ ; in particular P {\displaystyle P} $P$ cannot be zero.

For sufficiently large k, | Q k ! | < 1 {\displaystyle \left|{\tfrac {Q}{k!}}\right|<1} $\left|{\tfrac {Q}{k!}}\right|<1$ .

Proof. Note that

f k e − x = x k [ ( x − 1 ) ( x − 2 ) ⋯ ( x − n ) ] k + 1 e − x = ( x ( x − 1 ) ⋯ ( x − n ) ) k ⋅ ( ( x − 1 ) ⋯ ( x − n ) e − x ) = u ( x ) k ⋅ v ( x ) {\displaystyle {\begin{aligned}f_{k}e^{-x}&=x^{k}\left[(x-1)(x-2)\cdots (x-n)\right]^{k+1}e^{-x}\\&=\left(x(x-1)\cdots (x-n)\right)^{k}\cdot \left((x-1)\cdots (x-n)e^{-x}\right)\\&=u(x)^{k}\cdot v(x)\end{aligned}}} ${\begin{aligned}f_{k}e^{-x}&=x^{k}\left[(x-1)(x-2)\cdots (x-n)\right]^{k+1}e^{-x}\\&=\left(x(x-1)\cdots (x-n)\right)^{k}\cdot \left((x-1)\cdots (x-n)e^{-x}\right)\\&=u(x)^{k}\cdot v(x)\end{aligned}}$

where u(x), v(x) are continuous functions of x for all x, so are bounded on the interval [0, _n_]. That is, there are constants G, H > 0 such that

| f k e − x | ≤ | u ( x ) | k ⋅ | v ( x ) | < G k H for 0 ≤ x ≤ n . {\displaystyle \ \left|f_{k}e^{-x}\right|\leq |u(x)|^{k}\cdot |v(x)|<G^{k}H\quad {\text{ for }}0\leq x\leq n~.} $\ \left|f_{k}e^{-x}\right|\leq |u(x)|^{k}\cdot |v(x)|<G^{k}H\quad {\text{ for }}0\leq x\leq n~.$

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

| ∫ 0 n f k e − x d x | ≤ ∫ 0 n | f k e − x | d x ≤ ∫ 0 n G k H d x = n G k H . {\displaystyle \left|\int _{0}^{n}f_{k}e^{-x}\ \mathrm {d} \ x\right|\leq \int _{0}^{n}\left|f_{k}e^{-x}\right|\ \mathrm {d} \ x\leq \int _{0}^{n}G^{k}H\ \mathrm {d} \ x=nG^{k}H~.} $\left|\int _{0}^{n}f_{k}e^{-x}\ \mathrm {d} \ x\right|\leq \int _{0}^{n}\left|f_{k}e^{-x}\right|\ \mathrm {d} \ x\leq \int _{0}^{n}G^{k}H\ \mathrm {d} \ x=nG^{k}H~.$

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

| Q | < G k ⋅ n H ( | c 1 | e + | c 2 | e 2 + ⋯ + | c n | e n ) = G k ⋅ M , {\displaystyle |Q|<G^{k}\cdot nH\left(|c_{1}|e+|c_{2}|e^{2}+\cdots +|c_{n}|e^{n}\right)=G^{k}\cdot M\ ,} $|Q|<G^{k}\cdot nH\left(|c_{1}|e+|c_{2}|e^{2}+\cdots +|c_{n}|e^{n}\right)=G^{k}\cdot M\ ,$

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

| Q k ! | < M ⋅ G k k ! → 0 as k → ∞ , {\displaystyle \ \left|{\frac {Q}{k!}}\right|<M\cdot {\frac {G^{k}}{k!}}\to 0\quad {\text{ as }}k\to \infty \ ,} $\ \left|{\frac {Q}{k!}}\right|<M\cdot {\frac {G^{k}}{k!}}\to 0\quad {\text{ as }}k\to \infty \ ,$

finishing the proof of this lemma.

Choosing a value of k that satisfies both lemmas leads to a non-zero integer ( P k ! ) {\displaystyle \left({\tfrac {P}{k!}}\right)} $\left({\tfrac {P}{k!}}\right)$ added to a vanishingly small quantity ( Q k ! ) {\displaystyle \left({\tfrac {Q}{k!}}\right)} $\left({\tfrac {Q}{k!}}\right)$ being equal to zero: an impossibility. It follows that the original assumption, that e can satisfy a polynomial equation with integer coefficients, is also impossible; that is, e is transcendental.

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.

Transcendental number theory, the study of questions related to transcendental numbers
Transcendental element, generalization of transcendental numbers in abstract algebra
Gelfond–Schneider theorem
Diophantine approximation
Periods, a countable set of numbers (including all algebraic and some transcendental numbers) which may be defined by integral equations.
Hartmanis–Stearns conjecture, a conjectural transcendence criterion based on complexity of computing the number's expansion

Set inclusions between the natural numbers ( N {\displaystyle \mathbb {N} } $\mathbb {N}$ ), the integers ( Z {\displaystyle \mathbb {Z} } $\mathbb {Z}$ ), the rational numbers ( Q {\displaystyle \mathbb {Q} } $\mathbb {Q}$ ), the real numbers ( R {\displaystyle \mathbb {R} } $\mathbb {R}$ ), and the complex numbers ( C {\displaystyle \mathbb {C} } $\mathbb {C}$ )

^ 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.[15]
^ Pickover, Cliff. "The 15 most famous transcendental numbers". sprott.physics.wisc.edu. Retrieved 2020-01-23.
^ Shidlovskii, Andrei B. (June 2011). Transcendental Numbers. Walter de Gruyter. p. 1. ISBN 9783110889055.
^ a b Bunday, B. D.; Mulholland, H. (20 May 2014). Pure Mathematics for Advanced Level. Butterworth-Heinemann. ISBN 978-1-4831-0613-7. Retrieved 21 March 2021.
^ Baker, A. (1964). "On Mahler's classification of transcendental numbers". Acta Mathematica. 111: 97–120. doi:10.1007/bf02391010. S2CID 122023355.
^ Heuer, Nicolaus; Loeh, Clara (1 November 2019). "Transcendental simplicial volumes". arXiv:1911.06386 [math.GT].
^ "Real number". Encyclopædia Britannica. mathematics. Retrieved 2020-08-11.
^ "transcendental". Oxford English Dictionary. s.v.
^ Leibniz, Gerhardt & Pertz 1858, pp. 97–98; Bourbaki 1994, p. 74
^ Erdős & Dudley 1983
^ Lambert 1768
^ a b Kempner 1916
^ "Weisstein, Eric W. "Liouville's Constant", MathWorld".
^ Liouville 1851
^ Cantor 1874; Gray 1994
^ Cantor 1878, p. 254
^ Baker, Alan (1998). J.J. O'Connor and E.F. Robertson. www-history.mcs.st-andrews.ac.uk (biographies). The MacTutor History of Mathematics archive. St. Andrew's, Scotland: University of St. Andrew's.
^ Hardy 1979
^ Adamczewski & Bugeaud 2005
^ a b Nesterenko, Yu V (1996-10-31). "Modular functions and transcendence questions". Sbornik: Mathematics. 187 (9): 1319–1348. Bibcode:1996SbMat.187.1319N. doi:10.1070/SM1996v187n09ABEH000158. ISSN 1064-5616.
^ Weisstein, Eric W. "Transcendental Number". mathworld.wolfram.com. Retrieved 2023-08-09.
^ Weisstein, Eric W. "Dottie Number". Wolfram MathWorld. Wolfram Research, Inc. Retrieved 23 July 2016.
^ Mező, István; Baricz, Árpád (June 22, 2015). "On the generalization of the Lambert W function". arXiv:1408.3999 [math.CA].
^ Chudnovsky, G. (1984). Contributions to the theory of transcendental numbers. Mathematical surveys and monographs (in English and Russian). Providence, R.I: American Mathematical Society. ISBN 978-0-8218-1500-7.
^ a b Waldschmidt, Michel (September 7, 2005). "Transcendence of Periods: The State of the Art" (PDF). webusers.imj-prg.fr.
^ Siegel, Carl L. (2014). "Über einige Anwendungen diophantischer Approximationen: Abhandlungen der Preußischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse 1929, Nr. 1". On Some Applications of Diophantine Approximations (in German). Scuola Normale Superiore. pp. 81–138. doi:10.1007/978-88-7642-520-2_2. ISBN 978-88-7642-520-2.
^ Lorch, Lee; Muldoon, Martin E. (1995). "Transcendentality of zeros of higher dereivatives of functions involving Bessel functions". International Journal of Mathematics and Mathematical Sciences. 18 (3): 551–560. doi:10.1155/S0161171295000706.
^ Mahler, Kurt; Mordell, Louis Joel (1968-06-04). "Applications of a theorem by A. B. Shidlovski". Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences. 305 (1481): 149–173. Bibcode:1968RSPSA.305..149M. doi:10.1098/rspa.1968.0111. S2CID 123486171.
^ Lagarias, Jeffrey C. (2013-07-19). "Euler's constant: Euler's work and modern developments". Bulletin of the American Mathematical Society. 50 (4): 527–628. arXiv:1303.1856. doi:10.1090/S0273-0979-2013-01423-X. ISSN 0273-0979.
^ Murty, M. Ram (2013), "The Fibonacci zeta function", in Prasad, D.; Rajan, C. S.; Sankaranarayanan, A.; Sengupta, J. (eds.), Automorphic representations and L-functions, Tata Institute of Fundamental Research Studies in Mathematics, vol. 22, Tata Institute of Fundamental Research, pp. 409–425, ISBN 978-93-80250-49-6, MR 3156859
^ Yoshinaga, Masahiko (2008-05-03). "Periods and elementary real numbers". arXiv:0805.0349 [math.AG].
^ Bugeaud 2012, p. 113.
^ Pytheas Fogg 2002
^ Mahler 1929; Allouche & Shallit 2003, p. 387
^ Weisstein, Eric W. "Rabbit Constant". mathworld.wolfram.com. Retrieved 2023-08-09.
^ Allouche, Jean-Paul; Cosnard, Michel (2000), "The Komornik–Loreti constant is transcendental", American Mathematical Monthly, 107 (5): 448–449, doi:10.2307/2695302, JSTOR 2695302, MR 1763399
^ "A143347 - OEIS". oeis.org. Retrieved 2023-08-09.
^ "A140654 - OEIS". oeis.org. Retrieved 2023-08-12.
^ Kurosawa, Takeshi (2007-03-01). "Transcendence of certain series involving binary linear recurrences". Journal of Number Theory. 123 (1): 35–58. doi:10.1016/j.jnt.2006.05.019. ISSN 0022-314X.
^ Adamczewski, Boris (March 2013). "The Many Faces of the Kempner Number". arXiv:1303.1685 [math.NT].
^ Shallit 1996
^ Adamczewski, Boris; Rivoal, Tanguy (2009). "Irrationality measures for some automatic real numbers". Mathematical Proceedings of the Cambridge Philosophical Society. 147 (3): 659–678. Bibcode:2009MPCPS.147..659A. doi:10.1017/S0305004109002643. ISSN 1469-8064.
^ Loxton 1988
^ Allouche & Shallit 2003, pp. 385, 403
^ Blanchard & Mendès France 1982
^ Duverney, Daniel; Nishioka, Keiji; Nishioka, Kumiko; Shiokawa, Iekata (1997). "Transcendence of Rogers-Ramanujan continued fraction and reciprocal sums of Fibonacci numbers". Proceedings of the Japan Academy, Series A, Mathematical Sciences. 73 (7): 140–142. doi:10.3792/pjaa.73.140. ISSN 0386-2194.
^ Bertrand, Daniel (1997). "Theta functions and transcendence". The Ramanujan Journal. 1 (4): 339–350. doi:10.1023/A:1009749608672. S2CID 118628723.
^ van de Pol, Levi (2022). "The first occurrence of a number in Gijswijt's sequence". arXiv:2209.04657 [math.CO].
^ Bailey, David H. (1988). "Numerical Results on the Transcendence of Constants Involving pi,e\pi, epi,e, and Euler's Constant". Mathematics of Computation. 50 (181): 275–281. doi:10.2307/2007931. ISSN 0025-5718. JSTOR 2007931.
^ Weisstein, Eric W. "e". mathworld.wolfram.com. Retrieved 2023-08-12.
^ Brownawell, W. Dale (1974-02-01). "The algebraic independence of certain numbers related by the exponential function". Journal of Number Theory. 6 (1): 22–31. Bibcode:1974JNT.....6...22B. doi:10.1016/0022-314X(74)90005-5. ISSN 0022-314X.
^ Waldschmidt, Michel (2021). "Schanuel's Conjecture: algebraic independence of transcendental numbers" (PDF).
^ Murty, M. Ram; Saradha, N. (2010-12-01). "Euler–Lehmer constants and a conjecture of Erdös". Journal of Number Theory. 130 (12): 2671–2682. doi:10.1016/j.jnt.2010.07.004. ISSN 0022-314X.
^ Murty, M. Ram; Zaytseva, Anastasia (2013-01-01). "Transcendence of generalized Euler constants". The American Mathematical Monthly. 120 (1): 48–54. doi:10.4169/amer.math.monthly.120.01.048. ISSN 0002-9890. S2CID 20495981.
^ Rivoal, Tanguy (2012). "On the arithmetic nature of the values of the gamma function, Euler's constant, and Gompertz's constant". Michigan Mathematical Journal. 61 (2): 239–254. doi:10.1307/mmj/1339011525. ISSN 0026-2285.
^ a b c Waldschmidt, Michel (2022). "Transcendental Number Theory: recent results and open problems". Michel Waldschmidt.
^ Rivoal, T.; Zudilin, W. (2003-08-01). "Diophantine properties of numbers related to Catalan's constant". Mathematische Annalen. 326 (4): 705–721. doi:10.1007/s00208-003-0420-2. hdl:1959.13/803688. ISSN 1432-1807. S2CID 59328860.
^ "Mathematical constants". Mathematics (general). Cambridge University Press. Retrieved 2022-09-22.

Adamczewski, Boris; Bugeaud, Yann (2005). "On the complexity of algebraic numbers, II. Continued fractions". Acta Mathematica. 195 (1): 1–20. arXiv:math/0511677. Bibcode:2005math.....11677A. doi:10.1007/BF02588048. S2CID 15521751.
Allouche, J.-P. [in French]; Shallit, J. (2003). Automatic Sequences: Theory, applications, generalizations. Cambridge University Press. ISBN 978-0-521-82332-6. Zbl 1086.11015.
Baker, A. (1990). Transcendental Number Theory (paperback ed.). Cambridge University Press. ISBN 978-0-521-20461-3. Zbl 0297.10013.
Blanchard, André; Mendès France, Michel (1982). "Symétrie et transcendance". Bulletin des Sciences Mathématiques. 106 (3): 325–335. MR 0680277.
Bourbaki, N. (1994). Elements of the History of Mathematics. Springer. ISBN 9783540647676 – via Internet Archive.
Bugeaud, Yann (2012). Distribution modulo one and Diophantine approximation. Cambridge Tracts in Mathematics. Vol. 193. Cambridge University Press. ISBN 978-0-521-11169-0. Zbl 1260.11001.
Burger, Edward B.; Tubbs, Robert (2004). Making transcendence transparent. An intuitive approach to classical transcendental number theory. Springer. ISBN 978-0-387-21444-3. Zbl 1092.11031.
Calude, Cristian S. (2002). Information and Randomness: An algorithmic perspective. Texts in Theoretical Computer Science (2nd rev. and ext. ed.). Springer. ISBN 978-3-540-43466-5. Zbl 1055.68058.
Cantor, G. (1874). "Über eine Eigenschaft des Inbegriffes aller reelen algebraischen Zahlen". J. Reine Angew. Math. 77: 258–262.
Cantor, G. (1878). "Ein Beitrag zur Mannigfaltigkeitslehre". J. Reine Angew. Math. 84: 242–258.
Chudnovsky, G.V. (1984). Contributions to the Theory of Transcendental Numbers. American Mathematical Society. ISBN 978-0-8218-1500-7.
Davison, J. Les; Shallit, J.O. (1991). "Continued fractions for some alternating series". Monatshefte für Mathematik. 111 (2): 119–126. doi:10.1007/BF01332350. S2CID 120003890.
Erdős, P.; Dudley, U. (1983). "Some Remarks and Problems in Number Theory Related to the Work of Euler" (PDF). Mathematics Magazine. 56 (5): 292–298. CiteSeerX 10.1.1.210.6272. doi:10.2307/2690369. JSTOR 2690369.
Gelfond, A. (1960) [1956]. Transcendental and Algebraic Numbers (reprint ed.). Dover.
Gray, Robert (1994). "Georg Cantor and transcendental numbers". Amer. Math. Monthly. 101 (9): 819–832. doi:10.2307/2975129. JSTOR 2975129. Zbl 0827.01004 – via maa.org.
Hardy, G.H. (1979). An Introduction to the Theory of Numbers (5th ed.). Oxford: Clarendon Press. p. 159. ISBN 0-19-853171-0.
Higgins, Peter M. (2008). Number Story. Copernicus Books. ISBN 978-1-84800-001-8.
Hilbert, D. (1893). "Über die Transcendenz der Zahlen e und π {\displaystyle \pi } $\pi$ ". Mathematische Annalen. 43 (2–3): 216–219. doi:10.1007/BF01443645. S2CID 179177945.
Kempner, Aubrey J. (1916). "On Transcendental Numbers". Transactions of the American Mathematical Society. 17 (4): 476–482. doi:10.2307/1988833. JSTOR 1988833.
Lambert, J.H. (1768). "Mémoire sur quelques propriétés remarquables des quantités transcendantes, circulaires et logarithmiques". Mémoires de l'Académie Royale des Sciences de Berlin: 265–322.
Leibniz, G.W.; Gerhardt, Karl Immanuel; Pertz, Georg Heinrich (1858). Leibnizens mathematische Schriften. Vol. 5. A. Asher & Co. pp. 97–98 – via Internet Archive.
le Lionnais, F. (1979). Les nombres remarquables. Hermann. ISBN 2-7056-1407-9.
le Veque, W.J. (2002) [1956]. Topics in Number Theory. Vol. I and II. Dover. ISBN 978-0-486-42539-9 – via Internet Archive.
Liouville, J. (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" (PDF). J. Math. Pures Appl. 16: 133–142.
Loxton, J.H. (1988). "13. Automata and transcendence". In Baker, A. (ed.). New Advances in Transcendence Theory. Cambridge University Press. pp. 215–228. ISBN 978-0-521-33545-4. Zbl 0656.10032.
Mahler, K. (1929). "Arithmetische Eigenschaften der Lösungen einer Klasse von Funktionalgleichungen". Math. Annalen. 101: 342–366. doi:10.1007/bf01454845. JFM 55.0115.01. S2CID 120549929.
Mahler, K. (1937). "Arithmetische Eigenschaften einer Klasse von Dezimalbrüchen". Proc. Konin. Neder. Akad. Wet. Ser. A (40): 421–428.
Mahler, K. (1976). Lectures on Transcendental Numbers. Lecture Notes in Mathematics. Vol. 546. Springer. ISBN 978-3-540-07986-6. Zbl 0332.10019.
Natarajan, Saradha [in French]; Thangadurai, Ravindranathan (2020). Pillars of Transcendental Number Theory. Springer Verlag. ISBN 978-981-15-4154-4.
Pytheas Fogg, N. (2002). Berthé, V.; Ferenczi, Sébastien; Mauduit, Christian; Siegel, A. (eds.). Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics. Vol. 1794. Springer. ISBN 978-3-540-44141-0. Zbl 1014.11015.
Shallit, J. (15–26 July 1996). "Number theory and formal languages". In Hejhal, D.A.; Friedman, Joel; Gutzwiller, M.C.; Odlyzko, A.M. (eds.). Emerging Applications of Number Theory. IMA Summer Program. The IMA Volumes in Mathematics and its Applications. Vol. 109. Minneapolis, MN: Springer (published 1999). pp. 547–570. ISBN 978-0-387-98824-5.

English Wikisource has original text related to this article:

Weisstein, Eric W. "Transcendental Number". MathWorld.
Weisstein, Eric W. "Liouville Number". MathWorld.
Weisstein, Eric W. "Liouville's Constant". MathWorld.
"Proof that e is transcendental". planetmath.org.
"Proof that the Liouville constant is transcendental". deanlmoore.com. Retrieved 2018-11-12.
Fritsch, R. (29 March 1988). Transzendenz von e im Leistungskurs? [_Transcendence of e in advanced courses?_] (PDF). Rahmen der 79. Hauptversammlung des Deutschen Vereins zur Förderung des mathematischen und naturwissenschaftlichen Unterrichts [79th Annual, General Meeting of the German Association for the Promotion of Mathematics and Science Education]. Der mathematische und naturwissenschaftliche Unterricht (in German). Vol. 42. Kiel, DE (published 1989). pp. 75–80 (presentation), 375–376 (responses). Archived from the original (PDF) on 2011-07-16 – via University of Munich (mathematik.uni-muenchen.de ). — Proof that e is transcendental, in German.
Fritsch, R. (2003). "Hilberts Beweis der Transzendenz der Ludolphschen Zahl π" (PDF). Дифференциальная геометрия многообразий фигур (in German). 34: 144–148. Archived from the original (PDF) on 2011-07-16 – via University of Munich (mathematik.uni-muenchen.de/~fritsch).