Thue–Siegel–Roth Theorem
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, Roth's theorem is a fundamental result in
diophantine approximation 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 r ...
to
algebraic number An algebraic number is a number that is a root of a non-zero polynomial in one variable with integer (or, equivalently, rational) coefficients. For example, the golden ratio, (1 + \sqrt)/2, is an algebraic number, because it is a root of the po ...
s. It is of a qualitative type, stating that algebraic numbers cannot have many
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ration ...
approximations that are 'very good'. Over half a century, the meaning of ''very good'' here was refined by a number of mathematicians, starting with
Joseph Liouville Joseph Liouville (; ; 24 March 1809 – 8 September 1882) was a French mathematician and engineer. Life and work He was born in Saint-Omer in France on 24 March 1809. His parents were Claude-Joseph Liouville (an army officer) and Thérèse ...
in 1844 and continuing with work of , , , and .


Statement

Roth's theorem states that every
irrational Irrationality is cognition, thinking, talking, or acting without inclusion of rationality. It is more specifically described as an action or opinion given through inadequate use of reason, or through emotional distress or cognitive deficiency. T ...
algebraic number \alpha has approximation exponent equal to 2. This means that, for every \varepsilon>0, the inequality :\left, \alpha - \frac\ < \frac can have only finitely many solutions in
coprime integers In mathematics, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equivale ...
p and q. Roth's proof of this fact resolved a conjecture by Siegel. It follows that every irrational algebraic number α satisfies :\left, \alpha - \frac\ > \frac with C(\alpha,\varepsilon) a positive number depending only on \varepsilon>0 and \alpha.


Discussion

The first result in this direction is Liouville's theorem on approximation of algebraic numbers, which gives an approximation exponent of ''d'' for an algebraic number α of degree ''d'' ≥ 2. This is already enough to demonstrate the existence of
transcendental number In mathematics, a transcendental number is a number that is not algebraic—that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are and . Though only a few classes ...
s. Thue realised that an exponent less than ''d'' would have applications to the solution of
Diophantine equation In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a c ...
s and in Thue's theorem from 1909 established an exponent d/2 + 1 + \varepsilon. Siegel's theorem improves this to an exponent about 2, and Dyson's theorem of 1947 has exponent about . Roth's result with exponent 2 is in some sense the best possible, because this statement would fail on setting \varepsilon = 0: by
Dirichlet's theorem on diophantine approximation In number theory, Dirichlet's theorem on Diophantine approximation, also called Dirichlet's approximation theorem, states that for any real numbers \alpha and N , with 1 \leq N , there exist integers p and q such that 1 \leq q \leq N and ...
there are infinitely many solutions in this case. However, there is a stronger conjecture of
Serge Lang Serge Lang (; May 19, 1927 – September 12, 2005) was a French-American mathematician and activist who taught at Yale University for most of his career. He is known for his work in number theory and for his mathematics textbooks, including the i ...
that :\left, \alpha - \frac\ < \frac can have only finitely many solutions in integers ''p'' and ''q''. If one lets α run over the whole of the set of real numbers, not just the algebraic reals, then both Roth's conclusion and Lang's hold for
almost all In mathematics, the term "almost all" means "all but a negligible amount". More precisely, if X is a set, "almost all elements of X" means "all elements of X but those in a negligible subset of X". The meaning of "negligible" depends on the math ...
\alpha. So both the theorem and the conjecture assert that a certain
countable set In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; ...
misses a certain set of measure zero. The theorem is not currently
effective Effectiveness is the capability of producing a desired result or the ability to produce desired output. When something is deemed effective, it means it has an intended or expected outcome, or produces a deep, vivid impression. Etymology The ori ...
: that is, there is no bound known on the possible values of ''p'',''q'' given \alpha. showed that Roth's techniques could be used to give an effective bound for the number of ''p''/''q'' satisfying the inequality, using a "gap" principle. The fact that we do not actually know ''C''(ε) means that the project of solving the equation, or bounding the size of the solutions, is out of reach.


Proof technique

The proof technique involves constructing an
auxiliary Auxiliary may refer to: * A backup site or system In language * Auxiliary language (disambiguation) * Auxiliary verb In military and law enforcement * Auxiliary police * Auxiliaries, civilians or quasi-military personnel who provide support of ...
multivariate polynomial in an arbitrarily large number of variables depending upon \varepsilon, leading to a contradiction in the presence of too many good approximations. More specifically, one finds a certain number of rational approximations to the irrational algebraic number in question, and then applies the function over each of these simultaneously (i.e. each of these rational numbers serve as the input to a unique variable in the expression defining our function). By its nature, it was ineffective (see
effective results in number theory For historical reasons and in order to have application to the solution of Diophantine equations, results in number theory have been scrutinised more than in other branches of mathematics to see if their content is effectively computable. Where i ...
); this is of particular interest since a major application of this type of result is to bound the number of solutions of some
diophantine equation In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a c ...
s.


Generalizations

There is a higher-dimensional version, Schmidt's subspace theorem, of the basic result. There are also numerous extensions, for example using the
p-adic metric In mathematics, the -adic number system for any prime number  extends the ordinary arithmetic of the rational numbers in a different way from the extension of the rational number system to the real and complex number systems. The extensi ...
, based on the Roth method. William J. LeVeque generalized the result by showing that a similar bound holds when the approximating numbers are taken from a fixed
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a f ...
. Define the ''
height Height is measure of vertical distance, either vertical extent (how "tall" something or someone is) or vertical position (how "high" a point is). For example, "The height of that building is 50 m" or "The height of an airplane in-flight is abou ...
'' ''H''(ξ) of an algebraic number ξ to be the maximum of the absolute values of the coefficients of its minimal polynomial. Fix κ>2. For a given algebraic number α and algebraic number field ''K'', the equation : , \alpha - \xi , < \frac has only finitely many solutions in elements ξ of ''K''.


See also

*
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 ...
*
Granville–Langevin conjecture The ''abc'' conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985. It is stated in terms of three positive integers ''a'', '' ...
* Størmer's theorem *
Diophantine geometry In mathematics, Diophantine geometry is the study of Diophantine equations by means of powerful methods in algebraic geometry. By the 20th century it became clear for some mathematicians that methods of algebraic geometry are ideal tools to study ...


Notes


References

* * * * * * *


Further reading

* * * * {{DEFAULTSORT:Thue-Siegel-Roth Theorem Diophantine approximation Theorems in number theory Algebraic numbers