Irrationality measure

From testwiki
Revision as of 04:53, 4 February 2025 by imported>Ducmatgoctoanlyhoa (Added the relation between $\pi^2$ and $\zeta(2)$)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description

Rational approximations to the Square root of 2.

In mathematics, an irrationality measure of a real number x is a measure of how "closely" it can be approximated by rationals.

If a function f(t,λ), defined for t,λ>0, takes positive real values and is strictly decreasing in both variables, consider the following inequality:

0<|xpq|<f(q,λ)

for a given real number x and rational numbers pq with p,q+. Define R as the set of all λ+ for which only finitely many pq exist, such that the inequality is satisfied. Then λ(x)=infR is called an irrationality measure of x with regard to f. If there is no such λ and the set R is empty, x is said to have infinite irrationality measure λ(x)=.

Consequently, the inequality

0<|xpq|<f(q,λ(x)+ε)

has at most only finitely many solutions pq for all ε>0.[1]

Irrationality exponent

The irrationality exponent or Liouville–Roth irrationality measure is given by setting f(q,μ)=qμ,[1] a definition adapting the one of Liouville numbers — the irrationality exponent μ(x) is defined for real numbers x to be the supremum of the set of μ such that 0<|xpq|<1qμ is satisfied by an infinite number of coprime integer pairs (p,q) with q>0.[2][3]Template:Rp

For any value n<μ(x), the infinite set of all rationals p/q satisfying the above inequality yields good approximations of x. Conversely, if n>μ(x), then there are at most finitely many coprime (p,q) with q>0 that satisfy the inequality.

For example, whenever a rational approximation pqx with p,q yields n+1 exact decimal digits, then

110n|xpq|1qμ(x)+ε

for any ε>0, except for at most a finite number of "lucky" pairs (p,q).

A number x with irrationality exponent μ(x)2 is called a diophantine number,[4] while numbers with μ(x)= are called Liouville numbers.

Corollaries

Rational numbers have irrationality exponent 1, while (as a consequence of Dirichlet's approximation theorem) every irrational number has irrationality exponent at least 2.

On the other hand, an application of Borel-Cantelli lemma shows that almost all numbers, including all algebraic irrational numbers, have an irrationality exponent exactly equal to 2.[3]Template:Rp

It is μ(x)=μ(rx+s) for real numbers x and rational numbers r0 and s. If for some x we have μ(x)μ, then it follows μ(x1/2)2μ.[5]Template:Rp

For a real number x given by its simple continued fraction expansion x=[a0;a1,a2,...] with convergents pi/qi it holds:[1]

μ(x)=1+lim supnlnqn+1lnqn=2+lim supnlnan+1lnqn.

If we have lim supn1nln|qn|σ and limn1nln|qnxpn|=τ for some positive real numbers σ,τ, then we can establish an upper bound for the irrationality exponent of x by:[6][7]

μ(x)1+στ

Known bounds

For most transcendental numbers, the exact value of their irrationality exponent is not known.[5] Below is a table of known upper and lower bounds.

Number x Irrationality exponent μ(x) Notes
Lower bound Upper bound
Rational number p/q with p,q+ 1 Every rational number p/q has an irrationality exponent of exactly 1.
Irrational algebraic number α 2 By Roth's theorem the irrationality exponent of any irrational algebraic number is exactly 2. Examples include square roots and the golden ratio φ.
e2/k,k+ 2 If the elements an of the simple continued fraction expansion of an irrational number x are bounded above an<P(n) by an arbitrary polynomial P, then its irrationality exponent is μ(x)=2.

Examples include numbers which continued fractions behave predictably such as

e=[2;1,2,1,1,4,1,1,6,1,...] and I0(2)/I1(2)=[1;2,3,4,5,6,7,8,9,10,...].

tan(1/k),k+ 2
tanh(1/k),k+ 2
S(b) with b2 2 S(b):=k=0b2kwith b, has continued fraction terms which do not exceed a fixed constant.[8][9]
T(b) with b2[10] 2 T(b):=k=0tkbk where tk is the Thue–Morse sequence and b. See Prouhet-Thue-Morse constant.
ln(2)[11][12] 2 3.57455... There are other numbers of the form ln(a/b) for which bounds on their irrationality exponents are known.[13][14][15]
ln(3)[11][16] 2 5.11620...
5ln(3/2)[17] 2 3.43506... There are many other numbers of the form 2k+1ln(2k+1+12k+11) for which bounds on their irrationality exponents are known.[17] This is the case for k=12.
π/3[18][19] 2 4.60105... There are many other numbers of the form 2k1arctan(2k1k1) for which bounds on their irrationality exponents are known.[18] This is the case for k=2.
π[11][20] 2 7.10320... It has been proven that if the Flint Hills series n=1csc2nn3 (where n is in radians) converges, then π's irrationality exponent is at most 5/2[21][22] and that if it diverges, the irrationality exponent is at least 5/2.[23]
π2[11][24] 2 5.09541... π2 and ζ(2) are linearly dependent over . (ζ(2)=π26), also see the Basel problem.
arctan(1/2)[25] 2 9.27204... There are many other numbers of the form arctan(1/k) for which bounds on their irrationality exponents are known.[26][27]
arctan(1/3)[28] 2 5.94202...
Apéry's constant ζ(3)[11] 2 5.51389...
Γ(1/4)[29] 2 10330
Cahen's constant C[30] 3
Champernowne constants Cb in base b2[31] b Examples include C10=0.1234567891011...=[0;8,9,1,149083,1,...]
Liouville numbers L The Liouville numbers are precisely those numbers having infinite irrationality exponent.[3]Template:Rp

Irrationality base

The irrationality base or Sondow irrationality measure is obtained by setting f(q,β)=βq.[1][6] It is a weaker irrationality measure, being able to distinguish how well different Liouville numbers can be approximated, but yielding β(x)=1 for all other real numbers:

Let x be an irrational number. If there exist real numbers β1 with the property that for any ε>0, there is a positive integer q(ε) such that

|xpq|>1(β+ε)q

for all integers p,q with qq(ε) then the least such β is called the irrationality base of x and is represented as β(x).

If no such β exists, then β(x)= and x is called a super Liouville number.

If a real number x is given by its simple continued fraction expansion x=[a0;a1,a2,...] with convergents pi/qi then it holds:

β(x)=lim supnlnqn+1qn=lim supnlnan+1qn.[1]

Examples

Any real number x with finite irrationality exponent μ(x)< has irrationality base β(x)=1, while any number with irrationality base β(x)>1 has irrationality exponent μ(x)= and is a Liouville number.

The number L=[1;2,22,222,...] has irrationality exponent μ(L)= and irrationality base β(L)=1.

The numbers τa=n=01na=1+1a+1aa+1aaa+1aaaa+... (na represents tetration, a=2,3,4...) have irrationality base β(τa)=a.

The number S=1+121+1421+18421+1168421+132168421+ has irrationality base β(S)=, hence it is a super Liouville number.

Although it is not known whether or not eπ is a Liouville number,[32]Template:Rp it is known that β(eπ)=1.[5]Template:Rp

Other irrationality measures

Markov constant

Template:Main Setting f(q,M)=(Mq2)1 gives a stronger irrationality measure: the Markov constant M(x). For an irrational number x it is the factor by which Dirichlet's approximation theorem can be improved for x. Namely if c<M(x) is a positive real number, then the inequality

0<|xpq|<1cq2

has infinitely many solutions pq. If c>M(x) there are at most finitely many solutions.

Dirichlet's approximation theorem implies M(x)1 and Hurwitz's theorem gives M(x)5 both for irrational x.[33]

This is in fact the best general lower bound since the golden ratio gives M(φ)=5. It is also M(2)=22.

Given x=[a0;a1,a2,...] by its simple continued fraction expansion, one may obtain:[34]

M(x)=lim supn([an+1;an+2,an+3,...]+[0;an,an1,...,a2,a1]).

Bounds for the Markov constant of x=[a0;a1,a2,...] can also be given by p2+4M(x)<p+2 with p=lim supnan.[35] This implies that M(x)= if and only if (ak) is not bounded and in particular M(x)< if x is a quadratic irrational number. A further consequence is M(e)=.

Any number with μ(x)>2 or β(x)>1 has an unbounded simple continued fraction and hence M(x)=.

For rational numbers r it may be defined M(r)=0.

Other results

The values M(e)= and μ(e)=2 imply that the inequality 0<|epq|<1cq2 has for all c+ infinitely many solutions pq while the inequality 0<|epq|<1q2+ε has for all ε+ only at most finitely many solutions pq . This gives rise to the question what the best upper bound is. The answer is given by:[36]

0<|epq|<clnlnqq2lnq

which is satisfied by infinitely many pq for c>12 but not for c<12.

This makes the number e alongside the rationals and quadratic irrationals an exception to the fact that for almost all real numbers x the inequality below has infinitely many solutions pq:[5] (see Khinchin's theorem)

0<|xpq|<1q2lnq

Mahler's generalization

Template:Main

Kurt Mahler extended the concept of an irrationality measure and defined a so-called transcendence measure, drawing on the idea of a Liouville number and partitioning the transcendental numbers into three distinct classes.[3]

Mahler's irrationality measure

Instead of taking for a given real number x the difference |xp/q| with p/q, one may instead focus on term |qxp|=|L(x)| with p,q and L[x] with degL=1. Consider the following inequality:

0<|qxp|max(|p|,|q|)ω with p,q and ω0+.

Define R as the set of all ω0+ for which infinitely many solutions p,q exist, such that the inequality is satisfied. Then ω1(x)=supM is Mahler's irrationality measure. It gives ω1(p/q)=0 for rational numbers, ω1(α)=1 for algebraic irrational numbers and in general ω1(x)=μ(x)1, where μ(x) denotes the irrationality exponent.

Transcendence measure

Mahler's irrationality measure can be generalized as follows:[2][3] Take P to be a polynomial with degPn+ and integer coefficients ai. Then define a height function H(P)=max(|a0|,|a1|,...,|an|) and consider for complex numbers z the inequality:

0<|P(z)|H(P)ω with ω0+.

Set R to be the set of all ω0+ for which infinitely many such polynomials exist, that keep the inequality satisfied. Further define ωn(z)=supR for all n+ with ω1(z) being the above irrationality measure, ω2(z) being a non-quadraticity measure, etc.

Then Mahler's transcendence measure is given by:

ω(z)=lim supnωn(z).

The transcendental numbers can now be divided into the following three classes:

If for all n+ the value of ωn(z) is finite and ω(z) is finite as well, z is called an S-number (of type ω(z)).

If for all n+ the value of ωn(z) is finite but ω(z) is infinite, z is called an T-number.

If there exists a smallest positive integer N such that for all nN the ωn(z) are infinite, z is called an U-number (of degree N).

The number z is algebraic (and called an A-number) if and only if ω(z)=0.

Almost all numbers are S-numbers. In fact, almost all real numbers give ω(x)=1 while almost all complex numbers give ω(z)=12.[37]Template:Rp The number e is an S-number with ω(e)=1. The number π is either an S- or T-number.[37]Template:Rp The U-numbers are a set of measure 0 but still uncountable.[38] They contain the Liouville numbers which are exactly the U-numbers of degree one.

Linear independence measure

Another generalization of Mahler's irrationality measure gives a linear independence measure.[2][13] For real numbers x1,...,xn consider the inequality

0<|c1x1+...+cnxn|max(|c1|,...,|cn|)ν with c1,...,cn and ν0+.

Define R as the set of all ν0+ for which infinitely many solutions c1,...cn exist, such that the inequality is satisfied. Then ν(x1,...,xn)=supR is the linear independence measure.

If the x1,...,xn are linearly dependent over then ν(x1,...,xn)=0.

If 1,x1,...,xn are linearly independent algebraic numbers over then ν(1,x1,...,xn)n.[32]

It is further ν(1,x)=ω1(x)=μ(x)1.

Other generalizations

Koksma’s generalization

Jurjen Koksma in 1939 proposed another generalization, similar to that of Mahler, based on approximations of complex numbers by algebraic numbers.[3][37]

For a given complex number z consider algebraic numbers α of degree at most n. Define a height function H(α)=H(P), where P is the characteristic polynomial of α and consider the inequality:

0<|zα|H(α)ω*1 with ω*0+.

Set R to be the set of all ω*0+ for which infinitely many such algebraic numbers α exist, that keep the inequality satisfied. Further define ωn*(z)=supR for all n+ with ω1*(z) being an irrationality measure, ω2*(z) being a non-quadraticity measure,[17] etc.

Then Koksma's transcendence measure is given by:

ω*(z)=lim supnωn*(z).

The complex numbers can now once again be partitioned into four classes A*, S*, T* and U*. However it turns out that these classes are equivalent to the ones given by Mahler in the sense that they produce exactly the same partition.[37]Template:Rp

Simultaneous approximation of real numbers

Template:Main

Given a real number x, an irrationality measure of x quantifies how well it can be approximated by rational numbers pq with denominator q+. If x=α is taken to be an algebraic number that is also irrational one may obtain that the inequality

0<|αpq|<1qμ

has only at most finitely many solutions pq for μ>2. This is known as Roth's theorem.

This can be generalized: Given a set of real numbers x1,...,xn one can quantify how well they can be approximated simultaneously by rational numbers p1q,...,pnq with the same denominator q+. If the xi=αi are taken to be algebraic numbers, such that 1,α1,...,αn are linearly independent over the rational numbers it follows that the inequalities

0<|αipiq|<1qμ,i{1,...,n}

have only at most finitely many solutions (p1q,...,pnq)n for μ>1+1n. This result is due to Wolfgang M. Schmidt.[39][40]

See also

References

Template:ReflistTemplate:Number theory