This paper investigates the structure and measure of Diophantine tuples over the ring of p-adic integers and their residue fields, providing new insights into their distribution and properties.
Contribution
It introduces methods to compute and estimate the measures of Diophantine m-tuples over _p and _p, advancing understanding of their distribution in p-adic contexts.
Findings
01
Computed measures of Diophantine tuples in _p and _p.
02
Estimated the distribution of these tuples in p-adic integers.
03
Provided bounds and asymptotic estimates for the measures.
Abstract
For an element r of a ring R, a Diophantine D(r)m-tuple is an m-tuple (a1,a2,…,am) of elements of R such that for all i,j with i=j, aiaj+r is a perfect square in R. In this article, we compute and estimate the measures of the sets of D(r)m-tuples in the ring Zp of p-adic integers, as well as its residue field Fp.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Diophantine Tuples over \use@mathgroup\M@U\symAMSbZp
Nitya Mani
(Mani): Stanford University, Department of Mathematics, Stanford, CA 94305
For an element r of a ring R, a D(r)m-tuple is an m-tuple (a1,a2,…,am) of elements of R such that for all i,j with i=j, aiaj+r is a perfect square in R. In this article, we compute and estimate the measures of the sets of D(r)m-tuples in the ring \use@mathgroup\M@U\symAMSbZp of p-adic integers, as well as its residue field \use@mathgroup\M@U\symAMSbFp.
1. Introduction
The study of Diophantine m-tuples has a long history, attracting the attention of the some of the most prominent mathematicians. The story begins in the 3rd century with Diophantus, who first observed that the quadruple (161,1633,417,16105) has the curious property that the product of any two elements in the set was one less than a rational square. It was not until Fermat that the first quadruple of integers with this property was discovered, namely (1,3,8,120): 1⋅3+1=22, 3⋅8+1=52, …, 3⋅120+1=192. Euler found infinitely many Diophantine quadruples in the positive integers and also found a way of extending Fermat’s set to a rational quintuple with this property, namely (1,3,8,120,8288641777480). Such sets of numbers are now known as Diophantine m-tuples, precisely defined below:
Definition 1.1**.**
For a commutative ring with unit R, an m-tuple (a1,…,am)∈Rm is said to be a Diophantine m-tuple over R if for every i,j with 1≤i<j≤m, aiaj+1∈□(R), where □(R) denotes the set of square elements in ring R.
Here, we will leverage some notation that enables us to include a more general family of sets than just the Diophantine m-tuples, as investigated in a number of works, such as [Duj04].
Definition 1.2**.**
For r∈R, an m-tuple (a1,…,am)∈Rm is said to be a D(r)* m-tuple over R* if
[TABLE]
We denote by Diophmr(R)⊂Rm the set of D(r)m-tuples over R. Note that Diophm1(R) is the set of Diophantine m-tuples over R.
In this notation, Diophantus’s original example (161,1633,417,16105) is in Dioph41(\use@mathgroup\M@U\symAMSbQ), and after clearing denominators, we see that (1,33,68,105)∈Dioph4256(\use@mathgroup\M@U\symAMSbZ). Fermat’s first Diophantine (i.e. D(1)) quadruple in the positive integers is (1,3,8,120)∈Dioph41(\use@mathgroup\M@U\symAMSbZ).
The problem of extending Fermat’s triple {1,3,8} to a quadruple was one of the early successes of Baker’s results on linear forms in logarithms; see [BD69]. More recently, Gibbs in [Gib06] found a rational Diophantine sextuple, namely (19211,19235,27155,27512,481235,16180873)∈Dioph61(\use@mathgroup\M@U\symAMSbQ). Recently, He, Togbé, and Ziegler in [HTZ16] showed that there is no Diophantine quintuple in positive integers, i.e. that Dioph51(\use@mathgroup\M@U\symAMSbZ)=∅.
A curious property about Diophantine tuples is that any triple, over any ring (or even any semiring) can be extended to a Diophantine quadruple. This is special to the case of D(1) (or more generally D(k2)), as D(r) triples do not generally extend to D(r) quadruples in interesting ways. (Of course, one can always extend any D(r)m-tuple to a D(r)(m+1)-tuple by appending 0, but this is rather trivial.) An open question of considerable interest is whether or not every Diophantine triple (a,b,c) in the positive integers can be uniquely extended to a Diophantine quadruple (a,b,c,d) with d∈\use@mathgroup\M@U\symAMSbZ and d>max(a,b,c).
Most of the past work in Diophantine and D(r) tuples has been in the case of R=\use@mathgroup\M@U\symAMSbZ (or even \use@mathgroup\M@U\symAMSbN) and R=\use@mathgroup\M@U\symAMSbQ. There have been a few papers studying the case where R is the ring of integers in a quadratic field (e.g. [Duj97, Fra04]) and a cubic field (e.g. [Fra13]). The question of Diophantine tuples over finite fields was considered in [DK16].
In recent years, there has been a flurry of activity on Diophantine and D(r) tuples. Instead of summarizing more of it, we instead refer the interested reader to Dujella’s extensive bibliography of the field, which can be found at https://web.math.pmf.unizg.hr/~duje/ref.html.
In the present paper, we investigate some questions similar in spirit to those of [DK16]. In [DK16] and frequently in this literature, it is assumed that elements of a Diophantine tuple must be distinct. However, our main goal is an understanding of the Haar measure of tuples over \use@mathgroup\M@U\symAMSbZp. To do so, it is often convenient to reduce modulo p, so we do not require our tuples to have distinct elements.
The main goal of this article is to evaluate or approximate the Haar measure of the set Diophmr(\use@mathgroup\M@U\symAMSbZp), for certain values of m, r, and p. Then our goal is to evaluate diophmr(\use@mathgroup\M@U\symAMSbZp) defined below:
Definition 1.3**.**
For r∈R, let diophmr(R)=μ(Diophmr(R)) be the measure of the set of D(r)m-tuples in Rm, where μ is the product measure induced by a choice of finite measure μ on R.
Throughout this article, we will assume that R is a commutative ring equipped with a probability measure μ, i.e. one in which μ(R)=1. The main case we will be focusing on is the case in which R is the ring \use@mathgroup\M@U\symAMSbZp of p-adic integers equipped with its Haar measure μ, normalized so that μ(\use@mathgroup\M@U\symAMSbZp)=1. We will also look at the case where R=OK is the valuation ring of a finite extension K of \use@mathgroup\M@U\symAMSbQp, again equipped with its normalized Haar measure. We will also consider the case where R=\use@mathgroup\M@U\symAMSbFq is a finite field, equipped with the normalized counting measure, where the normalization is such that μ(\use@mathgroup\M@U\symAMSbFq)=1.
Unless otherwise specified, we take a,b,c,d∈\use@mathgroup\M@U\symAMSbZp. All of our results over \use@mathgroup\M@U\symAMSbZp can be easily modified to obtain bounds over \use@mathgroup\M@U\symAMSbFp with respect to the counting measure on \use@mathgroup\M@U\symAMSbFp and vice versa, modulo lower order terms.
In the case where m is small, we can usually give an exact value for diophmr(\use@mathgroup\M@U\symAMSbZp), whereas when m≥4, we can only give an asymptotic as p→∞, with a lower-order error term. One of our main techniques is to study the reduction to diophmr(\use@mathgroup\M@U\symAMSbFp) and then use results about character sums in \use@mathgroup\M@U\symAMSbFp. More precisely, we note that diophmr(\use@mathgroup\M@U\symAMSbZp) is quite close to
[TABLE]
which can be calculated exactly for m≤3 and approximated up to an error term of the form O(p−1/2) as p→∞ when m≥4. Here and elsewhere, (p⋅) denotes the Legendre symbol on \use@mathgroup\M@U\symAMSbZp.
We proceed as follows in this article. In Section 2 we collect some notation and observe that the Haar measure of Diophantine pairs over \use@mathgroup\M@U\symAMSbZ2 is 31. In Section 3, we prove Theorem 3.1 and exactly compute the Haar measure of Diophantine D(r) pairs over \use@mathgroup\M@U\symAMSbZp for all odd primes p. We observe in Section 4 that when p=3, we can compute the Haar measure exactly of D(r)m-tuples for all (3r)=1 and m≥2. We proceed in Section 5 to give asymptotic bounds in Theorem 5.2 on dioph3r(\use@mathgroup\M@U\symAMSbZp), exactly computing dioph3r(\use@mathgroup\M@U\symAMSbFp) in Theorem 5.3 as an intermediate step. We extend our asymptotic analysis of Diophmr(\use@mathgroup\M@U\symAMSbZp) to m≥4 in Section 6. Finally, we are able to carry over many of our methods when we replace \use@mathgroup\M@U\symAMSbZp by a finite extension thereof as we observe in Section 7, for example exactly computing the Haar measure of Diophantine D(r) pairs in Theorem 7.1 when the residue characteristic is odd.
2. Dioph21(\use@mathgroup\M@U\symAMSbZ2)
Before stating any results, let us recall some notation that will be used throughout the article.
Definition 2.1**.**
For a∈\use@mathgroup\M@U\symAMSbZp, we let vp(a) denote the p-adic valuation of a, given by
[TABLE]
Definition 2.2**.**
More generally, if R=OK is a valuation ring, we let vR denote the normalized valuation so that if π∈OK is a uniformizer, then vR(π)=1.
Note that (a,b)∈\use@mathgroup\M@U\symAMSbZp2 is a Diophantine pair over \use@mathgroup\M@U\symAMSbZ2 if ab+1∈□(\use@mathgroup\M@U\symAMSbZ2). An element α=2v2(α)β∈□(\use@mathgroup\M@U\symAMSbZ2) if
[TABLE]
Proposition 2.3**.**
The Haar measure of Diophantine pairs over \use@mathgroup\M@U\symAMSbZ2 is given by
[TABLE]
Proof.
We consider cases based on the residues of ab modulo 8 and the 2-adic valuation of ab+1 in \use@mathgroup\M@U\symAMSbZ2. To that end, we will define the measures of disjoint subsets of \use@mathgroup\M@U\symAMSbZ22. For k≥0, let
[TABLE]
If ab+1≡0(mod4), ab+1=□∈\use@mathgroup\M@U\symAMSbZ2 exactly when ab≡0(mod8). This occurs when either one of a,b is 0(mod8) or
[TABLE]
This yields
[TABLE]
If v2(ab+1)=2, then ab+1=□∈\use@mathgroup\M@U\symAMSbZ2 exactly when ab+1≡4(mod32). Considering residue classes of a,b(mod32) yields A2=21⋅321. Similarly we obtain for v2(ab+1)=2k for k>1, that ab+1=□ exactly when
[TABLE]
or in other words when
[TABLE]
The above result implies that for k≥1, we have that
[TABLE]
We therefore obtain the desired result:
[TABLE]
∎
3. Dioph2r(\use@mathgroup\M@U\symAMSbZp)
Theorem 3.1**.**
Let p be an odd prime and let α=vp(r) with r=pαs. Then, we have the following:
[TABLE]
where (ba) denotes the Legendre symbol.
In particular, we have that the measure of the Diophantine pairs over \use@mathgroup\M@U\symAMSbZp is given by
[TABLE]
Remark 3.2*.*
We will repeatedly use the following characterization of □(\use@mathgroup\M@U\symAMSbZp). For an odd prime p, α∈□(\use@mathgroup\M@U\symAMSbZp) exactly if α=p2kβ for some nonnegative integer k and some β∈\use@mathgroup\M@U\symAMSbZp with (pβ)=1.
Lemma 3.3**.**
Let p be an odd prime and take r∈\use@mathgroup\M@U\symAMSbZp so that (pr)=−1. Then,
[TABLE]
Proof.
We compute dioph2r(\use@mathgroup\M@U\symAMSbZp) by summing the measures of disjoint subsets of Dioph2r(\use@mathgroup\M@U\symAMSbZp). For k≥0, let
[TABLE]
First, we consider A0. If (a,b)∈A0, then ab+r=β where (pβ)=1. Thus
[TABLE]
since (pr)=−1. This implies that for each choice of nonzero residue class of a(modp) and every nonzero square residue class choice of β(modp), there is exactly one choice of residue class (modp) for b that results in ab+r∈A0. Since there are (p−1)/2 nonzero square residue classes (modp), we have that
[TABLE]
Similarly, for k≥1, if (a,b)∈Ak, then ab+r=p2k⋅β where (pβ)=1. Here
[TABLE]
since r≡0(modp).
such that a≡0(modp) and the resulting possibilities for b(modp2k+1), we obtain
[TABLE]
This yields the desired result:
[TABLE]
∎
Lemma 3.4**.**
Let p be an odd prime and take r∈\use@mathgroup\M@U\symAMSbZp so that (pr)=1. Then,
[TABLE]
Proof.
As above, we compute dioph2r(\use@mathgroup\M@U\symAMSbZp) by summing the measures of disjoint subsets of Dioph2r(\use@mathgroup\M@U\symAMSbZp). For k≥0, let
[TABLE]
We first consider A0. If (a,b)∈A0, then ab+r=β where (pβ)=1. Since (pr)=1, if either a,b≡0(modp), then ab+r≡r(modp) is nonzero square in \use@mathgroup\M@U\symAMSbFp and thus a square in \use@mathgroup\M@U\symAMSbZp. We note that
[TABLE]
Else, we write
ab=β−r(modp)
This expression is nonzero as long as β=r. This implies that for each choice of nonzero residue class of a(modp) and every nonzero square residue class choice of β(modp) except r(modp), there is exactly one choice of residue class (modp) for b that results in ab+r∈A0. Since there are (p−1)/2 nonzero square residue classes (modp), we have that
[TABLE]
Similar to Lemma 3.3, for k≥1, if (a,b)∈Ak, then ab+r=p2k⋅β where (pβ)=1. Here
[TABLE]
since r≡0(modp). Considering all residue class of a(modp)3 such that a≡0(modp) and the resulting possibilities for b(modp)3, we obtain
[TABLE]
This yields the desired result:
[TABLE]
∎
Lemma 3.5**.**
Fix some r∈\use@mathgroup\M@U\symAMSbZp such that p∣r, with vp(r)=α>0. Then for all β≡0(mod2) such that β>α, if
[TABLE]
then
[TABLE]
Proof.
We can write r=pαs with s∈\use@mathgroup\M@U\symAMSbZp×, and note that α≥1. Note that for any (a,b)∈Bβ, ab+r=pβq2 for some q∈\use@mathgroup\M@U\symAMSbZp×. Thus, (a,b)∈Bβ iff there exists some q∈\use@mathgroup\M@U\symAMSbZp× such that
[TABLE]
Thus, we can compute μ(Bβ) using a probability over the residue classes of a,b in \use@mathgroup\M@U\symAMSbZ/pβ+1\use@mathgroup\M@U\symAMSbZ.
We can write a=peaa′,b=pebb′ where a′,b′∈\use@mathgroup\M@U\symAMSbZp×, and ea+eb=α. Then, there are pβ+1−ea−pβ−ea choices for the residue a(modp)β+1, such that there exists some q and choice(s) of b(modp)β+1 to satisfy the above equivalence.
For every such choice of a, there are 2p−1 choices for b′(modpβ−α+1), corresponding to the 2p−1 choices for the residue q2(modp). There are pα ways to lift this residue (modpβ+1−α) to a residue (modpβ+1), yielding pα⋅(p−1)/2 residue choices of b(modpβ+1) for each choice of a, such that there exists some q∈\use@mathgroup\M@U\symAMSbZp where the above equivalence holds. Since ea can be any integer from [math] to α, inclusive, this gives the desired result:
[TABLE]
∎
Lemma 3.6**.**
Fix some r∈\use@mathgroup\M@U\symAMSbZp such that p∣r, with vp(r)=α. Let β≡0(mod2) be such that β<α, and set
[TABLE]
Then
[TABLE]
Proof.
As above, we write r=pαs with s∈\use@mathgroup\M@U\symAMSbZp×, and note that α≥1. Note that for any (a,b)∈Bβ, ab+r=pβq2 for some q∈\use@mathgroup\M@U\symAMSbZp×. Thus, (a,b)∈Bβ iff there exists some q∈\use@mathgroup\M@U\symAMSbZp× such that
[TABLE]
Thus, we can compute μ(Bβ) using a probability over the residue classes of a,b in \use@mathgroup\M@U\symAMSbZ/pβ+1\use@mathgroup\M@U\symAMSbZ. We can write a=peaa′,b=pebb′ where a′,b′∈\use@mathgroup\M@U\symAMSbZp×, and ea+eb=β. Then, there are pα+1−ea−pα−ea choices for the residue a(modpα+1), such that there exists some q and choice(s) of b(modpα+1) to satisfy the above equivalence.
For every such choice of a, there are 2p−1 choices for b′(modp), corresponding to the 2p−1 choices for the residue q2(modp). There are pα−eb ways to lift this residue b′(modp) to a residue of b(modpα+1), yielding pα−eb⋅(p−1)/2 residue choices of b(modpβ+1) for each choice of a, such that there exists some q∈\use@mathgroup\M@U\symAMSbZp where the above equivalence holds. Since ea can be any integer from [math] to α, inclusive, this gives the desired result:
[TABLE]
∎
Lemma 3.7**.**
Fix some r∈\use@mathgroup\M@U\symAMSbZp with vp(r)=α>0 and let r=pαs. If
[TABLE]
then
[TABLE]
Proof.
Note that if α≡1(mod2), then no element x∈\use@mathgroup\M@U\symAMSbZp with vp(x)=α is a square. So now assume that α≡0(mod2). For any (a,b)∈Bα, we have ab+r=pαq2 for some q∈\use@mathgroup\M@U\symAMSbZp×. Rearranging, we find that any (a,b)∈Bα satisfies ab=pα(q2−s) for some q∈\use@mathgroup\M@U\symAMSbZp×. Note that if vp(q2−s)=γ, we can check if (a,b)∈Dioph2r(\use@mathgroup\M@U\symAMSbZp) by seeing if ab+r is a square (modpα+γ+1).
Thus, we consider two cases for γ.
If γ=0, then q2−s∈\use@mathgroup\M@U\symAMSbZp×, and we can check if ab+r∈Dioph2r(\use@mathgroup\M@U\symAMSbZp) by computing the residue (modpα+1).
As above, we write a=peaa′,b=pebb′ where a′,b′∈\use@mathgroup\M@U\symAMSbZp× and ea+eb=α.
There are pα−ea(p−1) choices for a(modpα+1) such that there exists b∈\use@mathgroup\M@U\symAMSbZp with ab+r∈Dioph2r(\use@mathgroup\M@U\symAMSbZp). For each such fixed choice of a residue class for a, there are 2p−1 choices for b′(modp) if (ps)=−1, and 2p−3 choices for b′(modp) if (ps)=1, and pα−eb ways to lift each such choice of b′(modp) to a residue b(modpα+1) such that
[TABLE]
for some q∈\use@mathgroup\M@U\symAMSbZp×. In particular, this implies that if (ps)=−1, then
[TABLE]
If γ≥1, then (ps)=1. We can handle all of these cases together, since the residue of q2−s is restricted (modp), but not modulo higher powers of p.
Let q2−s=pγz where z∈\use@mathgroup\M@U\symAMSbZp×. Evaluating whether ab+r=pαq2∈Dioph2r(\use@mathgroup\M@U\symAMSbZp) in these cases reduces to a check of ab(modpα+γ+1). Using the same decomposition of a,b as above, a=peaa′,b=pebb′ with ea+eb=α+γ, we have pα+γ−ea(p−1) choices for a(modpα+γ+1) such that there exists some b making the following equivalence hold:
[TABLE]
For each such choice of a, there are pα+γ−eb(p−1) choices for the residue b(modpα+γ+1) such that there is some z satisfying the above equivalence. This yields a
[TABLE]
fraction of the residue classes (a,b)(modp)α+γ+1 such that ab+r∈Dioph2r(\use@mathgroup\M@U\symAMSbZp) with ab+r=pαq2 such that vp(q2−s)=γ.
Combining these disjoint cases gives the desired equality when (ps)=1:
The result follows immediately by applying Lemmas 3.3 and 3.4 when (pr)=0.
Next, let vp(r)=α>0 and let r=pαs. We take two cases based on the parity of α and leverage the results of Lemmas 3.5, 3.6, and 3.7. First suppose α is odd. Then,
[TABLE]
Next suppose that α is even. Then
[TABLE]
Thus, when (ps)=1,
[TABLE]
[TABLE]
and when (ps)=−1,
[TABLE]
[TABLE]
∎
4. Diophmr(\use@mathgroup\M@U\symAMSbZ3)
We can exactly compute the Haar measure of D(r)m-tuples over \use@mathgroup\M@U\symAMSbZ3 for a broad class of values r and all m≥2. More precisely, we will show the following result:
Theorem 4.1**.**
For any r∈\use@mathgroup\M@U\symAMSbZ3 with (3r)=1, the Haar measure of D(r)m-tuples in \use@mathgroup\M@U\symAMSbZ3m for m≥2 is
[TABLE]
Recall that α∈□(\use@mathgroup\M@U\symAMSbZ3) iff v3(α) is even and
[TABLE]
This leads us to the following observation:
Lemma 4.2**.**
Fix r∈\use@mathgroup\M@U\symAMSbZ3 so that (3r)=1. Then any D(r) triple (a,b,c) over \use@mathgroup\M@U\symAMSbZ3 has at least one of a,b,c≡0(mod3).
Proof.
If (3r)=1, then r≡1(mod3).
Suppose to the contrary that a,b,c≡0(mod3). Then either two of a,b,c are 1(mod3) or −1(mod3). Suppose WLOG that a≡b(mod3). Then
[TABLE]
and thus
[TABLE]
so ab+r is not a square over \use@mathgroup\M@U\symAMSbZ3. Thus, (a,b,c) cannot be a D(r) triple, a contradiction.
∎
Fix r∈\use@mathgroup\M@U\symAMSbZ3 such that (3r)=1. Lemma 4.2 implies that for a D(r)m-tuple (a1,…am) with (3r)=1, all but at most two of the ai’s are congruent to 0(mod3). We consider cases:
**Case 1: **
a1,…,am≡0(mod3). Then for any i=j,
[TABLE]
Thus all of the above m-tuples are in Diophmr(\use@mathgroup\M@U\symAMSbZ3). Therefore,
[TABLE]
**Case 2: **
Exactly one of the ai’s is not congruent to 0(mod3).
We have that whenever i=j
[TABLE]
since for all such pairs i,j at least one of ai,aj≡0(mod3).
Since there are m ways to choose which element of the triple is not 0(mod3) and two choices of its nonzero residue mod 3, we have that
[TABLE]
**Case 3a: **
Suppose exactly two of a1,…am are not congruent to 0(mod3), ai,aj, and those two are distinct modulo 3 with ai≡1(mod3),aj≡2(mod3).
Then without loss of generality a1≡1(mod3),a2≡2(mod3). For k1=k2, (k1,k2)=(i,j),(j,i), we have that
[TABLE]
Now, we compute the measure of pairs (ai,aj) in \use@mathgroup\M@U\symAMSbZ32 such that aiaj+r∈□(\use@mathgroup\M@U\symAMSbZ3). For k=1,2,…, let
The measure inside \use@mathgroup\M@U\symAMSbZ32 of the desired set is then
[TABLE]
Since there are m(m−1) ways to pick the pair of elements that are 1,−1(mod3) in the m-tuple,
[TABLE]
**Case 3b: **
If for (a1,…am) there are exactly 2 elements ai,aj≡0(mod3), but ai≡aj(mod3), then
[TABLE]
meaning that (a1,…am) cannot be a D(r)-tuple over \use@mathgroup\M@U\symAMSbZ3.
**Case 4: **
If at least 3ai (WLOG a1,a2,a3) are not 0mod3, then via Lemma 4.2, we can find i=j with aiaj+1∈□(\use@mathgroup\M@U\symAMSbZ3), so
(a1,…am) is not a Diophantine m-tuple.
The above allows us to compute the Haar measure of D(r)m-tuples in \use@mathgroup\M@U\symAMSbZ3m for r such that (3r)=1 by summing the Haar measures over disjoint subsets of \use@mathgroup\M@U\symAMSbZ3m.
[TABLE]
∎
5. Dioph3r(\use@mathgroup\M@U\symAMSbZp)
Throughout this section, we take p to be an odd prime. We give asymptotic bounds on dioph3r(\use@mathgroup\M@U\symAMSbZp), thereby showing that over triples (a,b,c)∈\use@mathgroup\M@U\symAMSbZp3 the events that (a,b),(b,c),(a,c) are D(r) pairs are asymptotically independent.
Definition 5.1**.**
For a prime p, m≥2,r∈\use@mathgroup\M@U\symAMSbZp, we let
[TABLE]
and
[TABLE]
Then, let Diophmr(\use@mathgroup\M@U\symAMSbFp) be the image of Diophmr(\use@mathgroup\M@U\symAMSbZp) under the reduction map \use@mathgroup\M@U\symAMSbZp→\use@mathgroup\M@U\symAMSbFp and define diophmr(\use@mathgroup\M@U\symAMSbFp)=μ(Diophmr(\use@mathgroup\M@U\symAMSbFp)).
Theorem 5.2**.**
For fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbZp, we have that as p→∞,
[TABLE]
To prove Theorem 5.2, we will first understand the intermediate quantity dioph3r(\use@mathgroup\M@U\symAMSbFp).
Theorem 5.3**.**
For fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbFp with p∤r (for odd primes p), we have that
[TABLE]
We recall a result about character sums that will be useful in counting Diophantine D(r)-tuples over \use@mathgroup\M@U\symAMSbFp:
Let f(x)=a2x2+a1x+a0∈\use@mathgroup\M@U\symAMSbFp[x] and a2=0. Let Δ=a12−4a0a2 be the discriminant of f. Then,
[TABLE]
Lemma 5.5**.**
For fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbFp that satisfies (pr)=1, we have that
[TABLE]
Proof.
Let r=s2=0. Note that if at least 2 of a,b,c are divisible by p, then
[TABLE]
and thus (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp). The size of this subset of \use@mathgroup\M@U\symAMSbFp3 is
3(p−1)+1=3p−2.
Now suppose that exactly one of a,b,c is divisible by p, which we shall assume without loss of generality to be a. Then
[TABLE]
Consequently, (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) iff bc+r∈□(\use@mathgroup\M@U\symAMSbFp).
Since r=s2 and bc≡0(modp), for each of the p−1 choices of b, there are (p−1)/2 choices of c that yield squares, and thus, we have
[TABLE]
triples (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) with exactly one of a,b,c≡0(modp). This gives the desired result:
[TABLE]
∎
Lemma 5.6**.**
For fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbFp that satisfies (pr)=−1, we have that
[TABLE]
Proof.
If abc≡0(modp), then without loss of generality a≡0(modp). Then ab+r≡r(modp), so ab+r∈□(\use@mathgroup\M@U\symAMSbFp), since (pr)=−1. Therefore, (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp), giving the desired result.
∎
Lemma 5.7**.**
For fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbFp such that p∤r, we have that
[TABLE]
Proof.
We consider cases:
(1)
Suppose ab+r≡ac+r≡ab+r≡0(modp).
Then, since a≡0(modp),
[TABLE]
By symmetry, this yields, a≡b≡c(modp), yielding two points in Dioph3r(\use@mathgroup\M@U\symAMSbFp) if (p−r)=1, else no point. Thus, there are
[TABLE]
points in Dioph3r(\use@mathgroup\M@U\symAMSbFp) with ab+r≡ac+r≡ab+r≡0(modp).
2. (2)
Now without loss of generality suppose ab+r≡bc+r≡0(modp) but ac+r≡0(modp). We consider values for b in a triple (a,b,c) and note that (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) exactly if
[TABLE]
Note that as b ranges over all nonzero (ab+r≡0(modp) implies b≡0(modp)) elements of \use@mathgroup\M@U\symAMSbFp, r2/b2 ranges over all nonzero squares in \use@mathgroup\M@U\symAMSbFp. Thus let r/b=X and consider the following quadratic function in \use@mathgroup\M@U\symAMSbFp[X]:
[TABLE]
We observe that for each X=0 with (pf(X))=1, we have a single choice of b=r/X that gives a point (a,b,c)∈Dioph3r. We proceed to count the number of such X as follows:
[TABLE]
where to obtain (∗), we apply Lemma 5.4. Thus, we have 21(p−1−(pr)+(p−r)) such points (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp).
3. (3)
Finally, suppose that exactly one of ab+r,bc+r,ac+r≡0(modp), WLOG ab+r≡0(modp), so a=−rb−1. Then, we wish to count the number of choices of b,c∈\use@mathgroup\M@U\symAMSbFp\{0} such that
[TABLE]
Since r≡0(modp), it suffices for bc+r∈□(\use@mathgroup\M@U\symAMSbFp)\{0},(p1−cb−1)=(pr).
Note that for any of the (p−1)/2 nonzero values t2∈\use@mathgroup\M@U\symAMSbFp, r(1−cb−1)=t2 exactly if we take c=b(1−r−1t2). For any such fixed t2, (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) with bc+r=0 for all choices of b such that
[TABLE]
Since c=0, t2=r.
Therefore, we can find all such b by applying Lemma 5.4 to
[TABLE]
finding that the number of such b is given by
[TABLE]
We can sum over the all the possibilities of t2∈□(\use@mathgroup\M@U\symAMSbFp×) to count the number of (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) with ab+r≡0(modp) and (bc+r)(ac+r)abc≡0(modp):
[TABLE]
where as above (∗) follows by Lemma 5.4 applied to g(t)=1−r−1t2.
Using the symmetry between a,b,c, we can use the above three cases to obtain the desired result:
[TABLE]
∎
Lemma 5.8**.**
For r∈\use@mathgroup\M@U\symAMSbZ with p∤r viewed as an element of \use@mathgroup\M@U\symAMSbFp, we have that
[TABLE]
Proof.
We first compute the count of triples in (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) such that abc(ab+r)(bc+r)(ac+r)=0.
Let α=ab,β=bc and let γ=b−1, so that αβγ2=ac. This gives the following:
[TABLE]
Recall that p∤r and first consider the two outer sums. As α,β range over the summation, they range over all values in \use@mathgroup\M@U\symAMSbFp except r, but contribute a nonzero value only when (pα)=(pβ)=1.
We first consider the inner summation, recalling that α,β=r:
[TABLE]
where as earlier, we apply Lemma 5.4 in (∗).
This simplification gives
as if abc(ab+r)(bc+r)(ac+r)≡0(modp), then ab+r,bc+r,ac+r∈□(\use@mathgroup\M@U\symAMSbFp) if and only if ab+r,bc+r,ac+r∈□(\use@mathgroup\M@U\symAMSbZp).
Further,
[TABLE]
Combining this bound with the result of Theorem 5.3 gives the asymptotic result:
[TABLE]
This implies that
[TABLE]
as desired.
∎
6. Diophmr(\use@mathgroup\M@U\symAMSbZp) for m≥4
In this section, we take p to be an odd prime. It appears to be difficult to compute diophmr(\use@mathgroup\M@U\symAMSbZp) or diophmr(\use@mathgroup\M@U\symAMSbFp) exactly, but it is possible to give asymptotics. In the case of r=1, this was done for \use@mathgroup\M@U\symAMSbFp by Dujella and Kazalicki in [DK16]; they proved that
[TABLE]
Their technique is similar to ours in the previous section, involving character sums evaluated at the values of polynomials. However, the best analogue of Lemma 5.4 in this case is only an inequality. To do this in the case of r=1, Dujella and Kazalicki consider the sum
[TABLE]
They note that the main contribution to this sum is
[TABLE]
obtained by choosing the 1 from each factor of the form 1+(paiaj+1). The remaining terms can be bounded using the Weil bound on character sums (or, equivalently, the Hasse–Weil bound for the number of \use@mathgroup\M@U\symAMSbFp-points on a genus-g curve): for fixed m, the remaining terms are O(p−1/2) by [LN97, Theorem 5.41].
The arguments in [DK16] do not make any use of r=1; they only rely on p∤r. Thus we have the following:
Theorem 6.1**.**
For all fixed m≥3 and r∈\use@mathgroup\M@U\symAMSbZ, we have that
[TABLE]
as p→∞.
If we instead work with \use@mathgroup\M@U\symAMSbZp instead of \use@mathgroup\M@U\symAMSbFp, we have
[TABLE]
as in the previous section, and that
[TABLE]
so that
[TABLE]
as well.
We also note that there is a second technique for estimating dioph4r(\use@mathgroup\M@U\symAMSbFp) and dioph4r(\use@mathgroup\M@U\symAMSbZp), which we now describe.
Proposition 6.2**.**
For any fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbZp, we have that as p→∞
[TABLE]
It is helpful to begin by showing the relevant result for tuples over \use@mathgroup\M@U\symAMSbFp:
Proposition 6.3**.**
For any fixed r∈\use@mathgroup\M@U\symAMSbZ viewed in \use@mathgroup\M@U\symAMSbFp, we have that as p→∞
[TABLE]
Proof.
Let (a,b,c,d)∈\use@mathgroup\M@U\symAMSbFp4. Note that (a,b,c,d)∈Dioph4r(\use@mathgroup\M@U\symAMSbFp) only if (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) and if ab+r,bc+r,ac+r∈□(\use@mathgroup\M@U\symAMSbFp).
Assume that a,b,c are all distinct and let
[TABLE]
Fix (a0,b0,c0)∈S0 and consider the elliptic curve E defined as
[TABLE]
The Hasse–Weil bound gives that
[TABLE]
Excluding the point at infinity, we find that this gives between 2p−2p−2 and 2p+2p choices of d=0∈\use@mathgroup\M@U\symAMSbFp, such that there is a point (X,Y)∈E(\use@mathgroup\M@U\symAMSbFp) with X=d. Of course, not all of these choices d∈\use@mathgroup\M@U\symAMSbFp make a0d+r,b0d+r,c0d+r∈□(\use@mathgroup\M@U\symAMSbFp); they merely guarantee that the product (a0d+r)(b0d+r)(c0d+r)∈□(\use@mathgroup\M@U\symAMSbFp).
For our fixed (a0,b0,c0)∈S0, the values d∈\use@mathgroup\M@U\symAMSbFp that make (a0,b0,c0,d)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) correspond exactly to the choices of X for which there is a Y∈\use@mathgroup\M@U\symAMSbFp with (X,Y)∈2E(\use@mathgroup\M@U\symAMSbFp) by [Kna92, Theorem 4.2].
E(\use@mathgroup\M@U\symAMSbFp) has full 2-torsion as seen via the factored form of E in Equation (6.1). Thus E(\use@mathgroup\M@U\symAMSbFp)≅\use@mathgroup\M@U\symAMSbZ/t1\use@mathgroup\M@U\symAMSbZ×\use@mathgroup\M@U\symAMSbZ/t2\use@mathgroup\M@U\symAMSbZ, where t1,t2≡0(mod2). Thus, 41 of the points on E(\use@mathgroup\M@U\symAMSbFp) are in 2E(\use@mathgroup\M@U\symAMSbFp) and (X,Y)∈2E(\use@mathgroup\M@U\symAMSbFp) if and only if (X,−Y)∈2E(\use@mathgroup\M@U\symAMSbFp), which since p>2, gives the following bound (noting that the point at infinity is guaranteed to be a multiple of 2):
[TABLE]
Notice that
[TABLE]
Further, observe that
[TABLE]
Consequently,
[TABLE]
Using the bound of Equation (6.2) and recalling that via Theorem 5.3, dioph3r(\use@mathgroup\M@U\symAMSbFp)=81+O(p1) in conjunction with the above, we find that
Let (a,b,c,d)∈\use@mathgroup\M@U\symAMSbZp4. Note that (a,b,c,d)∈Dioph4r(\use@mathgroup\M@U\symAMSbZp) if and only if both (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbZp) and ab+r,bc+r,ac+r∈□(\use@mathgroup\M@U\symAMSbZp). For every (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbZp), (a,b,c)∈Dioph3r(\use@mathgroup\M@U\symAMSbFp) where we view a,b,c under the natural map \use@mathgroup\M@U\symAMSbZp→\use@mathgroup\M@U\symAMSbFp. For a1,a2∈\use@mathgroup\M@U\symAMSbZp unless a1a2+r≡0(modp), then a1a2+r∈□(\use@mathgroup\M@U\symAMSbZp) if and only if a1a2+r∈□(\use@mathgroup\M@U\symAMSbFp). Thus there are at most 3 choices of d(modp), such that (ad+r)(bd+r)(cd+r)≡0(modp) for a,b,c,d∈\use@mathgroup\M@U\symAMSbFp. This computation implies that
[TABLE]
and consequently as desired,
[TABLE]
∎
A similar technique can be used to show that dioph5r(\use@mathgroup\M@U\symAMSbFp) and dioph5r(\use@mathgroup\M@U\symAMSbZp) are 10241+O(p1), since the curve y2=(ax+r)(bx+r)(cx+r)(dx+r) is again an elliptic curve. There is an analogue of [Kna92, Theorem 4.2] for hyperelliptic curves (see [Zar16]). Let C be the hyperelliptic curve y2=(a1x+r)⋯(am−1x+r), where m−1 is odd and a1,…,am−1∈\use@mathgroup\M@U\symAMSbFp are distinct. Let (x0,y0)∈C(\use@mathgroup\M@U\symAMSbFp) be a point. Then aix0+r is a perfect square for all i with 1≤i≤m−1 if and only if the point [(x0,y0)−∞]∈2Jac(C)(\use@mathgroup\M@U\symAMSbFp), where Jac(C) is the Jacobian of C. So, in order to estimate diophmr(\use@mathgroup\M@U\symAMSbFp), it suffices to understand the proportion of points of the form [(x0,y0)−∞] in Jac(C)(\use@mathgroup\M@U\symAMSbFp) that are multiples of 2 in Jac(C). While we know that the 2-torsion in Jac(C)(\use@mathgroup\M@U\symAMSbFp) is isomorphic to (\use@mathgroup\M@U\symAMSbZ/2\use@mathgroup\M@U\symAMSbZ)2g, and so that the proportion of points in Jac(C)(\use@mathgroup\M@U\symAMSbFp) which are multiples of 2 is 22g1, what we need to know is that of the points of the more specific form [(x0,y0)−∞]∈Jac(C)(\use@mathgroup\M@U\symAMSbFp), the proportion which are multiples of 2 is 22g1, up to a small error term. This does not appear to be so easy, since we cannot guarantee that points of this specific form in the Jacobian are “representative” with respect to being multiples of 2.
7. Diophmr(OK) for K/\use@mathgroup\M@U\symAMSbQp
Many of the methods highlighted above carry over when we replace \use@mathgroup\M@U\symAMSbZp by a finite extension. Let K/\use@mathgroup\M@U\symAMSbQp be a finite extension with valuation ring OK and residue field κ=\use@mathgroup\M@U\symAMSbFq for q=pf and f≥1.
Applying the methods of Section 3 replacing p by q as appropriate and the Legendre symbol with χ, the quadratic multiplicative character over \use@mathgroup\M@U\symAMSbFq, yields the following result:
Theorem 7.1**.**
Suppose q is a power of an odd prime.
With notation as above, let α=vπ(r) with r=παs where π is a uniformizer and s∈OK×. Then, we have the following:
[TABLE]
where χ denotes the quadratic multiplicative character on \use@mathgroup\M@U\symAMSbFq.
In particular, we have that the measure of the Diophantine pairs over OK is given by
[TABLE]
In the case that K/\use@mathgroup\M@U\symAMSbQ3 is totally ramified, we obtain an analogue of Theorem 4.1 in Section 4:
Theorem 7.2**.**
If K/\use@mathgroup\M@U\symAMSbQ3 is a finite, totally ramified extension, then for any r∈OK with χ(r)=1, the Haar measure of D(r)m-tuples in OKm for m≥2 is
[TABLE]
In Sections 5 and 6, the computations of Dioph3r(\use@mathgroup\M@U\symAMSbZp) and Diophmr(\use@mathgroup\M@U\symAMSbZp) extend to a bound when we replace \use@mathgroup\M@U\symAMSbZp with OK for an arbitrary finite K/\use@mathgroup\M@U\symAMSbQp. (Note that the result of Lemma 5.4 generalizes to one over \use@mathgroup\M@U\symAMSbFq, replacing the Legendre symbol with χ discussed above.)
Theorem 7.3**.**
Let K1,K2,… be a sequence of characteristic [math] local fields, and let pi be the residue characteristic of Ki such that pi→∞ as i→∞. Then, as i→∞,
[TABLE]
Theorem 7.4**.**
Let m≥4 be an integer, let K1,K2,… be a sequence of characteristic [math] local fields, and let pi be the residue characteristic of Ki such that pi→∞ as i→∞. Then, as i→∞,
[TABLE]
Bibliography11
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BD 69] A. Baker and H. Davenport. The equations 3 x 2 − 2 = y 2 3 superscript 𝑥 2 2 superscript 𝑦 2 3x^{2}-2=y^{2} and 8 x 2 − 7 = z 2 8 superscript 𝑥 2 7 superscript 𝑧 2 8x^{2}-7=z^{2} . Quart. J. Math. Oxford Ser. (2) , 20:129–137, 1969.
2[DK 16] Andrej Dujella and Matija Kazalicki. Diophantine m 𝑚 m -tuples in finite fields and modular forms. ar Xiv preprint ar Xiv:1609.09356 , 2016.
3[Duj 97] Andrej Dujella. The problem of Diophantus and Davenport for Gaussian integers. Glas. Mat. Ser. III , 32(52)(1):1–10, 1997.
4[Duj 04] Andrej Dujella. Bounds for the size of sets with the property d ( n ) 𝑑 𝑛 d(n) . Glas. Mat. , 39(2):199–205, 2004.
5[Fra 04] Zrinka Franušić. Diophantine quadruples in the ring \use@mathgroup \M@U \sym AM Sb Z [ 2 ] \use@mathgroup \M@U \sym AM Sb 𝑍 delimited-[] 2 \use@mathgroup\M@U\sym AM Sb{Z}[\sqrt{2}] . Math. Commun. , 9(2):141–148, 2004.
6[Fra 13] Zrinka Franušić. Diophantine quadruples in the ring of integers of the pure cubic field \use@mathgroup \M@U \sym AM Sb Q ( 2 3 ) \use@mathgroup \M@U \sym AM Sb 𝑄 3 2 \use@mathgroup\M@U\sym AM Sb{Q}(\root 3 \of{2}) . Miskolc Math. Notes , 14(3):893–903, 2013.
7[Gib 06] Philip Gibbs. Some rational Diophantine sextuples. Glas. Mat. Ser. III , 41(61)(2):195–203, 2006.
8[HTZ 16] Bo He, Alain Togbè, and Volker Ziegler. There is no Diophantine quintuple. ar Xiv e-prints , page ar Xiv:1610.04020, October 2016.