Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Diophantine approximation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===General upper bound === {{main | Hurwitz's theorem (number theory)}} The first important result about upper bounds for Diophantine approximations is [[Dirichlet's approximation theorem]], which implies that, for every irrational number {{math|''α''}}, there are infinitely many fractions <math>\tfrac{p}{q}\;</math> such that : <math>\left|\alpha-\frac{p}{q}\right| < \frac{1}{q^2}\,.</math> This implies immediately that one cannot suppress the {{math|''ε''}} in the statement of Thue-Siegel-Roth theorem. [[Adolf Hurwitz]] (1891)<ref>{{harvnb|Hurwitz|1891|p=279}}</ref> strengthened this result, proving that for every irrational number {{math|''α''}}, there are infinitely many fractions <math>\tfrac{p}{q}\;</math> such that : <math>\left|\alpha-\frac{p}{q}\right| < \frac{1}{\sqrt{5}q^2}\,.</math> Therefore, <math>\frac{1}{\sqrt{5}\, q^2}</math> is an upper bound for the Diophantine approximations of any irrational number. The constant in this result may not be further improved without excluding some irrational numbers (see below). [[Émile Borel]] (1903)<ref>{{harvnb|Perron|1913|loc=Chapter 2, Theorem 15}}</ref> showed that, in fact, given any irrational number {{math|''α''}}, and given three consecutive convergents of {{math|''α''}}, at least one must satisfy the inequality given in Hurwitz's Theorem.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)