English

The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation

Number Theory 2024-03-19 v1

Abstract

Given a monotonically decreasing ψ:N[0,)\psi: \mathbb{N} \to [0,\infty), Khintchine's Theorem provides an efficient tool to decide whether, for almost every αR\alpha \in \mathbb{R}, there are infinitely many (p,q)Z2(p,q) \in \mathbb{Z}^2 such that αpqψ(q)q\left\lvert \alpha - \frac{p}{q}\right\rvert \leq \frac{\psi(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 k1k\geq 1, any function ψ:N[0,1/2]\psi: \mathbb{N} \to [0,1/2] (not necessarily monotonic) and almost every αRk\alpha \in \mathbb{R}^k, there exist infinitely many qq such that i=1kαipiqψ(q)qk,p1,,pk\prod\limits_{i=1}^k \left\lvert \alpha_i - \frac{p_i}{q}\right\rvert \leq \frac{\psi(q)}{q^k}, p_1,\ldots,p_k all coprime to qq, if and only if qNψ(q)(φ(q)q)klog(qφ(q)ψ(q))k1=.\sum\limits_{q \in \mathbb{N}} \psi(q) \left(\frac{\varphi(q)}{q} \right)^k\log \left(\frac{q}{\varphi(q)\psi(q)}\right)^{k-1} = \infty. This settles a conjecture of Beresnevich, Haynes, and Velani.

Keywords

Cite

@article{arxiv.2403.11257,
  title  = {The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation},
  author = {Lorenz Frühwirth and Manuel Hauke},
  journal= {arXiv preprint arXiv:2403.11257},
  year   = {2024}
}

Comments

23 pages, 3 figures, comments are welcome!

R2 v1 2026-06-28T15:23:20.819Z