The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation
Abstract
Given a monotonically decreasing : N [0,∞), Khintchine's Theorem provides an efficient tool to decide whether, for almost every α ∈ R, there are infinitely many (p,q) ∈ Z2 such that α - pq ≤ (q)q. 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 k≥ 1, any function : N [0,1/2] (not necessarily monotonic) and almost every α ∈ Rk, there exist infinitely many q such that Πi=1k αi - piq ≤ (q)qk, p1,…,pk all coprime to q, if and only if \[Σq ∈ N (q) ((q)q )k (q(q)(q))k-1 = ∞.\] This settles a conjecture of Beresnevich, Haynes, and Velani.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.