Diophantine approximation
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers.
≈ 9 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers.
For this problem, a rational number p/q is a "good" approximation of a real number α if the absolute value of the difference between p/q and α may not decrease if p/q is replaced by another rational number with a smaller denominator. This problem was solved during the 18th century by means of simple continued fractions.
Knowing the "best" approximations of a given number, the main problem of the field is to find sharp upper and lower bounds of the above difference, expressed as a function of the denominator. It appears that these bounds depend on the nature of the real numbers to be approximated: the lower bound for the approximation of a rational number by another rational number is larger than the lower bound for algebraic numbers, which is itself larger than the lower bound for all real numbers.
Thus a real number that may be better approximated than the bound for algebraic numbers is certainly a transcendental number. This knowledge enabled Liouville, in 1844, to produce the first explicit transcendental number. Later, the proofs that and e are transcendental were obtained by a similar method.…
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers.
For this problem, a rational number p/q is a "good" approximation of a real number α if the absolute value of the difference between p/q and α may not decrease if p/q is replaced by another rational number with a smaller denominator. This problem was solved during the 18th century by means of simple continued fractions.
Knowing the "best" approximations of a given number, the main problem of the field is to find sharp upper and lower bounds of the above difference, expressed as a function of the denominator. It appears that these bounds depend on the nature of the real numbers to be approximated: the lower bound for the approximation of a rational number by another rational number is larger than the lower bound for algebraic numbers, which is itself larger than the lower bound for all real numbers.
Thus a real number that may be better approximated than the bound for algebraic numbers is certainly a transcendental number. This knowledge enabled Liouville, in 1844, to produce the first explicit transcendental number. Later, the proofs that and e are transcendental were obtained by a similar method.
Diophantine approximations and transcendental number theory are very close areas that share many theorems and methods. Diophantine approximations also have important applications in the study of Diophantine equations. The 2022 Fields Medal was awarded to James Maynard, in part for his work on Diophantine approximation.
For example, the constant e = 2.718281828459045235... has the (regular) continued fraction representation [2;1,2,1,1,4,1,1,6,1,1,8,1,\ldots\;]. Its best approximations for the second definition are 3, \tfrac{8}{3}, \tfrac{11}{4}, \tfrac{19}{7}, \tfrac{87}{32}, \ldots\, , while, for the first definition, they are 3, \tfrac{5}{2}, \tfrac{8}{3}, \tfrac{11}{4}, \tfrac{19}{7}, \tfrac{49}{18}, \tfrac{68}{25}, \tfrac{87}{32}, \tfrac{106}{39}, \ldots\, .
The obvious measure of the accuracy of a Diophantine approximation of a real number by a rational number is \left|\alpha - \frac{p}{q}\right|. However, this quantity can always be made arbitrarily small by increasing the absolute values of and ; thus the accuracy of the approximation is usually estimated by comparing this quantity to some function of the denominator , typically a negative power of it.
For such a comparison, one may want upper bounds or lower bounds of the accuracy. A lower bound is typically described by a theorem like "for every element of some subset of the real numbers and every rational number , we have \left|\alpha - \frac{p}{q}\right|>\phi(q) ". In some cases, "every rational number" may be replaced by "all rational numbers except a finite number of them", which amounts to multiplying by some constant depending on .
For upper bounds, one has to take into account that not all the "best" Diophantine approximations provided by the convergents may have the desired accuracy. Therefore, the theorems take the form "for every element of some subset of the real numbers, there are infinitely many rational numbers such that \left|\alpha - \frac{p}{q}\right| ".
Badly approximable numbers
A badly approximable number is an x for which there is a positive constant c such that for all rational p/q we have \left|{ x - \frac{p}{q} }\right| > \frac{c}{q^2} \ . The badly approximable numbers are precisely those with bounded partial quotients.
Equivalently, a number is badly approximable if and only if its Markov constant is finite or equivalently its simple continued fraction is bounded. A rational number \alpha =\frac{a}{b} may be obviously and perfectly approximated by \frac{p_i}{q_i} = \frac{i\,a}{i \,b} for every positive integer i. If \frac{p}{q} \not= \alpha = \frac{a}{b}\,, we have \left|\frac{a}{b} - \frac{p}{q}\right| = \left|\frac{aq - bp}{bq}\right| \ge \frac{1}{bq}, because |aq - bp| is a positive integer and is thus not lower than 1.
Thus the accuracy of the approximation is bad relative to irrational numbers (see next sections). It may be remarked that the preceding proof uses a variant of the pigeonhole principle: a non-negative integer that is not 0 is not smaller than 1. This apparently trivial remark is used in almost every proof of lower bounds for Diophantine approximations, even the most sophisticated ones.
In summary, a rational number is perfectly approximated by itself, but is badly approximated by any other rational number. \sum_{j=1}^\infty 10^{-j!} = 0.110001000000000000000001000\ldots\,, which does not satisfy Liouville's theorem, whichever degree n is chosen. This link between Diophantine approximations and transcendental number theory continues to the present day.
Many of the proof techniques are shared between the two areas. In some sense, this result is optimal, as the theorem would be false with ε = 0. This is an immediate consequence of the upper bounds described below. \left|x_i - \frac{p_i}{q}\right| Again, this result is optimal in the sense that one may not remove from the exponent.
Aleksandr Khinchin proved in 1926 that if the series \sum_{q} \psi(q) diverges, then almost every real number (in the sense of Lebesgue measure) is \psi -approximable, and if the series converges, then almost every real number is not \psi -approximable. The circle of ideas surrounding this theorem and its relatives is known as metric Diophantine approximation or the metric theory of Diophantine approximation (not to be confused with height "metrics" in Diophantine geometry) or metric number theory. proved a generalization of Khinchin's result, and posed what is now known as the Duffin–Schaeffer conjecture on the analogue of Khinchin's dichotomy for general, not necessarily decreasing, sequences \psi . proved that a Hausdorff measure analogue of the Duffin–Schaeffer conjecture is equivalent to the original Duffin–Schaeffer conjecture, which is a priori weaker.
In July 2019, Dimitris Koukoulopoulos and James Maynard announced a proof of the conjecture. An important example of a function \psi to which Khinchin's theorem can be applied is the function \psi_c(q) = q^{-c} , where c > 1 is a real number. For this function, the relevant series converges and so Khinchin's theorem tells us that almost every point is not \psi_c -approximable.
Thus, the set of numbers which are \psi_c -approximable forms a subset of the real line of Lebesgue measure zero. The Jarník-Besicovitch theorem, due to V. Jarník and A. S. Besicovitch, states that the Hausdorff dimension of this set is equal to 1/c . In particular, the set of numbers which are \psi_c -approximable for some c > 1 (known as the set of very well approximable numbers) has Hausdorff dimension one, while the set of numbers which are \psi_c -approximable for all c > 1 (known as the set of Liouville numbers) has Hausdorff dimension zero.
Another important example is the function \psi_\varepsilon(q) = \varepsilon q^{-1} , where \varepsilon > 0 is a real number. For this function, the relevant series diverges and so Khinchin's theorem tells us that almost every number is \psi_\varepsilon -approximable.
This is the same as saying that every such number is well approximable, where a number is called well approximable if it is not badly approximable. So an appropriate analogue of the Jarník-Besicovitch theorem should concern the Hausdorff dimension of the set of badly approximable numbers. And indeed, V. Jarník proved that the Hausdorff dimension of this set is equal to one.
This result was improved by W. M. Schmidt, who showed that the set of badly approximable numbers is incompressible, meaning that if f_1,f_2,\ldots is a sequence of bi-Lipschitz maps, then the set of numbers x for which f_1(x),f_2(x),\ldots are all badly approximable has Hausdorff dimension one. Schmidt also generalized Jarník's theorem to higher dimensions, a significant achievement because Jarník's argument is essentially one-dimensional, depending on the apparatus of continued fractions.
See also
Davenport–Schmidt theorem Duffin–Schaeffer theorem Heilbronn set Low-discrepancy sequence
Text derived from https://en.wikipedia.org/w/index.php?oldid=1306115840 under CC BY-SA 4.0; modifications have been made.