Counterexamples, covering systems, and zero-one laws for inhomogeneous approximation
Abstract
We develop the inhomogeneous counterpart to some key aspects of the story of the Duffin--Schaeffer Conjecture (1941). Specifically, we construct counterexamples to a number of candidates for a sans-monotonicity version of Szusz's inhomogeneous (1958) version of Khintchine's Theorem (1924). For example, given any real sequence yi, we build a divergent series of non-negative reals psi(n) such that for any y in yi, almost no real number is inhomogeneously psi-approximable with inhomogeneous parameter y. Furthermore, given any second sequence zi not intersecting the rational span of 1,yi, and assuming a dynamical version of Erdos' Covering Systems Conjecture (1950), we can ensure that almost every real number is inhomogeneously psi-approximable with any inhomogeneous parameter z in zi. Next, we prove a positive result that is near optimal in view of the limitations that our counterexamples impose. This leads to a discussion of natural analogues of the Duffin--Schaeffer Conjecture and Duffin--Schaeffer Theorem (1941) in the inhomogeneous setting. As a step toward these, we prove versions of Gallagher's Zero-One Law (1961) for inhomogeneous approximation by reduced fractions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.