Math 2.0

Number theory Diophantine approximation and transcendence Theorem

Liouville's theorem on Diophantine approximation

Builds on Liouville numberAlgebraic numberTranscendental number

Statement

Let α\alpha be a real algebraic number of degree d≥2d \ge 2. Then there is a constant c>0c > 0 such that ∣α−pq∣>cqd\left| \alpha - \frac{p}{q} \right| > \frac{c}{q^d} for all integers pp and qq with q>0q > 0. As a consequence, each Liouville number is transcendental.

Remarks

The proof uses the minimal polynomial ff of α\alpha: qdf(p/q)q^d f(p/q) is a nonzero integer, and the mean value theorem bounds f(p/q)f(p/q) by ∣α−p/q∣|\alpha - p/q|. For a Liouville number xx, the approximations are better than c/qdc / q^d for every dd, so xx is not algebraic. Roth's theorem improves the exponent dd to 2+ε2 + \varepsilon for each ε>0\varepsilon > 0.

History

Joseph Liouville proved the bound in 1844. With it, he gave the first proof that transcendental numbers exist.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algebraic number definition
  2. Liouville number definition
  3. Transcendental number definition
  4. Liouville's theorem on Diophantine approximation statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Liouville_number, Liouville numbers and transcendence
About this page
Tag0N3WFZEFPM
URIm2://0N3WFZEFPM
Kindstatement, theorem
WritingW0 stub
MSC11J68
StatusThis copy of the site has no build data. Run m2 status 0N3WFZEFPM.
UsesLiouville number, Algebraic number, Transcendental number

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.