Liouville’s theorem on diophantine approximation

 

Liouville’s theorem on diophantine approximation Let α be an irrational number that is algebraic of degree d. Then for any real number e>d, there are at most finitely many rational numbers pq such that |pqα|<1qe.

If there is no such rational number pq then the number of solution is clearly finite.

Now assume there exists at least one rational number pq such that |pqα|<1qe.

Let P(x) be a polynomial of degree d, with integers coefficients, such that P(α)=0. Choose ϵ such that P(x) has no roots other that α on the interval [αϵ,α+ϵ]

Write P(x)=(xα)Q(x) where Q(x) is a monic polynomial with real coefficients of degree d1. Since Q(x) is continuous, there exists K>0 such that |Q(x)|K on the interval [αϵ,α+ϵ]

For all rational number pq such that |pqα|<1qe, |pqα|>ϵ or |pqα|ϵ

For all rational number pq such that ϵ<|pqα|<1qe. qe<1/ϵ and p[q(α1qe),q(α+1qe)], it is not difficult to tell the number of such rational numbers will be finite.

For all rational number pq such that |pqα|<1qe|pqα|ϵ. Note

|P(pq)|=|pqα||Q(pq)|<1qeK

Since P has degree d and integer coefficients,

P(pq)=mdpdqd+md1pd1qd1++m0=mdpd+md1pd1q++m0qdqd,

where both the nominator and the denominator are integers. Since α is irrational, P(pq)0. Then |P(pq)|1qd. Note

1qd|P(pq)|<1qeKqed<K

Similarly, the number of rational numbers pq such that |pqα|<1qe|pqα|ϵ will be finite.

Therefore, there are at most finitely many rational numbers pq such that |pqα|<1qe.