The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation
arXiv:2403.11257
Abstract
Given a monotonically decreasing , Khintchine's Theorem provides an efficient tool to decide whether, for almost every , there are infinitely many such that . The recent result of Koukoulopoulos and Maynard provides an elegant way of removing monotonicity when only counting reduced fractions. Gallagher showed a multiplicative higher-dimensional generalization to Khintchine's Theorem, again assuming monotonicity. In this article, we prove the following Duffin-Schaeffer-type result for multiplicative approximations: For any , any function (not necessarily monotonic) and almost every , there exist infinitely many such that all coprime to , if and only if \[\sum\limits_{q \in \mathbb{N}} ψ(q) \left(\frac{φ(q)}{q} \right)^k\log \left(\frac{q}{φ(q)ψ(q)}\right)^{k-1} = \infty.\] This settles a conjecture of Beresnevich, Haynes, and Velani.
23 pages, 3 figures, comments are welcome!