Computing Invariants of the Weil representation
Stephan Ehlen, Nils-Peter Skoruppa

TL;DR
This paper introduces an algorithm to compute invariants of Weil representations linked to finite quadratic modules, establishing their integral basis and stable dimensions over finite fields.
Contribution
It provides a novel algorithm for computing invariant spaces of Weil representations and proves their integral structure and dimension stability over finite fields.
Findings
Spaces of invariants are defined over integers.
Dimensions of these spaces are stable over certain finite fields.
The paper offers an effective computational method for these invariants.
Abstract
We propose an algorithm for computing bases and dimensions of spaces of invariants of Weil representations of associated to finite quadratic modules. We prove that these spaces are defined over , and that their dimension remains stable if we replace the base field by suitable finite prime fields.
| 2 | 0 | 3 | 1191 | 0 | ||||
| 5 | 1 | 16 | 1 | 0 | ||||
| 15 | 7 | 141 | 0 | 2 | ||||
| 51 | 35 | 1711 | 2 | 0 | ||||
| 187 | 155 | 1 | 0 | 4 | ||||
| 715 | 651 | 6 | 0 | 6 | ||||
| 73 | 5 | 0 |
| 8 | 1 | 0 | |||
| 4 | 0 | 0 | |||
| 25 | 7 | 1 | |||
| 11 | 1 | 4 | |||
| 11 | 2 | 4 | |||
| 4 | 4 | 3 | |||
| 4 | 1 | 1 | |||
| 6 | 3 | 1 |
| 0 | 0 | 1 | 0 | 6 | ||||
| 2 | 0 | 1 | 0 | 4 | ||||
| 1 | 1 | 5 | 5 | 2 | ||||
| 1 | 7 | 33 | 0 | 2 | ||||
| 10 | 10 | 121 | 4 | 0 | ||||
| 40 | 22 | 1 | 5 | 6 | ||||
| 91 | 91 | 3 | 1 | 0 | ||||
| 247 | 301 | 5 | 1 | 0 | ||||
| 820 | 820 | 11 | 1 | 0 | ||||
| 2542 | 2380 | 121 | 5 | 0 |
| 2 | 0 | 2 | 0 | ||||
| 1 | 1 | 1 | 1 | ||||
| 1 | 7 | 1 | 7 | ||||
| 10 | 10 | 10 | 10 | ||||
| 40 | 22 | 40 | 22 | ||||
| 2 | 0 | 2 | 0 | ||||
| 1 | 1 | 1 | 1 | ||||
| 1 | 7 | 1 | 7 | ||||
| 10 | 10 | 10 | 10 | ||||
| 40 | 22 | 40 | 22 |
| 0 | 0 | 1 | 0 | ||||
| 0 | 2 | 3 | 4 | ||||
| 1 | 1 | 7 | 0 | ||||
| 1 | 11 | 1 | 0 | ||||
| 26 | 26 | 1 | |||||
| 106 | 156 | 7 | |||||
| 651 | 651 |
| 0 | 0 | 2 | 2 | ||||
| 1 | 1 | 1 | 1 | ||||
| 1 | 1 | 11 | 11 | ||||
| 26 | 26 | 26 | 26 |
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
TopicsAdvanced Algebra and Geometry · Algebraic Geometry and Number Theory · Coding theory and cryptography
Computing invariants of the Weil representation
Stephan Ehlen
University of Cologne, Mathematisches Institut, Weyertal 86-90, D-50931 Cologne, Germany
and
Nils-Peter Skoruppa
Universität Siegen, Fachbereich Mathematik, Walter-Flex-Str. 3, D-57072 Siegen, Germany
Abstract.
We propose an algorithm for computing bases and dimensions of spaces of invariants of Weil representations of associated to finite quadratic modules. We prove that these spaces are defined over , and that their dimension remains stable if we replace the base field by suitable finite prime fields.
Key words and phrases:
Weil Representations, Finte Quadratic Modules
2010 Mathematics Subject Classification:
11F27
1. Introduction
Weil representations associated to finite abelian groups equipped with a non-degenerate quadratic form provide a fundamental tool in the theory of automorphic forms. They are at the basis of the theory of automorphic products, the theory of Jacobi forms or Siegel modular forms of singular and critical weight, and they find also applications in other disciplines like coding theory or quantum field theory. Of particular interest among the mentioned applications is the space of invariants of the Weil representations of associated to a given finite quadratic module . Despite the importance of for the indicated applications neither any explicit closed formula is known for the dimension of nor any useful description111However, if possesses a self-dual isotropic subgroup then the characteristic function of is quickly checked to be an invariant, and one can show that, in the case that possesses self-dual subgroups, the characteristic functions of the self-dual isotropic subgroups span in fact the space (A proof of this will be given in [Sko16]). But an arbitrary finite quadratic module does not necessarily possess self-dual isotropic subgroups and still admits nonzero invariants if its order is big enough. of its elements.
The purpose of the present note is to discuss questions related to the computation of the dimension and a basis of for a given finite quadratic module . In particular, we develop an algorithm (Algorithm 4.2) for computing a basis of which we also implemented and ran successfully in various examples. We mention two results of this article which might be of independent interest. First, we prove that always possesses a basis whose elements are in (Theorem 3.3). Second, if a finite prime field contains the th root of unity, where is the level of , then the Weil representation can also be defined on . We prove that then (except for possibly ). Our algorithm has already been used succesfully to compute the dimension of spaces of vector valued cusp forms of weight and in [BEF16], where a classification of all lattices of signature without obstructions to the existence of weakly holomorphic modular forms of weight for the associated Weil representation was given.
The plan of this note is as follows. In Section 2 we recall the basic definitions and facts from the theory of finite quadratic modules and its associated Weil representations. In Section 3 we prove some basic facts about the space of invariants . Most of the material of this section is probably known to specialists. However, since it is often difficult to find suitable references we decided to include this section. To our knowledge Theorem 3.3 is new, which shows that the space of invariants is in fact defined over . In Section 4 we explain our algorithm for computing a basis for , and we discuss some improvements. In Section 5 we consider the reduction of Weil representations modulo suitable primes and prove that the dimension of the space of invariants remains stable under reduction. This interesting fact can be used to improve the run-time of our algorithm. Finally, in Section 6 we provide tables of dimensions for quadratic modules of small order.
2. Finite quadratic modules and Weil representations
A finite quadratic module (also called a finite quadratic form or discriminant form in the literature) is a pair consisting of a finite abelian group together with a -valued non-degenerate quadratic form on . The bilinear form corresponding to is defined as
[TABLE]
The quadratic form is called non-degenerate if is non-degenerate, i.e. if there exists no , such that for all . Two finite quadratic modules and are called isomorphic if there exists an isomorphism of groups such that . The theory of finite quadratic modules has a long history; see e.g. [Wal63], [Wal72], [Nik79] and the upcoming [Sko16].
If is an even lattice, the quadratic form on induces a -valued quadratic form on the discriminant group of . The pair defines a finite quadratic module, which we call the discriminant module of . According to [Wal63, Thm. (6)], any finite quadratic module can be obtained as the discriminant module of an even lattice . If is a finite quadratic module and a lattice whose discriminant module is isomorphic to , then the difference of the real signature of is already determined modulo by . Namely, by Milgram’s formula [MH73, p. 127] one has
[TABLE]
where we use for . We call
[TABLE]
the signature of . The number
[TABLE]
is called the level of .
The metaplectic extension of (i.e. the nontrivial twofold central extension of ) can be realized as the group of pairs , where and is a holomorphic function on the complex upper half plane with (see e. g. [Shi73]). The group is generated by
[TABLE]
and the group is generated by and with relations , where is the standard generator of the center of .
The Weil representation associated to is a representation of on the group algebra . Here, and throughout, we denote the standard basis of by . The action of can then be given in terms of the generators as follows:
[TABLE]
We shall sometimes simply write for , i.e. we consider as -module via the action . For details of the theory of Weil representations attached to finite quadratic modules we refer the reader to [BS17], [Nob76], [NW76], [Sko16], [Str13a].
The kernel of the projection of onto its first coordinate is the subgroup generated by . It is easily checked that acts as multiplication by . This simple observation has two immediate consequences. First of all, the space of invariants , i.e. the subspace of elements in fixed by , reduces to unless is even. Secondly, descends to a representation of if and only is even. Note, that is always even if the level of is odd as follows from Milgram’s formula.
3. Invariants
Let be a finite quadratic module of level . We shall assume in this section that is even. As we saw at the end of the last section the space of invariants is otherwise zero. The representation then descends to a representation of and, even more, factors through a representation of the finite group , i.e. of the group
[TABLE]
We will denote this representation also by .
An easy closed and explicit formula for the dimension of is not known for general . Of course, orthogonality of group characters yields
[TABLE]
While it is therefore in principle possible to compute the dimension of , there are two obstructions in practice . First of all, the size of the sum on the right can become very large. More precisely, the number of conjugacy classes of is asymptotically equal to for increasing (see [Nob76, Tabelle 2]). Secondly, the straight-forward formulas for which follow from explicit formulas for the matrix coefficients of involve trigonometric sums with about many terms (see e.g. [Str13a, Theorem 6.4])222However, in [BS17] a much simpler formula is given, which expresses the traces of the Weil representations in terms of the natural invariants for the conjugacy classes of ..
The following proposition implies that we can compute the invariants or the dimension of the space of invariants “locally”, i.e. for every -component of separately. For a given prime , denote the -subgroup of by . It is quickly verified that is again a finite quadratic module. Moreover, the decomposition of as sum over its -subgroups induces an orthogonal direct sum decomposition of . We also decompose as a product
[TABLE]
with via the Chinese remainder theorem. In this way becomes a -module in the obvious way. For this, we note that the set of primes dividing is equal to the set of primes dividing .
Proposition 3.1**.**
Let be the decomposition of as sum over its -subgroups . Then defines via linear extension an isomorphism of -modules
[TABLE]
Under this isomorphism we have
[TABLE]
Remark 3.2**.**
The proposition implies in particular
[TABLE]
Proof of Proposition 3.1.
The given map clearly defines an isomorphism of complex vector spaces. That this map commutes with the action of , where acts component-wise on the right-hand side, as described above, is easily checked using the formulas for the and -action. It follows that
[TABLE]
for all in , which implies, in particular, the second statement via orthogonality of group characters. ∎
A natural problem is to determine the field or ring of definition333We say that a subspace of is defined over the ring if it possesses a basis whose elements are in . of the space . From the formulas defining , it is clear that is defined over the cyclotomic field 444For this one needs that is in , which can be read off from Milgram’s formula.. However, it turns out that the invariants are in fact defined over the field of rational numbers, as we shall see in a moment. This will allow us in Section 5 to compute a basis for by doing the computations in for suitable sufficiently large primes .
Theorem 3.3**.**
The space is defined over .
For the proof we need some preparations.
Lemma 3.4**.**
For any in and in , one has
[TABLE]
where with .
A careful analysis of yields
[TABLE]
where (see e.g. [Str13b, Lemma 3.9]). However, we shall not need this formula.
Proof of Lemma 3.4.
Since and it suffices to consider the action of . For this we write
[TABLE]
and apply the formulas for the action of and to obtain
[TABLE]
(Here we used Milgram’s formula). This proves the lemma. ∎
For any in , let denote the automorphism of which sends each th root of unity to . For any endomorphism of which leaves invariant , say with in , we use for the endomorphism of such that
[TABLE]
Note that defines an automorphism of the ring of endomorphisms of which leave invariant .
Lemma 3.5**.**
For any in , one has
[TABLE]
Proof.
Both sides of the claimed identity are multiplicative in (for this note that the map defines a automorphism of ). It suffices therefore to prove the claimed formula for the generators and of . For the formula can be read off immediately from the formula for the action of . For one has on the one hand side for any in
[TABLE]
where . On the other hand, , and hence, using Lemma 3.4,
[TABLE]
But , which implies the claimed formula. ∎
Proof of Theorem 3.3.
The -invariant projection is given by the formula
[TABLE]
It suffices to show that, for any in , we have with rational numbers , in other words, that we have, for any in the identity . But this follows from Lemma 3.5 and the fact that permutes the elements of . This proves the theorem. ∎
4. The algorithm
In this section we explain our algorithm for computing a basis for the space of invariants. We then discuss various easy and natural improvements. We fix a finite quadratic module of level , and assume that is even (since otherwise the space of invariants of the associated Weil representation is trivial). The Weil representation is then a representation of , which factors even through a representation of . Define
[TABLE]
and, for ,
[TABLE]
Note that, for any -submodule of , we have
[TABLE]
as follows immediately from the formula for the action of in Section 2. Our algorithm is based on the following observation.
Proposition 4.1**.**
Let be a -submodule of . Then
[TABLE]
Proof.
An element of is invariant under all of if it is invariant under the generators and of , i.e. if it is contained in and the set of vectors invariant under . Since we have , where
[TABLE]
But , hence , and therefore
[TABLE]
The proposition is now obvious. ∎
The Proposition is quickly converted into a first version of our algorithm:
Algorithm 4.1**.**
(Computing a basis for the space of invariants)
Find the isotropic elements and the non-isotropic elements in . 2. 2.
Compute the matrix such that
[TABLE]
where . 3. 3.
Let and be the matrices obtained by extraction the first and the last rows of , respectively. 4. 4.
Compute a basis for the space of vectors such that . 5. 5.
Return a basis for the space of all , where runs through the basis .
For implementing this algorithm we need, first of all, to decide over which field we would like to do the computations. One possibility is to use floating point numbers to do a literal implementation using the field of complex numbers. However, the matrix coefficients of with respect to the natural basis of are elements of the th cyclotomic field . Hence it is reasonable to the calculations over , where is the th cyclotomic polynomial. Another choice for will be discussed in Section 5.
There are two easy improvements which can help to reduce the computing time. The first one is due to the following observation.
Proposition 4.2**.**
The subspaces and of even and odd functions are -submodules of . Let . Then and .
Proof.
The first statement follows immediately from the observation that the map intertwines with the action of and , and hence with the action of , as is obvious from the formulas for the action of and .
For the proof of the second statement we note that which is again an immediate consequence of the formula for the action of . In other words, any invariant satisfies for all in . ∎
Let afforded by the -modules . As we saw in the proof of the preceding proposition acts on () as identity, i.e. . Using this Propositions (4.1), (4.2) imply
[TABLE]
A basis for is obtained by replacing in the standard basis by and omitting all zeroes and all duplicated vectors. This leads to the following modified algorithm.
Algorithm 4.2**.**
(Modified algorithm for computing a basis for the space of invariants)
As in Algorithm 4.1. 2. 2.a
Construct the basis , (, ) of obtained from the standard basis , by (anti-)symmetrizing, suppressing zeroes and duplicates, and after possibly renumbering the and . 3. 2.b
Compute the matrix such that
[TABLE]
where . 4. 3.–5.
As in Algorithm 4.1 with , , replaced by , , .
The dimension of equals , where denotes the subgroup of elements annihilated by “multiplication by ”. Note that if is odd. Therefore the size of is about half of the size of in Algorithm 4.1. Also note that has entries in the totally real subfield of . This implies that is in fact defined over and we can perform our computations over instead of .
To implement the algorithm, we still need an explicit formula for the entries of the matrix , where . We just write for and for for the elements of . By a straightforward calculation, we obtain
[TABLE]
where and denotes the standard hermitean inner product on (conjugate-linear in the second component), such that . Note that if and , otherwise.
Given a finite quadratic module the exact value of quantity is not immediately clear. For finding the of the preceding proposition the following is helpful.
Proposition 4.3**.**
For odd one has
[TABLE]
Proof.
Indeed, directly from the formula for the -action we obtain . On the other hand , and therefore we obtain by Lemma 3.4 that . For odd it is then easy to deduce from the formula of the lemma for that (see also the remark after Lemma 3.4). ∎
The second possible improvement is the factorization into local components as explained in Proposition 3.1. We compute first the local components , and apply then Algorithm 4.2 to the finite quadratic modules . If the number of different primes in is large this reduces the run-timeof our algorithm enormously. Indeed, the two bottle necks of our algorithm are the search for the isotropic elements in and the computation of the kernel of a matrix of size , where is the number of isotropic elements of . If contains more than two different primes, say with , then it takes many search steps to find all isotropic elements in , whereas an application of Proposition 3.1 allows us to dispense with many search steps to find eventually all invariants of . A similar comparison applies to the size of the matrices in our algorithm when run either directly on or else separately on the -parts .
5. Reduction mod
In this section we fix again a finite quadratic module of level . Let denote a prime such that . Then contains the th roots of unity, hence the th cyclotomic field. Accordingly, we can consider as a representation of taking values in , and as -module. From the formulas for the action of and on it is clear that is invariant under , and that the -rank of equals the dimension of .
For computing the rank of it is natural to consider the reduction modulo of . More precisely, note that is a -submodule of , so that we have the exact sequence of -modules
[TABLE]
where denotes the reduction map . Here the action of on is the one induced by the action on .
Theorem 5.1**.**
Suppose that . Then
[TABLE]
Remark 5.2**.**
Numerical computed examples suggest that the theorem is also true for and . However, we did not try to pursue this further.
Proof of Theorem 5.1.
From the short exact sequence preceding the theorem we obtain the long exact sequence in cohomology
[TABLE]
We shall show in a moment that the order of is a unit of . Hence, the cohomology group is trivial [Bro82, Corollary 10.2]. It follows then that . Since is free we conclude that equals the -rank of , which implies the proposition.
For proving that is not divisible by , first note that implies that . Then, recall that the order of is given by
[TABLE]
Hence, if , we have that there is a prime , such that or . However, and thus the only possibility is and . Since and are primes we conclude and , which we excluded in the statement of the proposition. ∎
The results on reduction modulo are not only interesting from a theoretical point of view. Our implementation profits tremedously from reduction modulo a suitable prime as it speeds up the calculation in practice. The reason is that there are higly optimized libraries for computation with matrices over finite fields (and/or over the integers) available. For instance, in sage (which uses the linbox library default), computing the nullity of a random matrix with entries in a cyclotomic field takes about seconds on our test machine, whereas computing the nullity of a matrix over takes about milliseconds. This immediately speeds up the computation of the dimension of although it does not give a basis for .
6. Tables
Tables 1 to 6 list the values and dimension for various -modules , where . We use genus symbols for denoting isomorphism classes of finite quadratic modules (see [Sko16, BEF16]). In short, for a power of an odd prime and a nonzero integer the symbol stands for the quadratic module
[TABLE]
where and is an integer such that . For a -power , we have the following symbols: We write for the module
[TABLE]
with and . We normalize to be contained in the set and if , we take . Finally, we write for
[TABLE]
and for
[TABLE]
The concatenation of such symbols stands for the direct sum of the corresponding modules. For instance, denotes the finite quadratic module
[TABLE]
It can be shown that every finite quadratic -module is isomorphic to a module which can be described by such symbols, and that this description is essentially unique (up to some ambiguities for ). For details of this we refer to [Sko16].
For the computations we used [S*+*13], the additional package [S*+*16] and our implementation of Algorithm 4.2, which is available as part of the package [Ehl16].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BEF 16] Jan Hendrik Bruinier, Stephan Ehlen, and Eberhard Freitag. Lattices with many Borcherds products. Math. Comp. , 85(300):1953–1981, 2016.
- 2[Bro 82] Kenneth S Brown. Cohomology of Groups, 1982.
- 3[BS 17] Hatice Boylan and Nils-Peter Skoruppa. Explicit formulas for Weil representations of SL ( 2 ) SL 2 \operatorname{SL}(2) . preprint, 2017.
- 4[Ehl 16] Stephan Ehlen. Finite quadratic modules and simple lattices, source code and resources, version 0.2 , 2016. http://www.github.com/sehlen/sfqm .
- 5[MH 73] John Milnor and Dale Husemoller. Symmetric bilinear forms . Springer-Verlag, New York, 1973. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 73.
- 6[Nik 79] V. V. Nikulin. Integer symmetric bilinear forms and some of their geometric applications. Izv. Akad. Nauk SSSR Ser. Mat. , 43(1):111–177, 238, 1979.
- 7[Nob 76] Alexandre Nobs. Die irreduziblen Darstellungen der Gruppen S L 2 ( Z p ) 𝑆 subscript 𝐿 2 subscript 𝑍 𝑝 SL_{2}(Z_{p}) , insbesondere S L 2 ( Z 2 ) 𝑆 subscript 𝐿 2 subscript 𝑍 2 SL_{2}(Z_{2}) . I. Comment. Math. Helv. , 51(4):465–489, 1976.
- 8[NW 76] Alexandre Nobs and Jürgen Wolfart. Die irreduziblen Darstellungen der Gruppen S L 2 ( Z p ) 𝑆 subscript 𝐿 2 subscript 𝑍 𝑝 SL_{2}(Z_{p}) , insbesondere S L 2 ( Z p ) 𝑆 subscript 𝐿 2 subscript 𝑍 𝑝 SL_{2}(Z_{p}) . II. Comment. Math. Helv. , 51(4):491–526, 1976.
