Dirichlet's approximation theorem

This is an old revision of this page, as edited by Mon4 (talk | contribs) at 02:31, 9 May 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, Dirichlet's theorem on diophantine approximation, also called Dirichlet's approximation theorem, states that for any real number α, and any positive integer n, there is some positive integer mn , such that the difference between mα and the nearest integer is at most 1/(n + 1). This is a consequence of the pigeonhole principle.

For example, no matter what value is chosen for α, at least one of the first five integer multiples of α, namely

1α, 2α, 3α, 4α, 5α,

will be within 1/6 of an integer, either above or below. Likewise, at least one of the first 20 integer multiples of α will be within 1/21 of an integer.

Dirichlet's approximation theorem shows that Roth's theorem is best possible in the sense that the occurring exponent cannot be increased, and thereby improved, to -2.