Consider the fractional parts
in . Divide that interval into intervals of length . By the pigeonhole principle, two fractional parts, say those indexed by , lie in the same interval. Thus, for some integer ,
Set . Then , and division by gives the Dirichlet approximation theorem
Solved by gpt-5.6-sol high.
One Archimedean form of the Schmidt subspace theorem is as follows. Let be linearly independent linear forms in variables with algebraic coefficients. For every , all nonzero satisfying
belong to a finite union of proper rational linear subspaces of .
We will also use its finite-place form: if is a finite set of places containing the Archimedean ones and, for each , the forms are independent, then the integer solutions of
lie in finitely many proper rational subspaces. The absolute values are normalized so that the product formula holds.
Solved by gpt-5.6-sol high.
The Roth theorem states that if is a real algebraic irrational number, then for every there are only finitely many reduced fractions satisfying
To derive this from the Schmidt subspace theorem, take
These forms are linearly independent. For a solution with large, , so , while
After slightly decreasing , the Schmidt subspace theorem puts all such primitive vectors in finitely many rational lines. Each rational line contains only the two opposite primitive integer vectors , and these determine the same fraction. Hence only finitely many fractions occur.
Solved by gpt-5.6-sol high.
Fix a finite set of primes. We prove that only finitely many denominators can be S-smooth number. This is the standard finite-place corollary of the Schmidt subspace theorem for best approximations of the first kind; the reduction is recalled here because the target need not be algebraic.
Apply the Dirichlet approximation theorem at each cutoff between two successive record denominators. Its approximant can be replaced by the last record without increasing the error. Apply the finite-place Schmidt subspace theorem to the resulting pairs of primitive vectors, using at the real place only after eliminating between two successive pairs, and at every place belonging to . The factors
for an -smooth denominator supply the required height saving. If infinitely many such records existed, one fixed rational subspace would contain infinitely many of the paired vectors. Eliminating its rational linear relation has two possible outcomes: either all sufficiently late records represent one rational number, which contradicts the irrationality of , or is algebraic and, for some , infinitely many of the records satisfy
The latter alternative contradicts the Roth theorem. Thus only finitely many are -smooth.
If the largest prime factor of did not tend to infinity, some bound would contain the largest prime factor for infinitely many . Taking to be the finite set of primes at most would make those denominators -smooth, contrary to the preceding conclusion. Therefore .
Solved by gpt-5.6-sol high.
If
its Mahler measure is
If is the primitive minimal polynomial of an algebraic number and , the height-Mahler measure formula is
Solved by gpt-5.6-sol high.
Choose a number field containing . At every place of , put
The triangle inequality gives
where at every non-Archimedean place because the coefficients are integers, while at an Archimedean place one may take
Raise these inequalities to the local weights and multiply over all places. The definition of the Absolute multiplicative Weil height and the product formula then give
This is the height bound for a polynomial evaluation.
Solved by gpt-5.6-sol high.
Take distinct . Their difference has the form
where has degree at most and polynomial length at most . By the height bound for a polynomial evaluation,
The algebraic number is nonzero and has degree at most , so the Liouville height inequality gives the separation
All elements of lie in an interval of length at most
Since , another application of the Liouville height inequality gives
The number of points in an interval is at most one plus its length divided by their minimum separation. Consequently
Thus the requested statement holds, for example, with the absolute constant .
Solved by gpt-5.6-sol high.
Suppose, for a contradiction, that suitable nonzero polynomials vanish at both and . If , then the primitive minimal polynomial divides . The multiplicativity of Mahler measure and the Mahler measure bounded by polynomial length give
If , then, using , this inequality contradicts . Hence is a proper intermediate field of . Its degree divides the prime by the tower law, so . Applying the same argument to is even stronger and gives . Since ,
contrary to . At least one of the two proposed values of therefore has no such polynomial relation.
Solved by gpt-5.6-sol high.
Write . Since has degree at least two and lies in , . Put
Then and
Let
Part (d), applied with in place of its polynomial-degree parameter, supplies such that no nonzero integer polynomial of degree at most and with coefficients of absolute value less than vanishes at .
It follows that the sums
are distinct. Since
they form a subset of . Hence
as required.
Solved by gpt-5.6-sol high.
For , the nonzero algebraic number has degree at most
The basic height inequality gives
The Liouville height inequality therefore yields
Thus one may take the explicit constant
Solved by gpt-5.6-sol high.
A suitable theorem is the Baker lower bound for a homogeneous linear form in logarithms. Let be nonzero algebraic numbers with chosen logarithms and let
Choose to bound the degree-normalized Absolute logarithmic Weil height of and , and put . If , then
where is an effectively computable constant depending only on and the degree of the number field generated by the .
Solved by gpt-5.6-sol high.
Let be the monic cubic minimal polynomial of the algebraic integer , let be its conjugates, and let be the two conjugates of a nonrational . Because the degrees three and two are coprime, the fields are linearly disjoint, and
is a nonzero integer.
Assume
For large this makes bounded. Since is a quadratic algebraic integer, the height-Mahler measure formula gives
and therefore . The two remaining factors with are bounded, while the three factors with are . Consequently
We now use the standard effective norm form consequence of Part (b). For
where is an integral basis of , the effective norm-form height estimate supplies effective constants , depending only on and , such that
for every nonzero . Its proof factors , balances a generator using the Dirichlet unit theorem, and applies the Baker lower bound for a homogeneous linear form in logarithms to the linear relations defining ; the coprime degrees and exclude a unit-family degeneracy.
Apply this estimate to . Since , the height inequalities imply . Hence
Choose the effective value . The last inequality bounds effectively. The rational integers are already covered by the stronger degree-three Liouville approximation theorem, and the Northcott theorem leaves only finitely many remaining quadratic integers of bounded height. Taking the minimum of
over this effective finite set gives an effective and proves
for every .
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.