In number theory, a Liouville number is a real number with the property that, for every positive integer , there exists a pair of integers with such that
Liouville numbers are "almost rational", and can thus be approximated "quite closely" by sequences of rational numbers. Precisely, these are transcendental numbers that can be more closely approximated by rational numbers than any algebraic irrational number can be. In 1844, Joseph Liouville showed that all Liouville numbers are transcendental, [1] thus establishing the existence of transcendental numbers for the first time. [2] It is known that π and e are not Liouville numbers. [3]
Liouville numbers can be shown to exist by an explicit construction.
For any integer and any sequence of integers such that for all and for infinitely many , define the number
In the special case when , and for all , the resulting number is called Liouville's constant:
It follows from the definition of that its base- representation is
where the th term is in the th place.
Since this base- representation is non-repeating it follows that is not a rational number. Therefore, for any rational number , .
Now, for any integer , and can be defined as follows:
Then,
Therefore, any such is a Liouville number.
Here the proof will show that the number where c and d are integers and cannot satisfy the inequalities that define a Liouville number. Since every rational number can be represented as such the proof will show that no Liouville number can be rational.
More specifically, this proof shows that for any positive integer n large enough that [equivalently, for any positive integer )], no pair of integers exists that simultaneously satisfies the pair of bracketing inequalities
If the claim is true, then the desired conclusion follows.
Let p and q be any integers with Then,
If then
meaning that such pair of integers would violate the first inequality in the definition of a Liouville number, irrespective of any choice of n .
If, on the other hand, since then, since is an integer, we can assert the sharper inequality From this it follows that
Now for any integer the last inequality above implies
Therefore, in the case such pair of integers would violate the second inequality in the definition of a Liouville number, for some positive integer n.
Therefore, to conclude, there is no pair of integers with that would qualify such an as a Liouville number.
Hence a Liouville number, if it exists, cannot be rational.
(The section on Liouville's constant proves that Liouville numbers exist by exhibiting the construction of one. The proof given in this section implies that this number must be irrational.)
Consider, for example, the number
3.14(3 zeros)1(17 zeros)5(95 zeros)9(599 zeros)2(4319 zeros)6...
where the digits are zero except in positions n! where the digit equals the nth digit following the decimal point in the decimal expansion of π.
As shown in the section on the existence of Liouville numbers, this number, as well as any other non-terminating decimal with its non-zero digits similarly situated, satisfies the definition of a Liouville number. Since the set of all sequences of non-null digits has the cardinality of the continuum, the same thing occurs with the set of all Liouville numbers.
Moreover, the Liouville numbers form a dense subset of the set of real numbers.
From the point of view of measure theory, the set of all Liouville numbers is small. More precisely, its Lebesgue measure, , is zero. The proof given follows some ideas by John C. Oxtoby. [4] : 8
For positive integers and set:
then
Observe that for each positive integer and , then
Since
and then
Now
and it follows that for each positive integer , has Lebesgue measure zero. Consequently, so has .
In contrast, the Lebesgue measure of the set of all real transcendental numbers is infinite (since the set of algebraic numbers is a null set).
One could show even more - the set of Liouville numbers has Hausdorff dimension 0 (a property strictly stronger than having Lebesgue measure 0).
For each positive integer n, set
The set of all Liouville numbers can thus be written as
Each is an open set; as its closure contains all rationals (the from each punctured interval), it is also a dense subset of real line. Since it is the intersection of countably many such open dense sets, L is comeagre, that is to say, it is a dense Gδ set.
The Liouville–Roth irrationality measure (irrationality exponent,approximation exponent, or Liouville–Roth constant) of a real number is a measure of how "closely" it can be approximated by rationals. Generalizing the definition of Liouville numbers, instead of allowing any in the power of , we find the largest possible value for such that is satisfied by an infinite number of coprime integer pairs with . This maximum value of is defined to be the irrationality measure of . [5] : 246 For any value less than this upper bound, the infinite set of all rationals satisfying the above inequality yield an approximation of . Conversely, if is greater than the upper bound, then there are at most finitely many with that satisfy the inequality; thus, the opposite inequality holds for all larger values of . In other words, given the irrationality measure of a real number , whenever a rational approximation , yields exact decimal digits, then
for any , except for at most a finite number of "lucky" pairs .
As a consequence of Dirichlet's approximation theorem every irrational number has irrationality measure at least 2. On the other hand, an application of Borel-Cantelli lemma shows that almost all numbers have an irrationality measure equal to 2. [5] : 246
Below is a table of known upper and lower bounds for the irrationality measures of certain numbers.
Number | Irrationality measure | Simple continued fraction | Notes | |
---|---|---|---|---|
Lower bound | Upper bound | |||
Rational number where and | 1 | Finite continued fraction. | Every rational number has an irrationality measure of exactly 1. Examples include 1, 2 and 0.5 | |
Irrational algebraic number | 2 | Infinite continued fraction. Periodic if quadratic irrational. | By the Thue–Siegel–Roth theorem the irrationality measure of any irrational algebraic number is exactly 2. Examples include square roots like and and the golden ratio . | |
2 | Infinite continued fraction. | If the elements of the continued fraction expansion of an irrational number satisfy for positive and , the irrationality measure . Examples include or where the continued fractions behave predictably: and | ||
2 | ||||
2 | ||||
[6] [7] | 2 | 2.49846... | Infinite continued fraction. | , is a -harmonic series. |
[6] [8] | 2 | 2.93832... | , is a -logarithm. | |
[6] [8] | 2 | 3.76338... | , | |
[6] [9] | 2 | 3.57455... | ||
[6] [10] | 2 | 5.11620... | ||
[6] | 2 | 5.51389... | ||
and [6] [11] | 2 | 5.09541... | and | and are linearly dependent over . |
[6] [12] | 2 | 7.10320... | It has been proven that if the Flint Hills series (where n is in radians) converges, then 's irrationality measure is at most 2.5; [13] [14] and that if it diverges, the irrationality measure is at least 2.5. [15] | |
[16] | 2 | 6.09675... | Of the form | |
[17] | 2 | 4.788... | ||
[17] | 2 | 6.24... | ||
[17] | 2 | 4.076... | ||
[17] | 2 | 4.595... | ||
[17] | 2 | 5.793... | Of the form | |
[17] | 2 | 3.673... | ||
[17] | 2 | 3.068... | ||
[18] [19] | 2 | 4.60105... | Of the form | |
[19] | 2 | 3.94704... | ||
[19] | 2 | 3.76069... | ||
[19] | 2 | 3.66666... | ||
[19] | 2 | 3.60809... | ||
[19] | 2 | 3.56730... | ||
[19] | 2 | 6.64610... | Of the form | |
[19] | 2 | 5.82337... | ||
[19] | 2 | 3.51433... | ||
[19] | 2 | 5.45248... | ||
[19] | 2 | 3.47834... | ||
[19] | 2 | 5.23162... | ||
[19] | 2 | 3.45356... | ||
[19] | 2 | 5.08120... | ||
[19] | 2 | 3.43506... | ||
[17] | 2 | 4.5586... | and | |
[17] | 2 | 6.1382... | and | |
[17] | 2 | 59.976... | ||
[20] | 2 | 4 | Infinite continued fraction. | where is the -th term of the Thue–Morse sequence. |
Champernowne constants in base [21] | Infinite continued fraction. | Examples include | ||
Liouville numbers | Infinite continued fraction, not behaving predictable. | The Liouville numbers are precisely those numbers having infinite irrationality measure. [5] : 248 |
The irrationality base is a measure of irrationality introduced by J. Sondow [22] as an irrationality measure for Liouville numbers. It is defined as follows:
Let be an irrational number. If there exists a real number with the property that for any , there is a positive integer such that
then is called the irrationality base of and is represented as
If no such exists, then is called a super Liouville number.
Example: The series is a super Liouville number, while the series is a Liouville number with irrationality base 2. ( represents tetration.)
Establishing that a given number is a Liouville number provides a useful tool for proving a given number is transcendental. However, not every transcendental number is a Liouville number. The terms in the continued fraction expansion of every Liouville number are unbounded; using a counting argument, one can then show that there must be uncountably many transcendental numbers which are not Liouville. Using the explicit continued fraction expansion of e, one can show that e is an example of a transcendental number that is not Liouville. Mahler proved in 1953 that π is another such example. [23]
The proof proceeds by first establishing a property of irrational algebraic numbers. This property essentially says that irrational algebraic numbers cannot be well approximated by rational numbers, where the condition for "well approximated" becomes more stringent for larger denominators. A Liouville number is irrational but does not have this property, so it can't be algebraic and must be transcendental. The following lemma is usually known as Liouville's theorem (on diophantine approximation), there being several results known as Liouville's theorem.
Below, the proof will show that no Liouville number can be algebraic.
Lemma: If is an irrational root of an irreducible polynomial of degree with integer coefficients, then there exists a real number such that for all integers with ,
Proof of Lemma: Let be a minimal polynomial with integer coefficients, such that .
By the fundamental theorem of algebra, has at most distinct roots.
Therefore, there exists such that for all we get .
Since is a minimal polynomial of we get , and also is continuous.
Therefore, by the extreme value theorem there exists and such that for all we get .
Both conditions are satisfied for .
Now let be a rational number. Without loss of generality we may assume that . By the mean value theorem, there exists such that
Since and , both sides of that equality are nonzero. In particular and we can rearrange:
Proof of assertion: As a consequence of this lemma, let x be a Liouville number; as noted in the article text, x is then irrational. If x is algebraic, then by the lemma, there exists some integer n and some positive real A such that for all p, q
Let r be a positive integer such that 1/(2r) ≤ A. If m = r + n, and since x is a Liouville number, then there exist integers a, b where b > 1 such that
which contradicts the lemma. Hence a Liouville number cannot be algebraic, and therefore must be transcendental.
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers n ≥ k ≥ 0 and is written It is the coefficient of the xk term in the polynomial expansion of the binomial power (1 + x)n; this coefficient can be computed by the multiplicative formula
The Möbius function μ(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted μ(x).
In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius.
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 of finite degree with rational coefficients. The best-known transcendental numbers are π and e.
The Liouville lambda function, denoted by λ(n) and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if n is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes.
In mathematics, the n-th harmonic number is the sum of the reciprocals of the first n natural numbers:
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria.
The number e was introduced by Jacob Bernoulli in 1683. More than half a century later, Euler, who had been a student of Jacob's younger brother Johann, proved that e is irrational; that is, that it cannot be expressed as the quotient of two integers.
In transcendental number theory, the Lindemann–Weierstrass theorem is a result that is very useful in establishing the transcendence of numbers. It states the following:
In mathematics, a sequence (s1, s2, s3, ...) of real numbers is said to be equidistributed, or uniformly distributed, if the proportion of terms falling in a subinterval is proportional to the length of that subinterval. Such sequences are studied in Diophantine approximation theory and have applications to Monte Carlo integration.
Transcendental number theory is a branch of number theory that investigates transcendental numbers, in both qualitative and quantitative ways.
In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form
In mathematics, convergence tests are methods of testing for the convergence, conditional convergence, absolute convergence, interval of convergence or divergence of an infinite series .
In mathematics, auxiliary functions are an important construction in transcendental number theory. They are functions that appear in most proofs in this area of mathematics and that have specific, desirable properties, such as taking the value zero for many arguments, or having a zero of high order at some point.
In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average".
Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.
In mathematics, a Brjuno number is a special type of irrational number named for Russian mathematician Alexander Bruno, who introduced them in Brjuno (1971).
In mathematics, a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating function enumerating another. These transformations typically involve integral formulas applied to a sequence generating function or weighted sums over the higher-order derivatives of these functions.
In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby counts each distinct prime factor, whereas the related function counts the total number of prime factors of honoring their multiplicity. That is, if we have a prime factorization of of the form for distinct primes , then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.
In number theory, specifically in Diophantine approximation theory, the Markov constant of an irrational number is the factor for which Dirichlet's approximation theorem can be improved for .