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.

Articles by others on the same topic (0)

There are currently no matching articles.