On a quadratic Waring's problem with congruence conditions
Daejun Kim

TL;DR
This paper investigates a variant of Waring's problem for quadratic forms with congruence conditions, establishing exponential growth bounds and exact values for small dimensions.
Contribution
It introduces the function g_Δ(n) for quadratic forms with congruence conditions and proves its growth rate is at most exponential in √n, matching known bounds for classical Waring's problem.
Findings
g_Δ(n) grows at most exponentially with √n
Exact values of g_Δ(n) are determined for n ≤ 4
The growth rate matches bounds for classical quadratic Waring's problem
Abstract
For each positive integer , let be the smallest positive integer such that every complete quadratic polynomial in variables which can be represented by a sum of odd squares is represented by a sum of at most odd squares. In this paper, we analyze by studying representations of integral quadratic forms by sums of squares with certain congruence condition. We prove that the growth of is at most an exponential of , which is the same as the best known upper bound on the -invariants of the original quadratic Waring's problem. We also determine the exact value of for each positive integer less than or equal to .
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.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Theories and Applications · Advanced Mathematical Identities
On a quadratic Waring’s problem with congruence conditions
Daejun Kim
Department of Mathematical Sciences
Seoul National University
Seoul 151-747, Korea
Abstract.
For each positive integer , let be the smallest positive integer such that every complete quadratic polynomial in variables which can be represented by a sum of odd squares is represented by a sum of at most odd squares. In this paper, we analyze by studying representations of integral quadratic forms by sums of squares with certain congruence condition. We prove that the growth of is at most an exponential of , which is the same as the best known upper bound on the -invariants of the original quadratic Waring’s problem. We also determine the exact value of for each positive integer less than or equal to .
Key words and phrases:
Waring’s problem, Sums of squares, Representations of cosets
2010 Mathematics Subject Classification:
Primary 11E12, 11E25
This work was supported by BK21 PLUS SNU Mathematical Science Division.
1. Introduction
In 1770, Lagrange proved the Four-Square Theorem, which states that every positive integer is a sum of at most four squares of integers. This result has been generalized in many directions. In 1930’s, a higher dimensional generalization, the so-called new (or quadratic) Waring’s Problem, was initiated and studied by Mordell [12] and Ko [10]. In those papers, they proved that for any integer , every positive definite integral quadratic form in variables is represented by a sum of squares, and is the smallest number with this property. Later, Mordell [13] proved that the quadratic form corresponding to the root lattice cannot be represented by any sum of squares.
This result of Mordell lead us to consider the number defined as the smallest positive integer such that every quadratic form in variables which can be represented by a sum of squares is represented by a sum of at most squares. The numbers are called the “-invariants" of . Then the results of Lagrange’s, Mordell’s and Ko’s mentioned above can now be rewritten as for . In [7], Kim and Oh proved that , which disproves the earlier conjecture made by Ko [11] that . This is the last known value of .
On the other hand, it has been studied to find an upper bound of as a function of . Icaza [5] gave the first explicit but astronomical upper bound by computing the so called HKK-constant in [4]. Later, Kim-Oh [8] proved that , which improves Icaza’s bound. Recently, Beli-Chan-Icaza-Liu [1] obtained a better upper bound for any .
In this paper, we consider a quadratic Waring’s problem with a congruence condition modulo as a generalization of the original problem. One may naturally generalize the Lagrange’s four square theorem by considering the smallest number such that every positive integer is a sum of at most squares of odd integers. In fact, this number is and
[TABLE]
is the smallest positive integer which is a sum of squares of odd integers but is not a sum of less than squares of odd integers (cf. Proposition 3.4, see also [6]).
As a higher dimensional generalization of this problem, we introduce new -invariants in the following paragraphs.
Let be a quadratic polynomial such that
[TABLE]
where is a quadratic form, is a linear form, and is a constant. We always assume that is positive definite. Hence, there exists a unique vector such that , where is the bilinear form such that . The quadratic polynomial is called complete if , that is,
[TABLE]
We say that a quadratic polynomial is represented by a quadratic polynomial if there exists and such that
[TABLE]
Now let be the following quadratic polynomial in variables :
[TABLE]
A quadratic polynomial is said to be represented by a sum of odd squares if it is represented by . For each positive integer , we define the set of all complete quadratic polynomials in variables which can be represented by a sum of odd squares. For a quadratic polynomial in , we define
[TABLE]
and we define the following new -invariant of :
[TABLE]
One may deduce that the problem of determining is equivalent to the problem of representing positive integers by sums of odd squares explained above, so that . Furthermore, we will see in Section 3 that can be analyzed by studying representation of integral quadratic forms by sums of squares with a congruence condition modulo . Our main results can be stated as
Theorem 1.1**.**
Let be a positive integer. For any we have
[TABLE]
Theorem 1.2**.**
We have and for .
Note that our result presents the same growth as the best known upper bound on . More precisely, the upper bound on we obtain is approximately times the upper bound on obtained in [1]. We will adopt geometric language of quadratic spaces, lattices and -cosets in studying so that we shall use the geometric theory of those.
The rest of the paper is organized as follows. In Section 2, we introduce the geometric language and theory of quadratic spaces, lattices and -cosets, especially the concept of representations of -cosets. In Section 3, we consider the problem geometrically by translating representations of quadratic polynomials into representations of -cosets explicitly. The exact value of will also be determined. Section 4 contains some technical lemmas which will essentially be used in the following sections. The proof of Theorem 1.1 will be presented in Section 5. In Section 6, we will determine the exact values of for through some extensive computation.
For any unexplained notations, terminologies, and basic facts about -lattices, we refer the readers to [15].
2. Representation of cosets
In this section, we introduce the geometric theory of quadratic -lattices. We refer the readers to [3, Section 4] for the theory under more general setting. For simplicity, the quadratic map and its associated bilinear form on any quadratic space will be denoted by and , respectively. The set of all places on including the infinite place will be denoted by .
A -lattice is a finitely generated -module (hence a free -module) on an -dimensional quadratic space over . A -coset is a set , where is a -lattice on and is a vector in . A -coset on an -dimensional quadratic space is said to be represented by another -coset on an -dimensional space , which is denoted by
[TABLE]
if there exists an isometry such that , which is equivalent to
[TABLE]
Two -cosets and are said to be isometric, which is denoted by , if one is represented by another one and vice versa. For each , -cosets and representations of -cosets are defined analogously.
As in the case of quadratic forms and lattices, there is a one-to-one correspondence between the set of equivalence classes of complete quadratic polynomials in variables and the set of isometry classes of -cosets on -dimensional quadratic spaces. We will describe this correspondence concretely in Proposition 3.1.
Definition 2.1**.**
Let be a -coset on a quadratic space . The genus of is the set
[TABLE]
Lemma 2.2**.**
Let be a -coset on a quadratic space and let be a finite subset of . Suppose that -coset on is given for each . Then there exists a -coset on such that
[TABLE]
Proof.
See Lemma 4.2 of [3]. ∎
Let be the adelization of the orthogonal group of . By Lemma 2.2, naturally acts transitively on and hence
[TABLE]
Let be the stabilizer of in . Then the isometry classes in can be identified with
[TABLE]
The class number of , denoted by , is the number of classes in , which is also the number of elements in . The class number is finite and , where is the class number of (see Corollary 4.4 of [3]). Note that is equal to the number of elements in . For each , we have
[TABLE]
From now on, let be the -lattice whose Gram matrix with respect to is the identity matrix. For the sake of convenience, the vector will be denoted by and the -coset will be denoted by .
Proposition 2.3**.**
For any , we have .
Proof.
If we can prove for any prime that
[TABLE]
then so that we have , which proves the proposition.
When , we have so that . Now, it suffices to show that . Let and for each , we put for some . Note that
[TABLE]
for any , since . We claim that for any if the following two conditions hold:
(1) for any ,
(2) for any .
If we show this claim, then we have
[TABLE]
which implies and therefore we prove the proposition.
We prove the claim using an induction argument on . When , we have . Now, assume that and the above two conditions hold. From the first condition, for each , exactly one or five of belong to and all the other elements are in . Assume, without loss of generality, that and for all . Then, from the second condition, for any . Hence, we have . Also, we have and for any so that we have by the induction hypothesis. Therefore, we are left with the case when and exactly five of belong to for any . One may easily show from the second condition that this can only happen when as well as for any in those cases. ∎
Proposition 2.4**.**
Let be a -coset on a quadratic space , and let be a -coset on a quadratic space . Suppose that for each , there exists a representation such that . Then there exists a -coset which represents .
Proof.
By virtue of the Hasse Principle, we may assume that . By Witt’s extension theorem, we may further assume that . Let be the set of such that . Then is a finite set since for almost all . For each , let and . By Lemma 2.2, there exist such that
[TABLE]
Therefore , which proves the proposition. ∎
Corollary 2.5**.**
Let be a -coset and let be a positive integer less than or equal to . If is locally represented by , then is represented by .
Proof.
This is a direct consequence of Propositions 2.3 and 2.4. ∎
3. Geometric approach of the problem
In this section, we introduce some geometric approach of the problem via representations of -cosets. For any , let be the -lattice whose Gram matrix with respect to is the identity matrix. As in Section 2, the vector will be denoted by and the -coset will be denoted by . For any positive integer , we define
[TABLE]
For any , we define
[TABLE]
and we also define
[TABLE]
Proposition 3.1**.**
For any positive integer , we have
Proof.
Let be a complete quadratic polynomial in , where , and is the Gram matrix of the quadratic part of . Hence, there exists a positive integer , a matrix , and a vector such that
[TABLE]
By comparing the coefficients of both sides and by putting , one may easily show that
[TABLE]
Now let us consider a -coset of a -lattice , where and define a linear map by
[TABLE]
By (3.1), the map is a representation of -lattices satisfying , which implies that is a representation of -cosets. Thus, we have constructed a -coset in with .
Conversely, let be a -coset in , where and . Then there exist and a representation of -cosets . Since , there are integers such that . Also, let be the matrix such that for each . Then we have
[TABLE]
where . Hence the complete quadratic polynomial is represented by . Therefore, we have constructed a quadratic polynomial in with . The proposition follows as a consequence. ∎
Proposition 3.2**.**
For any positive integer , let
[TABLE]
Then we have
[TABLE]
Proof.
Let be a -coset in and let be a representation of -cosets, where . Note that one can write , where are relatively prime positive integers and is a primitive vector of . Since , there are integers such that . Moreover, we have
[TABLE]
Therefore, we have , that is, for any . Hence, there is an positive integer such that and we have
[TABLE]
Thus, and .
Since is a primitive vector of , we may assume that and consider the -lattice in the same quadratic space . Note that is a primitive vector of . One may easily check that
[TABLE]
which implies that is a representation of -cosets. Therefore, we have
[TABLE]
On the other hand, if we let be a representation of -cosets, then by restricting on we obtain a representation of by . Thus we may conclude . Hence , which proves the proposition. ∎
Remark 3.3**.**
(a) Let be a -coset in , where and let be the Gram matrix corresponding to with respect to the basis . Then we may assume that , where and . Let be either or and let us consider as an -coset. Let be a representation of -cosets, that is, and . Let be the matrix over such that for any . Then the assumption that is a representation of -cosets is equivalent to the following conditions:
[TABLE]
Conversely, a matrix satisfying (3.3) induces the representation of -cosets defined by for each . Therefore, we shall identify the above with .
(b) Let be an symmetric matrix over , which is not necessarily non-degenerate. We will sometimes say is represented by , denoted by , which means that there exists an integral matrix which satisfies (3.3). Suppose that there are two symmetric matrices over such that
[TABLE]
If we let be the corresponding integral matrix for each , then the matrix together with the matrix satisfies (3.3), hence we have .
We can simply analyze the problem in the case when .
Proposition 3.4**.**
We have .
Proof.
Let . As described in Remark 3.3 (a), we may assume that , where for some positive integer . Furthermore, finding a representation of -cosets is equivalent to writing as a sum of squares of odd integers.
We shall prove that every positive integer is a sum of at most squares of odd integers. Clearly, and are sum of 1 and 2 odd squares, respectively. Now, let us assume that with . Then, so that Legendre’s three-square theorem implies that for some odd integers . Since is a sum of squares of , is a sum of odd squares. Thus . On the other hand, every positive integers which are not a sum of two squares, for example, the integer , is a sum of odd squares. This proves the proposition. ∎
4. Lemmas
In this section, we will introduce several lemmas. We use the notations described in Remark 3.3 (a), so for a -coset , we put and , where and . We begin with finding some necessary condition of a -coset to be represented by .
Lemma 4.1**.**
Let be a -coset in . If is represented by for some positive integer , then the following holds.
- (i)
* for any .* 2. (ii)
* and .* 3. (iii)
, where is the greatest positive integer satisfying
[TABLE]
Proof.
Let be a representation of -cosets and be the integral matrix satisfying . Then,
[TABLE]
for each . Hence, for any , we have
[TABLE]
Now, we note that , where is an odd integer by the second condition of (3.3), for each . Thus, we have
[TABLE]
so that and . On the other hand, since not all elements in are zero for each , we have
[TABLE]
Then, follows from this with . ∎
Lemma 4.2**.**
Let be a -lattice of rank and be a primitive vector of . Suppose that is represented by over for some positive integer . Then we have . Furthermore, we have
[TABLE]
for any positive integer satisfying
[TABLE]
Proof.
For the sake of simplicity of notation, all the lattices, cosets, representations and matrices in the proof of this lemma are considered to be defined over . Moreover, the -lattice associate with will be denoted by for any positive integer during the proof of this lemma.
Assume that there is a representation of -cosets. One may show that holds by a similar argument used in the proof of (ii) of Lemma 4.1.
Now, we prove the second assertion. Since , the representation can be extended to a representation of -lattices
[TABLE]
We shall divide the proof into three cases.
First, suppose that . One may easily verify that
[TABLE]
for some integral -lattice and
[TABLE]
where and . It follows from Theorem 3 of [14] that has no proper unimodular Jordan component since . On the other hand, the same theorem also implies that if has no proper unimodular Jordan component, then we have for any integer with . Therefore, there is a representation
[TABLE]
Let , where the ’s are 2-adic integers. Since
[TABLE]
we have . Hence, we have
[TABLE]
Similarly, for any vector , let , where the ’s are 2-adic integers. Since and
[TABLE]
we have so . Hence, we have which implies that is a representation of -cosets.
Next, suppose that . One can verify that
[TABLE]
where , is an integral -lattice and
[TABLE]
In this case, implies that has no proper unimodular Jordan component and
[TABLE]
On the other hand, if the above conditions for both and are satisfied, then we have for any with . Therefore, we have a representation of cosets by a similar reasoning to the case when .
Finally, suppose that . Since is a primitive vector of , we may take as a basis for . Let be the matrix over corresponding to the representation , that is,
[TABLE]
Then for any (see Remark 3.3 (a)). Now, we consider another -lattice whose Gram matrix with respect to the basis is , where is the matrix with 1 in the position and [math] elsewhere and an integer is chosen to satisfy . Then the matrix defined by
[TABLE]
induces a representation of cosets (see Remark 3.3 (b)). Since , we may apply the result of the first case to conclude that there exists a representation of -cosets for any integer satisfying . Let be the integral matrix corresponding to , and define the matrix as
[TABLE]
where such that . Then induces a representation of -cosets
[TABLE]
This proves the lemma since and . ∎
Lemma 4.3**.**
(1)* Let be a positive definite integral -lattice such that and . Then the -coset is represented by .*
(2)* Let be a -lattice such that and is a positive definite even integral -lattice of rank . Then is represented by .*
Proof.
Since the proofs for (1) and (2) are quite similar to each other, we only provide the proof of (1). For the sake of convenience, put , and . By Corollary 2.5, it is enough to show, for any prime , that
[TABLE]
In case when , is represented by by Theorem 2 of [14]. When , we have, by hypothesis, that
[TABLE]
Therefore, by following the argument of the first case of the proof of Lemma 4.2 similarly, one may conclude is represented by so that is represented by . ∎
Let be a positive integer and let be integers such that , let be the matrix with 1 in the position and [math] elsewhere.
Lemma 4.4**.**
Let be a positive integer and let be an integer such that . Let be a diagonal matrix in and be a symmetric matrix in . Suppose that and satisfy the following conditions:
- (i)
* for any ,* 2. (ii)
* for any ,* 3. (iii)
* for any .*
Then, is a positive definite symmetric matrix and we have
[TABLE]
for some integer , where whose Gram matrix with respect to is and .
Proof.
By condition (i), we can write, for each , such that
[TABLE]
Since by condition (ii), we have
[TABLE]
Hence, by condition (iii), one may verify that
[TABLE]
Similarly, we can write , where
[TABLE]
and . One may also show that . Therefore, by condition (iii), we have for any .
Now, we can decompose as follows:
[TABLE]
Hence, one may easily observe that is positive definite. Moreover, since for any , we can apply Lemma 4.3 so that each
[TABLE]
is represented by for any with , and for each ,
[TABLE]
is represented by . Furthermore, can be represented by for some , for . Thus,
[TABLE]
for some , which proves the lemma (see Remark 3.3 (b)). ∎
5. Upper bound for
In this section, we will derive an upper bound for and complete the proof of Theorem 1.1. We begin by describing the “balanced HKZ reduction” introduced in Section 4 of [1] in terms of -lattices. Let be the group of upper triangular unipotent matrices in . Let be a positive definite -lattices of rank and let be a basis for . We say that a basis for is balanced HKZ-reduced if its corresponding Gram matrix is of the form , where and satisfy the following two properties:
(1) and for any ;
(2) for any , where .
Here, , and is the coefficient of in the Maclaurin series of . Note that every positive definite -lattice has a “balanced HKZ-reduced” basis (see [1, Section 4]). On the other hand, we can bound the values ([17, Corollary 2.5]) as
[TABLE]
Furthermore, there exists an absolute constant such that
[TABLE]
for any ([16], see also [9, p.547]). Note that is an increasing function of .
Proposition 5.1**.**
Let be an integer and let
[TABLE]
where is the absolute constant in (5.2). Then every -coset satisfying condition (i) of Lemma 4.1 can be represented by for some integer , provided that .
Proof.
The proof of this proposition is motivated by Section 6 of [1] and a modification of the arguments in there. The strategy of the proof is outlined as follows. We will take a specific basis for whose Gram matrix will be denoted by . Then we will take a diagonal matrix , with all the ’s as large as possible, such that remains positive semidefinite. Then we will take such that approximates well and is represented by . Write as , or equivalently, . We will show that and satisfy all conditions in Lemma 4.4. As a result, will be represented by for some . Hence we will conclude that can be represented by for some .
Let be a balanced HKZ-reduced basis for whose corresponding Gram matrix is , where is a diagonal matrix , , and which satisfy (1) and (2). Let for some and . With respect to the basis obtained by replacing with , where and is defined as . We note that . If we put and , then by a straight forward computation using (5.2) we obtain
[TABLE]
Now, for any , we let
[TABLE]
and let . Following the same argument used in the proof of Proposition 6.3 of [1], we can find an upper triangular matrix such that
[TABLE]
Note that for any , since is the entry of which is positive semidefinite.
Let be the upper triangular matrix in . Then . We can take an integral matrix satisfying
[TABLE]
for any . Let . Then
[TABLE]
hence , where which is an integral symmetric matrix. We note that is represented by . Therefore, as outlined at the beginning of the proof, it is enough to show that and satisfy the conditions in Lemma 4.4 with .
To verify the first condition, let and note that for any , by the hypothesis of this proposition. Also, the and the entries of have the same parity for any , by the construction of . Since , the first condition in Lemma 4.4 is satisfied.
Now we estimate the lower bound of . By the hypothesis, we have
[TABLE]
Combining this with the fact that is maximized at , we have
[TABLE]
for any . Hence, we have , so that
[TABLE]
and, especially for any . This proves that the second condition in Lemma 4.4 is satisfied.
On the other hand, using (5.1), (5.3), and the fact that , one may obtain that for any . Furthermore, since and , one may show for each that
[TABLE]
Thus, by (5.4), (5.5), and (5.6), for any , we have
[TABLE]
This implies that the third condition in Lemma 4.4 is satisfied, hence we complete the proof. ∎
Proposition 5.2**.**
For any positive integer ,
[TABLE]
where is the function defined in Proposition 5.1.
Proof.
Let be a -coset in . If , then by Proposition 5.1, is represented by for some integer less than or equal to
[TABLE]
Suppose that . We may assume that is represented by for some . Furthermore we may also assume that . Let , and define
[TABLE]
We may further assume that is a balanced HKZ reduced basis for so that . As is described in (3.2), there are linear forms over and integers such that
[TABLE]
Since , we have for any . Hence, for any , we have
[TABLE]
If are the coefficients of in respectively, then at most of them are nonzero. Thus, without loss of generality, we can write
[TABLE]
Note that . Thus, the second sum is zero or a complete quadratic polynomial in variables represented by . Hence it is represented by for some integer . Hence, the proposition follows immediately from this. ∎
Proof of Theorem 1.1.
Clearly, . Hence, by Proposition 5.2,
[TABLE]
We will show that in Section 6. Therefore, we have
[TABLE]
Since for any , we may conclude that
[TABLE]
∎
6. Exact value of for
In this section, we always assume that is an integer such that and we will determine the exact value of . Let be a -coset in . From now on, we fix the following notations. We write and for some and . We denote the corresponding Gram matrix of with respect to by and we assume that is a Minkowski reduced symmetric matrix. By [2] (see Lemma 1.2 of page 257), we have
[TABLE]
We shall state two more technical lemmas, which will be used in the proof of Theorem 1.2.
Lemma 6.1**.**
Let be a positive definite quadratic form whose Gram matrix is a Minkowski reduced symmetric matrix . Then, for any , we have
[TABLE]
where , and .
Proof.
We only provide a proof in the case when . Other cases can be proved similarly (cf. see Lemma 2.3 of [3]). Fix an integer in and let be the remaining three integers listed in increasing order. Let
[TABLE]
which is the determinant a submatrix of . Hence, is positive, since is positive definite. From the fact that , where is the -dimensional Hermite constant, we have , where is the discriminant of . We refer readers to [2, Theorem 2.2, 3.1 of Chapter 12] and [18, Satz 7] for more details. By (6.1), we have
[TABLE]
Now, by completing the squares, we have
[TABLE]
Hence, we prove the lemma. ∎
Lemma 6.2**.**
*Let and with . Furthermore, let , and .
(1) If or , then .
(2) Suppose that and . If there are non-negative integers such that*
[TABLE]
is a positive definite quadratic form. Then .
Proof.
(1) If then the result follows from Lemma 4.1. Now we assume that . Since , is represented by for any prime . Also, by Lemma 4.2, is represented by . Thus, by Corollary 2.5, .
(2) Let be a representation of -cosets. Consider another -coset , where is a -lattice whose Gram matrix with respect to is equal to
[TABLE]
and . We note that is positive definite and is a positive integer congruent to [math] modulo by the hypothesis.
Let be the integral matrix corresponding to and let be a unit in such that . We consider the following matrix over :
[TABLE]
Here, ’s are all placed on -th row for each , only one is placed on each column and 0’s are placed elsewhere. Then induces a representation (see Remark 3.3 (a)), hence by Lemma 4.2, we have
[TABLE]
It is clear that is represented by for any prime . Thus, by Corollary 2.5, there is a representation of -cosets . If we let be the matrix corresponding to , then the following matrix over
[TABLE]
induces a representation of -cosets . ∎
We are now ready to prove Theorem 1.2. First, we shall prove the following Proposition.
Proposition 6.3**.**
We have for any .
Proof.
Let be a -lattice whose Gram matrix with respect to is and . If is represented by , then by Lemma 4.1. Note that the following matrix
[TABLE]
induces a representation of -cosets (see Remark 3.3 (a)). However, cannot be represented by , since cannot be represented by over . Thus, we have .
For the case when or , we consider a -lattice whose Gram matrix with respect to is a diagonal matrix
[TABLE]
and . Then , respectively, and one may find a representation of -cosets from to or , respectively. However, cannot be represented by or , respectively, over . Hence, we have and . ∎
Proof of Theorem 1.2.
By Propositions 3.4 and 6.3, it is enough to prove that for each . The proof is a case-by-case analysis according to and the shape of . For each case, the proof will show how we can determine .
We assume that with and let be the integer defined in Lemma 4.1. Also, we assume that the Gram matrix of is Minkowski reduced so that satisfies all conditions given in (6.1). Also, by replacing with suitably, we may further assume that
[TABLE]
Under the conditions (6.1) and (6.2), the necessary and sufficient condition for to be a Minkowski reduced positive definite form is that
[TABLE]
and when ,
[TABLE]
[TABLE]
(Case 1) We shall prove by showing is represented by for some . By Lemma 4.1 and part (1) of Lemma 6.2, we may assume that condition (i) of Lemma 4.1 holds and
[TABLE]
Case 1-(i) Assume that for or . From the assumption, we have . Hence, we have is positive definite, since by Lemma 6.1,
[TABLE]
for any . Therefore, by Lemma 6.2 (2), we conclude that is represented by , where .
Case 1-(ii) Assume that . If , then is positive definite by Lemma 6.1, hence we are done by Lemma 6.2. For any satisfying and , it does not satisfy the assumption of (Case 1). This proves Case 1.
(Case 2) Now we shall prove by showing is represented by for some . As in Case 1, we may assume that condition (i) of Lemma 4.1 holds and
[TABLE]
Case 2-(i) Assume that for or . From the assumption, we have . Hence, we have is positive definite, since by Lemma 6.1,
[TABLE]
for any . Therefore, by Lemma 6.2 (2), we conclude that is represented by , where .
Case 2-(ii) Assume that . If then is positive definite by Lemma 6.1, hence we are done by Lemma 6.2 (2). Now, we may assume that
[TABLE]
We note that for each triple satisfying the assumption of Case 2, there exist non-negative integers such that and is positive definite. Once are decided, there are only finitely many candidates of by (6.2) and (6.3).
Now, for each fixed , we do the following process. Let be the smallest integer greater than or equal to satisfying condition (i) of Lemma 4.1. We search for non-negative integers such that and is positive definite. Once we find such , then we are done by Lemma 6.2 (2). Otherwise, we put the matrix in a list, raise by and then repeat searching for . Note that this process ends in a finite number of steps, since the discriminant of the form is an increasing linear function of for each possible pair . Running this process by a computer program, the final list of matrices obtained is empty.
Case 2-(iii) For the remaining cases, we have . If , then is positive definite by Lemma 6.1. Thus, we are done by Lemma 6.2 (2). Hence, we are left with finitely many candidates of all of which have . For each such satisfying the assumption of Case 2, by a computer program, we can find non-negative integers such that
[TABLE]
is positive definite. Thus, we are done by Lemma 6.2 (2).
(Case 3) Lastly, we shall prove by showing is represented by for some . As before, we may assume that condition (i) of Lemma 4.1 holds and
[TABLE]
Case 3-(i) Assume that , where there are possible cases. If , then by Lemma 6.1, is positive definite, since
[TABLE]
for any . Thus, we are done by Lemma 6.2 (2). By (6.1)(6.5), we are left with finitely many candidates of to check. For each of these that satisfies the assumption of Case 3, by a computer program, we can find non-negative integers such that
[TABLE]
is positive definite, except for the four -cosets , where and is one of the following matrices:
[TABLE]
Note that, two -cosets corresponding to the first matrix and the last one with are isometric to each other, and they are represented by . Also, the other two matrices also give an equivalent -cosets, which are represented by . This, together with Lemma 6.2 (2), implies the claim in this case.
Case 3-(ii) Assume that , where there are possible cases. If , then is positive definite by Lemma 6.1. Thus, we are done by Lemma 6.2 (2). Now, we may assume that
[TABLE]
Then there are only finitely many candidates of matrix . Note that, for each candidate that we should concern, there exist non-negative integers such that
[TABLE]
is positive definite. We can run a process similar to the one described in the Case 2-(ii). However this time we have four matrices on the final list and they appear when . Each of the corresponding -cosets is isometric to one of the -cosets described in Case 3-(i). Hence we proves the claim.
Case 3-(iii) Assume that . By a similar argument as before, we may assume that . Then there are only finitely many candidates of -tuple . For each of these -tuples that satisfies the assumption of Case 3, we can check that is positive definite and . Let and put
[TABLE]
If , then is greater than or equal to
[TABLE]
Since and by Lemma 6.1, we conclude that is positive definite. Hence, we are done by Lemma 6.2 (2).
Now, we may assume that , so that there are only finitely many candidates of matrix . We note that the quadratic form is positive definite for each of these candidates. We run the same process as described in the Case 3-(ii) and obtain a list of four matrices which appear only when . Each of the corresponding -cosets is isometric to one of the -cosets described in Case 3-(i). Hence we proves the claim.
Case 3-(iv) Finally, we assume that . One may check by Lemma 6.1 that is positive definite except for . Hence, by Lemma 6.2 (2), we may assume that , so that there are only finitely many candidates of -tuple .
Put and . If , that is, , then is positive definite obviously. Otherwise, we note that
[TABLE]
Hence, if , then is positive definite, since
[TABLE]
by Lemma 6.1. Thus, we may assume that and there are only finitely many candidates of -tuple . By a similar argument used in Case 3-(iii), we may further assume that is bounded and run the process as described in the other cases. This time the final list is empty and so we are done. ∎
Remark 6.4**.**
One may naturally expect that . However, if we consider a -coset , where whose Gram matrix with respect to is a diagonal matrix , then one may verify that
[TABLE]
which implies that .
Acknowledgments
I would like to express my gratitude to Professor Byeong-Kweon Oh who is my supervisor and Professor Wai Kiu Chan for their valuable advice, and to the referee for carefully reading this paper and making many helpful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. N. Beli, W. K. Chan, M. I. Icaza and J. Liu, On a Waring’s problem for integral quadratic and hermitian forms , Tran. Amer. Math. Soc., electronically published on September 28, 2018, DOI : https://doi.org/10.1090/tran/7571 (to appear in print).
- 2[2] J. W. S. Cassels, Rational quadratic forms , Academic Press, London, 1978.
- 3[3] W. K. Chan and B.-K. Oh, Representations of integral quadratic polynomials , Contemp. Math. 587 (2013), 31-46.
- 4[4] J. S. Hsia, Y. Kitaoka and M. Kneser, Representations of positive definite quadratic forms , J. Reine Angew. Math. 301 (1978), 132-141.
- 5[5] M. I. Icaza, Sums of squares of integral linear forms , Acta Arith. 124 (1996), 231-241.
- 6[6] K. Kim and B.-K. Oh, A sum of squares not divisible by a prime , ar Xiv:1805.03038, 2018
- 7[7] M.-H. Kim and B.-K. Oh, Representations of positive definite senary integral quadratic forms by a sum of squares , J. Number Theory 63 (1997), 89-100.
- 8[8] M.-H. Kim and B.-K. Oh, Representations of integral quadratic forms by sums of squares , Math. Z. 250 (2005), 427-442.
