$p$-adic quotient sets II: quadratic forms
Christopher Donnay, Stephan Ramon Garcia, Jeremy Rouse

TL;DR
None
Contribution
None
Abstract
For , we consider . If is the set of nonzero values assumed by a quadratic form, when is dense in the -adic numbers? We show that for a binary quadratic form , is dense in if and only if the discriminant of is a nonzero square in , and for a quadratic form in at least three variables, is always dense in . This answers a question posed by several authors in 2017.
Peer Reviews
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.
-adic quotient sets II:
quadratic forms
Christopher Donnay
,
Stephan Ramon Garcia
Department of Mathematics, Pomona College, 610 N. College Ave., Claremont, CA 91711
[email protected] http://pages.pomona.edu/~sg064747 and
Jeremy Rouse
Department of Mathematics and Statistics, Wake Forest University, 1834 Wake Forest Road, Winston-Salem, NC 27109
[email protected] http://users.wfu.edu/rouseja
Abstract.
For , we consider . If is the set of nonzero values assumed by a quadratic form, when is dense in the -adic numbers? We show that for a binary quadratic form , is dense in if and only if the discriminant of is a nonzero square in , and for a quadratic form in at least three variables, is always dense in . This answers a question posed by several authors in 2017.
Key words and phrases:
-adic number, quotient set, ratio set, quadratic form
C. Donnay partially supported by a fellowship from the University of Pennsylvania Graduate School of Education. S.R. Garcia partially supported by a David L. Hirsch III and Susan H. Hirsch Research Initiation Grant, the Institute for Pure and Applied Mathematics (IPAM) Quantitative Linear Algebra program, and NSF Grant DMS-1800123.
1. Introduction
For a subset , let denote the corresponding ratio set (or quotient set). The question of when is dense in the positive real numbers has been examined by many authors over the years [6, 10, 12, 13, 21, 20, 5, 16, 17, 27, 2, 3, 4, 22, 23, 28, 29]. Analogues in the Gaussian integers [7] and, more generally, in algebraic number fields [26], have recently been considered.
The study of quotient sets in the -adic setting was initiated by Florian Luca and the second author [9]. Shortly thereafter several other papers on the topic appeared [8, 18, 24, 19]. In [8] it was shown that if , then is dense in if and only if . It is natural to wonder about possible extensions to other quadratic forms.
Fix a prime number and observe that each nonzero rational number has a unique representation of the form , in which , , and . The -adic valuation of such an is and its -adic absolute value is . By convention, and . The -adic metric on is . We write in place of when no confusion can arise. The field of -adic numbers is the completion of with respect to the -adic metric [11, 14]. We let .
A quadratic form is a homogeneous polynomial
[TABLE]
of degree . We say that is integral if for all , and we say that is primitive if there is no positive integer so that for all and . We can write for an symmetric matrix (which will have even diagonal entries, and integral off-diagonal entries). Two forms and are equivalent if there is an matrix with integer entries and so that .
In the case of binary forms, we will distinguish proper equivalence (the case that ) from improper equivalence (the case that ). Given a binary form
[TABLE]
the discriminant of is . Equivalent binary forms assume the same values and have the same discriminants.
Let be a field. We say that is nonsingular over if (and singular otherwise). We say that is isotropic over if there is a nonzero vector so that . Otherwise, is anisotropic over . If represents every value in , then is universal over . It is known that if is isotropic and nonsingular over , then is universal over [15, Thm. I.3.4].
For brevity, the term “quadratic form” hereafter refers to a quadratic form that is nonsingular over , integral, and primitive. The quotient set generated by a quadratic form is
[TABLE]
If and are equivalent, then . It has been asked when is dense in [8, Problem 4.4]. The main result of this paper is a complete answer to this question.
Theorem 1.3**.**
Let be an integral quadratic form in variables. Assume that is primitive and is nonsingular over and let be a prime number.
- (a)
If is binary, then is dense in if and only if the discriminant of is a square in . 2. (b)
If , then is dense in .
We give two proofs of Theorem 1.3a. Our first approach is longer (Figure 1), but completely elementary. The second approach is shorter, but requires the classification of values represented by quadratic forms over (as can be found in Serre’s book [25]). This same tool is used to prove Theorem 1.3b.
The organization of this paper is as follows. The elementary proof of Theorem 1.3a constitutes sections 2, 3, and 4. In Section 2 we handle binary quadratic forms that are nonsingular over ; the results therein apply to all primes. Section 3 concerns binary quadratic forms that are singular modulo an odd prime and Section 4 treats forms that are singular modulo . In Section 5, we give a more sophisticated proof of Theorem 1.3a as well as the proof of Theorem 1.3b.
2. Nonsingular (all primes)
Our aim in this section is to prove the following theorem, which addresses the two uppermost terminal nodes (blue) in Figure 1.
Theorem 2.1**.**
Let be primitive and integral.
- (a)
If is anisotropic modulo , then is not dense in . 2. (b)
If is isotropic and nonsingular modulo , then is dense in .
2.1. Proof of Theorem 2.1a
Suppose that is anisotropic over . We claim that is even for all . If , then , which is even. Suppose that . Then since is anisotropic; that is, and , in which , , and . Without loss of generality, assume that . Then
[TABLE]
since and is anisotropic. Thus, for all and hence is bounded away from in . Consequently, is not dense in . ∎
2.2. Proof of Theorem 2.1b for odd
Before proceeding, we need two lemmas.
Lemma 2.2** (Lemma 2.3 of [8]).**
Let and let be a prime.
- (a)
If is -adically dense in , then is dense in . 2. (b)
* is -adically dense in if and only if is dense in .*
Proof.
(a) If is -adically dense in , it is -adically dense in . Inversion is continuous on , so is -adically dense in , which is dense in .
(b) Suppose that is -adically dense in . Since inversion is continuous on , the result follows from the fact that is -adically dense in . ∎
Lemma 2.3**.**
Let be nonsingular modulo an odd prime . If and , then or .
Proof.
We prove the contrapositive. Suppose that
[TABLE]
Since is nonsingular, . If , then and . Thus, there are two cases: and , or .
Case 1: If and , then (2.4) implies that
[TABLE]
Thus,
[TABLE]
and hence . Then (2.5) implies that .
Case 2: If , then
[TABLE]
and hence
[TABLE]
Consequently, or .
- •
If , then (2.6) implies that .
- •
If , then (2.6) implies that . Since , (2.4) ensures that . Thus, . ∎
Suppose that is isotropic and nonsingular modulo an odd prime . By Lemma 2.2, it suffices to show that for each and , there exists an such that . To this, we add the requirement
[TABLE]
We induct on . The base case is .
- •
If , then since is isotropic we may find so that . Lemma 2.3 ensures that at least one of the two conditions in (2.7) hold.
- •
If , then there is an so that since is isotropic and nonsingular [15, Prop. 3.4]. Since is odd,
[TABLE]
which implies that (2.7) holds.
Now suppose that and, without loss of generality, that . Then for some . If
[TABLE]
then the identity
[TABLE]
yields
[TABLE]
in which is not divisible by . This completes the induction. ∎
2.3. Proof of Theorem 2.1b for
Suppose that is isotropic and nonsingular modulo . Since , it follows that is odd and hence
[TABLE]
Because is isotropic, or is even; see Table 1. Without loss of generality, suppose that is even. By Lemma 2.2, it suffices to show that for each and , there is an such that
[TABLE]
We proceed by induction on . For the base case , we may let .
Now suppose that (2.9) holds for some . Then for some . If , then (2.8) yields
[TABLE]
This completes the induction. ∎
3. Singular modulo an odd prime
Our aim in this section is to prove the following theorem, which addresses the three lower-left terminal nodes (red) in Figure 1. Below is a Legendre symbol.
Theorem 3.1**.**
Let be primitive and integral with discriminant , in which and is an odd prime that does not divide .
- (a)
If is even, then is dense in if and only if . 2. (b)
If is odd, then is not dense in .
3.1. Proof of Theorem 3.1a
We have with even. Because is primitive, cannot divide both and since otherwise it would divide , , and . Without loss of generality, suppose that . Let , so that . The forms and
[TABLE]
are (improperly) equivalent. Thus, and have the same discriminant and assume the same values, hence . Since and
[TABLE]
it follows that
[TABLE]
are integers. We may write
[TABLE]
which has discriminant
[TABLE]
Consequently, the integral quadratic form
[TABLE]
has discriminant . Moreover,
[TABLE]
Case 1: Suppose that . If , then (3.4) implies
[TABLE]
since . The Legendre symbol of the left-hand side is [math] or ; the Legendre symbol of the right-hand side is [math] or . Thus, both sides are congruent to [math] modulo and hence . Since , it follows that and hence is anisotropic modulo . Theorem 2.1 ensures that is not dense in . Since , we conclude that , which equals , is not dense in .
Case 2: Suppose that . Let denote a square root of modulo and let , which is not congruent to modulo since . Then (3.3) yields
[TABLE]
Since , it follows that is isotropic modulo . Since the discriminant of is not divisible by , Theorem 2.1b implies that is dense in . If , then (3.2) provides
[TABLE]
and hence is dense in . Since and are equivalent, is also dense in . ∎
3.2. Proof of Theorem 3.1b
As in the proof of Theorem 3.1a, we may assume that . Since and
[TABLE]
we may assume without loss of generality that
[TABLE]
Suppose toward a contradiction that is dense in . Let be a quadratic nonresidue modulo . Then there are , not all multiples of , so that and
[TABLE]
In particular, . Multiplying (3.5) by gives
[TABLE]
If or , then and hence , which is a contradiction.
Since and , we get or . Thus, . Now observe that has even -adic valuation (the form is anisotropic and nonsingular modulo and the proof of Theorem 2.1a ensures that it has even -adic valuation for all ). Consequently, is the sum of a -adic integer with even valuation, and one with odd valuation . Thus, , which is a contradiction. Since cannot be arbitrarily well approximated by elements of , it follows that is not dense in . ∎
4. Singular modulo
Our aim in this section is to prove the following theorem, which addresses the three lower-right terminal nodes (purple) in Figure 1.
Theorem 4.1**.**
Let be primitive and integral with discriminant , in which is odd.
- (a)
If is odd, then is not dense in . 2. (b)
If is even and , then is not dense in . 3. (c)
If is even and , then is dense in .
4.1. Proof of Theorem 4.1a
The proof is similar in flavor to that of Theorem 3.1b, although there are a couple modifications. Since and , we may assume without loss of generality that . Suppose that is dense in . Then there are , not all even, so that and
[TABLE]
We also see that and from this we get
[TABLE]
If or is odd, then . It follows that the power of dividing is even. If and are odd, then , which contradicts (4.2). Thus, and are both even. However, in this case, the power of dividing is even, and the power of dividing is odd and at most . It follows that
[TABLE]
which is a contradiction. Thus, is not dense is . ∎
4.2. Proof of Theorem 4.1b
In this section, we show that if with even and , then is not dense in . As before, if , then and so if , then . Letting , we have
[TABLE]
for and hence . Consequently, it suffices to show that is not dense in . We require a couple computational lemmas.
Lemma 4.3**.**
If , then is not dense in .
Proof.
Write and , in which and are odd.
- •
If , then
[TABLE]
- •
If , then
[TABLE]
- •
If , then
[TABLE]
If , then
[TABLE]
since . Thus, is even.
It follows that is even, and so there are no solutions to
[TABLE]
Thus, is not dense in . ∎
Lemma 4.4**.**
If , then is not dense in .
Proof.
Suppose that is dense in . Then there are so that
[TABLE]
We may assume at least one of is odd. Multiplying by gives
[TABLE]
For , a computation confirms that there are no solutions to with at least one of is odd. For , there are no solutions to with at least one of is odd. This contradiction tells us that is not dense in . ∎
4.3. Proof of Theorem 4.1c
Suppose that is primitive and where is even and . Since , must be even. By switching and if necessary, we may assume that is odd. The form is equivalent to
[TABLE]
and hence . We claim that we can choose a such that
[TABLE]
Let
[TABLE]
Then
[TABLE]
which is the first condition in (4.5). The second condition follows from
[TABLE]
since is odd and . Thus, we may define the integers
[TABLE]
so that the form
[TABLE]
has discriminant
[TABLE]
Since , we have . Since
[TABLE]
we get . Thus, .
From (4.6), it follows that is odd and hence . Thus, either or is even and it follows that is isotropic modulo . Theorem 2.1b ensures that is dense in . ∎
5. An alternative approach
In this section, we present an alternative approach to the proof of Theorems 2.1, 3.1, and 4.1. We also prove that if is a non-degenerate quadratic form in variables, then is dense in for all . While the arguments given here are shorter, they rely heavily on the classification of quadratic forms over and the values they represent. One convenient source for this material is [25].
Over a field, any quadratic form is equivalent to a diagonal one (by [25, Thm. IV.1]), namely
[TABLE]
For the remainder of this section, we will use the classification of squares in (see [25, Thms. 2.3 & 2.4]). If , then an element with and is a square if and only if is even and is a square. If , then an element is a square if and only if is even and . It follows from this that has four square classes if and eight square classes if .
The corollary on page 37 of [25] gives a classification of the values reprsented by a quadratic form over . We wish to record some consequences of this corollary. In particular, a binary quadratic form over whose discriminant is not a square represents half of the square classes, while a binary quadratic form over whose discriminant is a square represents everything in . A quadratic form in three variables either represents everything in , or represents all but one square class. Finally, a quadratic form in four or more variables over is universal.
We begin by reproving Theorems 2.1, 3.1, and 4.1. We start with a result of Arnold (which he attributes to F. Aicardi) [1, Thm. 1].
Lemma 5.1** (Arnold).**
Let be a binary quadratic form with integer coefficients. If represents , and , then it represents .
One way of interpreting this statement is that the inverse of in the class group is , which is improperly equivalent to . Because in the class group, if represents , represents , and represents , then represents .
Proof.
If , and , then , in which
[TABLE]
The following result provides an alternate representation of based upon Arnold’s lemma.
Lemma 5.2**.**
Let be a binary quadratic form and let be a nonzero integer represented by . Then
[TABLE]
Proof.
Suppose that , in which and for some . Write and , in which and . Then
[TABLE]
Now suppose that . Then there are so that
[TABLE]
By Lemma 5.1, there are so that . Thus,
[TABLE]
Next we require an analogue of Lemma 5.2 that describes the -adic closure of .
Lemma 5.3**.**
If is a nonzero integer represented by , then
[TABLE]
Proof.
Suppose that with . Write with and choose sequences of rational numbers such that
[TABLE]
in . The continuity of ensures that
[TABLE]
so is a limit point of by Lemma 5.2. Thus, .
Now suppose that . If , then and we are done. If , Lemma 5.2 provides such that
[TABLE]
which implies that
[TABLE]
Since every element of that is congruent to modulo is a square (by [25, Thms. II3 & II.4] mentioned above), there is a such that . Then
[TABLE]
We can now reprove Theorems 2.1, 3.1, and 4.1. Lemma 5.3 implies that the -adic closure of depends only on the -equivalence class of . A quadratic form over a field can be diagonalized, and so up to scaling, any binary quadratic form is equivalent to , where is a representative of the -square class of the discriminant of . As mentioned earlier, the corollary on page 37 of [25] shows that represents every element of if and only if is a square in . For this reason, is dense in if and only if the discriminant of is a square in . In particular, if and , then is dense in if and only if is even and . If , and , then is dense in if and only if is even and .
Now, we turn to the situation of quadratic forms in variables. Suppose that is an integral quadratic form in variables and . The special case and was settled by Miska, Murru, and Sanna [18, Thm. 1.8c].
Theorem 5.4**.**
If , then is dense in for all primes .
Proof.
Fix an . If , then it is clear that is in the -adic closure of , since we can take a vector so that , and note that .
Assume therefore that . By the same corollary from page 37 of [25] quoted above, the forms and each represent either everything in or all but one square class in . Since has four square classes if (and eight if ), there must be some nonzero element represented by both and . By scaling these representations by a power of , we can assume that there are vectors and so that with and .
Fix . Since is dense in , there are vectors and (with components , , and , , ) so that
[TABLE]
for all (and similarly for all ). Since is a polynomial with integer coefficients, is -adically continuous. In fact, the ultrametric inequality implies that if and are elements of with for all , then
[TABLE]
Using this, we have that
[TABLE]
Since and , it follows that . Thus,
[TABLE]
This proves that is in the -adic closure of , as desired. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Vladimir Arnold, Arithmetics of binary quadratic forms, symmetry of their continued fractions and geometry of their de Sitter world , Bull. Braz. Math. Soc. (N.S.) 34 (2003), no. 1, 1–42, Dedicated to the 50th anniversary of IMPA. MR 1991436
- 2[2] Bryan Brown, Michael Dairyko, Stephan Ramon Garcia, Bob Lutz, and Michael Someck, Four quotient set gems , Amer. Math. Monthly 121 (2014), no. 7, 590–599. MR 3229105
- 3[3] Jozef Bukor, Paul Erdős, Tibor Šalát, and János T. Tóth, Remarks on the ( R ) 𝑅 (R) -density of sets of numbers. II , Math. Slovaca 47 (1997), no. 5, 517–526. MR 1635220 (99e:11013)
- 4[4] Jozef Bukor, Tibor Šalát, and János T. Tóth, Remarks on R 𝑅 R -density of sets of numbers , Tatra Mt. Math. Publ. 11 (1997), 159–165, Number theory (Liptovský Ján, 1995). MR 1475512 (98e:11012)
- 5[5] József Bukor and Peter Csiba, On estimations of dispersion of ratio block sequences , Math. Slovaca 59 (2009), no. 3, 283–290. MR 2505807
- 6[6] József Bukor and János T. Tóth, On accumulation points of ratio sets of positive integers , Amer. Math. Monthly 103 (1996), no. 6, 502–504. MR 1390582 (97c:11009)
- 7[7] Stephan Ramon Garcia, Quotients of Gaussian Primes , Amer. Math. Monthly 120 (2013), no. 9, 851–853. MR 3115449
- 8[8] Stephan Ramon Garcia, Yu Xuan Hong, Florian Luca, Elena Pinsker, Carlo Sanna, Evan Schechter, and Adam Starr, p 𝑝 p -adic quotient sets , Acta Arith. 179 (2017), no. 2, 163–184. MR 3670202
