Transcendental number explained

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 .[1] [2] The quality of a number being transcendental is called transcendence.

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 form 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.[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 non-rational, 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 . The golden ratio (denoted

\varphi

or

\phi

) is another irrational number that is not transcendental, as it is a root of the polynomial equation .

History

The name "transcendental" comes,[7] 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 proof that is transcendental.

\begin L_b &= \sum_^\infty 10^ \\[2pt] &= 10^ + 10^ + 10^ + 10^ + 10^ + 10^ + 10^ + 10^ + \ldots \\[4pt] &= 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.[8] 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 that is transcendental. 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, 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 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).[9]

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

5\pi

,

\tfrac{\pi-3}{\sqrt{2}}

,

(\sqrt{\pi}-\sqrt{3})8

, and

\sqrt[4]{\pi5+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 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 have a "simple" structure, and that are not eventually periodic are transcendental (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

Numbers proven to be transcendental:

2\sqrt{2

} (by the Gelfond–Schneider theorem).

\pi+\beta1ln(a1)++\betanln(an)

are transcendental, where

\betaj

are algebraic for all

1\leqj\leqn

and

aj

are non-zero algebraic for all

1\leqj\leqn

(by Baker's theorem).

\pi-1{\arctan(x)}

, for rational such that

x\notin\{0,\pm{1}\}

.[11]

a0

, for any branch of the generalized Lambert W function.[13]

\Gamma\left(\tfrac16\right),\Gamma\left(\tfrac14\right),\Gamma\left(\tfrac13\right),\Gamma\left(\tfrac23\right),\Gamma\left(\tfrac34\right)

and

\Gamma\left(\tfrac56\right)

.[14]

\varpi

(following from their respective algebraic independences).

\Beta(a,b)

(in which

a,b

and

a+b

are non-integer rational numbers).[15]

\tfrac{J'\nu(x)}{J\nu(x)}

are transcendental when is rational and is algebraic and nonzero,[16] and all nonzero roots of and are transcendental when is rational.[17]

\tfrac{\pi}{2}\tfrac{Y0(2)}{J0(2)}-\gamma

, where and are Bessel functions and is the Euler–Mascheroni constant.[18] [19]

C=0.64341...

.
infty
\sum
n=1
3n
3n
2
.[23]
infty
\sum
n=0
-2n
10

=0.bf{1}bf{1}0bf{1}000bf{1}0000000bf{1}\ldots

which also holds by replacing 10 with any algebraic number .

infty
\sum
k=0
-\left\lfloor\betak\right\rfloor
10

;

where

\beta\mapsto\lfloor\beta\rfloor

is the floor function.[24]
infty
\sum
n=0
rn
E)
n(\beta
rn
F)
n(\beta
(where

En(z)

,

Fn(z)

are polynomials in variables

n

and

z

,

\beta

is algebraic and

\beta0

,

r

is any integer greater than 1).[25]

\alpha=3.3003300000...

and

\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.

R(q)

where

{{q}}\inC

is algebraic and

0<|q|<1

.[26] The lemniscatic values of theta function
infty
\sum
n=-infty
n2
q
(under the same conditions for

{{q}}

) are also transcendental.[27]

{{q}}\inC

is algebraic but not imaginary quadratic (i.e, the exceptional set of this function is the number field whose degree of extension over

Q

is 2).

\epsilonk

and

\nuk

in the formula for first index of occurence of Gijswijt's sequence, where k is any integer greater than 1.[28]

Possible transcendental numbers

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

n\geq3

; in particular Apéry's constant, which is known to be irrational. For the other numbers even this is not known.

n\geq2

; in particular Catalan's Constant . (none of them are known to be irrational).[34]

n=5

and

n\geq7

are not known to be irrational, let alone transcendental.[35] It is however known that for

n\geq3

at least one the numbers and is transcendental.

Related conjectures:

Proofs for specific numbers

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 satisfying the equation: c_ + c_e + c_ e^ + \cdots + c_ e^ = 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, but we can absorb those powers into an integral which “mostly” will assume integer values. For a positive integer, define the polynomial f_k(x) = x^ \left [(x-1)\cdots(x-n) \right ]^,and multiply both sides of the above equation by \int^_ f_k(x) \, e^\, \mathrmx\,to arrive at the equation: c_0 \left (\int^_ f_k(x) e^ \,\mathrmx \right) + c_1 e \left(\int^_ f_k(x) e^ \,\mathrmx \right) + \cdots + c_e^ \left(\int^_ f_k(x) e^ \,\mathrmx \right) = 0 ~.

By splitting respective domains of integration, this equation can be written in the form P + Q = 0where \begin P &= c_ \left(\int^_ f_k(x) e^ \,\mathrmx \right) + c_ e \left(\int^_ f_k(x) e^ \,\mathrmx \right) + c_ e^ \left(\int^_ f_k(x) e^ \,\mathrmx \right) + \cdots + c_ e^ \left(\int^_ f_k(x) e^ \,\mathrmx \right) \\ Q &= c_ e \left(\int^_ f_k(x) e^ \,\mathrmx \right) + c_e^ \left(\int^_ f_k(x) e^ \,\mathrmx \right) + \cdots+c_ e^ \left(\int^_ f_k(x) e^ \,\mathrmx \right) \endHere will turn out to be an integer, but more importantly it grows quickly with .

Lemma 1

There are arbitrarily large such that

\tfrac{P}{k!}

is a non-zero integer.

j

. More generally,

if

g(t)=

m
\sum
j=0

bjtj

then
infty
\int
0

g(t)e-tdt=

m
\sum
j=0

bjj!

.

This would allow us to compute

P

exactly, because any term of

P

can be rewritten as c_ e^ \int^_ f_k(x) e^ \,\mathrmx = c_ \int^_ f_k(x) e^ \,\mathrmx = \left\ = c_a \int_0^\infty f_k(t+a) e^ \,\mathrmtthrough a change of variables. Hence P = \sum_^n c_a \int_0^\infty f_k(t+a) e^ \,\mathrmt = \int_0^\infty \biggl(\sum_^n c_a f_k(t+a) \biggr) e^ \,\mathrmtThat latter sum is a polynomial in

t

with integer coefficients, i.e., it is a linear combination of powers

tj

with integer coefficients. Hence the number

P

is a linear combination (with those same integer coefficients) of factorials

j!

; in particular

P

is an integer.

Smaller factorials divide larger factorials, so the smallest

j!

occurring in that linear combination will also divide the whole of

P

. We get that

j!

from the lowest power

tj

term appearing with a nonzero coefficient in
n
style\sum
a=0

cafk(t+a)

, but this smallest exponent

j

is also the multiplicity of

t=0

as a root of this polynomial.

fk(x)

is chosen to have multiplicity

k

of the root

x=0

and multiplicity

k+1

of the roots

x=a

for

a=1,...,n

, so that smallest exponent is

tk

for

fk(t)

and

tk+1

for

fk(t+a)

with

a>0

. Therefore

k!

divides

P

.

To establish the last claim in the lemma, that

P

is nonzero, it is sufficient to prove that

k+1

does not divide

P

. To that end, let

k+1

be any prime larger than

n

and

|c0|

. We know from the above that

(k+1)!

divides each of

styleca

infty
\int
0

fk(t+a)e-tdt

for

1\leqslanta\leqslantn

, so in particular all of those are divisible by

k+1

. It comes down to the first term

stylec0

infty
\int
0

fk(t)e-tdt

. We have (see falling and rising factorials) f_k(t) = t^k \bigl[(t-1) \cdots (t-n) \bigr]^ = \bigl[(-1)^{n}(n!) \bigr]^ t^k + \textand those higher degree terms all give rise to factorials

(k+1)!

or larger. Hence P \equiv c_0 \int_0^\infty f_k(t) e^ \,\mathrmt \equiv c_0 \bigl[(-1)^{n}(n!) \bigr]^ k! \pmodThat right hand side is a product of nonzero integer factors less than the prime

k+1

, therefore that product is not divisible by

k+1

, and the same holds for

P

; in particular

P

cannot be zero.

Lemma 2

For sufficiently large,

\left|\tfrac{Q}{k!}\right|<1

.

Proof. Note that

\begin f_k e^ &= x^ \left[(x-1)(x-2) \cdots (x-n) \right]^ 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 are continuous functions of for all, so are bounded on the interval . That is, there are constants 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 is bounded, the worst case being

\left| \int_^ f_ e^\ \mathrm\ x \right| \leq \int_^ \left| f_ e^ \right| \ \mathrm\ x \leq \int_^G^k H\ \mathrm\ x = n G^k H ~.

It is now possible to bound the sum as well:

|Q| < G^ \cdot n H \left(|c_1|e+|c_2|e^2 + \cdots+|c_n|e^ \right) = G^k \cdot M\,

where is a constant not depending on . It follows that

\ \left| \frac \right| < M \cdot \frac \to 0 \quad \text k \to \infty\,

finishing the proof of this lemma.

Conclusion

Choosing a value of that satisfies both lemmas leads to a non-zero integer

\left(\tfrac{P}{k!}\right)

added to a vanishingly small quantity

\left(\tfrac{Q}{k!}\right)

being equal to zero: 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

Sources

External links

Notes and References

  1. Web site: Cliff . Pickover . The 15 most famous transcendental numbers . sprott.physics.wisc.edu . 2020-01-23.
  2. Book: Shidlovskii . Andrei B. . June 2011 . Transcendental Numbers . Walter de Gruyter . 9783110889055 . 1.
  3. Book: Bunday . B. D. . Mulholland . H. . Pure Mathematics for Advanced Level . 20 May 2014 . Butterworth-Heinemann . 978-1-4831-0613-7 . 21 March 2021 . en.
  4. Baker . A. . On Mahler's classification of transcendental numbers . Acta Mathematica . 1964 . 111 . 97–120 . 10.1007/bf02391010 . 122023355 . free .
  5. Heuer . Nicolaus . Loeh . Clara . Transcendental simplicial volumes . 1 November 2019 . math.GT . 1911.06386 .
  6. Encyclopedia: Real number . mathematics . 2020-08-11 . Encyclopædia Britannica . en.
  7. Encyclopedia: transcendental . . s.v.
  8. Web site: Weisstein, Eric W. "Liouville's Constant", MathWorld.
  9. Alan . Baker . 1998 . J.J. O'Connor and E.F. Robertson . biographies . The MacTutor History of Mathematics archive . . . www-history.mcs.st-andrews.ac.uk .
  10. Nesterenko . Yu V . 1996-10-31 . Modular functions and transcendence questions . Sbornik: Mathematics . 187 . 9 . 1319–1348 . 10.1070/SM1996v187n09ABEH000158 . 1064-5616.
  11. Web site: Weisstein . Eric W. . Transcendental Number . 2023-08-09 . mathworld.wolfram.com . en.
  12. Web site: Weisstein. Eric W.. Dottie Number. Wolfram MathWorld. Wolfram Research, Inc.. 23 July 2016.
  13. 1408.3999 . math.CA . István . Mező . Árpád . Baricz . On the generalization of the Lambert W function . June 22, 2015.
  14. Book: Chudnovsky, G. . Contributions to the theory of transcendental numbers . 1984 . American Mathematical Society . 978-0-8218-1500-7 . Mathematical surveys and monographs . Providence, R.I . engrus.
  15. Web site: Waldschmidt . Michel . September 7, 2005 . Transcendence of Periods: The State of the Art . webusers.imj-prg.fr.
  16. Book: Siegel . Carl L. . On Some Applications of Diophantine Approximations . Über einige Anwendungen diophantischer Approximationen: Abhandlungen der Preußischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse 1929, Nr. 1 . 2014 . Scuola Normale Superiore . 978-88-7642-520-2 . 81–138 . de . 10.1007/978-88-7642-520-2_2 .
  17. Lorch . Lee . Muldoon . Martin E. . Transcendentality of zeros of higher dereivatives of functions involving Bessel functions . International Journal of Mathematics and Mathematical Sciences . 1995 . 18 . 3 . 551–560 . 10.1155/S0161171295000706 . free .
  18. 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 . 1968RSPSA.305..149M . 10.1098/rspa.1968.0111 . 123486171.
  19. 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 . 1303.1856 . 10.1090/S0273-0979-2013-01423-X . 0273-0979 . free.
  20. 0805.0349 . math.AG . Masahiko . Yoshinaga . Periods and elementary real numbers . 2008-05-03.
  21. Web site: Weisstein . Eric W. . Rabbit Constant . 2023-08-09 . mathworld.wolfram.com . en.
  22. Web site: A143347 - OEIS . 2023-08-09 . oeis.org.
  23. Web site: A140654 - OEIS . 2023-08-12 . oeis.org.
  24. Adamczewski . Boris . March 2013 . The Many Faces of the Kempner Number . math.NT . 1303.1685.
  25. Kurosawa . Takeshi . 2007-03-01 . Transcendence of certain series involving binary linear recurrences . Journal of Number Theory . en . 123 . 1 . 35–58 . 10.1016/j.jnt.2006.05.019 . 0022-314X. free .
  26. 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 . 10.3792/pjaa.73.140 . 0386-2194 . free.
  27. Bertrand . Daniel . 1997 . Theta functions and transcendence . The Ramanujan Journal . 1 . 4 . 339–350 . 10.1023/A:1009749608672 . 118628723.
  28. 2209.04657 . Levi . van de Pol . The first occurrence of a number in Gijswijt’s sequence.
  29. Brownawell . W. Dale . 1974-02-01 . The algebraic independence of certain numbers related by the exponential function . Journal of Number Theory . 6 . 22–31 . 10.1016/0022-314X(74)90005-5 . 0022-314X. free .
  30. Web site: Weisstein . Eric W. . e . 2023-08-12 . mathworld.wolfram.com . en.
  31. Murty . M. Ram . Saradha . N. . 2010-12-01 . Euler–Lehmer constants and a conjecture of Erdös . . en . 130 . 12 . 2671–2682 . 10.1016/j.jnt.2010.07.004 . free . 0022-314X.
  32. Murty . M. Ram . Zaytseva . Anastasia . 2013-01-01 . Transcendence of generalized Euler constants . . 120 . 1 . 48–54 . 10.4169/amer.math.monthly.120.01.048 . 20495981 . 0002-9890.
  33. Rivoal . Tanguy . 2012 . On the arithmetic nature of the values of the gamma function, Euler's constant, and Gompertz's constant. Michigan Mathematical Journal . en . 61 . 2 . 239–254 . 10.1307/mmj/1339011525 . free . 0026-2285 .
  34. Rivoal . T. . Zudilin . W. . 2003-08-01 . Diophantine properties of numbers related to Catalan's constant . Mathematische Annalen . en . 326 . 4 . 705–721 . 10.1007/s00208-003-0420-2 . 1432-1807 . 59328860 . free . 1959.13/803688.
  35. Web site: Mathematical constants . 2022-09-22 . Cambridge University Press . en . Mathematics (general).