Quaternary quadratic lattices over number fields
Markus Kirschmer, Gabriele Nebe

TL;DR
This paper establishes a correspondence between isometry classes of maximal lattices in definite quaternary quadratic spaces over number fields and ideal classes in quaternion algebras, providing an effective enumeration algorithm.
Contribution
It introduces a novel method linking lattice classes to quaternion algebra ideals, enabling efficient classification and enumeration of lattices.
Findings
Established a correspondence between lattice classes and quaternion ideal classes.
Developed an algorithm for enumerating lattice representatives.
Applied the method to classify lattices in specific quadratic spaces.
Abstract
We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of (V,q). This yields a good algorithm to enumerate a system of representatives of proper isometry classes of lattices in genera of maximal lattices in (V,q).
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.
Quaternary quadratic lattices over number fields
Markus Kirschmer
and
Gabriele Nebe
Lehrstuhl D für Mathematik, RWTH Aachen University, 52056 Aachen, Germany
Abstract.
We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of . This yields a good algorithm to enumerate a system of representatives of proper isometry classes of lattices in genera of maximal lattices in .
Key words and phrases:
Quaternary quadratic forms, lattices over totally real fields, genera of lattices, orders in quaternion algebras, class numbers, classification algorithm
2010 Mathematics Subject Classification:
11E20; 11E41; 11E12; 11R52
1. Introduction
Small dimensional lattices over algebraic number fields have been related to ideals in étale -algebras by various authors. In his Disquisitiones Arithmeticae Gauß relates proper isometry classes of binary lattices to ideal classes in quadratic extensions of . For ternary quadratic forms a similar relation between lattices and quaternion orders has been investigated by Peters ([14]) and Brzezinski ([2], [3]) based on results from Eichler and Brandt, for a functorial correspondence see Voight ([28]).
Quaternary lattices have been investigated by Ponomarev ([15, 16, 17, 18]), who relates the proper isometry classes of lattices in a quaternary quadratic space to certain equivalence classes of ideals in a quaternion algebra, where he is particularly interested in the case where . The present paper generalises Ponomarev’s results to arbitrary totally real number fields and develops a fast algorithm to enumerate proper isometry classes in certain genera of quaternary lattices.
To state our results let be a totally definite quaternary quadratic space over of square discriminant and let be the totally definite quaternion algebra representing its Clifford invariant. Then Theorem 4.1 shows that the proper isometry classes of -maximal lattices in are in bijection with certain equivalence classes of normal ideals in of norm . This correspondence is used to relate the mass formulas of Siegel and Eichler in Section 6. Section 7 develops an algorithm to enumerate a system of representatives of proper isometry classes of -maximal lattices in based on the method of [10]. Algorithm 7.1 is much more efficient than the usual Kneser neighbour method (see for instance [20] for a description of a good implementation of this method). This is illustrated in a small and a somewhat larger example in the end of the paper. A further application to the classification of binary Hermitian lattices is given in [9].
Acknowledgements The authors thank the anonymous referee for many helpful comments largely improving the exposition of the results. The research is supported by the DFG within the framework of the SFB TRR 195.
2. Quadratic lattices over number fields
In this section, we set up basic notation for quadratic lattices. Let be a number field and let be a non-degenerate quadratic space over . The most important invariants of are the Clifford invariant as defined in [22, Remark 2.12] and the determinant , which is the square class of the determinant of a Gram matrix of . The interest in these two isometry invariants of quadratic spaces is mainly due to the following classical result by Helmut Hasse.
Theorem 2.1** ([7]).**
Over a number field the isometry class of a quadratic space is uniquely determined by its dimension, its determinant, its Clifford invariant and its signature at all real places of .
Let be the ring of integers in . A -lattice in is a finitely generated -submodule of that contains a -basis of . The orthogonal group
[TABLE]
and its normal subgroup of proper isometries act on the set of all lattices in . We call two lattices and in properly isometric, , if they are in the same orbit under the action of and denote by
[TABLE]
the proper isometry class of the -lattice . The stabiliser of in is called the proper isometry group of . If we refer to the coarser notion of isometry and orbits under the full orthogonal group, then the superscript is omitted.
Certain invariants of a -lattice can be read off from the transfer to the corresponding -lattice , where
[TABLE]
The -lattice is called the trace lattice of
Given a place of , let and be the completions of and at . If is finite, we denote by and the completions of and at . Two lattices and in are in the same genus, if
[TABLE]
The classification of all (proper) isometry classes of lattices in a given genus is an interesting and intensively studied problem (see [20, 23, 8]). One strategy is to embed an integral quadratic lattice into a maximal one and deduce the classification of the genus of from the one of maximal lattices. Recall that for a (fractional) ideal of a lattice in is -maximal, if and for all -lattices in with . The -maximal lattices are also called maximal. Locally, all -maximal lattices are isometric, see [13, Theorem 91:2]. Hence the set of all -maximal lattices in forms a single genus, which we denote by .
The number of isometry classes in a genus is always finite and it is called the class number of the genus. By the strong approximation theorem, see for instance [13, Theorem 104:4], the class number of a genus can be determined by local invariants if there is an infinite place of such that is isotropic. So the only interesting case is when is totally real and is definite for all infinite places of . After rescaling, we assume that is totally positive definite, which means that is positive definite for all these . An element of the totally real number field is called totally positive, if for all infinite places of .
3. Some basic facts about quaternion algebras
This section relates normal ideals in quaternion algebras to maximal lattices. A detailed discussion of the arithmetic of quaternion algebras can be found in [5], [27], and [19]. Let be a totally definite quaternion algebra over an algebraic number field . Then is totally real and has a basis with and , for some totally positive . The algebra is also denoted by . It carries a canonical involution, defined by . The reduced norm
[TABLE]
of is a quaternary positive definite quadratic form over such that for all . The group of proper isometries of the quadratic space is
[TABLE]
(see e.g. [4, Appendix IV, Proposition 3] or [12, Proposition 4.3]).
The canonical involution of is an improper isometry of , so the full orthogonal group is generated by the normal subgroup and the canonical involution .
Remark 3.1*.*
The Gram matrix of with respect to the basis from above is . Hence the determinant of is a square and its Clifford invariant can be computed with [11, Formula (11.12)] as the class of in the Brauer group of .
An order in is a -lattice that is a subring of . An order is called maximal if it is not contained in any other order.
Proposition 3.2**.**
If is a maximal order in , then is a maximal lattice.
Proof.
It is enough to show that for all prime ideals of the completion is a maximal lattice in . If is not ramified, then is unimodular (see [19, Theorem 20.3]) and if is ramified in then by [19, Theorem 12.8]. In both cases the lattice is maximal. ∎
A -lattice in is called normal if its right order
[TABLE]
is a maximal order in . Then also its left order is maximal (see [19, Theorem 21.2]) and is an invertible left (right) ideal of its left (right) order. Let be a maximal order in . Then is called a two sided ideal of , if . The two sided ideals of form an abelian group. The normaliser of
[TABLE]
acts on this group by left multiplication. This action has finitely many orbits, the number of which is called the two sided ideal class number of .
Remark 3.3*.*
Any normal lattice in the completion is free as a right -module and thus of the form for some . The map
[TABLE]
is an improper isometry of .
We call two normal lattices left, right, respectively two sided equivalent, if there are such that , , respectively . We denote by
[TABLE]
the two sided equivalence class of the normal lattice .
Proposition 3.4**.**
Let be normal lattices in .
- (1)
If and are two sided equivalent, then and are conjugate. 2. (2)
Suppose . Then and are two sided equivalent if and only if there exists some such that is left equivalent to .
Proof.
Suppose and are two sided equivalent. Then there exist such that . Then is conjugate to . This shows the first assertion. Moreover, if , then . The converse of the second assertion is clear. ∎
The norm of a lattice is the fractional ideal of generated by the norms of the elements in ,
[TABLE]
Clearly so the norm gives a well defined map
[TABLE]
from the set of equivalence classes of normal lattices in into the narrow class group of .
Let be a fractional ideal of . We call a normal lattice in of type if . This generalises the notion of stably free ideals, which are the normal lattices of type , see [19, Section 35].
Proposition 3.5**.**
Let be a -lattice in and let be a fractional ideal of . Then is a normal lattice in with if and only if lies in .
Proof.
Suppose first that is a normal lattice in with . Then the right order of is maximal. As in the proof of Proposition 3.2 we pass to the completions and let be a maximal ideal of . As is locally free (see Remark 3.3), there exists such that . Assume that is not -maximal. Then there exists such that . But then . This contradicts Proposition 3.2.
Suppose now that is an -maximal lattice in . Let be some maximal order in . For each maximal ideal of there exists some such that . Then is -maximal and by Proposition 3.2 properly isometric to . So there exist with such that . Hence is maximal. Thus is normal. As we conclude that for all maximal ideals , so . ∎
Let be a normal lattice of type . Then for some totally positive . By the theorem of Hasse-Schilling-Maass, there is some such that . Then . So any two sided equivalence class of type is represented by some normal lattice with . We call such a representative -normalised. Then the set of all -normalised representatives of is
[TABLE]
the orbit of under the action of Let
[TABLE]
Clearly only depends on the left and right order of .
Lemma 3.6**.**
Let be a normal lattice and let . Then if and only if .
Proof.
Suppose first that . Then and hence . Similarly . Moreover implies that .
Suppose now and consider the ideal . Then and as . Hence is a two sided ideal of . As and , we have . For every maximal ideal of there exists a unique maximal two sided ideal of containing and these freely generate the group of all two sided ideals of , see [19, Theorems 22.4 and 22.10]. So being a two sided ideal of of norm implies that and hence
[TABLE]
For a normal lattice we set
[TABLE]
This is a subgroup of and since the norm of an element in is always totally positive, is a subgroup of the group of totally positive units of . It always contains .
For each coset , we choose an element such that .
Proposition 3.7**.**
Let be a normal lattice in with . A system of representatives of all proper isometry classes of lattices where is
[TABLE]
Moreover,
[TABLE]
where
[TABLE]
Proof.
Let . Then there are with such that . Let . By definition there are such that . As and lie in we also have . So and thus by Lemma 3.6. Moreover , hence
[TABLE]
It remains to shows that two different elements in do not represent the same proper isometry class. To this end let and be properly isometric elements of . Then there are such that and . Then . Lemma 3.6 shows that and . Moreover, . So . ∎
4. Quaternary lattices
In this section we summarise the results of the previous section in the context of a totally positive definite quadratic space of dimension 4 over some totally real number field . To apply the theory of the previous section, we assume that is a square in . Then the Clifford invariant is the class of a totally definite quaternion algebra in the Brauer group of and by Theorem 2.1 we have that
[TABLE]
So without loss of generality, we may assume that . If it is shown in [16] that the proper isometry classes of lattices in the genus of maximal lattices in correspond to two sided equivalence classes of normal lattices in . To extend this correspondence to our more general situation let be a fractional ideal of and choose -normalised lattices in such that the disjoint union
[TABLE]
is the set of all -normalised normal lattices in . The easiest way to see that is finite is the combination of the following theorem and the finiteness of class numbers of genera.
Theorem 4.1**.**
* is a system of representatives of the proper isometry classes of lattices in .*
Proof.
Let . Proposition 3.5 shows that is an -normalised normal lattice in . The choice of implies that there exists a unique index such that . Proposition 3.7 shows that is properly isometric to one and only one lattice in . ∎
5. Eichler’s mass formula.
As above let be a totally definite quaternion algebra over the totally real number field . Denote by the maximal ideals of that ramify in (i.e. where the completion is a division algebra). Let be a maximal order in . The unit group index is finite, see for example [27, Théorème V.1.2]. Let
[TABLE]
be a system of representatives of the left equivalence classes of right ideals of . The number of these classes is finite and does not depend on the maximal order . Hence is called the class number of and it is always bigger or equal to the type number of , the number of conjugacy classes of maximal orders in , see for example [27, Théorème III.5.4] and the accompanying discussion. The mass of is
[TABLE]
Theorem 5.1** (Eichler [5]).**
[TABLE]
where is the class number of .
Let be the narrow class number of and fix some narrow class . Then we define
[TABLE]
and
[TABLE]
Theorem 5.2**.**
.
Proof.
There exists some maximal order in such that . The discussion after [26, Théorème 1] shows that does not depend on the maximal order . Hence for all fractional ideals of and therefore
[TABLE]
6. The Minkowski-Siegel mass formula
In the spirit of our paper relating normal ideals in the quaternion algebra to maximal lattices in this section compares Eichler’s mass formula for ideals to the well known Minkowski-Siegel mass formula for lattices. Whereas Eichler’s formula involves the class number of , the Minkowski-Siegel formula does not. Our comparison below explains how the class number cancels out.
The quotient of the narrow class number and the class number is
[TABLE]
Let be the group of fractional principal ideals.
Let represent the conjugacy classes of maximal orders in and let
[TABLE]
For we define the following maps:
[TABLE]
and
[TABLE]
Let be the image of and denote its order. The kernel of is . Thus . By [5, p. 137], the order of the two sided ideal class group of is
[TABLE]
Moreover the image of is of order where
[TABLE]
Let
[TABLE]
where is given by eq. (1) and define
[TABLE]
Then the image of is exactly and the kernel of is
[TABLE]
We need one more map
[TABLE]
and its kernel .
Let be the norm one subgroup of . Since is totally definite, the group is finite. Let be the index of in .
Remark 6.1*.*
Let be a normal lattice in with right order and left order . Then the subgroup from Proposition 3.7 satisfies
[TABLE]
In particular
[TABLE]
All the groups defined above contain
[TABLE]
For further computations we define
[TABLE]
Figure 1 illustrates the various subgroups of the group .
Lemma 6.2**.**
Let be as in Remark 6.1. Then the proper isometry group of the lattice only depends on the left and right orders of and
[TABLE]
Proof.
By Proposition 3.7 every proper automorphism of is of the form with , and . This induces an epimorphism with kernel . ∎
Lemma 6.3**.**
The number of two sided equivalence classes represented by normal lattices in having left order and right order is
[TABLE]
Proof.
Let be a transversal of in the abelian group of two sided ideals of . We consider the set . The group acts on via
[TABLE]
where is chosen such that . Lemma 3.6 shows that the stabiliser of any ideal in is . In particular, consists of orbits. The result follows since the number of orbits is also the number of two sided equivalence classes represented by normal lattices in having left order and right order . ∎
To state the Minkowski-Siegel mass formula let be a system of representatives of proper isometry classes of lattices in . Then the mass of this genus of -maximal lattices is defined as
[TABLE]
Already Siegel gave an analytic expression for the mass of a genus of arbitrary positive definite -lattices (see [24] and [25]). In our special situation, this expression can also be derived from Eichler’s mass formula:
Theorem 6.4**.**
For any fractional ideal of
[TABLE]
Proof.
Clearly the map is an isometry preserving bijection between and for any totally positive . So it is enough to show the theorem for representatives , , of .
We fix an order and some . Remark 6.3 gives the number of right ideals in having left order isomorphic to as By Proposition 3.7 these right ideals give rise to proper isometry classes of lattices (see Remark 6.1), all having the same proper isometry group which has order by Lemma 6.2. So
[TABLE]
Now by [6] the mass of does not depend on , (as locally the lattices are just rescaled versions of each other) so for all
[TABLE]
and the theorem follows from the computation of in Theorem 5.1. ∎
7. Proper isometry classes in
This section uses the method from [10] to develop an algorithm for determining a system of representatives of the proper isometry classes in . As explained in Remark 7.3 below, this yields a much faster algorithm to enumerate this genus than the usual neighboring algorithm.
Algorithm 7.1**.**
Given a totally definite quaternion algebra over and a fractional ideal of , the following algorithm returns a system of representatives of the proper isometry classes in .
- (1)
Compute a maximal order in using Zassenhaus’ Round 2 algorithm **[30]** or Voight’s specialised algorithm **[29, Algorithm 7.10]**. 2. (2)
Using **[10, Algorithm 7.10]** compute:
- (a)
A system of representatives of the conjugacy classes of maximal orders in . 2. (b)
A system of representatives of all invertible right ideals of up to left equivalence. 3. (3)
For set . 4. (4)
*If and then there exists a unique lattice such that is left equivalent to . This yields an action of the normaliser on . For compute a system of orbit representatives of this action. * 5. (5)
For fix some totally positive generator of and compute some such that . 6. (6)
For compute some such that . 7. (7)
Return .
Proof.
We only need to show that the output of the algorithm is correct. The set is a system of representatives of the left equivalence classes of all invertible right ideals of . Thus Proposition 3.4 shows that is a system of representatives of the two sided equivalence classes of all normal lattices in of type . For any lattice , the class is trivial. Hence the scalar exists. The existence of the elements and follows from the Theorem of Hasse-Schilling-Maass. Then is -normalised. Proposition 3.7 shows that the proper isometry classes of lattices with is given by
[TABLE]
Hence the set computed in (7) is a system of representatives of the proper isometry classes of all -maximal lattices in . ∎
Remark 7.2*.*
We give some remarks concerning the last three steps in the previous algorithm.
- (1)
Let . Proposition 3.7 shows that whenever the left orders of and are conjugate. This can be used to speed up the last step of the algorithm. 2. (2)
The norms of the ideals will only be supported by very few prime ideals. So for the computation of and in steps (5) and (6) one only has to solve very few norm equations of the form
[TABLE]
The Theorem of Hasse-Schilling-Maass (or the Hasse principle for quadratic forms) shows that any such norm equation has a solution and it gives rise to the isotropic vector of the quintic quadratic space . This is how it such a solution can be found. 3. (3)
Note that left multiplication with gives an isometry between and where . So for most applications, it is not necessary to compute the elements and in steps (5) and (6).
Remark 7.3*.*
The computation of a system of representatives of the proper isometry classes in using Algorithm 7.1 is much faster than using Kneser’s neighbour method [20] directly. There are mainly two reasons for this.
- (1)
Let be the number of finite places of which ramify in and suppose that has narrow class number . Section 4 of [5] shows that and . Moreover, . By Algorithm 7.1 the number of proper isometry classes in is at least . So using Kneser’s method directly requires to enumerate way more lattices than the enumeration of the ideal classes in . 2. (2)
The bottleneck of Kneser’s method is the computation of many isometries between -lattices. The computation of such an isometry is usually done by computing a suitable isometry of the corresponding trace lattices, see for example [8, Remark 2.4.4]. Since the trace lattices have rank , this method is limited to being small.
Computing a system of representatives for the right ideal classes of does not require the computations of isometries, since isomorphism tests for normal ideals amount only to show that a certain -lattice has minimum , see [10, Algorithm 6.3]. The test for a lattice minimum is much faster than the computation of an isometry.
Example 7.4*.*
Unimodular lattices over . As an example we take . Then , , . The narrow class group of is represented by
[TABLE]
and the fundamental unit of is totally positive.
We take to be the quaternion algebra over ramified only at the two infinite places. With the algorithm from [10] that is implemented in Magma [1] we compute that has 8 maximal orders each of class number 8. We list these maximal orders by giving the structure of their unit group:
[TABLE]
From this information we get
[TABLE]
and if and in all other cases. We compute that
[TABLE]
As the class number is equal to the type number, all normal ideals are equivalent to for some . Moreover can be computed from the information above. Using the information on given before, Proposition 3.7 now allows to deduce the number of proper isometry classes of -lattices in each of the four genera as listed in the next table. The columns are headed by a set of indices whereas the entries in the table give the set of values of such that lies in the narrow ideal class of the respective row. The entries below the gives the number of proper isometry classes of lattices obtained by these values . Summing up these entries in each row gives the proper class number of the genus as displayed in the first column of the table:
[TABLE]
For the four genera considered above, the trace lattices lie in the genera of even 15-modular (+ type) (see [21] for basic facts on modular lattices), 5-modular, 3-modular resp. unimodular lattices of dimension 8. Of course the latter 14 lattices are as -lattices all isometric to the -lattice, the unique positive definite even unimodular -lattice of dimension 8. One finds 2 extremal 15-modular lattices (minimum as -lattices): and . There is a unique extremal even 5-modular lattice of dimension 8 (minimum 4 as -lattice), so all the -trace lattices in of minimum 4 are isometric to this lattice. These are for or for .
Example 7.5*.*
Let be the totally real subfield of the cyclotomic field . Then there exists a unique prime ideal of over and the narrow class group is trivial. Let be the quaternion algebra over ramified only at the infinite places and at . We implemented Algorithm 7.1 in Magma and applied it to compute the maximal integral -lattices in . The timings below were done on an Intel Core i7 7700K.
The computation of a maximal order in took less than a second. For the second step, [10, Algorithm 7.10] took about 9 minutes. It turns out that there are conjugacy classes of maximal orders in . Each of them has left equivalence classes of right ideals. The computation of the products in step (3) took minutes and it took another minutes to enumerate the orbit representatives in step (4). It turns out that consists of lattices. Since , we can always choose in the last step of the algorithm. So there are proper isometry classes of maximal integral -lattices in . The complete enumeration only took minutes. Enumerating such a large genus with Kneser’s neighbour method would take several days.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language. J. Symbolic Comput. , 24(3-4):235–265, 1997.
- 2[2] J. Brzezinski. Arithmetical quadratic surfaces of genus 0, I. Math. Scand. , 46:183–208, 1980.
- 3[3] J. Brzezinski. A characterization of Gorenstein orders in quaternion algebras. Math. Scand. , 50:19–24, 1982.
- 4[4] J. Dieudonné. Linear algebra and geometry . Hermann, 1969.
- 5[5] M. Eichler. Zur Zahlentheorie der Quaternionen-Algebren. J. Reine u. Angew. Math. , 195:127–151, 1955. Correction in: J. Reine u. Angew. Math. 197 (1957), p. 220.
- 6[6] W. T. Gan, J. Hanke, and J.-K. Yu. On an exact mass formula of Shimura. Duke Mathematical Journal , 107, 2001.
- 7[7] H. Hasse. Äquivalenz quadratischer Formen in einem beliebigen Zahlkörper. J. reine u. angew. Mathematik , 153:158–162, 1924.
- 8[8] M. Kirschmer. Definite quadratic and hermitian form with small class number . Habilitation, RWTH Aachen University, 2016.
