Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Dimitris Koukoulopoulos and James Maynard, On the Duffin-Schaeffer conjecture, Ann. of Math. (2) 192 (2020), no. 1, 251--307, doi:10.4007/annals.2020.192.1.5. Labels and pages here are those of the edition named on the source card, arXiv:1907.04593v3; Theorem 1 is stated on p. 2.
Statement
Let satisfy
Let be the set of for which the inequality
has infinitely many solutions in coprime integers and . Then has Lebesgue measure .
No monotonicity or regularity of is assumed, and the inequality is non-strict. The proof works with the set of points lying in infinitely many , where is the part of covered by the intervals with and (displays (1.3) and (1.4), p. 2).
The converse half is recorded on p. 2 as (1.5): if the same series converges, then , by the easy direction of the Borel-Cantelli lemma. Together, (1.5) and Theorem 1 make the measure of equal to or according as the series converges or diverges. The paper notes (p. 2) that the implication of Theorem 1 is the conjecture Duffin and Schaeffer posed in 1941, listed as Problem 46 in Montgomery's lectures.
Read depth. Claims checked: the statement, its hypotheses and (1.5) were read clause by clause on the pages of the edition named above. The proof was followed for its structure only; its estimates were not checked. Nothing here is independently reviewed.
Proof pointer
The proof occupies Sections 5 to 14 (pp. 11--45); Section 3 (pp. 6--10) outlines it and Section 4 (pp. 10--11) charts its dependencies.
Section 5 (pp. 11--15). Values are split off and handled by Lemma 5.2, which the paper takes from Pollington and Vaughan; so one may assume . Gallagher's zero-one law (Lemma 5.1) then reduces the theorem to . On a block where the sum of over lies in , a second-moment (Cauchy-Schwarz) argument and the known overlap bound for (Lemma 5.3, from Pollington and Vaughan) reduce the theorem to a bound on the weighted pairs with large greatest common divisor, Proposition 5.4 (p. 12), whose bound is for the pairs in its set .
Sections 6 to 14. Proposition 5.4 is recast as a statement about weighted bipartite "GCD graphs" (Proposition 6.3, p. 16) with vertex weight , and that in turn is reduced to finding a GCD subgraph of high "quality" (Proposition 7.1, p. 19). This subgraph is built by an iteration that passes to subgraphs in which a prime power divides many vertices, a density-increment and compression argument (Propositions 8.1--8.3, pp. 23--24, proved in Sections 12--14 with the lemmas of Sections 9--11). Section 15 (pp. 45--46) explains that the factor in the weights is essential to this approach.
Dependencies
None in the corpus. External inputs named by the paper: Gallagher's zero-one law, and two results of Pollington and Vaughan (the case of large values of and the overlap bound for ).
Bears on
- Problem 999: Theorem 1 is the divergence half of the problem's equivalence and (1.5) the convergence half, both for real-valued , for and with the non-strict inequality . The problem states the equivalence for with the strict inequality ; the paper does not address that wording, and the problem's claim page records the translation.