Gallagher's theorem (1962) gives a Khintchine-type dichotomy for the Lebesgue measure of the set of multiplicatively ψ-approximable points in Rn, n≥2, for monotonic functions ψ. We establish this dichotomy for arbitrary functions ψ, proving a conjecture of Beresnevich, Haynes, and Velani (2013).
Introduction
Multiplicative Diophantine approximation concerns the set Gn(ψ) of α=(α1,…,αn)∈Rn such that there are infinitely many solutions to
where ψ:N→[0,∞) is a given function. The foremost open problem in this area is Littlewood’s conjecture, stating that
L:=ε>0⋂G2(ε/q)=R2.
It is a simple matter to show that L has full Lebesgue measure, and much of the work toward Littlewood’s conjecture has resulted in further descriptions of the smallness of the exceptional set R2∖L. Most notably, Einsiedler, Katok, and Lindenstrauss [14] [2006] showed that R2∖L is a countable union of sets of zero box-counting dimension, improving vastly on the baseline knowledge that it is a null set.
In a related direction of research, one aims to determine the extent to which the claim in Littlewood’s conjecture can be strengthened, after allowing an exceptional set of Lebesgue measure zero. Gallagher proved the following theorem.
Gallagher’s Theorem ([16] [1962]). Let n≥2 and let ψ:N→[0,∞) be monotonically decreasing. Then
where logx:=max{lnx,1}, and λn denotes the n-dimensional Lebesgue measure on [0,1]n.
Remark. In fact, the series appearing in [16] is ∑ψ(q)(logq)n−1, but the above statement is equivalent, in the presence of the monotonicity assumption, see e.g. [5 Remark 4]. We remark that the above theorem is also true for n=1. In this case it is exactly Khintchine’s theorem [20] [1924], and hence, Gallagher’s theorem is the extension of Khintchine’s theorem to the multiplicative setting.
Gallagher’s theorem implies that Littlewood’s conjecture can be strengthened by a factor of (logq)2 for almost all points, but for almost no points by a factor of (logq)2+δ, that is,
for every δ>0. Similarly, it implies that the n-dimensional analogue of Littlewood’s conjecture, which is open for every n≥2, holds almost everywhere in Rn with an extra factor of (logq)n, but almost nowhere with an extra factor of (logq)n+δ. Of course, Gallagher’s theorem says much more, giving a complete metric dichotomy for monotonic rates, in the style of Khintchine’s theorem [20] [1924]. Famously, the monotonicity assumption cannot be removed from Khintchine’s theorem [12] [1941]. In contrast, it has been conjectured by Beresnevich, Haynes, and Velani that Gallagher’s theorem holds for arbitrary functions [5] [2013, Conjecture 1]. In this paper, we prove that conjecture.
Theorem 1. Let n≥2 and let ψ:N→[0,∞) be arbitrary. Then
Similar questions have been considered for other forms of approximation, such as simultaneous, dual, systems of linear forms, as well as inhomogeneous approximation and approximation with coprimality restrictions [2, 3, 4, 6, 9, 12, 15, 17, 18, 19, 22, 24, 25, 26]. The case of simultaneous approximation was handled by Gallagher in a follow-up paper [17] to the above cited [16]. He showed that the higher-dimensional Khintchine theorem [21] [1926] can be stated with arbitrary functions.
The main difficulty in the multiplicative setup comes from the unwieldy geometry of the sets involved. Specifically, the multiplicative problems present nonconvex sets whose intersections one must understand. (See Figure 1 to Figure 4.) By contrast, the other forms of approximation mentioned above present metric balls and thickened subspaces, whose intersections are more tractable. Historically, the literature has exhibited a trade-off between convexity and monotonicity. Beresnevich, Haynes, and Velani give an enlightening discussion of this trade-off and various instances of it:
Figure 1. On the left: An illustration of a set Aq with one of the translated copies of Hq highlighted in purple. In this example, q=4, and the highlighted set is H4+(41,21). On the right: An illustration of the sets Aq′′ appearing in Gallagher [16], coming from the condition that each coordinate of a is coprime to q. Gallagher proved QIA for these sets, under a monotonicity assumption.
Figure 4. The contribution of the error terms. The top row shows the overlaps between an untruncated set Hq and coordinatewise shifts of Hr when there is a coincidence in the other coordinate. The middle row shows the same for the truncated sets Hq and Hr. Note the smaller purple regions of intersection for the truncated sets. The bottom row shows a comparison of the integrals of the measures of those overlaps.
“[T]he current body of metrical results for lim sup sets requires that either the approximating domains are convex or that the approximating function is monotonic.”
Khintchine’s theorem for simultaneous approximation in higher dimensions [21] [1926] used both convexity and monotonicity. Later, Gallagher [17] showed that monotonicity could be removed from that theorem; his arguments relied heavily on the convexity of the sets that the simultaneous approximation setup provides. By contrast, the proof of the multiplicative, and hence non-convex, Gallagher theorem [16] uses monotonicity in a crucial way.
Beresnevich, Haynes, and Velani also point out that what is commonly called Gallagher’s theorem is actually a consequence of a more general statement established in [16]:
“In fact, Gallagher considers lim sup sets arising from more general domains but monotonicity plays a crucial role in his approach and seems to be unremovable.”
Gallagher proved in [16] that instead of assuming convexity, a Khintchine-type behaviour under monotonicity holds for qα(mod1)∈Sq for infinitely many q, as long as the sets (Sq)q∈N satisfy
The multiplicative approximation sets qHq (see Figure 1) satisfy (2), and thus Gallagher’s multiplicative theorem is indeed an instance of this more general statement. A straightforward construction confirms the remark quoted above by showing that if one only assumes (2), then monotonicity is unremovable.
Theorem 2.For every n≥1, there exists a sequence of sets Sq satisfying (2) such that ∑λ(Sq) diverges and such that the set W of points α∈[0,1]n for which there are infinitely many solutions to
qα(mod1)∈Sq,q∈N
has Lebesgue measure 0.
In fact, the sets we construct for the proof of Theorem 2 are even convex. From a geometric perspective, removing monotonicity might require the consideration of further properties of the sets Sq, perhaps a bound on the ratio between the diameter (of reasonably truncated subsets of Sq) and the volume: Theorem 2 is based on very thin rectangles that reduce the problem to the one-dimensional setting, where monotonicity is known to be necessary. As we will see in the proof of Theorem 1, the hyperbolic shapes for multiplicative approximation are just “higher-dimensional enough” to allow the removal of monotonicity. The upshot is that the multiplicative problem (1) strikes a rare balance that allows us to dispense with both convexity and monotonicity for Theorem 1.
Organization of the paper
The remainder of the paper is organized as follows. In Section 2 we present the proof strategy in the context of previous methods, highlighting how our proof differs from previous approaches. In Section 3 we collect notation, and in Section 4 we state the established tools from the literature that are used in the proof of Theorem 1. In Section 5 we make elementary calculations that are directly used in the subsequent technical sections. In Section 6 we provide the technical heart of the paper by calculating upper bounds on second moments, and in Section 7 we conclude the proof of Theorem 1, as well as the (particularly short) proof of Theorem 2.
Acknowledgments
MHT was funded by the Austrian Science Fund (FWF) project 10.55776/ESP5134624. Parts of this project were carried out while MHT visited FAR. MHT would like to thank Wesleyan University, as well as the whole Ramírez family (Yeni, Luna, Joaquín and Felipe) for their hospitality. More precisely, he thanks Yeni for the excellent Sancocho de Cola, Luna for teaching him how to do Origami, and Joaquín and Felipe for showing him where to find Asteroids, Waldo, and other things that really matter in life.
The proof strategy
In this section, we outline the strategy of the proof of Theorem 1, focusing on the case where n=2. Note that G2(ψ)=limsupq→∞Aq where
A straightforward calculation (Lemma 5.3) shows that λ(Aq)≍ψ(q)logψ(q)1 and, therefore, the convergence part of Theorem 1 follows by an application of the first Borel–Cantelli lemma. The divergence part of Theorem 1 would follow from the second Borel–Cantelli lemma, if the sets (Aq)q∈N were stochastically independent. However, they are far from independent. Instead, we aim to show that they contain subsets Aq∗⊆Aq such that ∑λ(Aq∗) diverges and such that the (Aq∗)q exhibit a weaker form of independence, called quasi-independence on average (QIA). Specifically, it would suffice to prove that there exists an absolute constant C>0, and subsets Aq∗⊆Aq such that for infinitely many disjoint ranges [X,Y] with ∑X≤q≤Yλ(Aq∗)∈[1,2], we have
for then the Chung–Erdős Lemma (see § 5) would imply that in these ranges we had
λX≤q≤Y⋃Aq≥λX≤q≤Y⋃Aq∗≥(4C)−1,
and λ(G2(ψ))≥(4C)−1 would follow. A zero-one law (Theorem BHV, see § 5 and [5 Theorem 1]) would then give Theorem 1.
The most straightforward approach when aiming for (3) would be to choose Aq∗=Aq. Computing λ(Aq∩Ar) amounts to summing the volume of (Hq+qa)∩(Hr+rb) over all values of (a,b)∈Zq2×Zr2. Clearly, the volume of (Hq+qa)∩(Hr+rb) is determined by qa−rb. Hence, writing
by an application of the Chinese Remainder Theorem. Since w(x) is monotonically decreasing in ∣xi∣ for i=1,2 (here, the property (2) is decisive), we may bound the sum with an integral,
c∈Z2∑w(lcm(q,r)c)≤lcm(q,r)2∫R2w(x)dx+c∈Z2c1=0 or c2=0∑w(lcm(q,r)c).(5)
(See Figure 1.) For q=r, the coprimality conditions rule out the existence of contributions from pairs (a,b) satisfying (8). However, one now has λ(Aq′′)≍(qφ(q))2λ(Aq) (where φ denotes the Euler totient function), and if ψ is supported only on numbers q with many small prime factors, this can cause the series ∑λ(Aq′′) to converge. It is for this reason that Gallagher’s theorem has a monotonicity assumption on ψ: the weights φ(q)/q are bounded away from 0 on average, so employing partial summation shows that for monotonic ψ we have
q≤Q∑λ(Aq′′)≍q≤Q∑λ(Aq),(9)
and the series ∑λ(Aq′′) diverges. Now, having removed the contributions from (8) the bound (7) becomes
on average over long ranges of q, r. This implies (3) which, as discussed, is sufficient for full measure of the limsup set. This proves Gallagher’s theorem, but having crucially used the monotonicity assumption.
In fact, it was shown by Frühwirth and the first author [15] that a coordinate-wise coprimality condition in (1) also leads to Khintchine-type behaviour, without assuming monotonicity: denoting the underlying sets by Aq′, it was shown that ∑q∈Nλ(Aq′)=∞ implies λ(limsupq→∞Aq′)=1 for arbitrary ψ. This resolved a conjecture of Beresnevich, Haynes, and Velani [5 Conjecture 2], and incidentally clarified an overlooked detail in the problem, namely, that Aq′ has “arms” that extend past the arms of Aq′′ (see Figure 2), and result in a different divergence condition from the conjectured one appearing in [5]. As in the previously described argument for Gallagher’s theorem, it was necessary to restrict to subsets of the sets arising naturally for the respective approximation sets. Instead of working directly with Aq′, the arguments in [15] used fiberwise-smooth bump functions 0≤fq≤1Aq′ that could heuristically be thought of as producing truncated sets Aq∗⊆Aq′ similar to the ones Figure 2 depicts.1
Figure 2. The sets Aq′ and Aq,∗∗ appearing in Frühwirth–Hauke [15]. Note the long arms on Aq′ in comparison to the short arms of Aq′′ in Figure 1, and truncations in Aq,∗∗.
Returning to the original question, which assumes only the divergence of ∑qλ(Aq), it is clear that restricting to Aq′′ will not help, because without monotonicity, there is no guarantee that the series ∑λ(Aq′′) diverges. We will see, however, that instead of pairwise coprimality gcd(a1,q)=gcd(a2,q)=1, we can use jointly coprime vectors, i.e.,
(See Figure 3.) Unlike coprimality in dimension one or the pairwise coprimality assumption employed by Gallagher, the joint coprimality condition gcd(a1,a2,q)=1 holds for a positive proportion of a∈Zq2 for everyq. Therefore, the divergence of ∑qλ(Aq) implies the divergence of ∑qλ(Aq) without having to assume monotonicity. For q=r, the condition gcd(a1,a2,q)=1 rules out coincidences where both equalities in (8) hold, that is,
Figure 3. On the left: The sets Aq defined using gcd(a1,a2,q)=1. On the right: Their truncations Aq∗.
qa1=rb1ANDqa2=rb2.
but cannot avoid contributions from coordinate-wise coincidences
Evidently, we must study the error terms Eq,r. If one could show that
q,r∈[X,Y]∑Eq,r≪q∈[X,Y]∑λ(Aq)2≍1,(11)
then the sufficient QIA (3) for (Aq)q would follow.
We note that Gallagher himself used the same joint primitivity condition to remove monotonicity from Khintchine’s Theorem [21] in the question of simultaneous approximation[17]. There, the underlying approximation sets are squares, hence the function w behaves much more regularly. In fact, a direct application of the above method with w(x,0)≤∥w∥∞ allows us to establish (11) for the analogous sets. This highlights the convenience of working with sets having nice geometric properties. Khintchine’s theorem is about balls in a norm-induced metric; they are convex and have bounded eccentricity.
For the actual sets (Aq)q and the underlying hyperbolic regions Hq, this crude approach fails. In order to study (11) in more detail in an idealized setup, we pose the following Model problem: Consider a set M⊆[X,2X] with #M=N, where X is arbitrarily large in terms of N (in other words, assume Y=2X in the above). Further, assume that suppψ=M, ψ is constant on its support, and the total measure is comparable to 1, i.e.,
q∈M∑ψ(q)logψ(q)1=1,
which implies
ψ(q)≍NlogN1,q∈M.
The Model problem is to show (11) in this simplified scenario. Now it is particularly easy to compute that
However, there are known ensembles M⊆N of cardinality N where
q,r∈M∑qrgcd(q,r)=ω(NlogN),
thus (11) fails. Note that this is not due to coarseness of estimates, but a second moment that is really too large.
In order to overcome the issue, we further prune the sets (Aq)q, but this time at a local level: for fixed a=(a1,a2), instead of considering the whole hyperbolic region
This established (3) in the Model problem, where the support was restricted to dyadic ranges with constant function values on its support.
Going from the Model problem to arbitrary sets M with varying values of ψ is mainly a technical challenge that must be undertaken in order to correctly evaluate, or at least efficiently bound, an error term Eq,r that now depends non-trivially on q and r as well as ψ(q) and ψ(r). However, an application of Cauchy–Schwarz reduces this situation essentially to the Model problem. The passage to the higher-dimensional case n≥3 also works in a reasonably straightforward manner: instead of primitive vectors, we define the sets Aq using vectors (a1,…,an) where gcd(ai,aj,q)=1 for all i=j, a condition which is again satisfied by a positive proportion of all vectors a∈Zqn.
Now the n-dimensional version of the error term Eq,r contains an (n−1)-dimensional integral ∫Rn−1w(0,x)dx whose value is too large for QIA and, again, the issue is fixed by restricting to polynomially truncated sets Aq∗⊆Aq. (See Lemma 6.2.)
Notation
Throughout, ψ:N→[0,∞) is an arbitrary function. The quantity ψ(q)(logψ(q)1)n−1 is of special interest, so we reiterate the conventions that logx=max{1,lnx} and 0⋅log(1/0)n−1=0.
where α=(α1,…,αn)∈Rn and, in particular, the set
Gn(ψ)={α∈[0,1]n:(12) holds for infinitely many (a,q)∈Zn×N}.
Note that we now adopt the convention of viewing Gn as a subset of [0,1]n. No generality is lost, since its defining condition is Zn-periodic. We define
We use λn to denote Lebesgue measure on [0,1]n, often dropping the subscript when the context makes it clear, and write Zn:=Z/nZ. We use the classical O-notation as well as the Vinogradov notation ≪ for f≪g⟺f=O(g)⟺∃c>0:f(x)≤cg(x), and write f≍g if both f=O(g) and g=O(f).
Tools from the literature
The following theorem is due to Dyer–Harman [13 Theorem 1], see also Harman’s monograph [18 Chapter 3, Theorem 3.2].
Theorem DH. Let ε>0. Then
q,r∈M∑qrgcd(q,r)ψ(q)ψ(r)≪ε∣M∣εq∈M∑ψ(q)
for all finite sets M⊆N and any ψ:M→[0,1].
Remark. In fact sharper estimates are known than the simple ∣M∣ε, see Aistleitner–Berkes–Seip [1], Lewko–Radziwiłł [23], Bondarenko–Seip [7], or de la Bretèche–Tenenbaum [11] for more recent developments. For our purposes here, the bound stated above suffices.
The following zero-one law is due to Beresnevich–Haynes–Velani [5 Theorem 1].
Theorem BHV. Let n≥1 and ψ:N→[0,∞). Then λn(Gn(ψ))∈{0,1}.
Chung–Erdős Lemma. For measurable sets A1,A2,…,AN⊆(X,μ) in an arbitrary probability space,
μ(n=1⋃NAn)≥∑m,n=1Nμ(Am∩An)(∑n=1Nμ(An))2.
Preliminary lemmas
In this section we gather elementary calculations that go into the proof of Theorem 1. We start with the following lemma that concerns intersections of sets S⊆Rn having the property that
x=(x1,…,xn)∈S and ∣xi′∣≤∣xi∣(i=1,…,n)⟹x′=(x1′,…,xn′)∈S.(13)
It is a direct adaptation of [16 Lemma 1] to our setup, and it only differs from Gallagher’s lemma in that our sets are symmetric over 0, while Gallagher’s lie in the positive orthant. This is purely an expository choice; the two points of view are equivalent.
Lemma 5.1 ([16 Lemma 1]). If A,B⊆Rn satisfy (13), then λ(A∩(B+t)) is a decreasing function of ∣ti∣ (1≤i≤n) when the other components of t are held fixed.
Proof. Write t=(s,t) where s=(t1,…,tn−1) and t=tn. Then
(interpreting ∣∞−∞∣=∞). This function is decreasing in ∣t∣ so, by (14), the measure λ(A∩(B+t)) is decreasing in ∣tn∣, while holding all other coordinates fixed. The same argument can be carried out for ti, i=1,…,n. □
Next, we show that having pairwise joint coprimality is a generic condition.
Lemma 5.2. Let n≥2, and let
Zqn:={a=(a1,…,an)∈Zqn:gcd(ai,aj,q)=1 for all 1≤i<j≤n}.
Then we have #Zqn≫nqn.
Proof. Note that q↦#Zqn is multiplicative, so we can focus on q=pk, with p prime. Here we have
with implied constants depending only on n. For ψ(q)≥2−n, we have λ(Gq)=λ(Aq)=1.
Proof. The last claim follows from the fact that [−1/2,1/2]n⊆Gq when ψ(q)≥2−n. Hence we may assume for the rest of the proof that ψ(q)≤2−n. We prove the claim for Gq by induction on n. When n=2,
which establishes the claim for λ(Gq). Notice that Aq=T−1(Gq) where T:Tn→Tn is the mapping x↦qx(mod1). Since T is Lebesgue measure-preserving, the result for Aq holds.
The Chinese Remainder Theorem gives rep(c)≤gcd(q,r)n, and by the definition of Zq, we have rep(c)=0 if c has at least two vanishing entries. Consequently,
using the symmetry of w. Note that Hq is an intersection of two sets that both satisfy (13), hence Hq also satisfies (13). Therefore, Lemma 5.1 shows that w is a decreasing function in each coordinate ∣xi∣. Using this property, we obtain
Remark. The proof shows that in fact in place of 61, the exponent 2n+2n−1=21+o(1) is admissible in the above. This follows the recurring theme in metric Diophantine approximation that higher-dimensional problems are easier to prove because of the smaller overlaps of their concomitant sets.
Proof of Theorems 1 and 2
Proof of Theorem 2
Proof. Let Sq=[−ψ(q),ψ(q)]×[−21,21]n−1, where ψ is a function such that ∑ψ(q)=∞ and such that almost no real number is ψ-approximable. That is, ψ is a Duffin–Schaeffer-type counterexample, such as was first constructed in [12].
Since Sq is a product of symmetric intervals, it satisfies (13). Notice that λn(Sq)=2ψ(q), hence ∑λn(Sq) diverges. Finally, notice that
W=W1(ψ)×[0,1]n−1,
where W1(ψ) denotes the set of ψ-approximable numbers. Therefore λn(W)=0 by Fubini’s theorem. □
Proof of Theorem 1
The convergence part of Theorem 1 is standard: by Lemma 5.3, the convergence assumption in the theorem statement implies that ∑q≥1λ(Aq) converges, so, by the Borel–Cantelli lemma, the limsup set Gn(ψ) has zero measure. For the divergence part of Theorem 1, assume
q=1∑∞ψ(q)(logψ(q)1)n−1=∞.
Since Gn(ψ) contains the simultaneously ψ1/n-approximable points, the result would follow as a consequence of [17 Theorem 1] if ∑ψ(q) diverged. We may therefore assume ∑ψ(q) converges and, in particular, that ψ(q)→0. This implies that
and since there are arbitrarily large X<Y satisfying (19), this shows that
λ(q→∞limsupAq∗)>0,
hence λ(Gn(ψ))>0. By Theorem BHV (§ 5), this implies λ(Gn(ψ))=1. □
AI declaration
We used ChatGPT-6 Astra to generate TikZ code for Figures 1 to 4, which we then adjusted. We did not use AI for any of the mathematical work or the writing.
References
[1]C. Aistleitner, I. Berkes, and K. Seip. GCD sums from Poisson integrals and systems of dilated functions. J. Eur. Math. Soc. (JEMS), 17(6):1517–1546, 2015. 11arxiv.org/abs/1210.0741
[2]D. Allen, M. Hauke-Treuer, and F. A. Ramírez. The inhomogeneous Khintchine Theorem in dimension two, 2026. Preprint, arXiv:2605.19582. 2arxiv.org/abs/2605.19582
[3]D. Allen and F. A. Ramírez. Independence inheritance and Diophantine approximation for systems of linear forms. Int. Math. Res. Not. IMRN, (2):1760–1794, 2023. 2arxiv.org/abs/2109.03929
[4]D. Allen and F. A. Ramírez. Inhomogeneous approximation for systems of linear forms with primitivity constraints. Math. Z., 309(1):Paper No. 10, 27, 2025. 2arxiv.org/abs/2305.16098
[5]V. Beresnevich, A. Haynes, and S. Velani. Multiplicative zero-one laws and metric number theory. Acta Arith., 160(2):101–114, 2013. 2, 3, 4, 6, 12arxiv.org/abs/1012.0675
[6]V. Beresnevich and S. Velani. Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem. Int. Math. Res. Not. IMRN, (1):69–86, 2010. 2arxiv.org/abs/0811.0809
[7]A. Bondarenko and K. Seip. GCD sums and complete sets of square-free numbers. Bull. Lond. Math. Soc., 47(1):29–41, 2015. 11DOI
[9]S. Chow and N. Technau. Littlewood and Duffin-Schaeffer-type problems in Diophantine approximation. Mem. Amer. Math. Soc., 296(1475):v+74, 2024. 2
[10]K. L. Chung and P. Erdős. On the application of the Borel-Cantelli lemma. Trans. Amer. Math. Soc., 72:179–186, 1952. 12
[11]R. de la Bretèche and G. Tenenbaum. Sommes de Gál et applications. Proc. London Math. Soc. (3), 119(1):104–134, 2019. 11DOI
[12]R. J. Duffin and A. C. Schaeffer. Khintchine’s problem in metric Diophantine approximation. Duke Math. J., 8:243–255, 1941. 2, 16DOI
[13]T. Dyer and G. Harman. Sums involving common divisors. J. London Math. Soc. (2), 34(1):1–11, 1986. 11DOI
[14]M. Einsiedler, A. Katok, and E. Lindenstrauss. Invariant measures and the set of exceptions to Littlewood’s conjecture. Ann. of Math. (2), 164(2):513–560, 2006. 1DOI
[15]L. Frühwirth and M. Hauke. The Duffin–Schaeffer conjecture for multiplicative Diophantine approximation, 2024. Preprint, arXiv:2403.11257. 2, 6, 7arxiv.org/abs/2403.11257
[16]P. Gallagher. Metric simultaneous diophantine approximation. J. London Math. Soc., 37:387–390, 1962. 1, 2, 3, 5, 6, 12DOI
[18]G. Harman. Metric number theory, volume 18 of London Mathematical Society Monographs. New Series. The Clarendon Press Oxford University Press, New York, 1998. 2, 11
[19]M. Hauke and F. A. Ramirez. The Duffin–Schaeffer conjecture with a moving target. Discrete Analysis, to appear. arXiv:2407.05344. 2arxiv.org/abs/2407.05344
[20]A. Khintchine. Einige Sätze über Kettenbrüche, mit Anwendungen auf die Theorie der Diophantischen Approximationen. Math. Ann., 92(1-2):115–125, 1924. 2
[21]A. Khintchine. Zur metrischen Theorie der diophantischen Approximationen. Math. Z., 24(1):706–714, 1926. 2, 8DOI
[22]D. Koukoulopoulos and J. Maynard. On the Duffin–Schaeffer conjecture. Ann. of Math. (2), 192(1):251–307, 2020. 2
[23]M. Lewko and M. Radziwiłł. Refinements of Gal’s theorem and applications. Adv. Math., 305:280–297, 2017. 11arxiv.org/abs/1408.2334
[24]A. D. Pollington and R. C. Vaughan. The k-dimensional Duffin and Schaeffer conjecture. Mathematika, 37(2):190–200, 1990. 2
[25]F. A. Ramírez. The Duffin–Schaeffer conjecture for systems of linear forms. Journal of the London Mathematical Society, 109(5):e12909, 2024. 2arxiv.org/abs/2211.09996
[26]V. G. Sprindžuk. Metric theory of Diophantine approximations. Scripta Series in Mathematics. V. H. Winston & Sons, Washington, D.C.; John Wiley & Sons, New York-Toronto, Ont.-London, 1979. Translated from the Russian and edited by Richard A. Silverman, With a foreword by Donald J. Newman. 2