This paper revisits the matrix construction of the Weil representation, providing a detailed analysis and possibly new insights into its algebraic structure and applications.
Contribution
It offers a renewed examination of the matrix approach to the Weil representation, expanding on previous foundational work from 1972.
Findings
01
Clarifies the matrix construction of the Weil representation
02
Provides new insights into algebraic properties of the representation
03
Enhances understanding of applications in algebra and number theory
Abstract
These notes contain a revisit to the matrix construction of the Weil representation by the author in the Journal of Algebra in 1972.
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 · Finite Group Theory Research · Algebraic structures and combinatorial models
Full text
Matrices for the Weil Representation
Harold N. Ward
Department of Mathematics
University of Virginia
Charlottesville, VA 22904
1 Introduction
These notes contain a revisit to the matrix construction of the Weil
representation presented in [13] and [14]. Further consequences
of that framework are presented.
2 Preliminaries and the symplectic algebra
As in [13], let q be a power of the odd prime p, and let V be a
vector space of even dimension 2n over the finite field GF(q), endowed
with a nondegenerate symplectic form φ. The corresponding
symplectic group will be denoted Sp(V). Let K be Q(e2πi/p), the field of p-th roots of unity. Denote the trace
function GF(q)→GF(p) by tr: tr(α)=α+αp+…+αq/p. Then let ψ be the
canonical additive character of GF(q) given by ψ(α)=e2πi/p×tr(α) [9, p. 190]. Finally, let f:V×V→K be the function f(x,y)=ψ(φ(x,y)).
2) f(x,y)m=f(mx,y)=f(x,my). Notice that f(αx,y)=f(x,αy)
for α∈GF(q).
3) f(y,x)=f(x,y)−1.
4) f is nondegenerate: if f(x,y)=1 for all y∈V, then x=0.
Definition 2.2
The symplectic algebra of V is the the twisted group ring A of the additive group of V over K, with the
factor set f. Thus A is a K-vector space with
basis indexed by the members of V. The basis element corresponding
to x∈V is denoted (x), and the multiplication rule is
that (x)(y)=f(x,y)(x+y).**
The following properties of A are straight-forward;
some are in [13, Proposition 1.2].
Lemma 2.3
For the algebra A we have:
1) The identity is (0).
2) If x∈V, then (x) is a unit and (x)−1=(−x).
3) If x,y∈V, then (x)−1(y)(x)=f(2y,x)(y).
4) The center of A is K(0).
5) For g∈Sp(V), the map ∑v∈Vαv(v)→∑v∈Vαv(vg) is a K-automorphism of
A. It will written as a→ag.
Proof. Only item 4 needs proof: certainly K(0) is in the center of A,
by item 1. If x∈V, then
[TABLE]
Thus ∑v∈Vαy(v) is in the center exactly when f(2v,x)αv=αv for all x and v. But if v=0, we
can choose x to make f(2v,x)=1, so that αv must be 0.
These are some general notations we shall use: as in [14], χ is
the quadratic character on GF(q), and δ=χ(−1)=(−1)(q−1)/2.
If U is a subspace of V, A(U) is the K-subalgebra
generated by the (u), u∈U. If Y is a subspace of X, then YF={x∣F(y,x)=0 for all y∈Y} and FY={x∣F(x,y)=0 for all y∈Y}. (However, we shall write Y⊥ when F=φ.) The form F is nondegenerate if XF={0}, and that is equivalent to detF=0. If F
is nondegenerate, we also have FX={0}. For A an
additive group, A∅ is the set of nonzero members of A. If
the size of a square matrix needs indicating, it is put on as a subscript.
Finally, if m is a linear transformation on a vector space X,
then Xm=Imm and Xm=ker(m−1), the fixed-point subspace of m.
Remark 2.4
Here are some facts that will be needed in the sequel:**
The trace form (α,β)→tr(αβ)
on GF(q) is nondegenerate [9, Theorem 5.7]. It follows from this
that if X is a finite-dimensional vector space over GF(q), then the
functions x→ψ(tr(l(x))), where l∈Xlin, the space of GF(q)-linear functionals on X, give the characters of
the additive group of X. The standard character summations are
[TABLE]
2. 2.
Let
[TABLE]
as in [14, Section 2]. Then ρ2=δq. Moreover, for γ=0, ∑α∈GF(q)ψ(γα2)=χ(γ)ρ. If Q is a quadratic form on X, then
[TABLE]
Here χ(Q) means χ(det(Q′)), where Q′ is
the quadratic form induced by Q on X/radQ, and we take χ(0)=1. This classical result can be proved as follows: square the sum
defining ρ to get ρ2=∑α,β∈GF(q)ψ(α2+β2). By [9, Theorem 6.26], the number of
solutions to ζ=α2+β2 is q−δ if ζ=0
and q−δ+qδ if ζ=0. Thus ρ2=(q−δ)∑ζ∈GF(q)ψ(ζ)+qδψ(0). As ψ is a
nontrivial character, the sum is 0, so that ρ2=qδψ(0)=qδ. For the second statement, ∑α∈GF(q)ψ(γα2)=∑α∈GF(q)ψ(α2) if γ
is a square. If not, ∑α∈GF(q)ψ(α2)+∑α∈GF(q)ψ(γα2)=2∑ζ∈GF(q)ψ(ζ)=0,
making ∑α∈GF(q)ψ(γα2)=−∑α∈GF(q)ψ(α2)=χ(γ)ρ. The quadratic form result
comes from taking an orthogonal basis for Q on X and using the previous
sums.
3. 3.
Continuing, let F(x)=Q(x)+l(x), where l∈Xlin. We
wish to evaluate ∑xψ(F(x)). Write X=X0+radQ for
some subspace X0 complementary to radQ, and suppose first
that l is not identically [math] on radQ. Putting x=x0+z,
with x0∈X0 and z∈radQ, we have
[TABLE]
By item 1, the second sum is [math], so that ∑xψ(F(x))=0. On the
other hand, if l is [math] on radQ, then
[TABLE]
If B is the polarization of Q, we can find y0∈X0 with l(x)=2B(x,y0) for all x. Then Q(x0)+l(x0)=Q(x0+y0)−Q(y0). Thus
[TABLE]
since dimX0=rankQ. Thus in this case
[TABLE]
These remarks imply the following:
Lemma 2.5
If X is a finite-dimensional vector space over GF(q), and F(x)=Q(x)+l(x), where Q is a quadratic form on X and l∈Xlin (that is, F is a polynomial of degree at most 2 on X,
with F(0)=0), then ∣∑xψ(F(x))∣≤∣X∣. Equality holds if and only if F is identically
0.
Corollary 2.6
If ψ(F(x))=1 for all x, then F is identically 0.
3 The symplectic group in A
In this section we produce the embedding of Sp(V) that is the
main ingredient in the treatment of the Weil representation in [13].
However, several other useful results are proved in its development. First
we recall the adjoint mapad for φ: it is an
involutory antiautomorphism m→mad of EndGF(q)(V) with the property that φ(xm,y)=φ(x,ymad) for all x,y∈V [5, Section 36.3]. The members of Sp(V) are the
invertible m for which mad=m−1.
Lemma 3.1
If m∈EndGF(q)(V), then kerm=Im(mad)⊥.
Proof. The equality follows from this sequence of equivalent statements: x∈Im(mad)⊥; φ(x,ymad)=0 for all y; φ(xm,y)=0 for all y; xm=0, from the nondegeneracy of φ; x∈kerm.
Applying this to m=g−1, g∈Sp(V), we have
Corollary 3.2
If g∈Sp(V), then Vg=(Vg−1)⊥.
Definition 3.3
Let g∈Sp(V). Following Thomas [11]
and Wall [12], we introduce the theta formΘg on Vg−1, defined by
[TABLE]
Lemma 3.4
[12, Lemma 1.1.1 and equation (1.1.3)]* The form Θg is well-defined and nondegenerate. Its skew-symmetric part is −φ/2 (on Vg−1), and its symmetric part Bg is given by Bg(xg−1,yg−1)=(φ(xg,y)+φ(yg,x))/2. The
corresponding quadratic form Qg has Qg(xg−1)=Bg(xg−1,xg−1)=φ(xg,x).*
Proof. If y1g−1=y2g−1, then y1−y2∈Vg, and φ(xg−1,y1−y2)=0, by Corollary 3.2. Thus φ(xg−1,y1)=φ(xg−1,y2), as needed to make Θg
well-defined. Then if Θg(xg−1,yg−1)=φ(xg−1,y)=0
for all x, y must be in (Vg−1)⊥ and hence be a fixed vector
of g, whereupon yg−1=0. This shows that detΘg=0
(relative to any basis of Vg−1).
The skew-symmetric part of Θg has the values
[TABLE]
But
[TABLE]
the same thing.
For the symmetric part Bg of Θg, we have
[TABLE]
Theorem 3.5
[12, Theorem 1.1.2]* Let U be a subspace
of V endowed with a nondegenerate bilinear form T whose skew-symmetric
part is −φ/2 on U. Then if B=T+φ/2 and Q(u)=B(u,u), u∈U, there is an element g∈Sp(V) for which U=Vg−1 and
Θg=T. If we start with h∈Sp(V) and take U=Vh−1
and T=Θh, then g=h. Consequently, the original g is unique.*
Proof. Let s=∑ψ(Q(u))(u) and s=∑ψ(−Q(u))(u), both
sums over u∈U. For v∈V,
[TABLE]
Put u2=z−u1 and use T(u1,z)=B(u1,z)−φ(u1,z)/2 to
get
[TABLE]
Now u→φ(u,v)−T(u,z) is a linear functional on U. So if
it is not identically 0, the inner sum (a character sum) is 0. Since T is nondegenerate, there is a unique z=z(v) making φ(u,v)−T(u,z(v))=0:
[TABLE]
The map v→z(v) is linear. Thus
[TABLE]
Moreover, T(z(v),z(v))=φ(z(v),v). That is, Q(z(v))+φ(v,z(v))=0, and Q(z(v))=φ(z(v),v). So
[TABLE]
From v=0 we get ss=∣U∣(0), so that s
is invertible and s−1=∣U∣−1s.
Consequently g:v→v+z(v) is nonsingular.
Since a→s−1as is an automorphism of A, f(v1g,v2g)=f(v1,v2) for all v1,v2.
In Lemma 2.5, let X=V⊕V and F(v1,v2)=φ(v1g,v2g)−φ(v1,v2). Then ψ(F(v1,v2)=1. By Corollary 2.6, F(v1,v2)=0,
so that φ(v1g,v2g)=φ(v1,v2), wherewith g∈Sp(V). As z(v)=vg−1,
[TABLE]
Thus Q=Qg, and so B=Bg and T=Θg. Certainly Vg−1⊆U, since z(v)∈Vg−1. But given z∈U, there is a
v with T(z,u)=φ(u,v) for all u∈U, since φ is
nonsingular. Then z=z(v), and U⊆Vg−1. So U=Vg−1.
Finally, let U=Vh−1 and T=Θh, for some h∈Sp(V). Then on the one hand, Θh(u,z(v))=φ(u,v) for all u∈U
and all v∈V, by (3.1). On the other hand, Θh(u,vh−1)=φ(u,v). Since Θh is nondegenerate, it
must be that z(v)=vh−1, so that vh=v+z(v)=vg. Thus g=h.
Corollary 3.6
*[13, Proposition 2.1] *For g∈Sp(V)
there is a unique invertible element s(g)∈A with (0)-coefficient 1, for which s(g)−1(x)s(g)=(xg) for all x∈V. One
has
[TABLE]
If g,h∈Sp(V), then
[TABLE]
for some nonzero μ(g,h) of K. (This factor is the inverse of the
“μ(g,h)” in [13].) The map g→s(g) is injective, and
[TABLE]
Proof. The existence, invertibility, and formula for s(g) follow from Theorem 3.5. If s1 and s2 are two members of A
for which s1−1(x)s1=s2−1(x)s2 for all x, then s1s2−1 commutes with all (x), so that s1=ζs2 for
some nonzero ζ∈K, by Lemma 2.3. If the (0)-coefficients of s1 and s2 are both 1, then ζ=1 and s1=s2, giving the uniqueness.
For g,h∈Sp(V),
[TABLE]
Thus again s(g)s(h) must be a scalar multiple of s(gh), and that
multiple is defined to be μ(g,h). As the (0)-coefficient of s(gh)
is 1, we can find μ(g,h) by computing the (0)-coefficient in s(g)s(h). Since f(u,v)=f(−u,−v), we may write s(h)=∑y=zh−zf(zh,z)(−y). Then the (0)-coefficient in s(g)s(h)
is ∑f(xg,x)f(zh,z), the sum over y∈Vg−1∩Vh−1 with
y=xg−x=zh−z. This coefficient is ∑y∈Vg−1∩Vh−1ψ(Qg(y)+Qh(y)). Here Qg(y)+Qh(y) is a quadratic
form on Vg−1∩Vh−1, by Lemma 3.4, so that item 2 of
Remark 2.4 implies that μ(g,h) is a power of ρ, up to
sign.
That g→s(g) is injective just follows from the fact that s(g)−1(x)s(g)=(xg), which determines g. Since s(g−1)s(g) and ss(g) are scalar multiples of (0), where s=∑\unity∈Vg−1ψ(−Qg(u)(u) from the proof of Theorem 3.5, both s(g−1) and s are scalar multiples
of s(g)−1 and so of each other. As both have (0)-coefficient 1, it
must be that s(g−1)=s. Note that
[TABLE]
Proposition 3.7
Let g∈Sp(V) be an involution, with eigenspaces
Eε={v∣vg=εv}, ε=±1. Then Qg=0 and s(g)=∑x∈E−1(x). If g∈Sp(V)
and Qg=0, then g is an involution.
Proof. We have V=E1⊕E−1, an orthogonal direct sum. For v=v1+v−1, with vε∈Eε, vg−1=2v−1=−v−1g−1. Thus Vg−1=E−1, and Qg(vg−1)=φ(2v−1,v)=0. Then s(g)=∑x∈E−1(x).
If Qg=0 for some g∈Sp(V), then Θg=−φ/2
on Vg−1, by Lemma 3.4, so that φ is nonsingular on Vg−1, since Θg is. We have both s(g)=∑x∈Vg−1(x)
and s(g−1)=∑x∈Vg−1(x), from Corollary 3.6. Thus
g=g−1 and g is an involution.
Proposition 3.8
Let hγ be the transvection v→v−γ−1φ(v,c)c. Then s(hγ)=∑ζ∈GF(q)ψ(γζ2)(ζc).**
Proof. Here vhγ−1=−γ−1φ(v,c)c, so that Vhγ−1=GF(q)c. Furthermore,
[TABLE]
Thus with vhγ−1=ζc, Qhγ(ζc)=γζ2, and s(hγ)=∑ζψ(γζ2)(ζc).
Corollary 3.9
[13, Proposition 2.2]* The centralizer C of j is the K-span of the s(g), g∈Sp(V).*
Let h,k∈Sp(V). If Vh−1∩Vk−1={0}, that is, the sum Vh−1+Vk−1 is direct,
then s(h)s(k)=s(hk) and μ(h,k)=1. Conversely, if μ(h,k)=1, then Vh−1∩Vk−1={0}. When this happens, Vhk−1=Vh−1⊕Vk−1 and dimVhk−1=dimVh−1+dimVk−1. Moreover, Θhk(Vh−1,Vk−1)=0, and with a basis for Vhk−1 adapted to the direct sum, the matrix [Θhk] for Θhk is \left[\begin{array}[]{cc}\left[\Theta_{h}\right]&0\\
\ast&\left[\Theta_{k}\right]\end{array}\right].
Proof. We have vhk−1=vh−1+vh(k−1), showing that Vhk−1⊆Vh−1+Vk−1. Suppose that Vh−1∩Vk−1={0}.
Then in writing out the product s(h)s(k), there is no collection of terms
with the same basis element (v). Thus s(hk)=s(h)s(k) and μ(h,k)=1.
Each term in s(h)s(k) appears as a product in only one way. So Vhk−1=Vh−1+Vk−1 and the sum must be direct. If x=uhk−1∈Vhk−1 and x∈Vh−1 too, then in the direct sum uh(k−1)=0 and x=uh−1. Likewise, if y=vhk−1 and y∈Vk−1, then vh−1=0,
so that v∈Vh. Thus
[TABLE]
from the φ-orthogonality of Vh−1 and Vh.
With xi=uihk−1, where uih(k−1)=0 and xi=uih−1,
we have
[TABLE]
making Θhk∣Vh−1=Θh. Similarly, with yi=vihk−1∈Vk−1, where vih−1=0 and yi=vik−1,
[TABLE]
Hence Θhk∣Vk−1=Θk. All this implies that by taking a
basis for Vhk−1 that is the union of one in Vh−1 followed by one
in Vk−1, a matrix for Θhk can be arranged as displayed.
From the proof of Corollary 3.6, the (0)-coefficient in s(h)s(k) is
[TABLE]
As observed there, Qh+Qk is a quadratic form on Vh−1∩Vk−1. If its rank is r, then r≤dim(Vh−1∩Vk−1), and the sum,
up to sign, is ρrqdim(Vh−1∩Vk−1)−r=±ρ2dim(Vh−1∩Vk−1)−r, by Remark 2.4. That must be μ(h,k), and the only way it can be 1 is that dim(Vh−1∩Vk−1)=0.
Corollary 3.11
Suppose that g∈Sp(V) and that Vg−1=X⊕Y, both terms nonzero. Suppose also that Θg(X,Y)=0, so that Θg∣X and Θg∣Y are
nondegenerate. Let h,k∈Sp(V) with X=Vh−1,Y=Vk−1, and Θg∣X=Θh,Θg∣Y=Θk, following Theorem 3.5. Then g=hk.
Proof. We have s(h)=∑x∈Xψ(Qh(x))(x) and s(k)=∑y∈Yψ(Qk(y))(y). Thus
[TABLE]
The argument of ψ here is
[TABLE]
and since Θg=Bg−φ/2, it is Qg(x+y)−2Θg(x,y)=Qg(x+y). Thus s(h)s(k)=∑x∈X,y∈Yψ(Qg(x+y))=s(g). Since s(h)s(k)=s(hk), from Vh−1∩Vk−1={0}, g=hk.
Remark 3.12
*By the arguments for s(g) we have been
using, if g=g1⋯gr and dimVg−1=∑i=1rdimVgi−1, then s(g)=s(g1)⋯s(gr) and Vg−1=Vg1−1⊕⋯⊕Vgr−1. Moreover, [Θg] *is lower
block-triangular, with [Θg1],…,[Θgr]on the diagonal.
4 A as a matrix ring
For any commutative ring S we let Mm(S) be the m×m
matrix ring over S. The goal of this section is to show that the
symplectic algebra A is isomorphic to Mqn(K).
We prove this by creating a set of matrix units that will be of use later
on. The flow of the argument is quite standard.
Let W and W∗ be two maximal isotropic (Lagrangian)
subspaces of V that are complementary, so that V=W⊕W∗, an
internal direct sum. Then φ is identically [math] on both W and W∗, and φ sets up a nondegenerate pairing between W and W∗. The subalgebras A(W) and A(W∗)
are simply the group algebras for the two subspaces as additive groups.
Moreover, the characters of the additive group of W are produced by the
maps w→f(w,a), a∈W∗. Set e0=q−n∑w∈W(w). If x∈V, then
[TABLE]
As w→f(w,x) is a character of W, ∑w∈Wf(w,x)=qn
if x∈W, and ∑w∈Wf(w,x)=0 otherwise. Thus
[TABLE]
Now let eab=(−a)e0(b), where a,b∈W∗ (we may separate the
two subscripts by a comma when more complicated expressions appear). Then eabecd=(−a)e0(b−c)e0(d), and by (4.1), this is 0 if b=c, and ead if b=c. Thus the eab multiply like matrix
units. As customary, put ea=eaa, so that e0 retains its
original meaning. These ea are orthogonal idempotents in A(W). By item 3 of Lemma 2.3, ea=q−n∑w∈Wf(w,2a)(w). Then
[TABLE]
The inner sum is 0 if w=0, and qn if w=0. So ∑a∈W∗ea=(0). Furthermore,
[TABLE]
Thus
[TABLE]
Hence ea(x)eb∈Keab for all x, so that eaAeb=Keab. Then for a∈A,
[TABLE]
with the αab∈K. As the number of the eab is q2n,
which is dimKA, the eab form a K-basis of A. Thus we have
Theorem 4.1
The algebra A is indeed isomorphic to Mqn(K).
We identify A with Mqn(K) by this
isomorphism, that is, by means of the matrix units eab. If we wish to
emphasize that we are regarding a∈A as a matrix,
we shall write [a].
Remark 4.2
*The trace of the map b→ab *is qntra, with a,b∈A. If x=0, b→(x)b has trace [math], so that tr[(x)]=0. Thus
[TABLE]
Remark 4.3
Suppose that M is a matrix algebra over
a field and that Mhas two sets of matrix units, the eaband the eab′, indexed by the same finite
set. Then by [8, Theorem 3, p. 59], there is an invertible u in M with eab′=u−1eabu, for all a,b. It follows that traces and determinants of members of M
computed from the two sets of units are the same.
5 The Weil representation
Continue now with the set-up and notation of Section 4.
We have s(−1)=∑v∈V(v), by Proposition 3.7. As in [13], we set j=q−ns(−1), an involution. To determine [j], observe that
[TABLE]
Once again, the inner sum is 0 if u∈/W and qn if u∈W. So
[TABLE]
Thus
[TABLE]
This last is 0 unless b=−a, when it is just ea,−a.
Partition W∗ as P∪−P∪{0} in some way, and on ordering P, order −P so that −a<−b in −P when a<b in P. Then label rows
and columns with the members of W∗ following that arrangement. This
makes
[TABLE]
where I is the identity matrix of size (qn−1)/2 and the various 0s
have appropriately matching sizes. Direct computations give the following
result:
Proposition 5.1
Let C be the centralizer of j in A. Then the members of C are the matrices of the form
[TABLE]
the blocks matching those of [j]. The map given by
[TABLE]
provides an isomorphism of C with the direct sum M(qn−1)/2(K)⊕M(qn+1)/2(K).
The representation g→s(g) is a projective representation of Sp(V), with factor set μ. A key result in any development of
the Weil representation is that it is equivalent to an ordinary
representation. Thus we seek a function η:Sp(V)→K
such that with t(g)=η(g)s(g), the representation g→t(g)
is ordinary; that is, μ(g,h)=η(gh)η(g)−1η(h)−1, μ
as in (3.3). Now
[TABLE]
Let ♭ be the homomorphism
[TABLE]
of C onto M(qn−1)/2(K), as inferred from
Proposition 5.1. Then
[TABLE]
Consequently:
Lemma 5.2
If we define
[TABLE]
we have the needed equation μ(g,h)=η(gh)η(g)−1η(h)−1.
Remark 5.3
The comments in Remark 4.3 show that
η is well-defined: it does not depend on the choices made in
obtaining the matrix realization of A. In fact, if we also have μ(g,h)=η′(gh)η′(g)−1η′(h)−1, then η′η−1 is a homomorphism of Sp(V) to C∅. As Sp(V)′=Sp(V) except when n=1 and q (odd) is 3, η′=η with that one exception.**
For example, j♭=−I(qn−1)/2, so that det(j♭)=(−1)(qn−1)/2=det(j). Then
[TABLE]
Since (qn−1)/2≡n(q−1)/2(mod2), (−1)(qn−1)/2=(−1)n(q−1)/2=δn. As s(−1)=qnj, we get
[TABLE]
Consequently,
[TABLE]
Definition 5.4
The representation W of Sp(V) given by g→t(g), with degree qn, is
the Weil representation. By Proposition 5.1, W has the two constituents W−:g→t(g)♭ and W+:g→t(g)♯, of degrees (qn−1)/2 and (qn+1)/2,
respectively. Since C is spanned by the t(g), from
Corollary 3.9, both of these representations are irreducible.
We denote the characters of these three representations by ω,
ω−, and ω+, so that ω=ω−+ω+.**
6 The Weil character
Before examining the Weil character in detail, we record this implication of
the matrix picture above:
Proposition 6.1
For the Weil characters,
[TABLE]
Thus
[TABLE]
Proof. If t(g)=\left[\begin{array}[]{ccc}A&B&\mathbf{b}\\
B&A&\mathbf{b}\\
\mathbf{a}&\mathbf{a}&\alpha\end{array}\right], then t(g)♭=A−B and
[TABLE]
Thus
[TABLE]
To begin with, from t(g)=η(g)s(g) and trs(g)=qn, we have
for the Weil character ω,
[TABLE]
For example,
[TABLE]
To obtain formulas for ω, we start with any g∈Sp(V)
for which Wg=W. Let g∗ be the map induced by g on W∗: if a∈W∗, W+ag∗=W+ag. For [s(g)], we have e0g=e0, so e0s(g)ea=s(g)e0ea=0 unless a=0;
similarly eas(g)e0=0 if a=0. Thus
We have eag=(−ag)e0(ag). But ag=w+ag∗ for
some w∈W, so
[TABLE]
Therefore
[TABLE]
Thus with [s(g)]=[αab],
[TABLE]
This can be nonzero only when b=ag∗. Therefore [s(g)] is
monomial, and it follows that both A+B and A−B are monomial. Moreover, det(A+B)=(−1)βdet(A−B), where β is the number of nonzero
entries in B. This is the number of members a of P for which ag∗∈−P. The sign (−1)β is evaluated in the next
lemma.
Lemma 6.2
Let Z be a vector space of dimension n>0 over GF(q), q odd. Partition Z into P∪−P∪{0}, as above. Let σ(g)=(−1)∣Pg∩(−P)∣ for g a nonsingular
linear transformation on Z. Then
[TABLE]
Proof. Index qn−1 independent variables Xz by the nonzero members of Z,
and in the Z-ring of polynomials R in the Xz, let π=z∈P∏(Xz−X−z). Let g act on R by Xz⟶Xzg. Then πg=σ(g)π, and it
follows that g⟶σ(g) is a homomorphism from GL(Z) to
⟨−1⟩. If σ is nontrivial, then it must be
that σ(g)=χ(detg), since GL(Z)/GL(Z)′ is cyclic of
order q−1 [1, Theorem 4.7].
For the nontriviality of σ, observe first that if P′∪−P′∪{0} is a second partition of Z and π′
the corresponding product, then π′=επ for some
sign, ε. It follows that π′g=σ(g)π′, so that σ(g) does not depend on the partition used. Now
realize Z as GF(qn) and let α be a primitive element. Let P={1,α,…,α(qn−3)/2}; α(qn−1)/2=−1. Then g:z⟶αz has ∣Pg∩(−P)∣=1, σ(g)=−1, and σ is indeed
nontrivial. By way of corroboration, this g has determinant α+αq+…+αqn−1=α(qn−1)/(q−1) (the norm
of α), a primitive element of GF(q). Thus χ(α(qn−1)/(q−1))=−1=σ(g).
Now the matrix \left[\begin{array}[]{ccc}A&B&0\\
B&A&0\\
0&0&\alpha\end{array}\right] is equivalent to \left[\begin{array}[]{ccc}A-B&B-A&0\\
0&A+B&0\\
0&0&\alpha\end{array}\right], with no scalings involved. Thus
[TABLE]
by the lemma. From η(g)=(dets(g)♭)2(dets(g))−1
(equation (5.2)) and dets(g)♭=det(A−B), we conclude:
Theorem 6.3
If g∈Sp(V) and Wg=W, then
[TABLE]
Corollary 6.4
Suppose that g∈Sp(V) is an involution.
Let Eε be the eigenspace of g for eigenvalue ε
and let dimE−1=2m. Then η(g)=δmq−m and ω(g)=δmqn−m.
Proof. As in Proposition 3.7, φ is nonsingular on E−1, so
that dimE−1 is indeed even. From Remark 4.2 we can tailor
the choice of W and W∗ to g. Thus we set up W and W∗
by taking decompositions Eε=Wε⊕Wε∗, with W=W1⊕W−1, W∗=W1∗⊕W−1∗. Here dimW−1=dimW−1∗=m, and dimW1=dimW1∗=n−m. We have Vg−1=E−1, and
Qg=0. Thus in [s(g)], α=W∩Vg−1=∣W−1∣=qm. On W∗, a→ag∗ has fixed point space W1∗ and so (qn−qn−m)/2=qn−m(qm−1)/2 two-cycles. Hence the sign of πg is (−1)(qm−1)/2. As noted before, this is δm. Thus
η(g)=δmq−m. Once again, we get η(−1)=δnq−n.
Corollary 6.5
For such an involution g,
[TABLE]
Proof. Here −g is also an involution with dimE−1=2n−2m, and Proposition 6.1 applies.
Corollary 6.6
Let h be the transvection v→v−γ−1φ(v,c)c, where γ=0 and c=0. Then η(h)=ρ−1χ(γ) and ω(h)=qnρ−1χ(γ).
Proof. Now choose W so that c∈W. From Proposition 3.8,
[TABLE]
By Remark 2.4, this is χ(γ)ρ. On W∗, h∗ is the identity. Thus η(h)=ρ−1χ(γ).
With these results in hand, we can now prove a version of the formula in
[11, Remark 1.3].
Theorem 6.7
Let g∈Sp(V) with theta form Θg. Then
[TABLE]
Proof. Recall that χ(Θg) means χ(detΘg), detΘg computed relative to any basis. The two examples we have so far
corroborate the formula: for an involution g, Vg−1=V−1, and with dimV−1=2m, Corollary 6.4 gives η(g)=δmq−m. As we saw in Proposition 3.7, Qg=0 and Θg=−φ/2, making detΘg=(−1/2)2m and χ(Θg)=1. Moreover, q=δρ2 makes η(g)=δmδmρ−2m=ρ−r, as asserted. Similarly, for h the
transvection h:v→v−γ−1φ(v,c)c, Vh−1=GF(q)c, and Θh(ξc,ζc)=ξζγ, with detΘh=γ, all by Proposition 3.8. From Corollary 6.6, η(h)=ρ−1χ(γ), again in agreement.
We can thus induct on dimVg−1. Suppose that Vh−1∩Vk−1={0} for h,k∈Sp(V), neither h nor k
the identity. Then Proposition 3.10 implies that detΘhk=detΘhdetΘk. Because μ(h,k)=1, it follows
that η(hk)=η(h)η(k), and by induction,
[TABLE]
But dimVhk−1=dimVh−1+dimVk−1, as shown in the proof of
Proposition 3.10, and then η(hk)=ρ−dimVhk−1χ(Θhk) indeed.
To obtain such a factoring, we may assume that a given g is neither an
involution nor a transvection, for both of which the formula is already
correct. Thus the quadratic form Qg on Vg−1 is not identically 0,
by Proposition 3.7. Take c∈Vg−1 with Qg(c)=0. Put
X=⟨c⟩ and Y=⟨c⟩Θg; Y={0)}. Corollary 3.11 applies,
since Qg(c)=0 implies that X∩Y={0)}. Then g=hk, where X=Vh−1 and Y=Vk−1, and neither h nor k is 1. The
product result (6.6) now gives the asserted formula for g.
7 Computations
7.1 Scaling
Let ν be a nonsquare in GF(q) and let φ′=νφ. Construct the algebra A′ with the procedure used for
A but with φ′ in place of φ. Label
corresponding ingredients for A′ with the dash. The
symplectic group for φ′ is the same as that for φ. But the form in Definition 3.3 changes to Θg′=νΘg. Then χ(Θg′)=(−1)dimVg−1χ(Θg), and
[TABLE]
from Theorem 6.7. That is, η′ comes from η by changing ρ to −ρ. The same holds for ω′ from ω. As pointed out when this scaling is discussed in [14, Section 3], −ρ may not be an algebraic conjugate of ρ.
7.2 Permuting V
Proposition 7.1
(compare [4, Theorem 4.4(c)]) The homomorphism g→t(g−1)T⊗t(g)∈Mq2n(K) is the
permutation representation of Sp(V) on V. Consequently ω(g−1)ω(g)=∣Vg∣.
Proof. This is immediate from the fact that t(g−1)(v)t(g)=(vg) for v∈V.
This leads to a corroboration of Theorem 6.7: we have
[TABLE]
and
[TABLE]
Now vg−1=−vg(g−1−1) implies that Vg−1=Vg−1−1. If u,v∈Vg−1 and v=yg−1=(−yg)g−1−1, then Θg(u,v)=φ(u,y) and Θg−1(u,v)=−φ(u,yg).
Thus Θg−1(u,v)=−Θg(u,vg). Hence detΘg−1=(−1)dimVg−1det(g∣Vg−1)detΘg. But since vg≡v(modVg−1) and detg=1, we have det(g∣Vg−1)=1.
So detΘg−1=(−1)dimVg−1detΘg. Then
[TABLE]
Therefore
[TABLE]
as Vg=(Vg−1)⊥.
7.3 Embedding
From the “internal” formula for η in Theorem 6.7, we can prove the following: let V=U⊕U′, with U′=U⊥; φ is nondegenerate on
U and U′. Then Sp(U)×Sp(U′) embeds into Sp(V): if g∈Sp(U) and g′∈Sp(U′), then (u+u′)g×g′=ug+(u′)g′, where u∈U and u′∈U′. We have Vg×g′−1=Ug−1⊕(U′)g′−1. and Θg×g′(u1+u1′,u2+u2′)=(ΘU)g(u1,u2)(ΘU′)g′(u1′,u2′), the Θs on the
right taken for U and U′. Then from the formula, η(g×g′)=ηU(g)ηU′(g′) and ω(g×g′)=ωU(g)ωU′(g′).
7.4 Eigenvalue restrictions and semisimplicity
Proposition 7.2
If no eigenvalue of g is 1, that is, g−1 is
invertible, then
[TABLE]
Proof. For such a g, Vg−1=V. With y2=x2g−1, we have Θg(y1,y2)=φ(y1,y2(g−1)−1). In matrix terms, Θg(y1,y2)=y1Φ(y2(g−1)−1)T=y1Φ(g−1)−Ty2T, Φ being the matrix for φ. Thus detΘg=det(Φ(g−1)−T)=detΦdet(g−1)−1. But relative
to a symplectic basis, detΦ=1. Hence χ(Θg)=χ(det(g−1)). So
[TABLE]
from which the stated formula follows. Once again, η(−1)=δnq−n, because χ(det(−2I2n))=χ(−2)2n=1.
Corollary 7.3
Let h be the usual transvection v→v−γ−1φ(v,c)c, where γ=0 and c=0. Then
[TABLE]
Proof. All eigenvalues of h are 1, so those of −h are −1. Thus det(−h−1)=(−1)2n=1, and ω(−h)=δn. The formula follows from
Propositions 6.1 and 7.2.
Corollary 7.4
If g∈Sp(V) is semisimple, then ω(g)=ω′(g).
Proof. Here ω′ is the Weil character for A′
from Subsection 7.1, and the restriction on g means that g
is diagonalizable in some extension of GF(q). If E is the eigenspace of g for eigenvalue 1, then the semisimplicity implies that φ is
nonsingular on E and g∣E is the identity. With the decomposition V=E⊕E⊥, the results in Subsection 7.3 apply, g
being identified with (g∣E)×(g∣E⊥). For g∣E⊥,
Proposition 7.2 gives ωE⊥(g∣E⊥)=δn−mχ(det(g∣E⊥−1)), where dimE=2m. As ωE(g∣E)=qm, we get ω(g)=qmδn−mχ(det(g∣E⊥−1)). There being no ρ here, we also have the same
formula for ω′(g), and ω′(g)=ω(g).
7.5 Constructions
One way to set up V and φ is to take V=GF(q2n) and to let
φ(x,y)=tr(εxyqn), where the trace is from
GF(q2n) to GF(q) and εqn=−ε. We have
[TABLE]
as needed, and the nondegeneracy of φ follows from the
nondegeneracy of the trace form itself. If z∈V and zqn+1=1,
then the multiplication g:x→zx is a member of Sp(V). With z=1, Proposition 7.2 applies. As in Lemma 6.2, the determinant of x→ax is the norm a(q2n−1)/(q−1) of a. Moreover, χ(α)=α(q−1)/2 for α∈GF(q). Thus
[TABLE]
(Once again, we use (−1)(qn−1)/2=δn.) Now z→z(qn+1)/2 is the “quadratic
character” χZ on the cyclic subgroup Z of
order qn+1 in GF(q2n)∅: χZ(z)=1 if z is
a square in Z, −1 if not. So χ(det(g−1))=−δnχZ(z), and ω(g)=δnχ(det(g−1))=−χZ(z).
If z=−1, we can apply this to g′=−g and get
[TABLE]
So ω(−g)=δnχZ(z). If g (and z) has order o(g), then χZ(z)=(−1)(qn+1)/o(g). Thus for z=±1,
A second construction for V and φ takes V=GF(qn)⊕GF(qn), with φ((x,y),(x′,y′))=tr(xy′−yx′), the trace now from GF(qn) to GF(q).
This time the map g:(x,y)→(zx,z−1y), for z∈GF(qn)∅, is in Sp(V). Taking z=1, we have
[TABLE]
Then
[TABLE]
with χZ now the quadratic character on GF(qn). Thus ω(g)=δnχ(det(g−1))=χZ(z). Similarly, if z=−1 and
g′=−g, χ(det(g′−1))=δnχZ(−z)=χZ(z), and ω(−g)=δnχZ(z). So this time, if z=±1, ω−(g)=χZ(z)(1−δn×δn)/2=0.
7.6 Some characters of SL(2,q)
With the various character values in hand, we can write out the part of the
character table for Sp(2,q)(≃SL(2,q)) that
involves ω,ω−, and ω+(see the table in [3, Section 38], for example, based on work of I. Schur). Let \left[\begin{array}[]{cc}0&1\\
-1&0\end{array}\right] be the matrix for φ. The transvection h:v→v−γ−1φ(v,(0,1))(0,1) we have been using has matrix \left[\begin{array}[]{cc}1&-\gamma^{-1}\\
0&1\end{array}\right]. From Corollary 6.6, ω(h)=δρχ(γ), and by 7.3, ω(−h)=δ.
[TABLE]
Using A′ from Subsection 7.1, we can add
two more irreducible characters ω−′ and ω+′ to this table, with the same rows as for ω− and ω+ but with −ρ in place of ρ.
8 Factorizations
The embedding of Sp(V) into A can be used to study
factorizations of group elements. The best known is the fact that every
member of Sp(V) is a product of transvections. Initially one
shows that the transvections generate Sp(V) without paying
attention to how many transvections are needed in a product for a given
group member [10, Theorem 8.5]. That number was examined by Dieudonné
[2], and we shall deal with it in this section.
Theorem 8.1
[2, Theorem 2]* If g∈Sp(V) and g is not an involution, then g is the product of dimVg−1
transvections. If g is an involution, then g is the product of dimVg−1+1 transvections. As usual, 1 is declared to be an empty product.*
Proof. If g=g1⋯gr with transvections gi, then Vg−1⊆Vg1−1+⋯+Vgr−1. Since dimVgi−1=1, by Proposition 3.8, dimVg−1≤r; so there must be at least dimVg−1 transvections in the product. Suppose that g is not an
involution. Then Qg is not identically 0, by Proposition 3.7.
When dimVg−1=1, g is already a transvection. Thus we can assume
that dimVg−1>1. If there is c∈Vg−1 for which Qg(c)=γ=0 and for which Qg is not identically 0 on Y=⟨c⟩Θg, then with X=GF(q)c in Corollary 3.11, g=hk, where h is the transvection v→v−γ−1φ(v,c)c and Y=Vk−1. Here k is also not an involution
since Qk=Qg∣Y is not identically 0. Induction then implies that k
is the product of dimY=dimVg−1−1 transvections, making g the
product of dimVg−1 transvections.
For the needed c, note that the map ⟨c⟩→⟨c⟩Θg is one-to-one
between lines and hyperplanes of Vg−1, because Θg is
nondegenerate. Suppose that there were three different hyperplanes in Vg−1 that are totally singular for Qg. Then the intersection of any
two of them must be the radical, radQg, of Qg. The
induced quadratic form on the two-dimensional space Vg−1/radQg would then have at least three singular lines. However, nonsingular
planes have either none or two [10, pp. 138–139]. Thus in general, Vg−1 has at most two Qg-totally singular hyperplanes. But since dimVg−1>1, there are at least three lines ⟨c⟩ with Qg(c)=0, as is easy to see. Therefore we can find the
required c with Qg(c)=0 and Qg not identically 0 on ⟨c⟩Θg.
Now let g be an involution, with dimVg−1=2l. It cannot be that g=g1⋯g2l for transvections gi. For if so, it must be that Vg−1=Vg1−1⊕⋯⊕Vg2l−1, by the dimensions. If
we set h=g1 and k=g2⋯g2l in Remark 3.12, then Θg∣Vg1−1=Θg1. But the left is 0, since Qg=0
and Θg=−φ/2 on Vg−1. Yet the right is not 0, by
Proposition 3.8. Thus a transvection product for g must have
more than 2l factors.
If c∈Vg−1, c=0, then cg=−c. Let h be the transvection v→. Then gh=hg: for the successive images of v by gh are v→vg→vg−αφ(vg,c)c; and by hg
are v→v−αφ(v,c)c→vg+αφ(v,c)c. But this last is indeed vg+αφ(vg,cg)c=vg−αφ(vg,c)c. Thus (gh−1)2=h−2
and gh−1 is not an involution. So it is a product g1⋯gr
of transvections, withr≤dimVg−1, since Vgh−1⊆Vg−1. Then g=hg1⋯gr, and now it must be that r=dimVg−1=2l.
Notice the freedom of choice for h.
Bibliography14
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] E. Artin, Geometric Algebra , Interscience Publishers, New York, 1957.
2[2] J. Dieudonné, Sur les générateurs des groupes classiques, Summa Brasil. Math. 3 (1955), 149–179.
3[3] L. Dornhoff, Group Representation Theory, Part A , Dekker, New York, 1971.
4[4] P. Gérardin, Weil representations associated to finite fields, J. Algebra 46 (1977), 54–101.
5[5] R. Godement, Algebra , Hermann, Paris; Houghton Mifflin, Boston,1968.
6[6] J. W. P. Hirschfeld, Projective Geometries over Finite Fields (2nd. edn.), Oxford Univ. Press, Oxford, 1998.
7[7] F. Knüppel, Factorization into symmetries and transvections of given conjugacy classes, Canad. Math. Bull. 35 (1992), no. 3, 400–409.
8[8] N. Jacobson, Structure of Rings , Colloquium Publications 37 , Amer. Math. Soc., Providence, 1956.