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 and Here 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 is satisfied by infinitely many integers p and q. This shows that any irrational number has irrationality measure at least 2. The Thue–Siegel–Roth theorem says that, for algebraic irrational numbers, the exponent of 2 in the corollary to Dirichlet’s approximation theorem is the best we can do: such numbers cannot be approximated by any exponent greater than 2. The Thue–Siegel–Roth theorem uses advanced techniques of number theory, but many simpler numbers such as the golden ratio can be much more easily verified to be inapproximable beyond exponent 2.

Simultaneous version

The simultaneous version of the Dirichlet's approximation theorem states that given real numbers and a natural number N then there are integers such that

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 we can write 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{1}{N}. Now, we have N+1 numbers 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: Dividing both sides by j-i will result in: 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 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

Related theorems

Legendre's theorem on continued fractions

In his Essai sur la théorie des nombres (1798), Adrien-Marie Legendre derives a necessary and sufficient condition for a rational number to be a convergent of the simple continued fraction of a given real number. A consequence of this criterion, often called Legendre's theorem within the study of continued fractions, is as follows: Theorem. If α is a real number and p, q are positive integers such that, then p/q is a convergent of the continued fraction of α. Proof. We follow the proof given in An Introduction to the Theory of Numbers by G. H. Hardy and E. M. Wright. Suppose α, p, q are such that, and assume that α > p/q. Then we may write, where 0 < θ < 1/2. We write p/q as a finite continued fraction [a0; a1, ..., an], where due to the fact that each rational number has two distinct representations as finite continued fractions differing in length by one (namely, one where an = 1 and one where an ≠ 1), we may choose n to be even. (In the case where α < p/q, we would choose n to be odd.) Let p0/q0, ..., pn/qn = p/q be the convergents of this continued fraction expansion. Set, so that and thus, where we have used the fact that pn-1 qn - pn qn-1 = (-1)n and that n is even. Now, this equation implies that α = [a0; a1, ..., an, ω]. Since the fact that 0 < θ < 1/2 implies that ω > 1, we conclude that the continued fraction expansion of α must be [a0; a1, ..., an, b0, b1, ...], where [b0; b1, ...] is the continued fraction expansion of ω, and therefore that pn/qn = p/q is a convergent of the continued fraction of α. This theorem forms the basis for Wiener's attack, a polynomial-time exploit of the RSA cryptographic protocol that can occur for an injudicious choice of public and private keys (specifically, this attack succeeds if the prime factors of the public key n = pq satisfy p < q < 2p and the private key d is less than (1/3)n1/4).