Bilinear cancellation for badly approximable phases Created 2026-10-07 Updated 2026-10-14
Let be a badly approximable number, and sum with and . The Cauchy-Schwarz inequality, divisor-square summatory bound and geometric sums give . Separated rotations bound the last sum by , giving the displayed estimate. A hyperbolic cutoff remains valid because the allowed first-variable values after expansion form an interval.
For a positive nonsquare integer and positive integers , the integer is nonzero. Therefore . If , the denominator factor is at most ; otherwise the approximation error already exceeds one. This proves that a quadratic irrational of this form is a badly approximable number. For , splitting instead at gives the strict bound .
// Target: analytic-number-theory.bigb
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 28 7 ii Solution Created 2026-10-03 Updated 2026-10-14
Use the integer norm lower bound for rational approximation to a quadratic irrational. The integer is nonzero, since is irrational. If , thenbecause . If , the difference is at least . ThusIn particular, is a badly approximable number.
To estimate the prime-weighted exponential sum, let . The Dirichlet approximation theorem gives a reduced fraction withCombining this with the lower bound gives . Thus ; the approximation cannot have a small denominator.
The relevant analytic input is the prime exponential-sum estimate from Vaughan identity:Here is the structure behind that estimate. With Dirichlet convolution and cutoffs , the Vaughan identity isIt follows from , , and . The first two Dirichlet convolution terms become type I sums with one short factor; the last becomes a bilinear type II sum with both factors bounded below. Split these sums into dyadic blocks and use . For the type I sums, the inner finite geometric series has bound . For the type II sums, the Cauchy-Schwarz inequality followed by expansion introduces analogous sums in differences of indices. Rational approximation separates the phases into blocks of length comparable to , bounding these reciprocal-distance sums. The Dirichlet convolution coefficients are divisor-bounded, producing the logarithmic factors. These steps give the displayed estimate; no unproved cancellation of arbitrary weighted sums is being assumed.
With and , the two denominator-dependent terms are . ConsequentlyThe final passage absorbs the logarithm using the positive exponent margin .
For reduced with and , the displayed bound follows by splitting Vaughan identity with parameters . Type I sums use short geometric-sum bounds; type II sums use the Cauchy-Schwarz inequality and rational spacing to control bilinear cancellation. A badly approximable number has a Dirichlet approximant with , yielding and hence .
// Target: analytic-number-theory.bigb