Diophantine approximation Created 2026-09-24 Updated 2026-11-05
Diophantine approximation asks how closely a real or complex quantity can be approximated by rational numbers or algebraic numbers of bounded arithmetic complexity. For a real , one compares with functions of the denominator .
For example, continued fraction convergents to give approximations . A nonzero integer norm of also supplies a lower bound, preventing arbitrarily exceptional accuracy. The Liouville approximation theorem extends this idea to algebraic numbers, while Roth's theorem sharpens the exponent for algebraic irrational inputs. Approximation quality can therefore distinguish algebraic from transcendental behavior, not merely give convenient decimal values.
Liouville constant 2026-11-05
The Liouville constant is the real number
Its decimal ones occur at factorial positions . The growing gaps make exceptionally well approximated by rational numbers. If is the truncation after terms, with , then
The strict lower bound shows the truncations never equal .
For any fixed degree of an algebraic number , these errors eventually fall below every positive constant times . The Liouville approximation theorem forbids this for an irrational algebraic number of degree . A rational number is also impossible, since distinct fractions satisfy . Hence is a transcendental number. The construction turns deliberately sparse decimal digits into a proof of transcendence.
Liouville number Created 2026-09-24 Updated 2026-11-05
A Liouville number is a real irrational number such that, for every positive integer , there are integers with and . It admits rational approximations of arbitrarily high polynomial accuracy.
For example, is a Liouville number: truncating after leaves a tail smaller than a constant times , while the denominator is . The Liouville approximation theorem bounds how well a fixed algebraic number that is an irrational number can be approximated, proving that every Liouville number is transcendental. The converse fails: transcendence alone does not require such exceptional approximations.
Set . If , then . If , irrationality of the square root of two implies that the integer is nonzero. Factoring a difference of squares therefore gives
Thus the requested bound holds for every integer and every nonzero integer , without using the Liouville approximation theorem. For completeness, irrationality follows because in lowest terms would make even and then even, contradicting coprimality.
The Liouville approximation theorem states that if is a real irrational algebraic number of degree , there is a constant such that, for all integers with ,
Reduction of the fraction is not necessary: an unreduced denominator only weakens this bound. More generally the same type of bound holds for an algebraic number of degree whenever . The exception is essential for a rational , since an exact rational representation gives zero error. A rational number of degree one obeys the bound directly: if in lowest terms and , then .
Let be the complete quotient. Iterating the fractional-linear formula for a continued fraction gives
The supplied determinant identity and therefore imply
The positive partial quotients ensure increasing denominators tending to infinity; the same determinant identity makes the even and odd convergents nested, giving their common limit . The displayed formula follows by passing to the limit in the finite-tail identity.
An explicit choice is for every . The recurrence gives . For , , so . Consequently and
First is irrational: if , the nonzero difference from a convergent is at least , contradicting the error bound once . If were algebraic of any fixed degree , the last displayed upper bound would eventually be smaller than for the positive constant in part (i), since . This contradicts the Liouville approximation theorem. Thus this explicit continued fraction is transcendental.
The Liouville approximation theorem states that if a real irrational algebraic number has degree , there is such that for every integer and positive integer .
Choose its irreducible polynomial of degree . Since is irrational, ; after multiplication by it is a nonzero integer. Hence . On the polynomial derivative has a finite bound . For , the mean value theorem gives , proving the required bound with . For more distant rationals, the bound holds with . Taking covers every rational and proves the theorem.
The Liouville approximation theorem says that for a real algebraic number of degree , there is a constant such that
for all integers and with . In particular a quadratic irrational cannot have arbitrarily accurate rational approximations of order .
The matrix recurrence gives and . Successive continued fraction convergents bracket , hence
The infinite continued fraction is irrational: if were rational, a distinct convergent would be at distance at least , contradicting the first bound once . If were rational, this irrational would have degree two. The Liouville approximation theorem would then give . Comparing with the displayed bound would force for every , contrary to the unbounded coefficients. Thus is irrational, by the unbounded continued-fraction coefficients exclude quadratic irrationality argument.
The Liouville approximation theorem says that if is an irrational algebraic number of degree , there is such that for all integers and . To see the source of the bound, a degree- integer minimal polynomial gives a nonzero integer. On a fixed neighbourhood of , the mean value theorem bounds by a constant times ; outside that neighbourhood a smaller uniform constant suffices.
Let denote the factorial-denominator sum and let be its partial sum through , with for . This is an integer numerator even though makes the first two terms equal. Positivity and the rapid increase of factorial exponents imply
For example the first omitted term is and every succeeding factorial exponent increases by at least one, giving a geometric tail bound less than times that first term.
First is irrational: if , the positive difference from a partial sum is at least , contradicting this bound for sufficiently large . If it were algebraic of any fixed degree , Liouville approximation theorem would require , again impossible for large . Hence
The Liouville approximation theorem states that an irrational algebraic number of degree satisfies for all integers and , for some . The constant is independent of the rational approximation.
The required condition is infinitely many of the coefficients equal one. If only finitely many do, the series is a finite sum of rational numbers. Conversely let be the sum with infinitely many nonzero terms. Its truncation has denominator dividing . For , its strictly positive tail satisfies
If were rational, the distinct fractions would have distance at least , contradicting the tail bound for large . Thus is irrational. If it were algebraic of fixed degree , apply the Liouville approximation theorem to . Even if its reduced denominator is smaller than , the lower bound is at least . The displayed upper bound contradicts this as . Hence
The coincidence changes only the first rational contribution and has no effect on this criterion.
Liouville approximation theorem states that if is a real algebraic number of degree , then there is a constant such that
for every rational with . The strict inequality may be replaced by a non-strict one after changing the constant.
Since is not a root, is a nonzero integer, and hence
Moreover implies . Applying part (i) to , , and using gives
Rearrangement proves
This is the core estimate behind the Liouville approximation theorem.
Let
The tail satisfies
For every fixed positive integer , this is smaller than for all sufficiently large .
The binary expansion has digits at factorial positions and arbitrarily long blocks of zeros, but it is neither eventually zero nor eventually periodic. Since a rational number has an eventually periodic binary expansion, is irrational. If it were an algebraic number of degree , part (b), or equivalently the Liouville approximation theorem, would give a fixed positive multiple of as a lower bound for all rational approximations. The fractions violate that bound. Thus is a transcendental number.
The Liouville approximation theorem states that if is an irrational algebraic number of degree , then there is a constant such that every reduced rational satisfies
Let be the minimal polynomial of , of degree . Since is irreducible of degree greater than one, . Moreover,
and hence
On the compact interval , put
If , the mean value theorem gives a point between and such that
Thus . If , then . Taking any
proves the stated strict inequality.
Liouville approximation theorem states that if an irrational algebraic number has degree , then some satisfies
for every rational with .
The omitted term is rational and does not affect transcendence. Let
The decimal expansion has ones at the increasingly separated positions and zeros elsewhere, so it is not eventually periodic and is irrational. Moreover,
For every fixed , the exponent eventually exceeds by an arbitrarily large amount, so this upper bound is smaller than . Liouville's theorem therefore rules out every finite algebraic degree, proving that is transcendental.
There are only countably many integer polynomials and each has finitely many roots, so the algebraic numbers are countable. Since is uncountable, its complement, the set of transcendental numbers, is uncountable.
Let be the monic cubic minimal polynomial of the algebraic integer , let be its conjugates, and let be the two conjugates of a nonrational . Because the degrees three and two are coprime, the fields are linearly disjoint, and
is a nonzero integer.
Assume
For large this makes bounded. Since is a quadratic algebraic integer, the height-Mahler measure formula gives
and therefore . The two remaining factors with are bounded, while the three factors with are . Consequently
We now use the standard effective norm form consequence of Part (b). For
where is an integral basis of , the effective norm-form height estimate supplies effective constants , depending only on and , such that
for every nonzero . Its proof factors , balances a generator using the Dirichlet unit theorem, and applies the Baker lower bound for a homogeneous linear form in logarithms to the linear relations defining ; the coprime degrees and exclude a unit-family degeneracy.
Apply this estimate to . Since , the height inequalities imply . Hence
Choose the effective value . The last inequality bounds effectively. The rational integers are already covered by the stronger degree-three Liouville approximation theorem, and the Northcott theorem leaves only finitely many remaining quadratic integers of bounded height. Taking the minimum of
over this effective finite set gives an effective and proves
for every .
Liouville approximation theorem says that if algebraic irrational has degree , then for all rationals .
Proof of Liouville approximation theorem Created 2026-09-24 Updated 2026-11-05
Let be a real irrational algebraic number of field extension degree , and let be its primitive algebraic minimal polynomial. For any rational with positive integer , irreducibility gives . Consequently the nonzero integer gives
On a fixed closed interval around , the mean value theorem gives , where on that interval. Thus rational points in the interval satisfy . Outside it, a fixed positive distance from gives the same type of bound after decreasing the constant. Choosing a smaller constant makes the inequality strict, proving the Liouville approximation theorem.
For nonreal algebraic numbers, the positive distance from the real axis already gives a uniform lower bound against rational approximations. The substantive approximation argument is therefore the real case.
Transcendental number theory studies numbers that satisfy no nonzero polynomial equation with integer coefficients, and stronger independence properties among numbers and special-function values. The distinction is algebraic: is irrational but algebraic because it satisfies .
A useful example is the Liouville constant . Truncating after terms gives a rational with and
For any fixed algebraic degree, these approximations eventually contradict the rational-approximation lower bound in Liouville approximation theorem. Thus exceptionally good approximation can certify transcendence.
Other results, such as the six exponentials theorem, constrain collections of exponential values using linear independence of their inputs. Proving each number irrational is weaker than proving it transcendental, and proving separate transcendence is weaker than proving algebraic independence of a collection.