Dirichlet's approximation theorem

In number theory, Dirichlet's theorem on Diophantine approximation, also called Dirichlet's approximation theorem, states that for any real numbers $\alpha$ and $N$, with $1 \leq N$, there exist integers $p$ and $q$ such that $1 \leq q \leq N$ and

:$\left , q \alpha -p \right , \leq \frac < \frac.$

Here $\lfloor N\rfloor$ represents the integer part of $N$.
This is a fundamental result in Diophantine approximation, showing that any real number has a sequence of good rational approximations: in fact an immediate consequence is that for a given irrational α, the inequality

:$0<\left , \alpha -\frac \right , < \frac$

is satisfied by infinitely many integers ''p'' and ''q''. This shows that any irrational number has irrationality measure at least 2. This corollary also shows that the Thue–Siegel–Roth theorem, a result in the other direction, provides essentially the tightest possible bound, in the sense that the bound on rational approximation of algebraic numbers cannot be improved by increasing the exponent beyond 2. The Thue–Siegel–Roth theorem uses advanced techniques of number theory, but many simpler numbers such as the golden ratio $(1+\sqrt)/2$ can be much more easily verified to be inapproximable beyond exponent 2. This exponent is referred to as the irrationality measure.

Simultaneous version

The simultaneous version of the Dirichlet's approximation theorem states that given real numbers $\alpha_1, \ldots, \alpha_d$ and a natural number $N$ then there are integers $p_1, \ldots, p_d, q\in\Z,1\le q\leq N$ such that $\left, \alpha_i-\fracq \ \le \frac1.$

Method of proof

Proof By The Pigeonhole Principle

This theorem is a consequence of the pigeonhole principle. Peter Gustav Lejeune Dirichlet who proved the result used the same principle in other contexts (for example, the Pell equation) and by naming the principle (in German) popularized its use, though its status in textbook terms comes later. The method extends to simultaneous approximation.

Proof Outline: Let $\alpha$ be an irrational number and $n$ be an integer. For every $k=0, 1, ..., n$ we can write $k\alpha=m_k + x_k$ such that $m_k$ is an integer and $0\le x_k <1$.
One can divide the interval $[0, 1)$ into $n$ smaller intervals of measure $\frac$. Now, we have $n+1$ numbers $x_0,x_1,...,x_n$ and $n$ intervals. Therefore, by the pigeonhole principle, at least two of them are in the same interval. We can call those $x_i,x_j$ such that $i < j$. Now:

: $, (j-i)\alpha-(m_j-m_i), =, j\alpha-m_j-(i\alpha-m_i), =, x_j-x_i, < \frac$

Dividing both sides by $j-i$ will result in:

: $\left, \alpha-\frac\< \frac\le \frac$

And we proved the theorem.

Proof By Minkowski's theorem

Another simple proof of the Dirichlet's approximation theorem is based on Minkowski's theorem applied to the set

: $S = \left\.$

Since the volume of $S$ is greater than $4$, Minkowski's theorem establishes the existence of a non-trivial point with integral coordinates. This proof extends naturally to simultaneous approximations by considering the set

: $S = \left\.$

See also

*Dirichlet's theorem on arithmetic progressions
*Hurwitz's theorem (number theory)
* Heilbronn set
* Kronecker's theorem (generalization of Dirichlet's theorem)

Notes

References

*
*

External links

*{{PlanetMath, urlname=DirichletsApproximationTheorem, title=Dirichlet's Approximation Theorem

Diophantine approximation
Theorems in number theory