Matrix generators for Weil representations
Pith reviewed 2026-05-18 08:08 UTC · model grok-4.3
The pith
Explicit matrices generate Sp_{2ℓ}(r) inside GL_{r^ℓ}(F) via the faithful Weil representation.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Let r be an odd prime and F a field containing a primitive r-th root of unity. For every ℓ ≥ 1 there exists a faithful representation f : Sp_{2ℓ}(r) → GL_{r^ℓ}(F) called the Weil representation. The paper supplies explicit matrices in GL_{r^ℓ}(F) that generate the image of Sp_{2ℓ}(r) under f, and analogous generators for the two irreducible constituents of this representation, which have degrees (r^ℓ ± 1)/2.
What carries the argument
A set of explicitly written matrices in GL_{r^ℓ}(F) that generate the image of Sp_{2ℓ}(r) under the Weil representation and satisfy the defining relations of the symplectic group.
If this is right
- The matrices can be entered into Magma or similar systems to compute with the Weil representation for any concrete element of Sp_{2ℓ}(r).
- The same construction produces generators for each irreducible constituent of degree (r^ℓ ± 1)/2.
- Any property of Sp_{2ℓ}(r) that can be checked in a matrix representation becomes directly testable.
- The explicit form makes it possible to compare the Weil representation with other known matrix realizations of the same group.
Where Pith is reading between the lines
- The method may be adaptable to other classical groups whose Weil or oscillator representations are known to exist but lack explicit matrix models.
- Having generators in hand allows systematic search for small-degree relations or presentations that the group satisfies inside GL_{r^ℓ}(F).
- Numerical experiments on character values or fixed-point ratios become feasible once the generators are implemented.
Load-bearing premise
A faithful Weil representation of Sp_{2ℓ}(r) into GL_{r^ℓ}(F) exists as soon as F contains a primitive r-th root of unity.
What would settle it
A direct computation, for small ℓ and r, showing that the subgroup generated by the listed matrices has order different from the known order of Sp_{2ℓ}(r).
read the original abstract
Let $r$ be an odd prime and $\mathbb{F}$ a field containing a primitive $r$th root of unity. Then for all $\ell \geq 1$, there is a faithful representation $f: \operatorname{Sp}_{2\ell}(r) \rightarrow \operatorname{GL}_{r^\ell}(\mathbb{F})$ called the Weil representation. We provide explicit matrices generating $\operatorname{Sp}_{2\ell}(r)$ in $\operatorname{GL}_{r^\ell}(\mathbb{F})$, which we have implemented in Magma. We also describe such generators for the irreducible Weil representations of $\operatorname{Sp}_{2\ell}(r)$, which are of degree $(r^{\ell} \pm 1)/2$ and arise as irreducible constituents of the Weil representations.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper constructs explicit matrices in GL_{r^ℓ}(F) that generate the image of Sp_{2ℓ}(r) under the Weil representation, for odd prime r and field F containing a primitive r-th root of unity. It also gives generators for the two irreducible constituents of the Weil representation, which have degrees (r^ℓ ± 1)/2. The constructions are accompanied by a Magma implementation.
Significance. If the explicit matrices are correct and generate a faithful copy of Sp_{2ℓ}(r), the result supplies concrete, computable realizations of these representations. The Magma code provides an independent verification route and could support further computational work in finite symplectic groups and their representations.
major comments (1)
- [Section describing the generators for Sp_{2ℓ}(r)] The central claim that the listed matrices generate a subgroup isomorphic to Sp_{2ℓ}(r) rests on the general existence of the Weil representation, but the manuscript provides no separate algebraic verification (e.g., direct check of the symplectic relations or computation of the order of the generated subgroup) that would rule out a proper quotient or transcription error in the matrix entries. This verification is load-bearing for the explicit-generator claim.
minor comments (1)
- [Implementation section] Clarify the precise field F and the choice of primitive root of unity used in the Magma implementation, as these affect reproducibility of the matrices.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for noting the importance of independent verification for the explicit generators. We have revised the manuscript to incorporate computational checks that directly address this point.
read point-by-point responses
-
Referee: [Section describing the generators for Sp_{2ℓ}(r)] The central claim that the listed matrices generate a subgroup isomorphic to Sp_{2ℓ}(r) rests on the general existence of the Weil representation, but the manuscript provides no separate algebraic verification (e.g., direct check of the symplectic relations or computation of the order of the generated subgroup) that would rule out a proper quotient or transcription error in the matrix entries. This verification is load-bearing for the explicit-generator claim.
Authors: We agree that an independent check is desirable to rule out transcription errors or proper quotients. In the revised version we have added a new subsection (Section 4.3) that uses the accompanying Magma implementation to compute the order of the subgroup generated by the explicit matrices for small values of ℓ and odd primes r (specifically ℓ=1 with r=3,5,7 and ℓ=2 with r=3). In each case the computed order equals |Sp_{2ℓ}(r)|, confirming that the matrices generate a faithful copy of the group. The same Magma code permits analogous checks for other small parameters where the group order remains computationally tractable. While a purely algebraic verification of all defining relations for arbitrary ℓ would be lengthy and is not attempted here, the combination of the explicit construction with these order computations provides the requested independent confirmation. revision: yes
Circularity Check
Explicit construction of matrix generators with no circular reduction
full rationale
The paper frames its contribution as providing explicit matrices that generate Sp_{2ℓ}(r) inside the Weil representation on GL_{r^ℓ}(F), together with a Magma implementation. The existence and faithfulness of the underlying Weil representation are taken from standard theory in the setup section rather than derived inside the manuscript. No equations reduce a claimed prediction or generator set to a fitted parameter or self-citation by construction; the central output is a concrete list of matrices whose correctness can be checked computationally or by direct verification of the symplectic relations. This is a self-contained constructive result.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption The field F contains a primitive r-th root of unity.
Reference graph
Works this paper leans on
-
[1]
B. Bolt, T. G. Room, and G. E. Wall. On the Clifford collineation, transform and similarity groups. I, II.J. Austral. Math. Soc., 2:60–79, 80–96, 1961/62
work page 1961
- [2]
-
[3]
K. Doerk and T. Hawkes.Finite soluble groups, volume 4 ofDe Gruyter Expositions in Mathematics. Walter de Gruyter & Co., Berlin, 1992
work page 1992
-
[4]
P. G´ erardin. Weil representations associated to finite fields.J. Algebra, 46(1):54–101, 1977
work page 1977
-
[5]
S. P. Glasby and R. B. Howlett. Extraspecial towers and Weil representations.J. Algebra, 151(1):236–260, 1992
work page 1992
-
[6]
R. M. Guralnick, K. Magaard, J. Saxl, and P. H. Tiep. Cross characteristic representations of symplectic and unitary groups.J. Algebra, 257(2):291–347, 2002
work page 2002
-
[7]
D. F. Holt and C. M. Roney-Dougal. Constructing maximal subgroups of classical groups. LMS J. Comput. Math., 8:46–79, 2005
work page 2005
-
[8]
R. E. Howe. On the character of Weil’s representation.Trans. Amer. Math. Soc., 177:287–298, 1973
work page 1973
-
[9]
I. M. Isaacs. Characters of solvable and symplectic groups.Amer. J. Math., 95:594–635, 1973
work page 1973
-
[10]
Jordan.Trait´ e des substitutions et des ´ equations alg´ ebriques
C. Jordan.Trait´ e des substitutions et des ´ equations alg´ ebriques. Gauthier-Villars, Paris, 1870
-
[11]
C. Jordan. Recherches sur les groupes r´ esolubles.Memorie della Pontificia Accademia Ro- mana dei Nuovi Lincei, 26:7–39, 1908
work page 1908
-
[12]
P. Kleidman and M. Liebeck.The subgroup structure of the finite classical groups, volume 129 ofLondon Mathematical Society Lecture Note Series. Cambridge University Press, Cam- bridge, 1990
work page 1990
-
[13]
M. Korhonen.Maximal solvable subgroups of finite classical groups, volume 2346 ofLecture Notes in Mathematics. Springer, Cham, 2024
work page 2024
- [14]
-
[15]
Landau.Elementary number theory
E. Landau.Elementary number theory. Chelsea Publishing Co., New York, 1958. Translated by J. E. Goodman
work page 1958
-
[16]
R. Lidl and H. Niederreiter.Finite fields, volume 20 ofEncyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, second edition, 1997. With a foreword by P. M. Cohn
work page 1997
-
[17]
H. E. Rose.A course in number theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, second edition, 1994
work page 1994
-
[18]
I. Schur. ¨Uber die Gaußschen Summen.Nachr. Ges. Wiss. G¨ ottingen, Math.-Phys. Kl., 1921:147–153, 1921
work page 1921
- [19]
-
[20]
D. A. Suprunenko.Matrix groups. American Mathematical Society, Providence, R.I., 1976. Translated from the Russian, Translation edited by K. A. Hirsch, Translations of Mathemat- ical Monographs, Vol. 45
work page 1976
-
[21]
H. N. Ward. Representations of symplectic groups.J. Algebra, 20:182–195, 1972
work page 1972
-
[22]
A. Weil. Sur certains groupes d’op´ erateurs unitaires.Acta Math., 111:143–211, 1964. MATRIX GENERATORS FOR WEIL REPRESENTATIONS 11 M. Korhonen, Shenzhen International Center for Mathematics, Southern University of Science and Technology, Shenzhen 518055, Guangdong, P. R. China Email address:korhonen mikko@hotmail.com(Korhonen)
work page 1964
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.