Classification of numbers : overview
(Click here
for a Postscript version of this page.)
Integers Ì Rational Numbers Ì Algebraic Numbers |
|
1 Rational and irrational numbers
Definition 1
Rational numbers can be expressed as fraction of integers r=p/q, where (p,q) are integers (p is the numerator and q the denominator).
Definition 2
The set of rational numbers is denoted Q.
Numbers like 7/5,1/1999,31416/10000 are rational numbers. During ancient
time the mathematicians believed that all numbers were rational,
Pythagoreans (a mathematical and philosophical school in Greece during the
VI-th century B.C.) based their system on such a belief. It was a scandal
when they proved that Ö2 could not be written as a fraction and it's
why such numbers were called irrational.
Rational numbers can be defined by a finite amount of information (the
numerator and denominator), their complexity is finite.
A basic property of rational numbers is that their decimal
expansion is finite (regular numbers) or periodic (non regular
numbers). Let us consider:
|
|
| |
|
0.5772151898734177215189873417721518987341... |
|
|
we see that the first example is a regular rational number and the
second is a non regular one with a period L=7721518987341 and
the length of this period is 13.
We have the property, if l denotes the length of the period and if p and q are relatively prime, that l(p/q)=l(1/q) for any non regular number and that l(1/q) is at
most q-1. And the previous case becomes:
l |
æ è
|
228
395
|
ö ø
|
=l |
æ è
|
1
395
|
ö ø
|
=13. |
|
After Ö2 it was a new challenge for mathematicians to find other
irrational numbers among the famous constants. Let us quote some major
results:
- e is irrational (Euler 1744)
- p is irrational (Lambert 1761 [9] and Legendre 1794
[10])
- z(3) is irrational (Apery 1978 [13])
- z(2k+1) are irrational for infinitely many integers k
(Rivoal 2000 [14])
Some irrationality proofs of classical constants can be found in
[5] or [6].
2 Algebraic numbers
Irrational numbers can be classified in two categories, the Algebraic numbers and the Transcendental numbers.
Definition 3
An algebraic number x is the root of a polynomial equation with integers
coefficients :
anxn+an-1xn-1+...+a1x+a0=0. |
|
If n is the smallest possible degree of the polynomial, x is called an
algebraic number of degree n. For example, the algebraic
numbers of degree n=1 define the set of rational numbers. Square roots of
integers which are not perfect squares are algebraic numbers of degree 2.
All the solutions of the following equations are algebraic numbers of degree
2 or 3 for the last example:
In other words, Ö2,j = (1+Ö5)/2,Ö{51}-4,... are
algebraic numbers.
In a certain sense, algebraic numbers are represented by a finite collection
of integers (the coefficients (a0,a1,...,an) of the polynomial),
so their complexity may be considered as finite.
It's possible to show that the sum, the product, the quotient of algebraic
numbers are also algebraic numbers (in mathematical terms, the set of
algebraic numbers which is sometimes denoted A, is a field).
3 Transcendental numbers
3.1 Elementary results
Definition 4
A numbers which is not root of any polynomial equation with integer
coefficients is called a transcendental number.
Definition 5
Transcendental numbers are non algebraic numbers.
In 1844, Joseph Liouville (1809-1882) [12] was the first to
prove the existence of such numbers and he gave an important and elementary
characterization of a category of transcendental numbers, the Liouville numbers:
Theorem 6
The non rational number x is a Liouville number if, for every positive
integer n there exist two integers (p,q) such as
|
ê ê
|
x- |
p
q
|
ê ê
|
< |
1
qn
|
q > 1, |
|
and such a number is transcendental.
He used this result to exhibit the first concrete transcendental numbers.
One of those numbers is famous
L= |
¥ å
k=1
|
|
1
10k!
|
=0.1100010000000000000000010000..., |
|
it has 0 everywhere except a few 1 at position k! (1,2,6,24,120,720,...). This number is not rational because it's clearly
not periodic and satisfies the characterization theorem because there so
many 0 between the 1 that it can be approximated by a rational number very
easily. All transcendental numbers are not Liouville numbers, in 1953 Mahler
proved that the constant p is not a Liouville number. He also proved
that non rational algebraic numbers are not easy to approximate with
rational numbers.
Theorem 7
For any algebraic and non rational number x of degree n, there exist a
positive constant C, such as for any couple of integers (p,q) with q > 0
In 1873, Georg Cantor (1845-1918) proved that the transcendental numbers are
non denumerable, whereas the algebraic numbers are denumerable. In other
words, there are much more transcendental numbers than algebraic
numbers. Because the proof is elementary we give it.
Theorem 8
The set of algebraic numbers is denumerable.
Proof. For any polynomial P(x)=anxn+an-1xn-1+...+a1x+a0 with
integer coefficients of degree n, define it's height h(P) as the integer
and let Tm be the set of all the roots of all the polynomials P such
as h(P) £ m. It's clear that for any integer m the number of
polynomials with h(P) £ m is finite, hence the set Tm is finite
(the number of roots of a polynomial is finite). Finally the set of
algebraic numbers is
and because a denumerable union of finite sets is denumerable the theorem
follows.
Proving that a given number is transcendental is usually a very hard
problem. The two most famous historical results are :
- e is transcendental (Hermite 1873 [7])
- p is transcendental (Lindemann 1882 [11],
Weierstrass 1885, Hilbert 1893 [8])
An important property of those numbers is the impossibility to construct any
transcendental number with geometric construction (with only the help of a
compass and a ruler). The celebrated problem of squaring the circle
which goes back to ancient times and occupied generations of mathematicians
was showed to have no solution with the proof of the transcendence of p.
3.2 Modern results
In 1934, Aleksandr Gelfond (1906-1968) and Theodor Schneider (1911-)
independently solved one of the famous Hilbert's problems (the
Seventh Problem: ''Irrationality and transcendence of certain numbers'')
which were cited at the International Congress of Mathematicians at Paris in
1900.
Theorem 9
(Gelfond-Schneider). Let a an algebraic number (a ¹ 0,a ¹ 1) and b an algebraic and irrational number, then
Corollary 10
The numbers 2Ö2(the Gelfond-Schneider constant) and ep
are transcendental numbers.
In 1966, Alan Baker (1939-) succeeded in giving a vast
generalization of Gelfond-Schneider theorem : any finite sum (if
not zero)
is transcendental when (ai,bi) are algebraic numbers with ai non zero and bi different from 1. As a consequence the number log(2) is transcendental, as for the logarithm of any integer or rational
number different from 1.
The sum of a transcendental number and an algebraic number is also
transcendental [2]. Some isolated results are available:
- G(1/3) is transcendental (Le Lionnais 1983) where G
is the gamma function.
- G(1/4) and G(1/6) are transcendental (Chudnovsky 1984)
- log(3)/log(2) is transcendental (Hardy & Wright 1979 [6])
- Champernowne's number [4] defined by writing the
consecutive integers 0.12345678910111213... was proven to be
transcendental by Mahler in 1961.
4 Non yet classified numbers
It is not known whether p+e, g (Euler's constant), B (Brun's
constant), z(3), ... are transcendental. We don't even know if g,z(5) nor G (Catalan's constant) are irrational.
Only numerical estimation are available, Brent & McMillan showed in 1980
[3] that if g = p/q then q > 1015000. This result has
been improved to q > 10242080 by Papanikolaou in 1997.
In 1988, Bailey also established that no polynomial with small integer
coefficients (of Euclidian norm smaller than 109) of degree 8 or less
exists which vanishes on the constants p+e, g,eg,...
[1].
References
- [1]
- D.H. Bailey, Numerical Results on the
Transcendence of Constants Involving p, e, and Euler's Constant, Mathematics of Computation, (1988), vol. 50, p. 275-281
- [2]
- A. Baker, A Transcendental Number Theory, Cambridge
University Press, London, (1975)
- [3]
- R.P. Brent and E.M. McMillan, Some New Algorithms
for High-Precision Computation of Euler's constant, Math. Comput., (1980),
vol. 34, p. 305-312
- [4]
- D.G. Champernowne, The construction of decimals
normal in the scale of ten, J. Lond. Math. Soc. 8, (1933)
- [5]
- X. Gourdon and P. Sebah, Numbers, Constants and
Computation, World Wide Web site at the adress: http://numbers.computation.free.fr/Constants/constants.html, (1999)
- [6]
- G.H. Hardy and E. M. Wright, An Introduction to the
Theory of Numbers, Oxford Science Publications, (1979)
- [7]
- C. Hermite, Sur la fonction exponentielle, C. R.
Académie des Sciences, (1873), vol. 77, p. 18-24, 74-79, 226-233, 285-293
- [8]
- D. Hilbert, Ueber die Transcendenz der Zahlen e und p, Mathematische Annalen, (1893), vol. 43, p. 216-219
- [9]
- J.H. Lambert, Mémoire sur quelques
propriétés remarquables des quantités transcendentes circulaires
et logarithmiques, Histoire de l'Académie Royale des Sciences et des
Belles-Lettres der Berlin, (1761), p. 265-276
- [10]
- A.M. Legendre, Eléments de géométrie,
Didot, Paris, (1794)
- [11]
- F. Lindemann, Ueber die Zahl p,
Mathematische Annalen, (1882), vol. 20, p. 213-225
- [12]
- J. Liouville, Sur des classes trés
étendues de quantités dont la valeur n'est ni rationnelle ni
même réductible à des irrationnelles algébriques, Comptes
rendus, (1844), vol. 18, p. 883-885, 910-911
- [13]
- A. van der Poorten, A Proof that Euler Missed ...,
Apéry's Proof of the Irrationality of z(3), The Mathematical
Intelligencer, (1979), vol. 1, p. 195-203
- [14]
- T. Rivoal, La fonction Zeta de Riemann prend une
infinité de valeurs irrationnelles aux entiers impairs, C. R. Acad.
Sci., (2000), vol. 331, p. 267-270
File translated from
TEX
by
TTH,
version 3.01.
On 7 May 2002, 14:28.