Completely $p$-primitive binary quadratic forms
Byeong-Kweon Oh, Hoseog Yu

TL;DR
This paper investigates the properties of completely p-primitive binary quadratic forms, providing a necessary and sufficient condition for definite forms to possess this property, which relates to solutions of certain Diophantine equations.
Contribution
It introduces the concept of completely p-primitive forms and characterizes when a definite binary quadratic form is completely p-primitive.
Findings
Characterization of completely p-primitive forms for definite cases
Necessary and sufficient conditions established
Insights into solutions of Diophantine equations related to these forms
Abstract
Let be a binary quadratic form with integer coefficients. For a prime not dividing the discriminant of , we say is completely -primitive if for any non-zero integer , the diophantine equation has always an integer solution with whenever it has an integer solution. In this article, we study various properties of completely -primitive binary quadratic forms. In particular, we give a necessary and sufficient condition for a definite binary quadratic form to be completely -primitive.
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.
\diagramstyle
[labelstyle=]
Completely -primitive binary quadratic forms
Byeong-Kweon Oh and Hoseog Yu
Department of Mathematical Sciences and Research Institute of Mathematics, Seoul National University, Seoul 08826, Korea
Department of Applied Mathematics, Sejong University, Seoul 05006, Korea
Abstract.
Let be a binary quadratic form with integer coefficients. For a prime not dividing the discriminant of , we say is completely -primitive if for any non-zero integer , the diophantine equation has always an integer solution with whenever it has an integer solution. In this article, we study various properties of completely -primitive binary quadratic forms. In particular, we give a necessary and sufficient condition for a definite binary quadratic form to be completely -primitive.
Key words and phrases:
binary quadratic forms, -primitive representations
2000 Mathematics Subject Classification:
Primary 11E12, 11E20
This work of the first author was supported by the National Research Foundation of Korea (NRF-2017R1A2B4003758).
1. Introduction
A two variable homogeneous quadratic polynomial with integer coefficients
[TABLE]
is called a binary quadratic form if the discriminant is a non-square integer. We always assume that is primitive, that is, , unless stated otherwise. An integer is said to be (primitively) represented by if has an integer solution ( such that , respectively). The set of all non-zero integers that are (primitively) represented by is denoted by (, respectively). As one of diophantine equations, it is quite a difficult problem to decide for an arbitrary binary quadratic form .
In 1928, in his unpublished thesis, B. W. Jones proved that if an odd prime is represented by , where is a positive integer relatively prime to , then the diophantine equation has always an integer solution with , if it has an integer solution. This lemma was used by many authors to solve some problems on representations of positive ternary quadratic forms (see, for example, [4], [6], [7], [8] and [10]).
The aim of this article is to fully generalize Jones’ lemma stated above. To be more precise, let be a binary quadratic form with discriminant and let be a prime not dividing . An integer is said to be -primitively represented by if has an integer solution with . The set of all integers that are -primitively represented by is denoted by . Then, clearly
[TABLE]
for any prime . Note that from the definition. A binary form is called completely -primitive if . Jones’ lemma stated above says that is completely -primitive for any odd prime relatively prime to .
Let be a non-square integer congruent to [math] or modulo . Let be the set of all proper classes of primitive binary quadratic forms with discriminant . Then it is well known that forms an abelian group with the composition law (for details, see [2]). Let be the identity class in . For any proper class , the set denotes for any binary quadratic form . Similarly, we also define and . For any two binary forms and having same discriminant, we write
[TABLE]
A proper class is called an ambiguous class if . For a prime , a proper class is called completely -primitive if any binary form is completely -primitive, or equivalently, .
In this article, we study various properties of completely -primitive binary forms for any prime . If , where is the Kronecker’s symbol, then one may easily check that no integers divisible by are -primitively represented by . Hence we always assume that . We prove that if , then any proper class in is completely -primitive. Conversely, if an ambiguous class is completely -primitive, then . Finally, for any prime such that , we prove that a proper class is completely -primitive if and only if the order of in the group is and , under the assumption that .
Some basic notations and terminologies on binary quadratic forms, especially the composition law between binary forms having same discriminant, can be found in [2]. See also [9] for some basic notations and terminologies on -lattices. For a binary quadratic form , we simply write .
2. -primitive representations of integers by binary quadratic forms
Let be a non-square integer such that or . Let be the abelian group of proper equivalence classes of primitive binary quadratic forms with discriminant . Let be the identity class in , that is, , where
[TABLE]
Lemma 2.1**.**
A binary quadratic form is completely -primitive if and only if for any .
Proof.
Note that “only if” part is trivial. Assume that for any . For any , let , where are integers that are either zero or not divisible by . Then . Now, by assumption, we have . Therefore we have . ∎
Let be proper classes of primitive binary quadratic forms with discriminant and and . It is well known that for any integers and , (see [3]). Furthermore, if and , then . However, if and are not relatively prime, then it is no longer true. For example, if and , then . However, . Note that for any positive integer , if and only if there are integers such that .
Lemma 2.2**.**
Under the notations given above, let and . If and divides , then .
Proof.
Let and , where . Let be integers such that . Note that for any integer ,
[TABLE]
and
[TABLE]
Since and , we have
[TABLE]
Therefore, is divisible by . Furthermore, since
[TABLE]
there is an integer such that . Let be an integer such that . Note that this is possible, for . Since for some integer , we have
[TABLE]
Therefore, we have . ∎
Lemma 2.3**.**
Under the notations given above, if , , where , then .
Proof.
Assume that , where . Then . Since and , there is an integer relatively prime to such that . From the assumption that , we have by Lemma 2.2. Now, the lemma follows from the fact that . ∎
Proposition 2.4**.**
Under the notations given above, if , , where , then .
Proof.
Without loss of generality, we may assume that and . Let . Let and , for some integers and . Since , we have . Furthermore, since , there are relatively prime integers such that , and
[TABLE]
Choose integers and such that and , where . Note that and . We define proper classes , and satisfying
[TABLE]
Similarly, we also define proper classes and . Then, clearly we have
[TABLE]
If does not divide , then the proof is almost trivial. Hence we assume that divides . First, assume that divides . Then by Lemma 2.2, we have . Since
[TABLE]
we have by Lemma 2.3. Now, assume that divides . In this case, we have by Lemma 2.2. Since , we may conclude that by Lemma 2.3. ∎
3. -primitive representations of binary -lattices
Let and be non-classic integral -lattices in a quadratic space . Here a -lattice is non-classic integral if its norm ideal is . Let be a prime. A representation is called -primitive if . We say is -primitively represented by if there is a -primitive representation from to . Note that if is a primitive submodule of , that is, is a primitive representation, then is -primitive. If , then the converse is also true. However, for the higher rank case, the converse is not true in general. A -primitive representation is called essential if has an infinite order. Recall that an isometry is called proper if , and improper otherwise.
Let be a non-square integer congruent to [math] or modulo . Let be a proper class with discriminant and let be a binary quadratic form. The binary -lattice corresponding to (or ) is defined by such that
[TABLE]
Note that the binary lattice corresponding to is isometric to the binary lattice corresponding to . Conversely, for a binary -lattice , the binary quadratic form corresponding to is defined by . Note that the discriminant of the binary -lattice is defined by , as usual.
Theorem 3.1**.**
Let be a non-square integer congruent to [math] or modulo and let be a prime such that . Then the followings are all equivalent:
- (i)
;
- (ii)
;
- (iii)
there is a binary -lattice with discriminant and a proper -primitive representation ;
- (iv)
for any binary -lattice with discriminant , there is a proper -primitive representation ;
- (v)
there is a binary -lattice with discriminant and a proper -primitive essential representation ;
- (vi)
for any binary -lattice with discriminant , there is a proper -primitive essential representation .
Proof.
Note that (i) (ii) is trivial. We will prove that
[TABLE]
Since proofs of all arrows placed in the middle are trivial, it suffices to show that (i) (vi) and (iii) (i).
(i) (vi). Let be integers such that with . Let be any -lattice such that , where . Define such that
[TABLE]
Then, one may easily check that is, in fact, a proper isometry of such that . The characteristic polynomial of is . Since all roots of are not roots of unity, the order of is not finite.
(iii) (i). Assume that the corresponding binary quadratic form to is , where . Since is a non-square integer, we have . Assume that is a proper -primitive representation such that
[TABLE]
Then we have
[TABLE]
By (3.3) and (3.4), we have . Since at least one of and is non-zero, there is a rational number such that
[TABLE]
Now, by (3.2) and (3.5), . Since divides both and and , divides . By letting in (3.1) for some integer , we have
[TABLE]
Assume that divides . Then divides by (3.6), and also divides both and by (3.5). This is a contradiction to the assumption that is -primitive. Therefore, does not divide and hence . This completes the proof. ∎
The following lemma will be used in the proof of the main theorem.
Lemma 3.2**.**
Let be a binary -lattice with whose isometry group contains an improper isometry . Then, for any vector ,
[TABLE]
for any prime not dividing . In particular, if and , where is a prime not dividing , then .
Proof.
Since is an improper isometry, there is a primitive vector such that by Theorem 43.3 of [9]. Let . Since , there is an integer such that . If , then . Hence
[TABLE]
The lemma follows directly from the fact that .
Now, assume that such that . If , then and hence . This is a contradiction. Suppose that . Then and
[TABLE]
Since is not divisible by by assumption, both and are divisible by , which is also a contradiction. ∎
4. Classification of completely -primitive binary quadratic forms
Let be a non-square integer congruent to [math] or modulo , and let be a group of proper classes of primitive binary quadratic forms with discriminant . Let be a prime satisfying .
Theorem 4.1**.**
If , where is the identity class, then every proper class in is completely -primitive. Conversely, if an ambiguous class in is completely -primitive, then .
Proof.
First, assume that . Let be any proper class in . Assume that . Then by Proposition 2.4, we have
[TABLE]
Therefore is completely -primitive by Lemma 2.1.
Conversely, assume that an ambiguous class is completely -primitive. Let be a binary -lattice such that . Since represents at least one prime primitively by [11], we may assume that is a prime. Since , there are integers such that
[TABLE]
Since divides , divides or . First, assume that divides . If for some integer , then . One may easily check that is not divisible by from the assumption that . Therefore, we have by Theorem 3.1. Finally, assume that divides . Define such that
[TABLE]
Then, one may easily show that is an improper -primitive representation. Since is an ambiguous class and , there is an improper isometry . Then is a proper -primitive representation. The theorem follows from Theorem 3.1. ∎
From now on, we always assume that . For a positive definite binary quadratic form and a positive integer , we define
[TABLE]
and
[TABLE]
We also define . It is well known that
[TABLE]
where is the Kronecker’s symbol and
[TABLE]
Similarly, we define .
Theorem 4.2**.**
Assume that . A proper class is completely -primitive if and only if and the order of in is .
Proof.
Note that for any prime and for any prime . Hence we may assume that and the order of isometry group of is or for any binary quadratic form with discriminant .
First, we prove “if” part. Assume that in and . For any integer , we have
[TABLE]
by Proposition 2.4. Therefore, is completely -primitive by Lemma 2.1.
To prove “only if” part, assume that is completely -primitive. Note that is not an ambiguous class by theorem 4.1. Let be an odd prime not dividing . Let be a non-identity proper class such that . First, we will show that by proving that or .
Assume that is not an ambiguous class. By Lemma 2.3, we have
[TABLE]
Since is not an ambiguous class, any of three classes among and cannot be the same simultaneously. Suppose that all four proper classes are different with each other in . Note that . Since , we have
[TABLE]
Since by Lemma 2.1, we have or . Assume that and . Then, the binary -lattice corresponding to a binary form in has an improper isometry. Therefore we have by Lemma 3.2. Furthermore, one may easily show that and
[TABLE]
Since , we have . The proof of the case when and is quite similar to the above. Finally, if and , then one may easily show that , which is a contradiction.
Now, assume that is an ambiguous class. Choose integers suitably so that
[TABLE]
Since by Lemma 3.2, there is a vector such that
[TABLE]
Note that . Since , and , we have . Similarly, . Therefore, we have
[TABLE]
Since , we have . Therefore, in any cases.
Suppose that and . Note that and by Lemma 2.2. Hence we have
[TABLE]
Note that . Assume that and . Then by Lemma 3.2, we have
[TABLE]
This is a contradiction, for by assumption. Assume that . Then, we have
[TABLE]
Since , the order of is , which is a contradiction. Now, assume that . Since is an ambiguous class, by a similar reasoning given above. Since , or , which is a contradiction.
In the remaining, we prove that the order of is by showing . Suppose, on the contrary, that . Assume that . Let be the proper class in such that . Then clearly . Suppose that or , that is, is represented by . Since by assmption, we have
[TABLE]
Since , we have , which is a contradiction by Lemma 2.1. From now on, we assume that and . Choose an odd prime not dividing . Assume that for some . Then by Lemma 2.2 of [3], we have
[TABLE]
Since and are the only proper classes containing a binary quadratic form representing , we have or . Furthermore, since , we have
[TABLE]
Now, let and be binary quadratic forms. Note that . Since , there is a vector such that
[TABLE]
Note that by Lemma 3.2. Since
[TABLE]
the binary -lattice corresponding to has at least primitive vectors and , all of whose norms are . Since the proper class containing is an ambiguous class, there is an improper isometry . Since
[TABLE]
by Lemma 3.2. Therefore
[TABLE]
are all different primitive vectors in whose norms are . Furthermore, since
[TABLE]
we have . This implies that is not primitively represented by , though is primitively represented by . This is a contradiction. Therefore the order of in is . This completes the proof. ∎
Remark 4.3*.*
(i) Note that and the proper class containing is of order . Furthermore, , where . Therefore, for any positive integer such that the diophantine equation has an integer solution, it has an integer solution such that by Theorem 4.2.
(ii) For a positive integer , let be a ternary quadratic form. Note that if and only if
[TABLE]
Assume that for an integer , has an integer solution. Then there is an integer solution with , except the case when by Theorem 4.2. Therefore, if we define , then
[TABLE]
where denotes the set of positive integers that are congruent to modulo . In particular, assume that . Then one may easily show that . In fact, the class number of is three and the other two ternary quadratic forms in the genus of are
[TABLE]
One may easily check that , and , are all represented by . For any prime not dividing , the isometry class is connected to or in the graph defined in [5] (see also [1]). Furthermore, since , is represented by . Therefore, every square of an integer except is represented by . Consequently, we have
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. W. Benham and J. S. Hsia, On spinor exceptional representations , Nagoya Math. J. 87 (1982) 247–260.
- 2[2] J. K. S. Cassels, Rational quadratic forms , Academic Press, 1978.
- 3[3] A. G. Earnest and R. W. Fitzgerald, Represented value sets for integral binary quadratic forms and lattices , Proc. of AMS, 135 (2007), 3765–3770.
- 4[4] W. C. Jagy, Five regular or nearly-regular ternary quadratic forms , Acta Arith. 77 (1996), 361–367.
- 5[5] J. Ju, I. Lee and B.-K. Oh, A generalization of Watson transformation and representations of ternary quadratic forms , J. Number Theory 167 (2016), 202–231.
- 6[6] I. Kaplansky, The first nontrivial genus of positive definite ternary forms , Math. Comp. 64 (1995), 341–345.
- 7[7] I. Kaplansky, Ternary positive quadratic forms that represent all odd positive integers Acta Arith. 70 (1995), 209–214.
- 8[8] B.-K. Oh Ternary universal sums of generalized pentagonal numbers , J. Korean Math. Soc. 48 (2011), 837–847.
