Hurwitz's theorem (number theory)

From HandWiki
Short description: Theorem in number theory that gives a bound on a Diophantine approximation

In number theory, Hurwitz's theorem, named after Adolf Hurwitz, gives a bound on a Diophantine approximation. The theorem states that for every irrational number ξ there are infinitely many relatively prime integers m, n such that [math]\displaystyle{ \left |\xi-\frac{m}{n}\right | \lt \frac{1}{\sqrt{5}\, n^2}. }[/math]

The condition that ξ is irrational cannot be omitted. Moreover the constant [math]\displaystyle{ \sqrt{5} }[/math] is the best possible; if we replace [math]\displaystyle{ \sqrt{5} }[/math] by any number [math]\displaystyle{ A \gt \sqrt{5} }[/math] and we let [math]\displaystyle{ \xi = (1+\sqrt{5})/2 }[/math] (the golden ratio) then there exist only finitely many relatively prime integers m, n such that the formula above holds.

The theorem is equivalent to the claim that the Markov constant of every number is larger than [math]\displaystyle{ \sqrt{5} }[/math].

See also

References