Davenport–Schmidt theorem

Davenport–Schmidt theorem

In mathematics, specifically the area of Diophantine approximation, the Davenport–Schmidt theorem tells us how well a certain kind of real number can be approximated by another kind. Specifically it tells us that we can get a good approximation to irrational numbers that are not quadratic by using either quadratic irrationals or simply rational numbers. It is named after Harold Davenport and Wolfgang M. Schmidt.

Contents

Statement

Given a number α which is either rational or a quadratic irrational, we can find unique integers x, y, and z such that x, y, and z are not all zero, the first non-zero one among them is positive, they are relatively prime, and we have

x\alpha^2 +y\alpha +z=0.\,

If α is a quadratic irrational we can take x, y, and z to be the coefficients of its minimal polynomial. If α is rational we will have x = 0. With these integers uniquely determined for each such α we can define the height of α to be

H(\alpha)=\max\{|x|,|y|,|z|\}.\,

The theorem then says that for any real number ξ which is neither rational nor a quadratic irrational, we can find infinitely many real numbers α which are rational or quadratic irrationals and which satisfy

|\xi-\alpha|<CH(\alpha)^{-3},\,

where

C=\left\{\begin{array}{ c l } C_0 & \textrm{if}\ |\xi|<1 \\ C_0\xi^2 & \textrm{if}\ |\xi|>1.\end{array}\right.

Here we can take C0 to be any real number satisfying C0 > 160/9.[1]

While the theorem is related to Roth's theorem, its real use lies in the fact that it is effective, in the sense that the constant C can be worked out for any given ξ.

Notes

  1. ^ H. Davenport, Wolfgang M. Schmidt, "Approximation to real numbers by quadratic irrationals," Acta Arithmetica 13, (1967).

References

  • Wolfgang M. Schmidt. Diophantine approximation. Lecture Notes in Mathematics 785. Springer. (1980 [1996 with minor corrections])
  • Wolfgang M. Schmidt.Diophantine approximations and Diophantine equations, Lecture Notes in Mathematics, Springer Verlag 2000

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

  • Diophantine approximation — In number theory, the field of Diophantine approximation, named after Diophantus of Alexandria, deals with the approximation of real numbers by rational numbers. The absolute value of the difference between the real number to be approximated and… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Normal number — For the floating point meaning in computing, see normal number (computing). In mathematics, a normal number is a real number whose infinite sequence of digits in every base b[1] is distributed uniformly in the sense that each of the b digit… …   Wikipedia

  • Théorème du minimax de von Neumann — John von Neumann Vers où faut il …   Wikipédia en Français

  • Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… …   Wikipedia

  • Chebyshev function — The Chebyshev function ψ(x), with x < 50 The function ψ( …   Wikipedia

  • Helmut Hasse — (* 25. August 1898 in Kassel; † 26. Dezember 1979 in Ahrensburg bei Hamburg) war ein deutscher Mathematiker und gilt als einer der führenden Algebraiker und Zahlentheoretiker seiner Zeit …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”