2 Reduction to Diophantine equations
We will work with a variant of \(S_{\alpha ,\beta ,\gamma }(X)\)
Let \(S^*_{\alpha ,\beta ,\gamma }(X)\) to be the number of \((a,b,c)\in \mathbb {N}^3\) with \(\gcd (a,b,c)=1\) and
We begin by noting that by the pigeonhole principle,
We have
There exists \(\varepsilon {\gt}0\) such that for all \(\mathbf{c}\in \mathbb {Z}^3\) and \(\mathbf{X},\mathbf{Y},\mathbf{Z}\in \mathbb {R}_{{\gt}0}^{d}\). we have
The following result allows us to bound \(S^*_{\alpha ,\beta ,\gamma }(X)\) in terms of the number of solutions to certain monomial Diophantine equations. In order to state it, we need to introduce the quantity \(B_d\)
For \(\mathbf{c}\in \mathbb {Z}^3\) and \(\mathbf{X},\mathbf{Y},\mathbf{Z}\in \mathbb {R}_{{\gt}0}^{d}\). we have
Let \(\varepsilon \in (0,1/2)\), and let \(2\leq n\leq X\) be an integer. Then there exists a factorisation
for positive integers \(x_j,c\) such that \(c\leq X^{\varepsilon /2}\), the \(x_j\) are pairwise coprime, and
Fix \(2\le n\le X\) and let \(K=2\lceil \varepsilon ^{-1}\rceil \), \(M=\lfloor \frac{5}{2}\varepsilon ^{-2}\rfloor \). Define
For \(j\leq M\), we set
All the \(x_j\) are pairwise coprime, since the \(y_j\) are pairwise coprime.
Note that by definition \(c\prod _{j\leq M}x_j^j=\prod _{m\geq 1}y_m^m=n\leq X\). In particular,
Then, since \(m-K\lfloor m/K\rfloor \le K\), it follows from the definition of \(c\) that
Thus
On the other hand, we have
Recalling that the \(y_j\) are squarefree and pairwise coprime for \(j\neq K\), gives the lower bound
as claimed.
Let \(\alpha ,\beta ,\gamma \in (0,1]\) be fixed and let \(X\geq 2\). For any \(\varepsilon {\gt}0\) there exists an integer \(d=d(\varepsilon )\geq 1\) such that the following holds. There exist \(X_1,\ldots , X_d,Y_1,\ldots , Y_d, Z_1,\ldots , Z_d\geq 1\) satisfying
and
and pairwise coprime integers \(1\leq c_1,c_2,c_3\leq X^{\varepsilon }\), such that
We may assume that \(X\) is large enough in terms of \(\varepsilon \), since otherwise the claim is trivial. Let \((a,b,c)\) be a triple counted by \(S^*_{\alpha ,\beta ,\gamma }(X)\). Apply Lemma 2.5 (with \(\varepsilon ^2/2\) in place of \(\varepsilon \)) to each of \(a,b,c\) to obtain factorisations of the form
where \(d=\lfloor 10\varepsilon ^{-4}\rfloor \) and \(1\leq c_1,c_2,c_3\leq X^{\varepsilon ^2/4}\). Since \((a,b,c)\) is counted by \(S^*_{\alpha ,\beta ,\gamma }(X)\), we have \(\gcd (a,b,c)=1\) and \(a+b=c\), so \(a,b,c\) are pairwise coprime. Hence, all the \(3d+3\) numbers \(x_i,y_i,z_i,c_1,c_2,c_3\) are pairwise coprime. Note also that by the properties of the factorisation given by Lemma 2.5, we have
Since \(\operatorname{rad}(a)\sim X^{\alpha },\operatorname{rad}(b)\sim X^{\beta },\operatorname{rad}(c)\sim X^{\gamma }\) for all triples under consideration, this implies
By dyadic decomposition, we can now find some \(X_i, Y_i,Z_i\) such that ?? and ?? hold, and such that
Now the claim follows from the pigeonhole principle.