Chapter 5
Projective Character Tables To know the rules is not the same as to know how to play the game. As in chess or tennis, so it is in projective character theory. How should one construct projective character tables of individual families of groups? How should one reveal their special behaviour, which is invisible in the general situation? The answer lies in the painstaking analysis of these groups combined with a knack for the art of computation. This art of computation, together with many ideas of great importance, was vividly demonstrated by Schur in his two monumental papers (Schur (1907), (1911)). It is Schur's profound discoveries which will constitute the major part of this chapter. In selecting or rejecting material for this chapter, we have held steadfast to a single-minded purpose: to present only those results which can be easily proved by a direct approach, without using any sophisticated technique to be employed in future chapters. Thus a reader who gained a feeling for the subject from this direct approach will be fully prepared to handle a more intricate method. The chapter begins with some general background concerning projective character tables. Special attention is drawn to spin characters of double covers. The importance of spin characters stems from the fact that if G" is a covering group of G with IG"I = 2lGI, then all projective character tables of G are determined by the character table of G and the spin character table of G". Some important examples of such groups G include G = Sn, n ;::: 4, G = An, n ;::: 4, n 16,7, G = PSL 2(q), q is an odd prime power, q 19. The bulk of the chapter consists in the treatment of such classical groups as S,H An, SL 2(q) and PSL2(q). The theory of spin characters of Sn and An is a subject in itself and our treatment below is mostly of an introductory 201
Projective Character Tables
202
nature. It is designed to give the reader some flavour of the subject. The corresponding theory for SL2(q) and PSL 2(q) is much easier to handle and is presented in full generality. The chapter concludes with the investigation of whether projective character tables of a group G determine G up to isomorphism. It is shown that there exist two nonisomorphic groups of order 32 with the same projective character tables. Thus, as in the ordinary case, projective character tables do not determine the isomorphism class of the underlying group.
1
Introduction
In what follows, G denotes a finite group and a an element of Z2(G,C*). All characters below are assumed to be C-characters. We wish to introduce the notion of an a-character table of G. The case where a = 1 will correspond to the notion of the ordinary character table which was examined in detail in VoLl. To motivate the definition, we first recall the following piece of information. Assume that X is an a-character of G. Although X need not be a class function, the values of X on the elements of any given conjugacy class C of G are determined by the values on any fixed representative of C. Indeed, by Proposition 1.6.2(i),
Thus, if a is known, then X is completely determined by the values
where gl,'" ,gr is a complete system of representatives of the conjugacy classes of G. In fact, we can say more. Namely, by Proposition 1.6.2(ii), X vanishes on all elements of G which are not a-regular. Thus, to determine X, we need only choose as gl, ... , gr a complete system of representatives of the a-regular conjugacy classes of G. This brings us to the notion of an a-character table. Let 91, ... ,9r be a complete system of representatives of the a-regular conjugacy classes of G. We know, from Theorem 1.3.6, that G has precisely 'T' distinct irreducible a-characters, say Xl, ... ,Xr' The r X r complex matrix
(2)
1 Introduction
203
is called an a-character table of G. Thus an a-character table of G depends upon: (i) The choice of the representatives of the a-regular conjugacy classes of G (in contrast to the ordinary character table). (ii) The ordering of a complete system of representatives of the a-regular conjugacy classes of G. (iii) The ordering of the irreducible a-characters of G. Hence, for any fixed choice of the representatives of the a-regular conjugacy classes of G, any a-character table of G can be transformed into any other by a permutation of the rows and columns. We know, from Theorem 1.3.1, that the irreducible a-characters Xl,· .. ,Xr of G are linearly independent as functions from G to C. Since these characters vanish on all elements of G which are not a-regular, Xb"" Xr are linearly independent as functions from Go to C, where Go denotes the set of all a-regular elements of G. Applying (1), it is now immediate that the a-character table C of G given by (2), is a nonsingular matrix. By a projective character table of G, we understand an a-character table of G for a suitable a E Z2(G, C*). We say that a projective character table C of G is isomorphic (or, by abuse of language, is equal) to a projective character table D of another group H, if C and D coincide upon a suitable permutation of rows and columns of D. Now assume that f3 E Z2(G,C*) is cohomologous to a E Z2(G,C*). Then, by Lemma 1.2.5, a ,B-character table of G can be immediately constructed from the knowledge of an a-character table of G. Thus, if we wish to construct all projective character tables of G, it suffices to select a set of cocycles al, . . . ,an E Z2(G, C*) whose cohomology classes exhaust all distinct elements of the group H 2 ( G, C*) and then to construct an ai-character table of G for each individual choice of i E {1, ... , n}. This freedom of choice of representatives of various cohomology classes enables us to concentrate on a-character tables for which the corresponding a-characters are class functions (and hence, for which an a-character table is no longer dependent on the choice of the representatives of the a-regular conjugacy classes). Indeed, by Lemma 1.6.1, any cocycle a E Z2(G, C*) is cohomologous to a normal cocycle. Moreover, by Proposition 1.6.2(iii), if a is normal, then any a-character of G is a class function. But we can do even better by choosing a more distinguished cocycle a, which is both normal and of finite order (see Lemma 1.11.15). By Lemma 1.11.11, such a choice of a ensures that the contragredient x* of any given
Projective Character Tables
204
a-character X of G is equal to the conjugate X of X defined by
X(9)=X(9)
for all
9EG
Thus, by Theorem 1.3.7, if Xl, ... ,Xr are all distinct irreducible a-characters of G, then Xl, ... ,Xr are all distinct irreducible a-l-characters of G. Therefore the a-character table and a-l-character table of G determine each other. Another advantage of choosing a normal cocycle a of finite order in any given cohomology class is that the orthogonality relations for irreducible a-characters are strikingly similar to their ordinary counterparts. Indeed, if Go denotes the set of all a-regular elements of G and Xl, ... ,Xr are all irreducible a-characters of G, then IG\-l
L
Xi(X )xj(x) = Dij
(Theorem 1.11.16)
(3)
xEGo
Moreover, if 91, ... ,gr is a complete system of representatives of the a-regular conjugacy classes of G, then r
L ~O,(gdXk(gj) = ICG(gdlDij
(Proposition 1.11.20)
(4)
k=l
Hence, as in the ordinary case, (3) can be used to find some missing entries in the a-character table, while (4) implies that for any a-regular 9 E G, \CG(g)! can be computed from the knowledge of an a-character table of G. An alert reader have probably noticed that all our previous discussions relied heavily on the knowledge of a E Z2( C, C*). In practice, however, an explicit formula for a may not be available. Fortunately enough, there is another device which uses special cocycles and relies exclusively on the knowledge of ordinary characters of a covering group. A detailed information on how this mechanism works is provided by Theorem 1.2. A subset S of a group G is said to be invariant if g-lSg = S for all 9 E G. It is clear that invariant subsets are precisely the conjugacy classes of G and their arbitrary unions. Assume that we are given an exact sequence of finite groups: 1 --+ A
--+
G*
.L G --+
1
Then, for any conjugacy classes C of G and any x E G
(5)
1 Introduction
205
which shows that f-1(C) is an invariant subset of G*. Thus f-1(C) is a union of conjugacy classes of G*. We say that C splits in G* if f- 1 (C) is a union of at least two conjugacy classes of G. Note that if iLll = 2, then C splits in G* if and only if r:' (C) is a union of precisely two conjugacy classes of G*, each of the same size as C. In practice the group Gin (5) is often identified with G*/A and f with the natural homomorphism. The following result contains some general information required for future use.
Theorem 1.1. Let 1 -+ A -+ G* 1. G -+ 1 be a finite central group extension and let Jl : G -+ G* be a fixed section of f. For any given X E Hom(A,C*), let 0' = ax E Z2(G,C*) be defined by O'(x,y)
= X(J-L(x)J-L(Y)Jl(xyr 1 )
for all
x,y E G
Then the Jollowing properties hold: (i) If Ai, ... , A; are all distinct irreducible C-charocters of G* whose restriction to A has X as an irreducible constituent and if Ai : G -+ C is defined by for all g E G then AI,"" Ar are all distinct irreducible a-characters of G. Moreover, if J-L is a conjugacy-preserving section, then each Ai is a class function. (ii) An element g EGis a-regular if and only if Ai(J-L(g)) i= 0 for some iE{l,oo.,r}. (iii) If g EGis a-regular, then r
L
IAi(J-L(g)W = ICo(g)1
i=l
(iv) If a conjugacy class C of G is nonsplit in G*, and X i= 1 then C is not a-reqular. (v) If IAI = 2 and X i= 1, then a conjugacy class C oj G is a-regular if and only if C splits in G*. Proof. (i) The first assertion is a special case of Corollary 4.1.3, while the second follows from Lemma 4.1.2(ii). (ii) Apply (i) and Proposition 1.6.3(ii).
Projective Character Tables
206
(iii) By definition, the values of a are roots of unity. Hence, by (i) and by Proposition 1.11.20, r
r
L IA;(p(g))12
=
L
=
ICo(g)l,
2 I Ai(9)1
i=1
i=1
as desired. (iv) Assume that a conjugacy class C of G is nonsplit in G* and let 9 E C. Suppose that X ::j:. 1, so that x(a) i- 1 for some a E A. Since ap(g), p(g) E 1-1 ( C), it follows that ap(g) and p(g) are conjugate in G*. Hence
(1 ::; i ::; r) Since X( a)
i- 1, we deduce therefore that for all
i E {1, ... , r}
Therefore, by (ii), C is not a-regular. (v) Assume that IAI = 2 and X ::j:. 1. Let C be a conjugacy class of G. If G is a-regular, then by (iv), G is split in G*. Conversely, assume that C is split in G* and let 9 E G. Let 11, ... - t: be all irreducible C-characters of G* which contain A in their kernel. Since IAI = 2, we see that A~ , ...
, A;, 11, ... -u
are all irreducible C-characters of G. Assume by way of contradiction that 9 is not a-regular. Then r
IGoo(p(g))1
L
=
t
I Ai (/l (g))!2 +
i=1
L
IIj(p(g))1
2
j=I
t
=
L
IIj(/l(g)W
(by (ii))
j=I
=
ICa(g)1
where the last equality follows from the fact that 11, ... - n can be regarded as all irreducible C-characters of G*/ A ~ G. Hence, if C' is the conjugacy class of G* with /l(g) E G', then G' ~ l- I (G ) and
,
21GI
IG I = /Go(g)1 =
21C1
1 Introduction
207
a contradiction. • The following result is the main tool for constructing an a-character table of G from the ordinary character table of a suitable central extension G* of G. By taking G* to be a covering group of G and by repeating the same procedure for all X E H om(A, C*), we then obtain all projective character tables of G (see Lemma 1.2.5 and Corollary 4.1.7). Let 1 ~ A ~ G* L G ~ 1 be a finite central group extension, let X E H om( A, C*) and let Ai, ... , A; be all distinct irreducible C-chamcters of G* whose restriction to A has X as an irreducible constituent. Choose conjugacy classes Ci, ... ,c; of G* such that C1 = f( Cn, ... .C, = f( Cn are all distinct conjugacy classes of G. Then (i) There exist precisely I' conjugacy classes C E {Ci, ... , for which Ai(C) i- 0 for some i E {l, ... ,r}, say Ci, ... ,C; (upon renumbering the if necessary). (ii) Let J1 : G ~ G* be any section of f with Il( Cj) ~ CJ, 1 :s; j :s; t, and let a E Z2( G, C*) be defined by
Theorem 1.2.
cn
c;
a(x,y) = X(Il(x)ll(y)ll(xyt 1)
for all
x,y E G
Then C 1, ... , C; are all distinct a-regular conjugacy classes of G. Moreover, if A ~ [G*, G*], then the order of X E H om( A, C*) is equal to the order of the cohomology class of a. (iii) All irreducible a-characters of G are class functions. Moreover, there is a numbering A1, ... ,A r of all irreducible a-characters of G such that
(1 :s; i,j
:s; 1')
Proof. Upon renumbering the Ct, if necessary, we may assume that Ci, ... , C; are precisely those classes C E {Ci, ... , C;} for which Ai( C) i- 0 for some i E {I, ... ,r}. Let 11 and a be as in (ii) and let Ai: G ~ C be defined by
(1 :s; i
:s; 1')
Then, by Theorem 1.1, A1,"" Ar are all distinct irreducible a-characters of G and, since 11 is a conjugacy-preserving section, each Ai is a class function. By Theorem 1.3.6, I' is equal to the number of a-regular conjugacy classes of G. Also, by definition, (1
:s; i :s; 1', 1 :s; j :s; t)
Projective Character Tables
208
Hence, by Proposition 1.6.3(ii), Gj is a-regular if and only if j E {I, ... ,s}. This shows that r = s. Finally, if A ~ [G*,G*] then by Proposition 10.1.15 in Vo1.2, the transgression map Tra: Hom(A,C*) ---'t H 2(G,C*) associated with the given central extension is injective. Since Tra(x) is the cohomology class of a, the result follows. • We close by providing some information on groups with a normal su bgroup of index 2. In what follows, G always denotes a finite group.
Lemma 1.3. Let N be a normal subgroup of G and let (G : N) = 2. If G is a conjugacy class of G contained in Nand 9 E G, then either GG(g) = GN(9), in which case G is a union of two conjugacy classes of N of the same cardinality or (GG(g) : GN(9)) = 2, in which case G is a conjugacy class of N.
G'
Proof. Let G' be the conjugacy class of N containing g. Then clearly G. Assume that GG(g) = GN(g). Then
~
IGI = (G : Ga(g))
= 2(N : GN(9)) = 21G'I
(6)
Now assume that GG(g) =I- GN(9) and choose go E GG(g) - N. We claim that GG(g) = GN(g) U gOGN(g) which will imply that
(Ga(g) : GN(g)) = 2
(7)
Indeed, let x E GG(g) - GN(g). Since x ¢ Nand (G : N) = 2, we have x = gon for some n E N. But x,go E CG(g), so n E GN(g) and hence x E 90GN(g), as claimed. Applying (7), we have
IG'I = (N
: GN(9))
= 2(N
: Ga(g))
= IGI
(8)
and thus G' = G. By the foregoing, we are left to verify that if Ga(g) = GN(9), then G is a union of two conjugacy classes of N of the same cardinality. By (6), we may choose x E G - G'. Let Gil be the conjugacy class of N containing x. By (6), it suffices to show that IGI = 2IG"I. But, by (6) and (8), if IGI =f. 2IG"I, then Gil = G, a contradiction. •
1 Introduction
209
Let N be a normal subgroup of G, let (G : N) = 2 and let C be a conjugacy class of G contained in N. We say that C splits in N, if C is a union of two conjugacy classes of N of the same cardinality. By Lemma 1.3, C is either a conjugacy class of N or C splits in N. Let N be a normal subgroup of G of index 2 and let a E Z2(G,C*). Denote by X the C-character of G of degree 1 with N = J( erx. If .A is any a-character of G, then the associate .A' of .A is the a-character of G defined by .A' = .AX, i.e. .A'(g) = .A(g)X(g) for all 9 E G It follows from the definition of X that
.A'(g) = {
.A(g) -.A(g)
if if
9EN g¢ N
(9)
It is clear that .A is irreducible if and only if so is .A'. We say that .A is selfassociate if .A = .A'. Thus, by (9), .A is self-associate if and only if .A vanishes on G - N. Of course, all the definitions above apply to the ordinary character .A (by taking a = 1). If.A =I- .A', then we refer to {,A,.A'} as an associate pair.
Theorem 1.4. Let N be a normal subgroup of G of index 2 and let .A be an irreducible C-character of G. Then (i) If .A is self-associate, then .AN is a sum of two distinct irreducible characters of N and .A = J1G where J1 is any irreducible constituent of .AN. (ii) If .A is not self-associate, then .AN is irreducible. (iii) The number of irreducible self-associate C-characters of G is equal to the number of those conjugacy classes of G contained in N which are split in N. (iv) The number of associate pairs {p, p'} of irreducible C-characters of G is equal to the number of conjugacy classes of G contained in N which do not split in N. Proof. (i) Since .A vanishes on G - N, we have < .AN,.AN >= 2 (see Lemma 21.2.2 in VoLl). HenCe.AN is a sum of two distinct irreducible characters of N. Therefor.e, by Clifford's theorem .A = J1G where J1 is any irreducible constituent of .AN' (ii) Let J1 be an irreducible constituent of .AN and let X be the Ccharacter of G of degree 1 with N = J( erx. By hypothesis, .AX =I- .A. Since (.AX)N = .AN, it follows from Frobenius reciprocity that .AX and .A are two
210
Projective Character Tables
distinct irreducible constituents of J.P. Hence 2J.l(1) = J.lG(I) ~ 2>.(1) and so J.l(I) ~ >'(1). Thus J.l(1) = >'(1) and >'N = J.l is irreducible. (iii) and (iv) Let Xll ... ,Xr be all irreducible C-characters of N and let C 1 , ..• , C; be all conjugacy classes of N. Then the group G acts by conjugation on {XI, .x-I and {CI, ... ,Cr}. By definition, Xi(Cj) = 9Xi(9Cj) for all i,j E {1, ,r}, 9 E G. Hence, by Brauer's permutation lemma (see Corollary 17.4.3 in Vol.I}, the number of G-orbits of {Xll ... .x-l is equal to the number of G-orbits of {C I , ... , C r } and, for any 9 E G, the number of elements of {Xl, ... .x-} fixed by 9 is equal to the number of elements of {CI , ... , Cr } fixed by g. Since N acts trivially on both sets and G/ N is of order two, we deduce that {Xl, ... , Xr} and {C1, ... , C r} have the same number of orbits of any given length, i.e. of length 1 and 2. Now the G-orbits of {C I , ... , Cr } of length 1 are precisely the conjugacy classes of G contained in N which do not split in N. On the other hand, the G-orbits of {Xl, ... ,Xr} of length 1 are precisely the G-invariant irreducible characters of N. Note also that, by (i), (ii) and Frobenius reciprocity, Xi is G-invariant if and only if xf = p + p' for some irreducible C-character p of G which is not self-associate. The pair {p, p'} is uniquely determined by a G-invariant Xi, since PN = Xi. Also, if P is an irreducible C-character of G which is not self-associate, then X = PN is irreducible by (ii). Hence X is also G-invariant and, by Frobenius reciprocity, XG = P + p'. This proves (iv). The G-orbits of {C I , ... , C r } of length 2 are in bijective correspondence with those conjugacy classes of G contained in N which are split in N. On the other hand, the G-orbits of {xl, ... , x-I of length 2 are precisely the pairs of distinct G-conjugate irreducible C-characters of N. If >. is a selfassociate irreducible (:>character of G, then the set Irr(>'N) of irreducible constituents of >'N is a pair of distinct G-conjugate C-characters of N by applying (i) and Clifford's theorem. Now any such>. vanishes on G - N, so it is determined uniquely by >'N. Also, if Xi is not G-invariant, then>' = xf is irreducible and>. vanishes on G - N. Therefore>. is self-associate and Irr(>.N) = {Xi, 9xd for some 9 E G with 9Xi i- Xi. This proves (iii) . •
2
Conjugacy classes of S; and An
In this section we shall record some elementary group-theoretic facts concerning the symmetric group 5'n and the alternating group An of degree n. These include a precise formula for the number of elements in each conjugacy class of 5'n and a description of conjugacy classes C of Sn, with C ~ An,
2 Conjugacy classes of Sn and An
211
which split in An. Recall that, by definition, the group Sn is the group of all permutations of any given set X of n elements. It is customary to choose X = {I, 2, ... , n}. Let a E Sn and let G =< a >. Then G acts on the set X and so X is a disjoint union of orbits:
where a( aij)
= ai,j+l, j
< ri, a( air.)
= ail
In this situation, we write
(1) Expression (1) is uniquely determined by the arrangement of the various orbits of X and by the choice of the first element of a given orbit. In particular, the set of the lengths of the orbits {r1, r2, ... , rs} is unique. The arrangement of the orbits lengths in nonincreasing order of magnitude r1 ~ r2 ~ ... ~ r s is said to be the type of a E Sn and is denoted by (rb ... ,rs). For a natural number r, a permutation of type r is said to be an r-cycle or a cycle of length r. A permutation is called a cycle if it is an r-cycle for some r. A 2-cycle is also called a transposition. Decomposition (1) is called the cycle decomposition of a. It is often customary to omit the terms with r; = 1 in such a decomposition. A partition of a positive integer n is a finite sequence of positive integers AI, ... , As such that
The Ai are called the parts of the partition. Note that the above partition of n determines a unique type (A1, ... ,A s ) . Conversely, any type (A1, ... ,A s ) determines a unique partition. Thus there is a bijective correspondence between the partitions of n and the types of the elements in Sn' For this reason, we shall often use the terms "partition" and "type" interchangeably. Lemma 2.1. Any permutation a E Sn can be decomposed into a product of cycles in which any two distinct factors do not have a common letter. This decomposition is unique once the order of the cycles in the product is determined.
Projective Character Tables
212
Proof.
This has been shown in the foregoing discussion. •
Lemma 2.2.
Two permutations a and T in Sn are conjugate if and only if they have the same type. Thus there is a bijection between the conjugacy classes of Sn and partitions of n.
Proof. Let (1) be the cycle decomposition of a. If T( aij) = bij for all iandj,then I TaT- = (bu'" bIT!)'" (b sl ... bsrJ (2) is the cycle decomposition of TaT-I. Hence conjugate permutations have the same type. Conversely, if a and T have the same type, then we can easily construct a permutation p with T = pap-I . • We now recall that any permutation can be decomposed into a product of transpositions. The decomposition into a product of transpositions is not unique, but the numbers of transpositions appearing in these decompositions are always even or all odd. Hence the parity of the number of transpositions is independent of the way a permutation is written as a product of transpositions. A permutation a E Sn is called even if a is the product of an even number of transpositions. Otherwise, a is called an odd permutation. Assume that n 2: 2. The normal subgroup of Sn consisting of all even permutations is called the alternating group of degree n and is denoted by An. It is clear that IAn I = (1/2)n!. Note also that an r-cycle is even if and only if r is odd. Hence a cycle decomposition of a E Sn allows us to decide whether a is even or odd. Let C be any conjugacy class of s; with C ~ An, n 2: 2. Since (Sn : An) = 2, it follows from Lemma 1.3 that C is either a conjugacy class of An or C splits in An, i.e. C is a union of two conjugacy classes of An of the same cardinality. Thus to describe the conjugacy classes of An, it suffices to characterize those conjugacy classes C of Sn with C ~ An which split in An. First it will be convenient to record some elementary facts concerning the centralizers of elements in S«. Lemma 2.3.
Let a E Sn and let
(3) be the cycle decomposition of a. For each k E {n , r2, ... , r s}, let X k be the union of all {ail, ai2, .. . , airJ with r; = k. Then a permutation T E Sn
213
2 Conjugacy classes of Sn and An
commutes with a if and only if T(Xk) = Xk for each k and the restriction Tk of T on Xk commutes with the restriction ak of a on X k for each k. Moreover, if a is an n-cycle, then
Proof.
By (2), a permutation a
T
E Sn commutes with a if and only if
= (bll···blrl)···(bsl···bsrJ
where T(aij) = bij for all i, j. This obviously implies the first assertion. Assume that a is an n-cycle. Since the number of all n-cycles in Sn is (n -1)!, it follows from Lemma 2.2 that the conjugacy class of a has precisely (n - 1)! elements. Hence the order of Csn(a) is n, Since < a >~ Csn(a) and < a > is of order n, the result is established. • We next record the following classical result due to Cauchy (1844). Lemma 2.4. Let a E Sn have the cycle decomposition in which a cycle of length i occurs ei ~ 0 times, 1 $ i $ n. If C is the conjugacy class of Sn containing a, then
Equivalently,
ICsn(a)1 = 1elel!2e2e2! ···nene n ! Proof.
The type of a can be displayed pictorially as ( .)( .) ... ( .)
-- e1
----.
( .. )( .. ) ... ( .. ) --
(4)
e2 ----.
There are exactly n spaces in (4), and we obtain an element of Sn by filling in the n objects in an arbitrary way. In each case, we obtain a permutation of the same type as a and hence an element of C. There are precisely n! ways of arranging the objects, but not all arrangements give distinct elements of C. We now show that each element of C has been repeated 1q el! 2e2e2! ... n enen! times, which will complete the proof. Consider the e; cycles oflenght i which appear in (4), 1 $ i $ n. Clearly, these e; cycles can be permuted amongst themselves in ei! ways, without changing the resulting element of Sn' Note also that each cycle oflength i, say (XIX2 ..• xd, can be written in i different ways, since (XIX2"' X i )
= (X2 J:3''' X i X d =... =
(XiXl"'Xi-d
Projective Character Tables
214
Hence each element of Sn has been counted ei! i e• times in so far as cycles of length i are concerned. Therefore, altogether, any given element of C has been repeated 1el e1! 2e2e2! ... n enen! times, as desired. • The following result, in conjuction with Lemma 2.2, describes all conjugacy classes of An' n ~ 2.
Theorem 2.5. Let C be a conjugacy class of Sn with C ~ An. Then C splits in An if and only if the elements of C have the type of the form (7'1,1'2, ... ,1's) where the r, are distinct and odd. Proof. Let a E Sn be an even permutation and let a = a1 ... as be the cycle decomposition of a, where a; is an ri-cycle, 1 ~ i ~ s. By Lemma 1.3, it suffices to show that C s; (a) = CAn(a) if and only if the 1'i are distinct and odd. Assume that Csn(a) = CAn(a). Since a commutes with each a.; we have ai E An. Hence each 1'i must be odd. Suppose that r; = rj = t for some i f:. j and write a; = (a1a2 ... at), aj = (b1b2 ... bt) Then (a1bI)'" (atbd E Csn(a) - An' which is impossible. Thus the r; are distinct. Conversely, suppose that the r, are distinct and odd. Then, by Lemma 2.3, if T E Sn commutes with a, then T E An' as required . • We close by providing an application of Theorem 2.5. Assume that n ~ 2. Then An is a normal subgroup of Sn of index 2. Hence the notions of associate and self-associate C-characters, introduced in Sec.1, are applicable to Sn'
Corollary 2.6. The number of irreducible self-associate C-characters of Sn is equal to the number of partitions of n :
in which all the
ri
are distinct and odd.
Proof. By Lemma 2.2 and Theorem 2.5, the above partitions are in bijective correspondence with the conjugacy classes C of Sn with C ~ An such that C splits in An. On the other hand, by Theorem 1.4(iii) (applied to
3 Conjugacy classes of double covers of Sn and An
215
G = Sn and N = An), such conjugacy classes C are in bijective correspondence with the irreducible self-associate lC>characters of Sn. So the corollary is true. •
3
Conj ugacy classes of dou ble covers of S; and An
Let G be a finite group. A double cover of G is a central extension 1~ Z
~
G*
~
G
~
1
in which IZI = 2. By abuse of language, it is customary to refer to G* itself as a double cover of G. To find projective character tables of G, it is essential to have a complete knowledge of conjugacy classes of a covering group G* of G. In case G = Sn( n ~ 4) or G = A n( n ~ 4, n i- 6,7) any covering group G* of G is a double cover of G. For this reason, we concentrate our attention to the study of conjugacy classes of double covers of Sn and An.
A. Preliminary information Consider the group Sn, n ~ 2. Then Sn is generated by n - 1 transpositions t 1 = (12), t2 = (23), ... ,t n - 1 = (n -l,n) These transpositions satisfy the relations
(1) (1 ::; i ::; n - 1, 1 ::; j ::; n - 2, k ::; 1-2) Moreover, by Theorem 12.1.1 in Vo1.2, (1) is a set of defining relations of Sn' By Theorem 12.2.2 in Vol.2, the Schur multiplier M(Sn) of Sn is given by if (2) if Now consider the group
(1 ::; i ::; n - 1, 1 ::; j ::; n - 2, k::; l - 2)
Projective Character Tables
216
Then the group
S~
determines a double cover of Sn
in which
(1 :::;
i:::; n - 1)
(3)
If m is an integer with m 2: n, then we may regard S~ as a subgroup of S:n. By Theorem 12.2.2 in Vo1.2, S~
is a covering group of Sn if n 2: 4
Put A~ = f-l(A n) and consider the corresponding double cover of An :
Since (Sn : An) = 2, we clearly have (S~ : A~)
(4)
=2
Moreover, by Theorem 12.3.2 in Vo1.2, A~
is a covering group of An if n
~
4, n
f:.
6,7
If n = 2,3, then by (2) S~ is not a covering group of Sn' One can easily verify that S2 is cyclic of order 4, while S:'3 is metacydic of order 12 with a presentation
Assume that n 2: r + k for some integers r, k 2: 2. We regard S; as the subgroup of S~ which is the double cover of the symmetric group on {I, 2, ... , r}. Then
S; =< 91, ... ,9,·-1,Z >
Similarly, we regard 1,... ,r+k}. Then
S'k
as the double cover of the symmetric group on {r
S'k =< 9r+l,'" For any x E (4), the map
S~,
,9r+k-l ,Z
>
let a(x) = 0 if x E A;, and a(x) = 1 if x ¢
S~
{ x
+
A~.
Then, by
3 Conjugacy classes of double covers of Sn and An
217
is a homomorphism, i.e. za(xlx2)
= za(xJl+a(x2)
for all
Xl, X2 E
s~
(5)
The following useful observation is implicit in Schur (1911) and is explicit in Hoffman and Humphreys (1992). With the notation above, the following properties hold: (i) Let S; XS'k be the cartesian product S; X with multiplication defined
Lemma 3.1.
s;
by (Xl, X2)(Y1, Y2) = (za(x 2)U(Yl) XlY1, X2Y2)
(6)
Then S; XS'k is a group and
{(1,1), (l,z), (z,l), (z,z)} is a central subgroup of S; XS'k. (ii) Put Z = {(I, 1), (z, z)}. Then the map
< S;, s; >---.
is;« S'k)/Z
which sends s. to (gi, l)Z if 1 ~ i ~ r - 1, and gi to (l,gdZ if r r + k - 1, is a group isomorphism.
+1~
i ~
Proof. (i) It is clear that (1,1) is the identity element of S;xS'k. Since, by (5) and (6), (ZU(x JlU(x 2) x l 1 , x2"l)( Xl, X2) = (1,1) we see that (X1,X2)-1 = (zu(x Jlu(x 2)x l 1,x2"1). The associativity of the product of (al,a2), (b1,b 2) and (Cl,C2) follows from the following equality obtained from (6) :
Thus S; XS'k is a group. Since the given subgroup is obviously central, the required assertions follow. (ii) The group < S;, S'k > has generators z, gl,· .. ,gr-1 ,gr+1,· .. ,gr+k-1, with z a central element of order 2, and relations 2
gj = z,
(gjgj+1) 3 = z
1~i~r+k-1,ifr
1~ j ~ r- 2
or
r
+1 ~ j
~
(7) r
+k -
2
(8)
Projective Character Tables
218
(gtga)2 = z
1::; t, s ::; r
+k -
1, t
i- r i- s, t ::; s -
2
(9)
The group (S; XSk) jZ has an isomorphic copy {(x, l)Z Ix E Sn of S; and an isomorphic copy {(1, y)Zly E SA;} of s; and
((1, y)Z)((x, l)Z) = (zu(x)u(y), l)Z((x, l)Z)((l, y)Z)
(10)
Put g: = (gi,l)Z, 1 ::; i ::; r - 1, gj = (l,gj)Z, r + 1 ::; j ::; r + k - 1, and z' = (z,l)Z = (l,z)Z. Then (S;xS'k)jZ is generated by z'; gL ... , g~-1 , g~+1 , ... , g~+k-l' Applying (10) and identifications of S; and Sit with their copies, we see that (S; XSk)j Z has a set of defining relations obtained from (7), (8) and (9) by replacing gi by g~ and z by z', Since this obviously implies the required assertion, the result follows. • Corollary 3.2. (Schur (1911, Satz III). Suppose x and yare elements of S~ such that f(x) moves only a subset X of{1,2, ... ,n} with IXI ~ 2, fey) moves only a subset Y of {1,2, ... ,n} with IYI ~ 2 and X n Y = 0. If both f(x) and fey) are odd permutations, then yx = zxy; in all other cases, yx = xy. Proof. Put r = IXI and k = IYI. Then n ~ r + k, r ~ 2, k ~ 2 and we may apply Lemma 3.1(ii). We may, of course, assume that X = {1, 2, ... , r} andY={r+1, ... ,r+k}. ThenxES;andYES'k. Putx'=(x,l)Z, y' = (1, y)Z and z' = (z, l)Z. Then, by Lemma 3.1(ii), xy = yx is equivalent to x'y' = y'x', which by (8) is equivalent to O'(x)O'(y) = O. Hence xy = yx if and only if either f(x) or fey) is an even permutation. Assume that both f(x) and fey) are odd permutations. Then O'(x) = O'(y) = 1 and, by (8), y':r' = z'x'y'. Hence, by Lemma 3.1(ii), yx = zxy, as required. • B. Conjugacy classes of
S~
and
A~
All the notation introduced in Sec.A remains in force. Here we examine in detail the conjugacy classes of S~ and A~, n 2: 2. Since the central subgroup < z > of S~ is of order two, a conjugacy class C of Sn splits in S~ if and only if f- 1 (C) is a union of precisely two conjugacy classes of S~, each of the same size as C. Recall that, by definition, an element x E Sn is of type (rl"'" r a) if x is a product of disjoint cycles of lengths rl, ... ,r a(rl ~ r2 2:. "r a 2: 1,n = 2::;=1 r.}, Theorem 3.3.
(Schur (1911, p.172)).
Let n > 2, and let C be a
3 Conjugacy classes of double covers of Sn and An
219
conjugacy class of Sn whose elements are of type (T1, ... ,T s )' Then G splits in S~ if and only if one of the following conditions holds : (i) Each Ti is odd (hence G ~ An)' (ii) G ~ An and the Ti are distinct.
Proof. Let f : S~ ---> Sn be the homomorphism given by (3). Choose any x E S~ with f(x) E G. Then G splits in S~ if and only if x is not conjugate to x z; Assume that (i) holds. Then the order, say k, of f(x) is odd. Since f(x k) = 1, we have x k = zi for i = 0,1. Hence (xz)k = xkz k = i+l, since k is odd. It follows that xz and x have distinct orders and so cannot be conjugate. Assume that (ii) holds. Since f( x) is an odd permutation, an odd numbel', say k, of the integers T1,"" Ts must be even. We may assume that x = Xl'" z , where f(xt) is a cycle oflength Ti, Xi E S~, 1 S; i S; s. Since the Ti are distinct, it follows from Lemma 2.3 that the centralizer of f( x) in s; is < f(xt) > X < f(X2) > X ••. X < f(x s ) > Assume that f(xJ E An. Then, by Corollary 3.2, Xi commutes with Xj for all j, thus Xi commutes with x. On the other hand, if f(xJ f/. An' then XiXj = ZXjXi for k - 1 values of i. again by Corollary 3.2. Because k - 1 is even, Xi commutes with x also in this case. It follows that the centralizer of x in S~ is generated by Z, xl, ... ,x s and has order 2T1 T2 ... Ts- Hence, if G' is the conjugacy class of S~ containing x, then IG'I = IGI and so G splits in the group S~. Conversely, assume that neither (i) nor (ii) holds. Then either f( x) is an even permutation with a cycle of even length or f( x) is an odd permutation with two cycles /1 and /2, say, of length k. Suppose that the latter occurs. Write /1 = (U1" 'Uk), /2 = (V1'''Vk) and put
/ = (U1 V1 U2V2 ., . UkVk) Then we have /2 = /1/2. Now choose u E S~ with f( u) = / and put v = xu- 2. Then f( v) and / are disjoint permutations and both are odd. Hence, by Corollary 3.2, uv = zvu. Accordingly, ux
= uvu 2 = zvu3 = ZXU
which shows that x is conjugate to zx. Thus G does not split S~. Finally, assume that f( x) is an even permutation with a cycle of even
Projective Character Tables
220
length. Then we may write x = uv for some u, v E S~ with f( u) being a cycle of even length. Because f(u) is an odd permutation, f(v) is also odd. Thus, by Corollary 3.2, uv = zvu. Hence ux and so x is conjugate to
ZX,
= u(uv) = uzvu = zxu as required . •
Note that the central subgroup < z > of A~ is of order two. Thus a conjugacy class C of An splits in A~ if and only if (C) is a union of precisely two conjugacy classes of A~, each of the same size as C. We are now ready to accomplish our second aim which is to provide the following counterpart of Theorem 3.3 for the group j!~.
r:
Theorem 3.4. Let n ~ 2 and let C be a conjugacy class of An whose elements are of type (rl,' .. , r s). Then C splits in A~ if and only if one of the following conditions holds : (i) Each r, is odd. (ii) All the r; are distinct and Tj is even fOT some j E {I, ... ,s}. Proof. Let f : A~ -+ An be the homomorphism induced by the homomorphism in (3). Choose any x E A~ with f(x) E C. Then C splits in A~ if and only if x is not conjugate to xz. Assume that (i) holds. Then, by the proof of case (i) in Theorem 3.3, we see that C splits in A~. Now assume that (ii) holds. We may then assume that Tl,"" rk are even for some k ~ 1 and rk+l," ., rs are odd. Again, we may assume that x = Xl . "X s where f(x) = f(xt} .. · f(x s ) is a cycle decomposition of f(x) and f(xd has length Tj, 1 SiS s. Because the Tj are distinct, it follows from Lemma 2.3 that the centralizer of f( x) in Sn is
< f(xt} >
X
< f(X2) > x .. · x < f(x s ) >
Hence the centralizer L of f( x) in An consists precisely of all elements of the form: f(xd" 1 • • • f(x s )'" (nl + ... + nk is even) Now put Yi = x;l x so that x = XiYi and f( xd, f(yd are disjoint permutations, 1 s ! S s, Then, by Corollary 3.2, YiXi
ZXiYi
for all
iE{I, ... ,k}
= XjYi
for all
i E {k+ I, ... ,s}
=
YiXi
4 Spin representations and spin characters of double covers
221
Hence XXi = ZXiX for i E {l, ... ,k} and XXi = XiX for i E {k + l, ... ,s}. Thus the centralizer of X in A~ is f-l(L), and the number of conjugates of X in A~ is equ al to the number of conjugates of f( x) in An. This demonstrates that C splits in A~. Finally, assume that neither (i) nor (ii) holds. Then f(x) has two cycles /1 and /2, say of length k, and f(x) also has at least one cycle 6, say, of even length. Again, we may assume that X = uv, u, v E A~, where f( u) = 6, so that f( u) and f( v) are odd permutations. Then, by Corollary 3.2, vu = zuv and so Xu = u( vu) = uzuv = zux, which shows that u- 1xu = ZX. We claim that there exists w E S~ with wx = xw and f(w) rt An; if sustained, it will follow that (uw)-l x(uw) = zx and f(uw) E An, so uw E A~ as desired. To substantiate our claim, let /1 = (Ul ... Uk), /2 = (VI' .. Vk) and put
Then /2 = /11'2' If w E S~ is such that f(w) = / and y = xw- 2, then f(y) is even, since f( w) is odd. Hence, by Corollary 3.2,
as we wished to show. •
4
Spin representations and spin characters of double covers
In this section, we provide some general results concerning ordinary representations and characters of double covers of finite groups. This will give us a unified framework for the material discussed in the next section. There are a number of classical groups G (e.g. G = Sn, n ~ 4, or G = An, n ~ 4, n i- 6,7) for which a covering group G* of G is a double cover of G. Hence the study of projective representations of such a group G can be reduced to the ordinary representations of the double cover G* of G. This explains our general interest in the study of ordinary representations of arbitrary double covers. As we shall see below, the corresponding theory can be split into two parts: ordinary representations of G and spin representations of G*. It is the second part to which we will devote most of our attention.
Projective Character Tables
222
Throughout this section, we fix a finite central group extension 1 -+< z
>-+
G*
L
G
-+
1
(1)
such that z is an element of order two. Such an extension (or by abuse of language the group G*) is called a double cover of G. As usual, we denote by I the identity matrix. Let p : G*
-+
GLm(C)
be an irreducible C-representation of G*. Since z is an element of order two in the centre of G*, we have
p(z)
=I
or
p(z) = -I
We say that p is a spin representation of G* if p(z) = -I. In case G = Sn, n 2: 4 and G* is a covering group of G, these representations were called Zweiter Art by Schur (1911). Of course, if p(z) = I, then p can be regarded as an irreducible C-representation of G ~ G* / < z ». Thus, to determine all irreducible C-representations of G*, we must find: (i) All spin representations of G*. (ii) All irreducible C-representations of G. By a spin character of G*, we understand the irreducible C-character of G* afforded by a spin representation of G*. Spin characters of S~ are the ones which correspond to Schur's "characters of the second kind" (see Schur (1911)). For any conjugacy class C* of G*, the set zC* = {zxlx E C*}
is another conjugacy class of G* with IC*I = IzC*1
We refer to zC* as the associate of C*. We say that C* is self-associate if C* = zC*. Thus, if C = f( C*), then C splits in G* if and only if C* is not self-associate. If C* is not self-associate, then {C*, zC*} is called an associate pair of conjugacy classes of G* . Before stating our first lemma, it will be convenient to introduce the following definitions. We say that a + bi E C (a, b E R) is pure imaginary if a = 0 and b 1- o.
4 Spin representations and spin characters of double covers
223
A group G is said to be ambivalent if every element of G is conjugate to its inverse. For example, the symmetric group Sn is obviously ambivalent. The alternating group An' n ~ 2, need not be ambivalent. In fact, An is ambivalent if and only if n E {2, 5, 6,10, 14} (see Kerber (1971, p.14)).
Lemma 4.1.
Let X be a spin character of G* and let C* be a conjugacy
class of G*. Then (i) X(zC*) = -X(C*). (ii) X(C*) = 0 if C* is self-associate. (iii) X( 1) is even if z E [G*,G*]. (iv) If C = f( C*) is such that C = C- 1 , then X(C*) is either real or pure imaginary. In particular, if G is ambivalent, then the values of all spin characters of G* are real or pure imaginary.
(i) Let p be a spin representation of G* which affords X. If g E C*, then p(zg) = -p(g). Hence X(zg) = -X(g), as required. (ii) Apply (i). (iii) Since z E [G*,G*] and p(z) = -I, we have 1 = detp(z) = (-l)x(1), as required. (iv) Since C = C-l, we have j(C*) = f((C*)-l). Hence C* = (C*)-l, in which case X(C*) is real or C* = z( C*)-l, in which case
Proof.
x(C*)
=
-X((C*)-l)
(by (i))
as required . • The number of spin characters of G* can be determined by applying Theorem 1.1 and the fact that the number of irreducible a-characters of G over C is equal to the number of a-regular conjugacy classes of G. However, in our particular case of double covers, there is a direct simple approach illustrated below.
Lemma 4.2.
Let C 1 , ... ,Cr be all distinct conjugacy classes of G which split in G* and let D 1 , ••. , D s be the remaining conjugacy classes of G. Choose any conjugacy classes Ci, ... ,C;, Di, ... , D; of G* such that C, = f(Ct) and o, = f(DJ), 1 ::; i::; r , 1 ::; j ::; s. Then (i) Ci, ... ,C; are all distinct representatives of associate pairs of conju-
Projective Character Tables
224
gacy classes of G* . (ii) C], zCi, C2', zC2', ... , c;, zC;, Di, ... , D; are all distinct conjugacy classes of G*. In partiuclar, the number of spin characters of G* is equal to r, (iii) The vector space of all class functions G* -+ C spanned by spin characters of G* has a basis {'l/JI, ... , 'l/Jr} given by
~
C =C; C = zC; C:I C;,zC;
if if if
where C is any conjugacy clas of G*, 1 ~ i
~
r,
Proof. (i) Since f( Ci), ... , f( Cn are distinct, no C; is associate to CJ for i :I j. Since each C, splits in G* and C, = f( Cn, no C; is selfassociate, 1 ~ i ~ r. Finally, if C* is any conjugacy class of G* which is not self-associate, then C = f( C*) splits in G*. Hence f( C*) = f( Cn for some i E {1, ... , r}, which shows that C* is associate to C;. (ii) The first assertion follows from (i). By subtracting the class number of G from the class number of G*, the second assertion is also true. (iii) By (ii), there are precisely r spin characters of G*. Since these r characters are linearly independent, it suffices to show that any spin character X of G* is a linear combination of 'l/Jl' ... , 'l/Jr. Setting X(C;) = at; it follows from Lemma 4.1(i) that X(zC;) = -ai, 1 ~ i ~ r . Moreover, by Lemma 4.1(ii), X(Dj) = 0, 1 ~ j ~ s. Hence r
X = Lai'l/Ji i=1
and the result follows. •
N*
Now assume that N is a fixed normal subgroup of G of index 2 and let = f-I(N). Then sequence (1) induces an exact sequence
1 -< z
>-+
N*
.L N
-+
1
Hence N* is a double cover of N. Since (G* : N*) = 2, the notions of associate and self-associate characters are applicable to G*. Let X be a C>character of G* and let X' be the associate of X. If X :I X', then we refer to {X, X'} as an associate pair of C-characters
4 Spin representations and spin characters of double covers
225
of G*. A conjugacy class C of G* is said to be even if C ~ N*; otherwise C is called odd. Thus a (;-character X of G* is self-associative if and only if X vanishes on all odd conjugacy classes of G*. We are now ready to determine the number of self-associate spin characters of G*. Theorem 4.3. Let r be the number of associate pairs of conjugacy classes of G* and let k be the number of associate pairs of even conjugacy classes of G*. Denote by s the number of self-associate spin characters of G* and denote by t the number of associate pairs of spin characters of G* . Then s = 2k - r and t=r-k Moreover, if Z E [N*, N*] and X is a self-associate spin character of G*, then X(l) is divisible by 4.
Proof.
Let Il be an irreducible constituent of XN*. Then, by Theorem Since Il is a spin character of N* and Z E [N*,N*], it follows from Lemma 4.1(iii) that 1l(1) is even. Hence X(l) is divisible by 4. Let Ci, ... , C; be all distinct representatives of associate pairs of conjugacy classes of G*, let V be the vector space of all class functions G* -+ C spanned by spin characters of G* and let 7/JI, ... ,7/Jr be the basis of V given by Lemma 4.2. Denote by V' (respectively, V") the subspace of V spanned by class functions that vanish on odd (respectively, even) conjugacy classes of G*. lf X is a self-associate spin character of G*, then X E V', whereas if Il and It' are distinct associate spin characters of G*, then
1.4, X(l)
= 21l(1).
Il
+ It' E V'
and
Il - It' E V"
Hence, in this case, 1(Il Il = 2
+ Il ,) 1 + 2(1l -
Il ') E V , ED V "
and therefore V = V' ED V". It will next be shown that dimV' = s
+t
and
dimV" = t
(2)
Indeed, let Xl, ... , Xs be all self-associate spin characters of G* and let {Ill , Il~}, ... , {Ilt, Il~} be all associate pairs of spin characters of G*. Denote by U' the linear span of Xl, ... , Xs, III + Il~, ... ,Ilt + Il~ and by U" the
Projective Character Tables
226
, I I Imeal' span 0 f III - Ill" .. ,Ilt - Ilt· Then U' ~ V', U" ~ V" and, by the previous paragraph, V = U' EEl U". Hence U' = V' and U" = V". Since V = U ' EEl U" and dimV = s
+ 2t,
dimU ' ::; s
+t
and
dimU"::; t
we deduce that (2) holds. are all even among the C;,.,., C;. We may assume that C;,.", By definition, 7/Jl,"" 7/Jk vanish on CZ+ l , ... ,C; and on all self-associate conjugacy classes of G* and so 7/Jl,"" 1/Jk E V'. Similarly, 7/Jk+ 1,. , . , 7/Jr vanish on C;, ... , and on all self-associate conjugacy classes of G* so 7/Jk+ 1, ... ,7/Jr E V". Since 7/Jl, ... ,7/Jr form a basis of V = V' EEl V", we deduce that k = dimV' and r - k = d'imV". Hence, by (2),
cz
cz
k = s +t
and
r- k= t
which proves the required assertion. • We now return to the general situation described by (1). Let C;, ... , C; be all distinct representatives of associate pairs of conjugacy classes of G*, Then, by Lemma 4.2, there are precisely r spin characters of G*, say Ai, ... ,A;. Moreover, by Lemma 4.1, each Ai is determined by
(1 ::; i ::; r) We shall refer to the r x r-rnatrix
(Ai( Cn)
(1 ::; i,j ::; r)
as the spin character table of G*, Thus the spin character table depends not only upon the numbering of C;, .. ., C; and xi" ., ,X;, but also upon the choice of C;. It is the latter ambiguity that distinguishes spin character tables from ordinary character tables. To resolve this ambiguity, we must choose a canonical representative C; of the pair {C;, zCn. In general, this is however impossible since no C; is distinguished from its fellow zC;. Theorem 4.4. (Spin Orthogonality Relations). Let Cl,'" .C; be all distinct representatives of associate pairs of conjugacy classes of G* and let Xl, ... ,Xr be all spin characters of G*. Then (i) Lk=l ICklxi(Ck)Xj(Ck) = IGlbij. (ii)
Lk=l Xk( CdXk(Cj) = ~bij.
4 Spin representations and spin characters of double covers
227
Proof. (i) Applying the first orthogonality relation for irreducible Ccharacters of G*, we have
21GI Oi j =
L
Xi(g)Xj(g)
gEG* r
r
L
ICklxi(Ck)Xj(Ck)
+L
k=l
ICklxi(ZCk)Xj(ZCk)
k=l
(by Lemma 4.1(ii)) r
2
L
(by Lemma 4.1(i))
ICklxi(Ck)xj(C k)
k=l
as required. (ii) Let AI, ... , As be all irreducible (:-characters of G* containing Z in their kernel. Then AI,' .. , As can be regarded as all irreducible C-characters of G ~ G*/ < z ». Applying the second orthogonality relation for irreducible C-characters of G* and G, we have r
r
k=l
t=l
L Xk(Ci)Xk(Cj) + L At(Ci)At(Cj)
Since If(Cdl =
ICil, 1 :::; i:::;
r, the result follows. •
In the rest of this section, we show that the spin character table of G* is determined and determines the a-character table of G for a suitable a E Z2(G,C*). Let C l , ... , C; be all distinct conjugacy classes of G which split in G* and let D 1 , .•• , I), be the remaining conjugacy classes of G. Choose any conjugacy classes Ci, ... , C;, Dj, . . . ,D; of G* such that
C.
= f(Ct),
D,
= f(Dj),
(1 :::; i :::; r, 1 :::; j :::; s)
Then, by Lemma 4.2(i), Ci, ... ,C; are all distinct representatives of associate pairs of conjugacy classes of G*. Denote by J.l : G --+ G* any section of f such that (1 :::; i :::; r, 1 :::; j :::; s)
Projective Character Tables
228
Now define a E Z2(G, C*) by
a(x, y) = {
_~
if if
JL(x )JL(Y) = JL( xy) JL(:1: )JL(Y) = ZJL( xy)
where Z appears in (1). With this information at our disposal, we can now achieve our final aim, which is to prove the following result.
Theorem 4.5. Further to the notation above, let Ai, ... ,A; be all spin characters of G*. Then (i) G I , ... , C; are all distinct a-regular conjugacy classes of G. Furthermore, if Z E [G*, G*], then the cohomology class of a is of order two. (ii) All irreducible a-characters of G are class functions. Moreover, there is a numbering AI,... ,A r of all irreducible a-characters of G such that
(1
~
i,j ~ r)
Thus the spin character table of G* and the a-character table of G determine each other.
Proof. (i) By hypothesis, G I , ..• .C; are all distinct conjugacy classes of G which split in G*. Hence, by Theorem 1.1( v), G I , ... .C; are all distinct a-regular conjugacy classes ofG. Moreover, if Z E [G*,G*], then by Theorem 1.2 (with A = < Z > and x( z) = -1) the order of the cohomology class of a is equal to two. (ii) Apply Theorem 1.2(iii) . •
5
Spin representations and characters of double covers of Sn and An
The present section can be regarded as an introduction to the theory of projective characters of Sn and An. It is based on a monumental work by Schur (1911) and covers only several aspects of his paper. Our principal objective is to give the reader some feeling for the subject of spin characters of Sn and An. By applying a more sophisticated machinery we shall in future develop Schur's theory in greater detail and depth. For reasons of exposition, clarity, and emphasis, we have divided this section into three parts.
5 Spin representations and characters of double covers of S« and An
229
A. General results In what follows, n 2: 2 is an integer. Consider the group
(1 :::; i :::; n - 1, 1 :::; j :::; n - 2, k :::; 1-2) Then the group
S~
determines a double cover (1)
of Sn in which
f(gd = (i, i + 1)
(1:::;i:::;n-1)
(2)
Since z = [gl, g3J for n 2: 4, we have
zE
[S~, S~]
if
n
2: 4
In fact, a stronger assertion holds. Namely, by Theorem 12.2.2 in Vo1.2, is a covering group of Sn. Put A~ = f-1(A n) and consider the corresponding exact sequence 1
----< z
>---t
A~
L
An
---t
1
(3) S~
(4)
Since (Sn : An) = 2, we have (S~ : A~) = 2. Moreover, since An = [Sn, Sn], we have A~ = [S~, S~J. Note also that the Sylow 2-subgroup of A 4 is nonabelian of order 8. Hence Z E [A4, A 4J ~ [A~, A~] for n 2: 4. Thus
z E [A~, A~J
if
n 2: 4
(5)
The significance of A~ resides in the fact that, by Theorem 12.3.2 in Vo1.2, A~ is a covering group of An' provided n 2: 4 and n:f 6,7. It is a consequence of (1), (3), (4) and (5) that we may apply all the information obtained in Sec.4 to groups G = Sn and G = An. Moreover, since we have an intimate knowledge of conjugacy classes of Sn, An' S~ and A~ we can assert much more. Recall that a partition (AI 2: A2 2: 2: As) of n is a finite sequence of positive integers AI, ... , As such that Al + + As = n and Al 2: A2 2: ... As. The Ai are called the parts of the partition. A partition A = (AI 2: A2 2: ... 2: As) of n is said to be strict if
Projective Character Tables
230
Thus strict partitions are precisely partitions into distinct parts. For future use, we now quote the following standard fact of the theory of partitions. Proposition 5.1. (Euler). The number of strict partitions of n is equal to the number of partitions of n into odd parts. Proof.
See Andrews (1976, Corollary 1.2) . •
The conjugacy classes of Sn are indexed by partitions
Namely, an element w E Sn belongs to the >'-th conjugacy class if the cycle lengths of ware >'}, ... ,>'s' In such a case, identifying partitions and types, we will write type(w) = >., l(>.) = sand 1>'1 = n We declare>. to be even or odd according to whether n - l( >') is even or odd. The parity of >. is therefore the same as the parity of any permutation of type >.. Recall that, by definition, a conjugacy class C of S~ is even if C ~ A~; otherwise C is called odd. Designate x E S~ to be even or odd according to whether x E A~ or x ~ A~. Thus x is even or odd depending on whether or not type (f(x)) is even or odd. Let G = Sn or G = An. If C* is a conjugacy class of G*, then we refer to zC* as the associate of C*. We say that C* is self-associate if C* = Hence, if C = f( C*), then C splits in G* if and only if C* is not self-associate. If C* f:. zC*, then {C*, zC*} is called an associate pair of conjugacy classes of G*. To construct a spin character table of G* (defined in SecA), we must first exhibit a full set of representatives of associate pairs of conjugacy classes of G*. In contrast to the general case of arbitrary double covers, we are able to exhibit a canonical representative from each associate pair of conjugacy classes of G*. For each partition>. = (A} 2 >'2 2 ... 2 >'s) of n, define g>' E S~ by
.c-.
9 >. =
1r} 1r2 •.•
1r s
where 1rj = 1 if Aj = 1 and, for >'j > 1, (l~j::;s)
5 Spin representations and characters of double covers of Sn and An
= Al + ...+ Aj-l if j
where kj
> 1 and kj
231
= 0 if j = 1.
With the notation above, the following properties hold: (i) f(gA) is of type A. (ii) 1rr1rt = z('\r-I)('\r-I)1rt1rr (r =I t).
Lemma 5.2.
Proof.
(i) If Aj > 1, then by (2),
+ 1, kj + 2)(kj + 2, kj + 3)··· (k j + Aj - 1, kj + Aj) (k j + 1, kj + 2, ... ,kj + Aj) = 1 if Aj = 1, the above also holds for Aj = 1. Hence f(1rj) is
f(1rj)
(k j
Since 1rj cycle of length Aj. Since
a
is a product of disjoint cycles, f(gA) is of type A. (ii) By symmetry, we may assume that t > r. If Ar = 1 or At = 1, then there is nothing to prove. Hence we may assume that Ar > 1 and At > 1, in which case
Fix i E {k r + 1, k; +2, ... ,kr +A r -I} and j E {k t+l,kt+2, ... , kt+At -I}. Then i ~ k, + Ar - 1 ~ kt - 1 ~ j - 2 and so [gi, gjJ = z, which obviously implies (ii). • For the rest of this section, we shall use the following notation; Pn is the set of all partitions of n. o Pn is the set of all partitions of n with only odd parts. DPn is the set of all strict partitions of n (i.e. partitions of n with distinct parts). DP: is the set of all even partitions in DPn . DP;; is the set of all odd partitions in DPn . For each A E Pn, we denote by C,\ the conjugacy class of Sn whose elements are of type A. Finally, C>: denotes the conjugacy class of S~ containing g,\. We are now ready to record some basic properties of spin characters of S~. We remind the reader that, by Lemma 4.1(iv), the values of all spin characters of S~ are real or pure imaginary.
Projective Character Tables
232
Theorem 5.3.
Keeping the notation above, the following properties
hold: (i) {CAJ.~ E 0 P n U D Pn- } is a set of all distinct representatives of associate pairs of conjugacy classes of s~. (ii) {cAJ.~ t/. 0 Pn , At/. DP;;} is the set of all distinct self-associate conjugacy classes of S~. (iii) All distinct conjugacy classes of S~ are C~, zC~ for A E 0 r; U D P;; and CX for At/. OPn, At/. DP;;. (iv) For any spin character X of S~,
x(CD x(zCD
= =
0
if
At/. OPn , At/. DP;;
-x(C~)
for
A E OPn U DP;;
(v) The number of self-associate spin characters of S~ is equal to IDp;t I and the number of associate pairs of spin characters of S~ is equal to IDP;; I. In particular, the number of spin characters of S~ is equal to
(vi) Let n 2: 4, let a E Z2( Sn, C*) be not a coboundary and let X be a spin character of S~. Then (a) {C"IA E OPn U DP;;} is the set of all distinct a-regular conjugacy classes of S«. (b) XCI) is even and, if X is self-associative, XCI) is divisible by 4. (c) All projective character tables of Sn are determined by the character table of Sn and the spin character table
(A E OPn U DP;:) of S~. Here X" is a spin character of S~ labelled by A E OPn U DP;;.
Proof. (i) By Lemma 5.2(i), f(C~) = C" for all x E e; Moreover, by Theorem 3.3, C" splits in S~ if and only if A E OPn U DPn-. Hence (i) follows by applying Lemma 4.2(i). (ii) and (iii) This is a direct consequence of (i). (iv) Apply (i), (ii) and Lemma 4.I(i), (ii), (v) Let r,k,s and t be as in Theorem 4.3 with G = Sn. Then, by (i), r
= IOPnl + IDP;:I
and
k
= IOPnl
(6)
It follows that
s
2k - r
(by Theorem 4.3)
5 Spin representations and characters of double covers of S« and An
IOPnl-IDP;1
233
(by (6)) (by Proposition 5.1)
and t = r - k = IDP; I, as required. (vi) Since n ~ 4, M(Sn) ~ Z2 by Theorem 12.2.2 in Vo1.2. Since aregularity depends only on the cohomology class of a, assertion (a) now follows by (3), (i) and Theorem 4.4(i). Property (b) is a consequence of (5), Lemma 4.1(iii) and Theorem 4.3. To prove (c), we first note that, since M(Sn) ~ Z2, the projective character tables of Sn are determined by the character table of Sn and the acharacter table of Sn (see Lemma 1.2.5). This proves (c), by choosing a as in Theorem 4.5. • We now turn our attention to the group A~. Let p;t denote the set of all even partitions of n, let>. E Pn and let C>. be the conjugacy class of Sn whose elements are of type >.. Then, by definition, C>. ~ An if and only if >. E P;[. Note also that 0 Pn ~ P;[, since any cycle of odd length is an even permutation. Now let >. E P;t. We say that C>. splits in An if C>. is a union of two conjugacy classes of An of the same cardinality. By Lemma 1.3, C>. is either a conjugacy class of An or C>. splits in An; in the latter case, we write C>. = C~ u C~, where C~ and C~ are distinct conjugacy classes of An. It is clear that C~ = (12)-lC~(12). Lemma 5.4.
Proof.
The set of all distinct conjugacy classes of An is given by
This is just a restatement of Theorem 2.5. •
For each>. E OPn n DPn, let D~ be the A~-conjugacy class of g>' and let be the A~-conjugacy class of g1 1g>'gl' Denote by D>.. the A~-conjugacy class of g>' if >. E P;t, >. rf. OPn n DPn.
D1
Theorem 5.5. hold:
Keeping the notation above, the following properties
Projective Character Tables
234
(i) {D~, D~IA E OPn n DPn } U {D~IA E OPn - DPn } U {D~IA E DP;t is a full set of distinct representatives of associate pairs of conjugacy classes of A~. (ii) {DXI.x E P;t, A ~ DPn } is the set of all distinct self-associate conjugacy classes of A~. Thus the conjugacy classes of A~ are precisely those in (i), (ii) and of the form zG, where G is as in (i). (iii) For any spin character X of A~ and any conjugacy class G of A~,
o Pn }
x(G) = 0 x(zG) = -x(G)
if if
(iv) The number of spin characters of
G G A~
is as in (ii) is as in (i) is equal to
(v) Let n 2:: 4, let a E Z2(A n , C*) be such that the cohomology class of a is of order two and let X be a spin character of A~. Then (a) {GLG~IA E OPn n DPn } U {G'\IA E OPn - DPn } U {G'\IA E DP;t OPn} is the set of all distinct a-regular conjugacy classes of An. (b) X(l) is even. (c) If n :f 6,7, then all projective character tables of An are determined by the character table of An and the spin character table of A~.
Proof.
(i) By Lemma 5.4 and Theorem 3.4,
is the set of all distinct conjugacy classes of An which split in A~. By Lemma 5.2(i), f(D~) is a conjugacy class of An where elements are of type A E OPn n DPn . Hence, by Lemma 5.4, f(D~) = G~ or Gf. Assume f(DD = G~. Then f(D~)
= (12)-lG~(12) = G~
Similarly, if f(D~) = G~ then f(D~) = G~. Since for A E OPn - DPn or A E DP;t - OPn , f(D~) = G,\ the desired conclusion follows by applying Lemma 4.2(i). (ii) For any A E P;t, A ¢ OPn , A ¢ DPn , we have f(D;) = G,\. Hence (ii) follows from (7) and Lemmas 5.4 and 4.2(ii). (iii) Apply Lemma 4.1(i), (ii). (iv) By Lemma 4.2, the number of spin characters of A~ is equal to the
5 Spin representations and characters of double covers of Sn and An
235
A~.
Hence,
number, say r, of distinct conjugacy classes of An which split in by (7),
210Pn n DPnl + IOPn - DPnl + IDP: - OPnl IOPnl + IDP:I 2IDP:1 + IDP;I (by Proposition
r
5.1)
as required. (v) By Theorem 12.3.2 in Vo1.2, M(A n ) has precisely one element of order two. Since, by (5), z E [A~, A~], we may assume that a is as in Theorem 4.5. Hence (a) follows from (7) and Theorem 4.5(i). Property (b) follows from the fact that z E [A~, A~] and from Lemma 4.1(iii). Assume that n ::J 6, 7. Then, by Theorem 12.3.2 in Vo1.2, M(A n ) ~ Z2. Hence, by Lemma 1.2.5, the projective character tables of An are determined by the character table of An and the a-character table of An. This proves (c), by choosing a as in Theorem 4.5. • B. The basic spin representation
Our aim here is to introduce a distinguished type of a spin representation of S~, where n 2 4. All conventions and notation introduced in Sec.A remain in force. In what follows, we denote by 1 the identity matrix of an appropriate size. As a point of departure, we introduce the following matrices:
oi ]
,B
=[
-1o ] ,C = [ 0 1
01
where i 2 = -1. It is clear that
A2
= B 2 = -1, C 2 = 1, AB = -BA = iC AC = -CA, BC = -CB
For any matrix X and any integer x@m
Again, let
171
=X
171
2 1, we put
® X ® ... ® X
(X appears
171
times)
2 1 be an integer. We define a set of 2m + 1 matrices
Projective Character Tables
236
by the following formulas : X 2k- 1
c0 (m - k ) ® A ® 10(k-1)
(l:::;k:::;m)
c0 (m - k ) ® B @ 10(k-1)
(1 :::; k :::; m)
;c0m •
X 2m+1 An easy verification shows that
(j =f k)
(1)
The following two lemmas provide some basic properties of introduced matrices.
Lemma 5.6. mined by n = 2m
Ftrt er to the notation above, let m be uniquely deterI}, put
+ 1 r n = 2m + 2. For each k E {I, ... , n Yk = ( k)-1/2((k + 1)1/2 X k - (k - 1)1/2 X k- 1)
(2)
(by convention, X o = I). Then
Yl
= (}jyj +1)3 = -1,
(1 :::; k :::; n - 1, 1 ~
Proof.
i
~
Ys¥t
=
-¥tYs
(3)
n - 2, s :::; t - 2)
This follows directly by the application of (1). •
Lemma 5.7. Let m ~ 1 and let X1, ... ,X2m,X2m+1 be the matrices defined prior to Lemma 5.6. For each subset S = {il,." ,id, i1 < jz < ... < it, of{I,2, ... ,2m}, put
(by convention, Xs = 1 if S = 0). Then (i) For any subsets Sand T of {I, 2, ... ,2m}, XSXT
=
±X(S-T)U(T-S)
(ii] X 1X2'" X 2m+ 1 = im + 1 I. (iii) For any nonempty subset S of {I, 2, ... ,2m}, tr( X s) = O. (iv) The matrices Xs, as S ranges over all subsets of {1,2, ... ,2m},
5 Spin representations and characters of double covers of Sn and An
237
form a basis for the vector space of all 2m X 2 m-matrices over C. (v) The group G genemted by Xl, ... , X 2m is an irreducible group of matrices of order 22m +! .
Proof. (i) This is an easy consequence of (1). (ii) By definition, we have
C0"'0C0C0A C0'''0C0C0A =
C0'''0C0A0I
B0"'0B0B0I iC0···0C0C0C Multiplying the entire k- th column (from the right) from top to bottom yields ic», except that the leftmost column yields i 2 I. Since the tensor product of identity matrices is an identity matrix, the desired conclusion follows. (iii) By hypothesis, we may write
S = {jl, ... ,jd
~
{1,2, ... ,2m}
Then the matrix Xs is obtained by using the rows at levels ii,>. .i., multiplying all the entries in each column, and tensoring the resulting products. Consider the column furthest to the right in which one of the rows n, ... , jt contains a nonidentity matrix. This column produces one of A, B or AB, each of which has zero trace. Using the fact that tr(X 0 Y)
= tr(X)tr(Y)
for any matrices X and Y, the required assertion follows. (iv) Since there are precisely 22m subsets of {I, 2, ... ,2m} and the vector space of all 2 m X 2 m -ma trices over C has dimension 22m , it suffices to show that the matrices Xs are linearly independent. So assume that I:asXs = 0
for some
as E C
(4)
s Fix any subset T of {I, 2, ... , 2m}. Then, by (i), XT' XT = ±X0 = ±I and XSXT = ±Xf{, where J( f:. 0 if Sf:. T. Hence, by (iii), tr(XsXT)
=0
if
(5)
Projective Character Tables
238
Since XT . XT
= ±I, we also have tr(XT . XT) =
±2m
(6)
It therefore follows that
o
tr(L asXsXT)
(by (4))
S
tr(aTXT . XT)
(by (5)) (by (6))
Thus aT = 0 as required. (v) By (i) and (iv), each element of G can be written uniquely in the form ±Xs, for some subset S of {1, 2, ... , 2m}. Thus G is of order 2Zm+1 . Since, by (iv), the elements of G span the vector space Mzm(C), we see that G is also irreducible. • Recall from Sec.A that the group
S~
has a presentation
(1 ::; i ::; n - 1, 1 ::; j ::; n - 2, k ::; 1-2) Corollary 5.8. Given an integer n ~ 4, let the integer m ~ 1 be uniquely determined by n = 2m + 1 or n = 2m + 2, and let Yk E GLzm(C) be defined by (2), 1 ::; k ::; n - 1. Then the map
determined by is an irreducible representation of S~.
Proof. By (3) and (7), Pn is a representation of S~. Since PZm+l is the restriction of PZm+2 to S2rn+l' it suffices to consider the case where n = 2m + 1. Now Pn induces a homomorphism 7/J : CS~
-+
M 2m(C)
5 Spin representations and characters of double covers of Sn and An
239
of C-algebras. Since, by (2), each X 1 " •• ,X2m is a linear combination of Y1 , ... , Y2m , we see that each Xi E 1m7jJ, 1 ~ i ~ 2m. Hence, in the notation of Lemma 5.7, Xs E 1m7jJ, for any subset S of {l, 2, ... , 2m}. Therefore, by Lemma 5. 7(iv), 7jJ is surjective, which proves that Pn is irreducible. • We can now introduce the following definition. Let
(n2:4) be the irreducible representation of S~ given by Corollary 5.8. Then, by definition Pn(z) = Pn(9k)2 = y k2 = -I where the last equality follows from (3). Hence pn is a spin representation of S~. To recognize a prominent role played by pn, we shall refer to Pn as the basic spin representation of S~. The character of Pn will be called the basic spin character of S~. In the rest of this subsection, we shall record some technical results concerning the basic spin representation of S~. First, we must develop our vocabulary. Recall, from Lemma 5.7(iv), that the matrices Xs, as S ranges over all subsets of {l, 2, ... , 2m}, form a basis for the vector space of all 2m X 2m _ matrices over
C
= LCsXs, D = LdsXs s
(cs, ds E
(8)
s
where S ranges over all subsets of {1,2, ... ,2m}. We say that C and D are disjoint if csds = 0 for all nonempty subsets S of {1,2, ... ,2m}. It turns out that if C and D are disjoint, then we can explicitly determine tr(CD) in terms of tr(C) and tr(D). In fact, we have Lemma 5.9.
Assume that the matrices C and D in (8) are disjoint.
Then tr(CD) Proof.
= Tmtr(C)· tr(D)
Owing to Lemma 5.7(iii), we have
tr( C)
= 2mc0
and
tr(D)
= 2md0
(9)
On the other hand,
CD
LcsdTXSXT S,T
(by (8))
Projective Character Tables
240
=
L csdsXsXs + L
CSdTXSXT
Sf.T
S
= c0 d0 1 +
L CSdTXSXT
(10)
Sf.T
(since C and D are disjoint)
Taking traces of both sides in (10), we obtain
t1'( C D) =
C0 d0t1'(I)
+L
CSdTt1'(XSXT)
Sf.T (by Lemma 5.7(i), (iii))
T
m
t1'( C) . t1'(D)
(by (9))
as desired. • Recall that the group S~ with presentation (7) determines an exact sequence where f(gd = (i,i + 1), 1 ~ i ~ n - l. Again, we fix an integer n ~ 4. Then n determines a unique integer m ~ 1 such that n = 2m + lor n = 2m + 2. For any k, r E {1, 2, ... , 2m + 2} with k ~ 1', we define g(k,r) E S2m+2 by putting 1
g(k,1') = { gkgk+l ... gr-l
if if
1'=k rf;k
(11)
Of course, if r < 2m + 2, then g(k, 1') E S2m+l' Also, if r f; k, then the image of g( k, 1') in S2m+2 is the cycle
(k,k
+ l)(k + 1,k + 2) .. ·(1' -1,1') = (k,k + 1, ... ,1')
of length r - k + 1. Since g(k, 1') r
= k.
= 1 for r = k, the same applies to
the case
5 Spin representations and characters of double covers of Sn and An
241
Assume that n = 2m + 2 and let
Lemma 5.10.
be the basic spin representation of S~. Let k, r E {I, 2, ... , n} with k < r < n and let g(k, r) E S~ be defined by (1J). Then Pn(g(k,r)) = LCsXs
(Cs E C)
s where S mnges over the subsets of {k - 1,k, ... .r - I} n {1,2, ... ,2m}. Moreover, the coefficients Cs satisfy the following properties: (i) cs = 0 if k > 1 and S = {k - 1, k, ... , r - I}. (ii) Cs = 0 if r - k is even and lSI is odd, or if r - k is odd and lSI is even. (iii) cs = 2(k-r)/2(r/k)1/2 if S = {k,k + 1, ... ,r - I}. (iv) Cs = 2(k-r)/2 if S = 0 and r - k is even. (v) cs = 2(k-r+!)/2 r1/2(2r - 2)-1/2 if S = {r - I} and r - k is odd. Proof. We argue by induction on r - k. If r - k = 1, then g(k, r) = gk. Hence, by definition,
Pn(g(k, r)) = Y k = (2k)-1/2((k
+ 1)1/2 X k -
(k - 1)1/2 X k- 1)
(12)
On the other hand, {k - 1, k, . . . , r - I} = {k - 1, k}, {k, k + 1, ... , r - I} = {k} = {r - I}. Hence all the required assertions follow from (12). Assume that r - k > 1. Then, by applying the induction hypothesis to Pn(g(k, r - 1)), we have
Pn(g(k, r))
Pn(g(k,r - 1))Pn(gr-1) (L dTXT )(2r - 2f1/2(r 1/2X r- 1 - (r - 2)1/2 X r- 2) (13) T
where, by induction, T ranges over the subsets of {k - 1, k, ... , r - 2} n {I, 2, ... , 2m} and the dT E C satisfy (i) to (v), with r replaced by r -1 and Cs by dT . Owing to Lemma 5.7(i), both XTX r- 1 and XTX r- 2 are of the form ±Xs, for some subset S of {k - 1, k, ... , r - I} n {I, 2, ... , 2m}. Hence, by (13), Pn(g(k, r)) can be written in the required form. By Lemma 5.7(i)j XTX r-1 = ±Xs for S = (T - {r -I}) U ({r -I} - T). Hence S =1= {k - 1,k, ... .r - 1} if T =1= {k - 1,k, ... ,r - 2}. The same
Projective Character Tables
242
conclusion holds if XTX r - 2 = ±Xs. This proves (i), by applying (13) and the induction hypothesis. Put S = {k, k + 1, ... , r - I}. Then the coefficient cs of Xs is obtained from XTX r - b where T = {k, k + 1, ... , r - 2}. Hence, by (13) and the induction hypothesis,
cs
2(k-r+1)/2 [(r - 1)/k]1/2 (2r _ 2)-1/2 r1/2 2(k-r)/2( r / k )1/2,
proving (iii). Assume that r - k is even. Then dT = 0 for even ITI, and if ITI is odd, then I(T - {x}) U ({x} - T)I is even for all x. This shows that cs = 0 for odd lSI. Similarly, if r - k is odd and lSI is even, then Cs = 0, proving (ii). Assume that r - k is even and let x E {T - 1,r - 2}. Then (T - {x}) U ({:/;} - T) is nonempty for any subset T of {k - 1, k, .. . ,r - 2}, except for T = {r - 2} and x = r - 2. Hence, for S = 0, we obtain Cs
(2r - 2r 1/ 2( -l)(r - 2)1/2( -1) X 2(k-r+2)/2(r _ 1)1/2(2r _ 4)-1/2 2(k-r }/2
proving (iv). The proof of (v) being similar, the result follows . •
Lemma 5.11. satisfying
Let n = 2m 1
+2
and let ki,rj, 1 :s; i :s; s, be integers
:s; k 1 < r1 < k 2 < .. . < r s :s; n
Then the following two matrices in G L 2m (C) are disjoint :
Here Pn : S~
-+
GL 2m(C) is the basic spin representation of S~.
Proof. Let A and B denote the first and the second matrices, respectively. Each Pn(g(kj, rj)) can be written in the form given by Lemma 5.10 (with k = k j , r = rd. Because r s - 1 < 2m - 1, we can multiply the expressions for Pn(g(kj,rd), 1:S; i:S; s -1, to obtain (dT E C)
5 Spin representations and characters of double covers of S« and An
243
where T ranges over the subsets of {k 1
-
1, ... , Tl
-
1, k 2 - 1, ... , T2 - 1, ... , k s- 1 , .•• , Ts-l - I}
n {I, 2, ... , 2m}
We now distinguish two cases. First assume that T s < n. Then, by Lemma 5.10, we have B = I>sXs (cs E C)
s where S ranges over the subsets of {k s -l,k s , ••. .r; -I} n {1,2, ... ,2m}. Since {k1 -1, . .. ,Ts-l-1} n {k s -l, ... ,Ts -I} = 0 it follows that A and B are disjoint. Next assume that T s = n. Then, by Lemma 5.10,
B
= LbsXs(CX2m+l + dX2m)
(bs,c,d E C)
S
where S ranges over the subsets of {k s - 1,k s , ... ,2m} and Pn(9n-l) CX2m+1 + dX 2m. The productsXsX2m give ±Xf{ for sets J( disjoint from those T occuring in A. The products XsX 2m+l are multiples of X 1X2··· X 2mXs = XL
(say),
by Lemma 5.7(ii). By Lemma 5.10(i), we may assume that S =I- {k s 1, ... ,2m}. Then if k s - 1 :S t :S 2m and t E S, we have tEL. Hence L =I- T for any T occuring in A, as required . •
C. The basic spin character In this subsection, we compute the basic spin character of S~, n ~ 4. Recall from Sec.A that the group S~ has a presentation
S~
=< 91, ... ,9n-l,zI9[ = (9j9j+d 3 = (9k9t)2 = z,
z2
= [Z,9j] = 1 >
(1 :S i :S n - 1, 1 :S j :S n - 2, k:S l - 2) The group
S~
yields the following double cover of Sn :
where
f(9j) = (i,i
+ 1)
(1 :S i :S n - 1)
Projective Character Tables
244
All the general information concerning spin characters of S~ is given by Theorem 5.3. In what follows, we use the following notation pertaining to the partitions of n : Pn is the set of all partitions of n. o Pn is the set of all partitions of n with only odd parts. DPn is the set of all strict partitions of n (Le. partitions of n with distinct parts ). DP;t is the set of all even partitions in DPn . DP;; is the set of all odd partitions in DPn . Next we recall the notation concerning conjugacy classes of Sn and S~. For each A E Pn, we denote by C>.. the conjugacy class of Sn whose elements are of type A. As before, C~ denotes the conjugacy class of S~ containing 9>", where A = (AI ~ A2 ~ ... ~ As) is a partition of nand 9>" E S~ is defined by >.. 9 = Here, by definition,
1I"j
11"111"2"
'1I"s
= 1 if Aj = 1 and, for Aj > 1, (1~j~s)
(1)
where
kj = Al +... Aj-l
if j > 1 and
kj = 0 if j = 1
It will be convenient to use formula (1) even in the case where A = 1, with the understanding that in this case the right-hand side of (1) should be interpreted as 1. To attain a better visual perception of the introduced notation, let us write the elements
in a more explicit fashion : 11"1
9192"'9>"1- 1
11"2
9>"1+19>"1+2'" 9>"1+>"2- 1
5 Spin representations and characters of double covers of Sn and An
(1,2, ... ,Ad (AI + 1,Al + 2, ... ,Al (AI
245
+ A2)
+... + AS-l + 1, Al + ...+ As-l + 2, ... , Al +
(91'" 9'\I-d(g'\1+l'" g'\I+'\2-d··· (g'\I+"+'\s-1+l
+ As-l + As) g'\I+"+'\s-d
Here, in the expression for g", if Aj = 1, then the j- th bracket should be interpreted as 1. What is the significance of the element g,\ E S~ and its conjugacy class C~? A full answer is provided by Theorem 5.3. In this section, we shall use the fact that {C~IA E OPn U DP;;}
is a set of all distinct representatives of associate pairs of conjugacy classes of S~ (see Theorem 5.3(i)). Thus, by Theorem 5.3(iii), (iv), each spin character X of S~ is uniquely determined by the values:
More precisely, if 9 E S~ is not conjugate to g,\ for any A E 0 Pn U D P;; , then exactly one of the following two possibilities occurs: (i) 9 is conjugate to zg'\ for a unique A E OPn U DP;;l, in which case
(ii) 9 is conjugate to g,\ for a unique A rt OPn , A rt DP;;, in which case
x(g) = 0 Of course, the above considerations apply to the basic spin character of S~. This explains why in the theorem below we provide only the values Xn (g,\) for A E 0 P n U D P;;. An advantage of this approach is that we do not have to burden the statement (and the proof) of the result below with a superfluous data. In what follows, for any partition A = (AI ~ ... ~ As) of n, we put l(A) = s. If A E Pn is such that l(A) = 1, then we write A = (n). Thus A = (n) if and only if the corrsponding conjugacy class of Sn consists of all cycles of length n.
Theorem 5.12. (Schur (1911)). Let n ~ 4, let Xn be the basic spin character of S~ and let A E 0 P« U D P;;. Then
Projective Character Tables
246
(i) If n is odd, then Xn is self-associate and
x
Xn(g ) =
{2(1(,\)-1)/2
if if
0
(ii) If n is even, then Xn is not self-associate and
A E OPn A = (n)
if if
otherwise
Proof. If X is an arbitrary C-character of S~, then X is self-associate if and only if X vanishes on all odd elements of S~. Hence it suffices to prove the formulas for Xn(g,\) in (i) and (ii). For the sake of clarity, we divide the proof into a number of steps. Step 1. We know that n determines a unique integer m ~ 1 such that n = 2m + 1 or n = 2m + 2. For any k, r E {I, 2, ... , 2m + 2} with k :::; r, define g(k, r) E S~m+2 by putting if if
g(k, r) = { 1
gkgk+l ... gr-l
Then, for n = 2m
+ 2 and A = (AI
~
A2
~
...
~
r=k r-l=k
As), we have
Let Pn : S~ ---. GL 2m(C) be the basic spin representation of S~. All other notation pertaining to Pn is contained in Sec.B. Step 2. Consider a sequence 1 :::; kl < rl < k 2 < ... < r, :::; 2m, + 2, where s ~ 1, and where (kl,rI) -1= (1,2m + 2) if s = 1. Put a, = r; - ki, 1 :::; i:::; s. We wish to show that if all a; are even otherwise We argue by induction on s. First assume that s = 1. We distinguish two cases: rl < 2m + 2 and rl = 2m + 2. Suppose that "i < 2m + 2. Then, by Lemmas 5.10 and 5.6(iii), we have
5 Spin representations and characters of double covers of Sn and An
247
On the other hand, by Lemma 5.10(ii), C0 = 0 if rl - kI is odd and, by Lemma 5.1O(iv), c0 = 2(kj-rI)/2 if rl - k1 is even, as required. Now consider the case s = 1, "t = 2m + 2, where kI > 1 by hypothesis. Then, by Lemma 5.10, P2m+2(g( k}, rI))
+ 1))P2m+2(g2m+l) (~csxs) (4m + 2)-1/2 [(2m + 2)I/2X2m+I -
P2m+2(g(k1 , 2m
(2m)I/2 X 2m ]
where S ranges over the subsets of {k I - 1, kI, ... ,2m}. By Lemma 5.60ii), we need to calculate the coefficient of X0 = I after multiplying. Now XsX 2m+I f:. ±I for any S in the summation (because Cs = 0 when k1 = 2 and S = {1, ... , 2m} by Lemma 5.100)). Also XsX 2m = ±I only for S = {2m}. If kI is odd, then cs = 0 for S = {2m} by Lemma 5.100i). If k I is even and S = {2m}, then by Lemma 5.10(v),
Cs
= 2(k
Multiplying this by (4m
j-2m)/2(2m
+ 1)1/2(4m)-I/2
+ 2)-I/2(2m )I/2tr(I) yields 2(kJ/2)-1
2m-(TJ -kj )/2 as required. Thus the case s = 1 is established. Turning to the general case, put
Then, by Lemmas 5.11 and 5.9,
tr(AB) Tmtr(A)tr(B) Hence applying the induction hypothesis to tr(A), the desired conclusion follows. Step 3. Here we investigate the case (kI,rl) = (1,2m + 2) and s = 1, by proving that
Projective Character Tables
248
By Lemma 5.10, we have X2rn+2(g(l, 2m + 2)) = tr (L:s csXs)( 4m + 2)-1/2 [(2m + 2)1/2X2rn+1 - (2m )1/2X2m] where S ranges over the subsets of {I, 2, ... , 2m}. By Lemma 5.10, cs = for odd lSI and cs = 2- m(2m + 1)1/2 for S = {I, 2, ... , 2m}. For even lSI, we have XSX2m = ±XK for some J( :f 0, whereas XSX2m+! is a multiple of XsX 1 ••• X 2m = ±XT
°
where T:f 0 unless S = {1,2, ... ,2m}. Thus X2m+2(g(I,2m+2)) is equal to tr [2- m(2m + 1)1/2(4m + 2)-1/2(2m + 2)1/2X 1X2··· X2mX2m+1]
TmT 1/2(2m + 2)1/2tr( i m+! I) (by Lemma 5.7(ii))
as asserted. Step 4. Completion of the proof. Let A = (AI DP;;. First assume that n = 2m + 2 is even. Put
k 1 = l,k 2 = Al + 1, r1 = A1,r2 = Al + A2,
, k, = Al + , rs = Al +
~
...
~
As) E OPn U
+A +1 + As S-1
Then, by (2), g>' = g(k 1, rd··· g(k s, r.) and, clearly, r; - k, = Ai - 1, 1 ::; i ::; s, If k, = ri, then g(ki,ri) = 1, so the equality of Step 2 holds for k; ::; ri (instead of k; < ri). Now assume that A E OPn . Then each ri - k; is even. Hence, by Step 2,
Xn(g>')
=
2m- L:=1 (>';-1)/2 2(s-2)/2
as required. Next assume that A E DP;:. If s = 1, then Al = n, A g>' = g(l, n). Hence, by Step 3, we have
+ 1)1/2 n 2 i / (n/2)1/2 i m +1 (m
(n) and
5 Spin representations and characters of double covers of Sn and An
249
as required. Assume that s f:. 1. Since at least one Ai is even, it follows from Step 2 that Xn(g-') = O. This establishes the case where n is even. Next assume that n = 2m + 1 is odd. Define J.l E Pn+l by J.l = (AI ~ ... ~ As 2:: As+d where As+l = 1. Then gJ.L E S~+1 and Xn(g-') = Xn+l(gJ.L). Since n + 1 = 2m + 2, we may apply the previous case, with n + 1 playing the role of nand J.l the role of A. Assume that A E OPn. Then J.l E OPn+l and so
as required. Finally, assume that Art OPn. Then J.l rt OPn+1 and J.l
f:.
(n+ 1). Hence
and the result follows. • We next examine the restriction of the basic spin character Xn of S~ to By Theorem 5.5, any spin character of A~ is uniquely determined by its values on A~.
For this reason, it suffices to identify the values of the irreducible constituents of (Xn)A;' on each element above. The results below are due to Schur (1911). Theorem 5.13. Let n ~ 4 be even and let J.ln be the restriction of the basic spin character Xn of s~ to A~. Then J.ln is irreducible and
J.ln(g-') = J.ln(g1 1g-'gt} = 2(1(-')-2)/2 J.ln(g-') = 2(/(-')-2)/2 J.ln(g-') = 0
for for for
A E OPn n DPn A E OPn - DPn A E DP;t - OPn
Proof. By Theorem 5.12(ii), Xn is not self-associate. Hence, by Theorem 1.4(ii), J.ln is irreducible. The assertion regarding the values of J.ln follows from Theorem 5.12(ii). • Theorem 5.14. Let n = 2m + l(m > 1) be odd and let J.ln be the restriction of the basic spin characters Xn of s~ to A~. Then J.ln = J.l~ + J.l~
Projective Character Tables
250
for some distinct spin characters characters are as follows:
J.l~
and
J.l~
of
= J.l~(gI1igd = 2(1(>.)-3)/2
for
J.l~(g>') = J.l~(gI1ig1) = 2(1(>')-3)/2
for for
J.l~(g>')
= JL~(i) = 2(1(>')-3)/2 J.l~(i) = J.l~(g>') = 0 J.l~(g>') = (1/2)(1 - i m(2m + 1)1/2) J.l~(gI1g>'gl) = (1/2)(1 + i m(2m + 1)1/2) J.l~(g>') = (1/2)(1 + i m(2m + 1)1/2) J.l~(gI1igd = (1/2)(1 - i m(2m + 1)1/2) J.l~(g>')
for for for for for
A~.
The values of these
A E OPn n DPn, A l' (n) A E OPn n DPn, A l' (n) A E OPn - DPn A E DP;t - OPn A = (n) A = (n) A = (n) A=(n)
Proof. By Theorem 5.12(i), Xn is self-associate. Hence, by Theorem 1.4(i), J.ln = J.l~ + JL~ for some distinct spin characters J.l~ and JL~ of A~. By Theorem 5.12(i), the remaining assertion of the theorem can be reformulated as follows. The characters J.l~ and J.l~ agree on all g\ gIl g>'gl' A E 0 P« n DPn, A1' (n) and also agree on all g>' for A E (OPn - DPn)U (DP;t - OPn). Moreover, for A = (n), J.l~(g>') - J.l~(g>') = -i m(2m
+ 1)1/2
JL~(gI1g>'gd - J.l~(g11lgd = i m(2m
+ 1)1/2
(4) (5)
For the sake of clarity, the rest of the proof will be divided into three steps. Step 1. Here we provide a precise formula for (J.l~ - J.l~)( x) for all x E A~. Let pn : S~ -+ G L 2 m(C) be the basic spin representation of S~. All other notation pertaining to Pn is contained in Sec.B. Setting A = iX2m +1 , we have A2 = I and
(1 ::; k::; 2m)
(6)
Because A 2 = I and tr( A) = 0, there exists a matrix B such that
(7) where I is the identity matrix of degree 2m - 1 . For any matrix C of degree 2m , let C' = B- 1CB. Then, by (6),
(1
s j s 2m)
5 Spin representations and characters of double covers of Sn and An
251
Hence any product of an even number of matrices Pn(gj)' commutes with A'. On the other hand, by (7), the matrices which commute with A' = B- 1 AB are of the form
[~
~]
where C and D are matrices of degree 2m write Pn(x)' in the form
I
.
Hence, for any x E A~, we may
(8)
Setting Jl~(x) = tr(C(x)) and Jl~(x) = tr(D(x)) for all x E A~, it follows that Jln = Jl~ + Jl~, where Jl~ and Jl~ are distinct spin characters of A~. We now closely examine Jl~ - Jl~. First, we note that for x E A~, (Jl~ - Jl~)(x)
0]
tr[C(OX) tr
-D(x)
[A'Pn(x)']
(by (7) and (8))
[Apn(x)] ir [iX 2m+1Pn(x )]
tr
(9) (by the definition of A)
Step 2. that
Here we prove (4) and (5). Setting A = (n), it follows by definition gA
= gl ... gn-1 = gl ... g2m = g(l, 2m + 1)
Hence, by Lemma 5.10, and the fact that pn is the restriction of Pn+1 to we have
(10)
(cs E C)
where S ranges over the subsets of {1, ... , 2m}. 5.10(iii), we have
cs
=T
m(2m+
1)1/2
for
S
S~,
Moreover, by Lemma
= {1,2, ... ,2m}
(11)
Projective Character Tables
252
Now the product X 2m+lXS is a multiple of XT for some T ::f. 0. Moreover, by Lemma 5.7(iii), tr(XT) = 0 for any such T. Thus, by (9), (10) and (11),
tr [iX 2m+12- m(2m + 1)1/2 Xl .. ' X 2m] 2- mi(2m + 1)1/2tr(X1 ... X2mXm+t) T mi(2m + 1)1/2 t r(i m+1I) (by Lemma 5.7(ii))
proving (4). To prove (5), note that, by Clifford's theorem, I ( -1 A) -1 A) "( A) I ( A) Jln 91 9 91 - Jl"( n 91 9 91 = Jln 9 - Jln 9
which proves (5), by applying (4). Step 3. By Step 2, it remains to prove that Jl~ and Jl~ agree on all those x E A~ whose image in An is not cycle oflength n. Since IA~I = 21A n l = n!, we have (n!)-1 LXEA~ IJl~(x) - Jl~(x)12 I I I" /I I " " < Jln' Jln > - < Jln, Jln > - < Jln' Jln > + < Jln' Jln >
2 because Jl~ and Jl~ are distinct irreducible characters of A~. On the other hand, the number of cycles oflength n in An is precisely (n - 1)!. Hence, by (4) and (5), there are exactly 2( n - 1)! elements x in A~ for which
IJl~(x) - Jl~(x )1 2 = I ± i m(2m
+ 1)1/212 = 2m + 1 =
n
Therefore, summing over only those elements above gives
(n!)-1(n - 1)!2n = 2 Thus Jl~(x) = Jl~(x) for all other elements x E A~, as desired . •
6
Spin character tables for
A~
and
S~,
n = 4,5
It is fitting to start this section by reminding that, by Theorems 5.3 and 5.5, the following properties hold :
6 Spin character tables for
A~
and
S~,
n
= 4,5
253
(i) All projective character tables of 5n , n ~ 4, are determined by the character table of 5 n and the spin character table of 5~. (ii) All projective character tables of An, n ~ 4, n f:. 6, 7, are determined by the character table of An and the spin character table of A~. Here we concentrate on the cases where n = 4,5. In case n = 4, the character tables of A 4 and 54 can be constructed in a straightforward manner. A slightely more involved case when n = 5 was presented in Vol.l. Thus all we need is to construct the spin character tables for A 4, As, 54' and 5;. Our construction of spin character tables uses minimal machinery and does not rely on any sophisticated technique. We only use the following : spin orthogonality relations, Frobenius reciprocity and basic spin characters. All general information concerning spin character tables of double covers is contained in Sec.4. We remind the reader that there is a canonical choice of a full set of distinct representatives of associate pairs of conjugacy classes of 5~ and A~ (see Theorem 5.3(i) and 5.5(i)). Our spin character tables will correspond to this choice. Recall that the group 5~ has a presentation
(1
~
i ~ n - 1, 1 ~ j ~ n - 2, k ~ l - 2)
and that the map f: 5~ ~ S«, f(g;) = (i, i+ 1),1 :S i ~ n-1, is a surjective homomorphism with kernel < z >. By definition, A~ = f-l(A n ) . For any partition A of n, g>' denotes the element of 5~ introduced prior to Lemma 5.2. It will be convenient to denote a partition A = (AI ~ .,. ~ As) ofn by (Al, ... ,A s ) . Repetitions of equal parts will be avoided by the use of exponents. For example, (3, 1, 1) will be abbreviated by (3,1 2 ) . The identity conjugacy class of A~ and 5~ will be denoted by [In]. Lemma 6.1. Let A = (3,1) and let [3,1] and [3,1]' denote the A 4conjugacy classes of g>' and g1'lg>'gl' respectively. Then {[14],[3,1],[3,1]'} is a full set of distinct representatives of associate pairs of conjugacy classes of A 4·
We have OP4 n DP4 = {(3, I)}, OP4 - DP4 = {(1 4 )} and DPt - OP4 = 0. Hence the required assertion follows by Theorem 5.5(i). • Proof.
254
Projective Character Tables
Theorem 6.2.
The spin character table for A 4 is as follows:
Al A2 A3 where
e is
[14 } [3, I} 2 1 [ 2 ["I. 2
[3,1 J' 1 [2 [
a primitive cube root of 1.
Proof. The top row of the required conjugacy classes of A 4 is taken from Lemma 6.1. The spin character Al corresponds to J.l4 in Theorem 5.13. The group A4 has a normal subgroup N of index 3. Hence the inverse image N* of N in A4 is a normal subgroup of A4 of index 3. The images of g>' and gl lg>'gl in A4 are (123) ad (123)2, respectively. Therefore there exist linear characters 11 and 12 of A 4 such that
This proves the required assertion by setting A2
= AliI
and A3
= A1 / 2• •
Let [3, I) be the 5 4-conj ugacy class of g>' for A = (3,1) and let [4} be the 54-conj ugac y class ofg>' [or X = (4). Then {[1 4 ], [3,1]'[4}} is a full set of distinct representatives of associate pairs of conjugacy classes
Lemma 6.3.
of 54'
Proof. We have OP4 = {(3, 1), (14 )} and DP4required assertion follows by Theorem 5.3(i) . • Theorem 6.4.
The spin character table for
Al A2 A3
[1'l } 2 2
4
[3, I} 1 1 -1
54
{(4)}. Hence the
is as follows:
[4} -V2 V2 0
Proof. The top row of the required conjugacy classes of 54 is taken from Lemma 6.3. The character Al is the basic spin character of 54 whose values are given by Theorem 5.12(ii). The character A2 is the associate
6 Spin character tables for
A~
and
S~,
n
=:
4,5
255
of AI' Let A3 be the remaining spin character. By Theorem 4.4(ii) (with C, = C, = {1}), we have A3([1 4]) = 4. Put A3([3,1]) = x and A3([4]) = y. Then, by Theorem 4.4(ii), 2 + 2 + 4x = 0 and
- 2V2 + 2V2 + 4y = 0
Hence x = -1 and y = 0, as required. • Lemma 6.5. Let [5] and [5]' be the A~ -conjugacy classes of g>' and g)"lg>'gl' respectively, where A = (5), and let [3,1 2 ] be the A~-conjugacy class of s", where J-L = (3,1 2). Then {[1S] , [5], [5]', [3, 12]} is a full set of distinct representatives of associate pairs of conjugacy classes of A~. Proof. We have OPs n DPs = {(5)}, OP s - DPs = {(3, 12), (1S)} and DPt - OPs = 0. Thus the desired conclusion follows by virtue of Theorem 5.5(i) . • Theorem 6.6.
J-Ll J-L2 J-L3 J-L4
The spin character table for [1S ] 2 2 6 4
[5] (1/2)(1 + V5) (1/2)(1 - V5) -1 1
A~
is as follows:
[5]' (1/2)(1 - v'5) (1/2)(1 + v'5) -1 1
[3,1 2] 1 1 0 -1
Proof. The top row of the required conjugacy classes of A~ is taken from Lemma 6.5. The spin characters J-Ll and J-L2 correspond to J-L~ and J-L~, respectively, given by Theorem 5.14. Let J-L3 and J-L4 be the remaining spin J-Li(1)2 = IAsl = 60. Hence, characters of A~. Now, by Theorem 4.4(ii), 2 setting x = J-L3(1) and y = J-L4(1), we have x + y2 = 52. But both x and y are even by Theorem 5.5(v). Hence x = 6, y = 4 or x = 4, y = 6. Thus we may assume that J-L3([1 S ]) = 6 and J-L4([1 S ]) = 4. Let J-L be the restriction of J-L3 to A 4. Since (A~ : A 4) = 5, it follows from Frobenius reciprocity and Theorem 6.2 that J-L = Al + A2 + A3, where Ai are as in Theorem 6.2. Therefore, by Theorem 6.2, 113([3,1 2]) = 1 + e + [2 = O. Next we note that J-Ll and 112 both restrict in A 4 to AI. Hence A~~ = J-Ll + J-L2 + J-L3, by Frobenius reciprocity. Since A~5([5]) = A~5([5]') = 0, we
ti;
Projective Character Tables
256
deduce that and /L3[5'J
= -/Ll([5J') -
/L2([5J')
= -1
Applying the spin orthogonality relation (Theorem 4.4(ii)) to the first and the fourth columns, we have 2 . 1 + 2 . 1 + 6 . 0 + 4 . /L4([3, 12]) = 0 Hence /L4([3, 12]) = -1. Therefore, applying the spin orthogonality relation to the third and fourth columns, we obtain /L4([5J') = 1. Similarly, applying the spin orthogonality relation to the second and fourth columns, we obtain /L4([5J) = 1, as required . • Our next task is to determine a full set of distinct representatives of This is accomplished in the lemma associate pairs of conjugacy classes of below.
Ss'
Lemma 6.7. Let [5],[4, IJ, [3,2J and [3,1 2] be the S;-conjugacy classes of gA [or ); = (5), (4,1), (3, 2) and (3,1 2), respectively. Then
{[lsJ, [5], [4, 1], [3,2], [3, 12 ]} is a full set of distinct representatives of associate pairs of conjugacy classes of S;.
Proof. We have OPs U DPs- = {(5), (3, 12), (15), (4,1), (3, 2)}. Hence the desired assertion follows by applying Theorem 5.3(i). • We are now ready to prove our final result.
Theorem 6.8.
The spin character table for S; is as follows;
11 12 13 14 15
[15J [5J [4,IJ 4 1 0 6 -1 y2 6 -1 -Y2 4 1 0 4 1 0
[3,2J
0 0 0 y3 -y3
[3,1 2J 2
0 0 -1 -1
6 Spin character tables for
A~
and
S~,
n
= 4,5
257
Proof. The top row of the required conjugacy classes of 55 is taken from Lemma 6.7. The spin character /1 corresponds to X5 in Theorem 5.12(i). By Theorem 5.3(v), the number of associate pairs of spin characters of s; is equal to ID Pi I = 2. Since 1'1 is self-associate, we may assume that /3 = /~ and /5 = /~. Setting x and y to be the degrees of /2 and /4, it follows that x 2 + y2 = 52. By Frobenius reciprocity and the fact that has a spin character of degree 6 (see Theorem 6.6), either x or y must be equal to 6. We may assume that x = 6, in which case y = 4. Thus the first row and the first column of the table are verified. We now use notation of Theorem 6.6. It is clear that /1 is induced from Pl. If the restriction of /4 to contains PI or P2, then /4 is induced from PI, which is impossible. Hence /4 restricts to P4 and so
A;
As
/5([5]) 1'5([3,1
2
])
1'4([5]) = }-l4([5]) = 1 /4([3,1 2]) = }-l4([3, 12 ])
= =
= -1
It is clear that 1'2 restricts to P3. Hence
/3([5]) 1'3([3,1
2
])
= =
/2([5])
= P3([5]) = -1
/2([3,1
2
])
= P3([3, 12]) = 0
Next we use the notation of Theorem 6.4. By Frobenius reciprocity and Theorem 6.4, /2 restricts to the sum of distinct irreducible characters of 54'. Since /2 vanishes on [3, 12], we have
= A2 + A3 or (/2)S; = A2 + A3
(/2)S; We may assume that by /2)' Then
1'2([4,1])
=
1'2([3,2]) =
(/2)S; = Al + A3 (otherwise, rename /2 by /3 and 1'3
A2([4]) + A3([4]) = -12 A2([3, 1]) + A3([3, 1]) = 0
Hence /3([4,1]) = -..;2, /3([3,2]) = 0 and the spin orthogonality relation applied to the third and fourth columns yields 1'4([4,1]) = 1'5([4,1]) = O. Finally, let 9 = gA for A = (3,2). Then g1 1991 = g-l and so /4([3,2]) is a real number. Hence, by the spin orthogonality relation applied to the fourth column, we see that /4([3,2]) = ±J3. Since we may assume that 1'4([3,2]) = J3 (by renaming 1'4 by 1'5 and /5 by /4, if necessary), the result follows. •
258
7
Projective Character Tables
Dihedral groups
In what follows, n 2:: 2 is an integer and D n denotes the dihedral group of order 2n defined by
Dn
=< a, blan = 1, b2 = 1, bab- 1 = a- 1 >
Recall that the Schur multiplier M(D n ) of D n is given by
n
if if
n
is odd is even
(see Corollary 10.1.27 in Vo1.2). For this reason, our interest lies only in the nontrivial case where n is even. In that case, to determine all projective character tables of D n we must find the character table of D n (which is a trivial task] and the a-character table of Dn , where 0' E Z2(D n , C*) is such that its cohomology class is of order two. It is the principal aim of this section to construct such an a-character table. Unlike in our previous discussions, we do not appeal to a covering group of D n . Instead, we provide an explicit formula for 0' and then exhibit all irreducible a-representations of Dn . This is, of course, far more than is needed. To accomplish such a goal for a more complicated group would be a formidable task. Let n 2:: 2 be an even integer, let c be a primitive n-th root of 1 in C and let be defined by
(1) (0
~
i, j
~ n -
1, k
= 0,1)
For each r E {I, 2, ... , n/2}, put
[~ Consider the map defined by (0
~
i ~ n - 1, j = 0,1)
7 Dihedral groups
259
We are now ready to accomplish our aim, which is to prove the following result.
Theorem 7.1. Let n 2 2 be an even integer. Then, with the notation above, the following properties hild : (i) a E Z2(D n,C*) and the cohomology class oj o is of order two. (ii) PI, P2, ... ,Pn/2 are all linearly nonequivalent irreducible a-representations of D n. ' (iii) There exists exactly n/2 a-regular conjugacy classes of D n, namely
{I}, {a, a-I}, {a 2, a- 2}, .. . , {a(n/2)-I, a-((n/2)-I)} (iv) The elements Zo
=I
and
Zi
= ai + Eia- i, 1 ::; i::; (n/2) -
1
constitute a C-basis for the center of CD' D n. (v) Every irreducible projective representation of D n over C is either projectively equivalent to an ordinary representation of D n or projectively equivalent to an a-representation Pi for a suitable i E {I, ... , n/2}. Proof. satisfy
(i) and (ii). The matrices P" (a)
= Ar
and pr(b)
= B;
Pr(at = I, Pr(b)2 = I, Pr(b)Pr(a)Pr(b)-1 = EPr(a)-1
clearly
(2)
Hence Pr is a ,6-representation of D n for some,6 E Z2(D n , C*). By definition,
Pr(ai)Pr(ajbk)P1'(ai+jbkrl (0::; i.i j Pre a)i P1'(a)j P1'(bl(Pr( a )i+ P1'( b)k 1 Prea)i p,.(a)j Pre b)kP1'( b)-kPre a )-i- j
r
:
n - l,k
= 0,1)
1
(3)
and
Pr(aib)Pr(ajbk)Pr(aibajbk)-1 Pr(aib)Pr(ajbk)p1'(ai+n-jbk+l)-1 Pre a)i Pre b)Pr(a)j Pr(b)k(p1'( a)i+n- j Pre b)k+l )-1 E
j
(by (2))
(4)
Projective Character Tables
260
Hence, by (3) and (4), (3 = a E Z2(D n , C*). Next we note that an / 2 E Z(D n ) . Since a(a n / 2 , b) == 1 and
we see that a n / 2 is not a-regular. Hence a is not a coboundary, Since M(D n ) is of order two, it follows that the cohomology class of a is of order two. Since a is not a coboundary, all irreducible a-representations of D n have degree 2: 2. Thus each pr is an irreducible a-representation of Dn, 1 ::; r ::; n/2. By looking at the restriction of Pr to < a >, it follows that PI,." ,pr are linearly nonequivalent. Since n/2 ~(degpi)2 = 2n ==
ID n )
i=l
we conclude that PI,'" ,Pn/2 are all linearly nonequivalent irreducible arepresentations of D n , proving (i) and (ii). (iii) By (ii) and Theorem 6.1.1 in Vo1.2, Dn has precisely n/2 a-regular conjugacy classes. Note that for each i E {I, 2, ... , (n/2) - I}, baib- l = a- i
:f ai
for otherwise a2i == 1, so (a i)2 = 1, contrary to the fact that a n / 2 is the only element of order two in < a >. It follows that for each i E {I, 2, ... , (n /2) I}, CDn(a i) ==< a ». Because for all x E< a >, 1::;
i::; (n/2) -
1
it follows that each ai, 1 ::; i ::; (n/2) - 1 is a-regular. Since 1 is a-regular, the desired conclusion follows. (iv) By (iii) and Theorem 2.6.3 in Vol.2, we have
Hence we need only verify that
1::; i::; (n/2)-1 The latter being a consequence of the equalities
8 Projective character tables for P S L2 ( q)
261
the required assertion follows. (v) Apply (i), (ii) and the fact that M(D n) is of order two. • Let n 2': 2 be an even integer, let m
Corollary 7.2. o
=
n/2 and let
E Z2(D n, C*) be defined by (1). For each i E {O, 1, ... , m - I}, let [ail be
the conjugacy class of a i . Then the a-character table of D n is as follows:
X2
[1] 2 2
Xm
2
Xl
[a 2 ]
[a] E+1 2 E + E- I Em
+ C(m-l)
+1 + E- 2
E~ 4
E
E2m + c 2(m- I)
... ... ...
E 2(m-l)
+ E-(m-Ij
...
Em(m-l)
+ E-(m-l)"
[am-I] Em ·1 + 1
Proof. Owing to Theorem 7.1, [1], [aJ, ... , [am-I] are all distinct 0regular conjugacy classes of D n . For each r E {l, ... ,m}, let Xr be the character of the irreducible o-representation Pr of D n given by Theorem 7.l. Since (O~i~m-1)
we have (1
:s: r
~
m, 0
~
i ~ m - 1)
as desired. •
8
Projective character tables for PSL 2 (q)
A. Introduction After devoting some attention to such classical groups as Sn and An' we now examine projective character tables of PSL 2(q), where q is a prime power. Our goal is to provide all projective character tables for P S L 2 ( q), with the exception of the o-character table for P S L2(9) ~ A 6 , where the cohomology class of 0 E Z2(PSL 2 (9),C* ) is of order 3 or 6. By Theorem 16.3.2 in Vo1.2, if q =J 4,9, then SL 2 (q) is a unique covering group of PSL 2(q) and the Schur multiplier M(PSL 2(q)) is given by if if
q is even is odd
q
Projective Character Tables
262
In the exceptional cases q = 4,9, we have
M(PSL 2(4)) M(PSL 2(9))
!::>:! !::>:!
Z2 Z6
and
PSL 2(9) ~ A6 , PSL 2(4) = SL 2(4) ~ As (see Theorems 16.3.2 and 16.2.5 in Vo1.2). A process of obtaining all projective character tables of a finite group G from the character table of a covering group of G is described by Theorem 1.2. Our principal aim is to construct the character table of S L 2 ( q). Since, for q f:. 4,9, SL 2(q) is a covering group of PSL 2(2), this will provide all projective character tables of P S L 2 ( q), q f:. 4,9. It is natural to investigate separately the cases q is even and q is odd. In the former case, we have PSL 2 (q) = SL 2(q) and in the latter case
(where z = diag( -1, -1)), is a double cover of PSL 2(q). Thus, in case q is odd, the ordinary character table of SL2(q) will provide us with the following data: (i) The ordinary character table of P SL2(q). (ii) The spin character table of SL 2 (q). As usual, our procedure starts by examining conjugacy classes of the underlying groups. The next subsection contains all the relevant background. B. Conjugacy classes of SL 2(q) and PSL 2(q) Assume that q is a prime power and let Irq denote the finite field of q elements. Recall that GL 2(q) is the group of all nonsingular 2 X 2-matrices over Irq. By definition, the subgroup SL 2(q) ofGL 2(q) consists of all matrices of determinant 1. Recall also that, by definition,
By Lemma 16.2.1 in Vo1.2,
Z(SL 2(q))
1 if q is even
Z(SL 2(q))
( [ -01
_°1 ])
if q is odd
8 Projective character tables for PSL 2 (q)
263
By Lemma 16.2.2 in Vo1.2,
ISL 2(q)1 = q(q - 1)(q + 1) We now record some elementary group-theoretic facts. Lemma 8.1. Let>. be a primitive element in Ir q2 (i.e. >. is a generator Ojlr;2), let fl = >.q+1 and let G = SL 2(q). (i) The map b : x f-t >.q-1 x, x E Ir q2, is an element of G and the order of b is q + 1. (ii) For any g E< b > of order> 2, we have Gc(g) =< b >. Moreover, if g is conjugate in G to gt for some integer t, then gt E {g,g-l}. (iii) The matrix a = diag(fl, /1-1) is an element of order q - 1 in G. (iv) For any 9 E< a > of order> 2, we have Gc(g) =< a >. Moreover, if 9 is conjugate in G to gt for some integer t, then gt E {g,g-l}.
Proof. (i) Consider GL 2 (q) in its natural action on a two-dimensional vector space V over Irq. We can identify V with the additive group of Ir q2. Hence left multiplication by >. effects a linear transformation ip of V of order q2 _ 1. In particualr,
.i(q-l). (ii) Assume that 9 E< b > has order> 2, say 9 = Then 9 : x f-t 'i'oX and (q + 1) t 2i. If'i'o E Irq, then >.i(q-l)2 = 1 and so q + 1 divides i(q - 1). If q is odd, then (q - 1,q + 1) = 2 and so (q + 1)12i, which is impossible. If q is even, then (q - 1,q + 1) = 1 and so (q + 1)li, which is again impossible. Thus 'i'o tf. Irq and so {1, 'i'o} is an Irq-basis of Ir q2 . Let y E GL2(q) satisfy vsv:' = gt. Then yg = s'v and so
v;
Y(/08) = yg(8) = (gt y)(8) = 'i'by(8)
for all
8 E Ir q2
(1)
It follows that for any f3 E Irq,
y(g(f3)8)
y(/0f38) f3y( 'i'08) f3'i'bY( 8)
= Let 1/J : Ir q2
---+
l(f3)y(8)
IF'q2 be defined by
1/'( a
+ 'i'0(3) = a + 'i'b(3
(by (1»
(2)
Projective Character Tables
264
Then 7/J(a and
+ g(,8)) = a + gt(j3).
If l' = a
y(f6) =
+ 1'013,6 E f q2, then l' = a + g(j3)
=
y((a+g(j3))6) (a+g t(j3))y(6)
=
7/J(f)y(6)
(by (2)) (3)
, , , 1Il' h . Hence, given l' ,1' E Jr q2, we ave
7/J(f'1''')y( 1) =
y(f'1''')(by (3) with l' = 1"1''', 6 = 1)
=
7/J( i')y( 1''')
=
7/J( 1")7/J(f")y( 1)
(by (3))
(by (3) with l' = 1''', 6 = 1)
Thus 7/J( 1"1''') = 7/J(f')7/J(1'''), so 7/J is an automorphism of f q2 which is trivial on fq. Hence 7/J E Gal(f q2/fq) and so 7/J = 1 or 7/J(x) = x q for all x E f q2. 1 It follows that 7/J(fo) E hO,1'6}. But 1'6+ = 1, so 1'6 = 1'0 1 and 7/J(fo) E 1 ho, 1'0 } . Thus l is either the map l' ........ 1'01' or the map l' ........ 1'0 11', which shows that gt E {g,g-l}. Finally, assume that ygy-1 = 9 for some y E G. Then t = 1, so by the definition of 7/J, 7/J(f) = l' for all l' E f q2. Applying (3) for 6 = 1, it follows that
y(f) = 1'y(l) This shows that y E <
t.p
>, where Y E<
t.p
t.p :
l' ........ A1'. Thus
> nSL 2 (q) =< b >
proving (ii). (iii) Since pq-1 = Aq2_1 = 1, we see that =< p >. It is now obvious that a = diag(p,p-l) is an element of order q - 1 in SL 2 (q). (iv) Let 9 E < a > be of order > 2. Then 9 is a diagonal nonscalar matrix. Hence GG(g) consists of diagonal matrices of determinant 1 and so GG(g) =< a>.
f;
8 Projective character tables for PSL2(q)
265
Let H consist of all h E G with h- 1gh diagonal. Then H is the set of matrices of the form
{[~
~]}
It follows that
Nc( < 9
» ==
H == (Gc(g), [
~
and so (H : Gc(g)) == 2. Because
[~ -~ r[~
1~-1] [~
we see that 9 is conjugate to g-l in G. But then 9 and powers of 9 conjugate to 9 in G, as required. •
«:'
are the only
Theorem 8.2. Let q be an odd prime power, let {l be a generator of the cyclic group IF; and let the element b of order q + 1 in S L 2( q) be defined as in Lemma 8.1 (i). Put 1 == [
~
o1 ] ,z == [ -10 d ==
[
~
~]
-01] ' e == [ 11
~ ] , a == [ ~
~-1]
For any 9 E SL 2(q), let [gl be the conjugacy class of SL 2(q) containing g. Then SL2(q) has precisely q + 4 conjugacy classes:
[a], [a 2 ],
[1]' [z], [e], [dl, [zel, [zdl . . . , [a(1/2j(Q-3)1, [bl, [b 21, ... , [b(1/2)(Q-1)1
(if q == 3, then the terms [ail should be deleted). Moreover, the cardinalities of these conjugacy classes are :
1[111 == l[zll==l
I[ell == I [d] I == I[zell
== I [zdll == (1/2)(q2 - 1)
I[anll
== q(q+1)
(1~n~(1/2)(q-3))
I[ bml l
==
(1 ::;
q(q - 1)
m::; (1/2)(q -
1))
Projective Character Tables
266
Proof. Note that if c and d are conjugate in G = S L 2 (q), then Jl is a square in IF;, which is impossible. Write q = pn for some prime p and some n ~ 1. Then e and d are of order p, while ze and zd are of order 2p. Thus the conjugacy classes of e, d, ze and zd are all distinct. In addition, we have obviously another two conjugacy classes, namely [I] and [zJ. One easily verifies that
Co(e) Hence
ICo(e)1 =
= Co(d) = {[ ;
ICo(d)1 = 2q and therefore
\[eJI = I[d]1 = lQl = q(q + l)(q 2q
2q
1)
= ~(q2 _
1)
2
It is clear that [zcJ and [zd] have the same cardinality above. By Lemma 8.1, [amJ, ibm], 1 ~ n ~ (1/2)(q- 3), 1 ~ m ~ (1/2)(q-1) are distinct conjugacy classes of G which have prescribed cardinalities. Adding up the cardinalities of the listed conjugacy classes of G, we obtain: 1 + 1 + 4· Since
IGI =
~(q2 - 1) + ~(q - 3)q(q + 1) + ~(q - l)q(q - 1) = q3 - q 2 2 2
q3 - q, the result follows. •
In what follows, we keep the notation of Theorem 8.2.
Let q be an odd prime power. Then (i) a-I is conjugate to a and b- I is conjugate to b. (ii) zan is conjugate to a(I!2)(q-I)-n, 1 ~ n ~ (1/2)(q - 3). (iii) zb" is conjugate to b(1!2)(q+I)-m, 1 ~ m ~ (1/2)(q - 1).
Corollary 8.3.
Proof. (i) Since l[aJj = l[a-IJj and I[bJI = I[b- I ]I, it follows from Theorem 8.1 that a-I is conjugate to an and b- I is conjugate to b" for some 1 ~ n ~ (1/2)(q - 3), 1 ~ m ~ (1/2)(q - 1). Hence, by Lemma 8.1(iv), an E {a-l,a} which forces an = a. Similarly, by Lemma 8.1(ii), b'" = bas required. (ii) By 0), an is conjugate to a- n and so zan is conjugate to za- n. Since z = a(I!2)(q-I), the required assertion follows. (iii) By (i), bm is conjugate to b- m and so zb": is conjugate to zb"'", Since z = b(1!2)(q+l), the required assertion follows. •
8 Projective character tables for P 5 £2 (q)
267
Assume that q is an odd prime power. Then SL 2(q) is a double cover of PSL 2(q) : Hence we may apply the terminology pertaining to double covers. For convenience, let us recall the following piece of information. For any conjugacy class C of S L 2 ( q), the set zC = {zxlx E C} is another conjugacy class of SL 2(q). We refer to zC as the associate of C. We say that C is selfassociate if C = zC. If C is not self-associate, then {C, zC} is called an associate pair of conjugacy classes of SL 2(q). A conjugacy class of PSL 2(q) splits in SL2(q) if its inverse image in SL2(q) is a union of two conjugacy classes of SL 2(q). Thus, if C is a conjugacy class of SL 2(q) whose image in PSL 2(q) is D, then D splits in SL 2(q) if and only if C is not self-associate. Finally, recall that a group G is ambivalent if each element of G is conjugate to its inverse. Our next task is to identify associate and self-associate conjugacy classes of SL 2(q). It turns out that the answer depends on whether q == 1(mod4) or q == -1(mod4) (since q is odd, these are the only possibilities). Using the notation of Theorem 8.2, we now prove
Theorem 8.4. Let q be an odd prime power and let q _ 1( mod 4). Then (i) S L 2(q) is ambivalent. (ii) [a(I/4)(q-l)] is the only self-associate conjugacy class of SL 2(q). (iii) [1], [c], [d], [a], [a 2], ... , [a(1/4)(q-5)J, [b], [b 2], ... , [b(1/4)(q-l)] are all distinct representatives of associate pairs of conjugacy classes of S L 2 ( q) (by convention, if q = 5, then all terms [ail should be deleted). (iv) The group PSL 2(q) has precisely (1/2)(q + 5) conjugacy classes, namely the images in PSL 2(q) of all conjugacy classes of SL 2(q) described in (ii) and (iii). (v) If the cohomology class of 0' E Z2(PSL 2(q),C") is of order two, then PSL 2(q) has precisely 1/2(q + 3) a-regular conjugacy classes, namely the images in PSL 2(q) of all conjugacy classes of SL 2(q) described in (iii). Proof. (i) Since q == 1(mod4), we see that 41IIr;l. Hence the element -1 of order two in F~ is a square in F~, say -1 = Therefore
,2.
o ] -1
-,
[~
268
Projective Character Tables
o ] -1 1
'
proving that c is conjugate to c- 1 and d is conjugate to a:', Hence zc is conjugate to (zc)-1 and zd is conjugate to (zd)-I. This proves (i), by applying Corollary 8.3 and Theorem 8.2. (ii) That [a(I/4)(q-l)] is a self-associate conjugacy class follows from Corollary 8.3(ii) by taking n = (1/4)(q - 1). The uniqueness is a consequence of property (iii) proved below. (iii) Since q == 1(mod4), we see that (1/2)(q - 3) is odd and (1/2)(q - 1) is even. Hence the desired assertion follows by applying Corollary 8.3(ii), (iii) and Theorem 8.2. (iv) This is a direct consequence of (ii) and (iii). (v) By Theorem 16.1.7 in Vo1.2, SL 2(q) is perfect (since q::J 2,3). Thus we have z E [SL2(q), SL 2(q)J. By Theorem 16.3.2 in Vo1.2, M(PSL 2(q)) has exactly one element of order two. Since a-regularity depends only on the cohomology class of a, we may assume that a is as in Theorem 4.5. Hence the desired assertion follows by applying (iii) and Theorem 4.5(i) . •
Theorem 8.5. Let q be an odd prime power and let q == -1(mod4). Then the following properties hold (i) SL 2(q) is not ambivalent. In fact, SL 2(q) has precisely four irreducible C-characters which are not 'R.-valued. (ii) [b(1/4)(q+l)] is the only self-associate conjugacy class of SL2(q). (iii) [1J, [c], [d], [a], [a 2], ... , [a(1/4)(q-3)], [b], [b 2], . . . , [b(I/4)(q-3)] are all distinct representatives of associate pairs of conjugacy classes of S L 2(q) (by convention, if q = 3, then all terms [ail, [fJJ] should be deleted). (iv) The group PSL2(q) has precisely (1/2)(q + 5) conjugacy classes, namely the images in PSL 2(q) of all conjugacy classes of SL 2(q) described in (ii) and (iii). (v) If the cohomology class of a E Z2(PSL 2(q),C*) is of order two, then PSL 2(q) has precisely (1/2)(q+3) a-regular conjugacy classes, namely the images in PSL 2(q) of all conjugacy classes of SL 2(q) described in (iii). Proof. But if
(i) Since q == -1(mod4), we see that -1 is not a square in
r;.
8 Projective character tables for P S L 2 (q)
269
for some x, y, z, u E r q with xu-yz = 1, then y = 0, u = -x, a contradiction. Thus c is not conjugate to c- I . Since q == -1(mod4), we see that (1/2)(q - 3) is even. Since 4 f Ir;1 and hence J.l2 is a square in we deduce that J.l(1/2)(q-3) = x 2 for some x E Hence
r;,
0][ -11
X [
1
x-I
r;.
O][x 1 1
r
[~ ~ ]
which shows that c l is conjugate to d. Hence (zc)-I is conjugate to zd, d- I is conjugate to c and (Zd)-I is conjugate to zc. Applying Theorem 8.2 and Corollary 8.3(i), we deduce that there are precisely four conjugacy classes C of SL 2(q) with C::j:. C- I . Hence, by Corollary 17.5.2 in Vol.I, SL 2(q) has precisely four irreducible (.>characters which are not R-valued. (ii) That [b(1/4)(q+I)] is a self-associate conjugacy class follows from Corollary 8.3(iii) by taking m = (1/4)(q+ 1). The uniqueness is a consequence of property (iii) proved below. (iii) Since q == -1(mod 4), we see that (1/2)(q-3) is even and (1/2)(q-l) is odd. Hence the desired assertion follows by applying Corollary 8.3(ii), (iii) and Theorem 8.2. (iv) This is a direct consequence of (ii) and (iii). (v) By the proof of Theorem 8.4(v), we need only show that
for q = 3. But, for q = 3, SL 2(q) is a covering group of PSL2(q) (see Theorem 16.3.2 in Vo1.2), as required. • Turning to the case where q is even, we now prove our final result.
Theorem 8.6. Let q = 2t for some t 2: 1, let J.l be a generator of the cyclic group and let the element b of order q + 1 in S L2(q) be defined as in Lemma 8.1 (i). Put
r;
1= [
~
For any g E SL 2(q), let [g] be the conjugacy class of SL 2(q) containing g. Then S L 2 ( q) has precisely q + 1 conjugacy classes: 1 ~ n ~ (1/2)(q-2),
1 ~ m ~ q/2
Projective Character Tables
270
Moreover, the cardinalities of these conjugacy classes are:
1[1]1 n
I[a
]
=
I =
1,I[c]l=q2-1 q(q + 1) (1 ::; n ::; (1/2)(q - 2)}
(1 ::; m ::; q/2)
Proof.
Setting G = SL 2(q), we have Ca(c)
= =
{ [
{[
Xy
~ ] lx, y E Irq, x2 = 1}
~ ~ ] Iy E Irq}
Hence we have
ICc(e)1
=q
which implies that l[e]1 = q2 - l. By Lemma 8.1, [an], [b m], 1 :S n :S (l/2)(q- 2), 1 :S m :S q/2, are distinct conjugacy classes of G which have prescribed cardinalities. Adding up the cardinalities of the listed conjugacy classes of G, we obtain
1·1+ 1· q2 + (1/2)(q - 2)(q + 1)2 + (1/2)q(q - 1)2 = q(q2 - 1) =
IGI
as desired . •
c.
The character table for SL2(q)
All characters below are assumed to be C-characters. We begin by providing the character table for SL 2 (q), where q is an odd prime power. All conjugacy classes of SL 2 (q) are given by Theorem 8.2. Note that for any irreducible character X of SL 2 (q), we have
x(ze)
x(z) X(z) = -( )x(e), X(zd) = -()X(d) Xl· X1
for this reason, the columns for the conjugacy classes [zc] and [zd] of SL 2(q) are missing in the character table below.
8 Projective character tables for P S L 2 (q)
271
Theorem 8.7. (Schur (1907), Jordan (1907)). Let q be an odd prime power, let v = (_1)(1/2)(q-1), let c be a primitive (q - l)-th root of 1 in C and let 6 be a primitive (q + 1)-th root of 1 in C. Then the character table for G = SL 2(q) is
[lJ Ie
A (Yi
{3j Xl
X2 /1
/2
1 q q' q" q'/2 q'/2 q"/2 q"/2
where [in
[anJ 1 1 [in
[bmJ 1 -1
[cJ 1
[dJ 1
0
0
0
0
s.;
( _1)n ( _l)n
0 0
1 -1 (1/2)(1 + JVCj) (1/2)(1 - Jvq) (1/2)(-1 + JVCj) (1/2)(-1 - JVCj)
1 -1 (1/2)(1 - JVq) (1/2)(1 + y'i/q) (1/2)(-1 - JVq) (1/2)(-1 + ViJq)
1
(-lr+ (-1r+ 1
0 0
= [in + e:'",
6jm
= _(6 jm + 6- jm),
q'
= q + 1, q" = q -
1 ~ i ~ (1/2)(q - 3),
1 ~ j ~ (1/2)(q - 1)
1 ~ n ~ (1/2)(q - 3),
1 ~ m ~ (1/2)(q - 1)
z 1 q (_l)l q' (-1)1 q" ~vq'
~vq' - ~vq" - ~vq"
1
Proof. For the sake of clarity, we divide the proof into a number of steps. Step 1. Here we demonstrate that the functions A, (Yi, 1 ~ i ~ (1/2)( q - 3) are irreducible characters of G = SL2(q). We denote by S the set of all nonzero squares in IF'q. Then lSI = (1/2)(q - 1). Now put
P={[~ and H
={[ ;
~]IXElF'q}
~-1] Ix E IF'q, y E IF'; }
By hypothesis, q = pk for some odd prime p and some k ~ 1. It is clear that P is a Sylow p-subgroup of G. Moreover, we also have P
< a >, Pn < a > = 1
and
IHI
=
IPII < a> I =
q(q - 1)
Projective Character Tables
272
Next we note that
[c] n
H=
{[
~
~]
Is
E
S}
nH
=
{[
~s
~]
[zc]nH
=
{[
=~
_~] ISES}
{zdJnH
= {[
[d]
Is E S}
-n
_~~
IsE
s}
All of the above sets have cardinality (1/2)(q - 1). If 1 ::; n ::; (1/2)(q - 3), then
~-n ], [~-n
~n]
Ix E Y q }
which is a set of cardinality 2q. If 1 ::; m ::; (1/2)(q - 1), then the linear group < b": > is irreducible. Thus we must have [b m ] n H = 0. It is clear that 1, z E H. Given any character X of H, we now compute XG by using the above information. Let i E {a, 1, ... ,q - 1} and let Ai be the linear character of H given by
0]
fL- t
Then P ~
J( er Ai
and Aq-l
.
-- cIt
= Ao = 1H.
(x E lFq
0::; t ::; q - 2)
The values of the Ay are:
AY(1) AY(ZC)
= =
q + 1, AY(Z) = (_1)i(q + 1), AY(C) = 1 (_1)i, Ay(d) = 1, Ay(zd) = (_l)i
Ay(a n )
=
cin
+ c:- i n , Ay(bm ) = 0
If 1 ~ i ::; (1/2)(q - 3), then O'i = Ay satisfies < O'i,O'i >= 1, so irreducible character of G. Moreover, < Ag >= 2 and
Ag,
O'i
is an
Thus Ag = 1a + A for some irreducible character A of G. This verifies the second and the third row of the character table. Of course, the first row is
8 Projective character tables for PSL 2 (q)
273
obvious, since Ie is the principal character of G. Step 2. We now claim that G has irreducible characters Xl and X2 such that and
Xl(1) ± X2(1)
Xl(ZC) ± X2(ZC) Xl(a n ) ± X2(a n )
+ 1, Xt(z) ± X2(Z) = lI(q + 1), Xt(c) ± Xz(c) = 1, 11, Xl(d) ± X2(d) = 1, Xt(zd) ± X2(zd) = 11 2( -It, X1(b m ) ± X2(bm ) = 0
q
Indeed, put / = A(q-l)/2 (in the notation of Step 1). Then < /,/ >= 2 and so / = Xl ± X2 for some irreducible characters Xl and Xz of G. Since /(z) = 11/(1) implies Xi(Z) = IIXi(l), the claim follows. Step 3. It will be shown here that the functions {3j, 1 :s; j :s; (1/2)(q - 1) listed in the character table are irreducible characters of G. Consider the linear character J-Lj of < b > given by
Then we have
J-Ly(l) m) J-Ly(b
q(q - 1), J-LY(z) 8Jm + 8- j m
= (-l)jq(q -
1)
and J-LY vanishes on the remaining conjugacy classes of G. For each j E {I, ... , (1/2)( q + I)}, let {3j = AAy- Ay - J-LY, where Aj is as in Step 1. Then the values of the generalized character (3j are as follows:
(3j(l) f3j(zc) f3j(an)
q -1, (3j(z) = (-l)j(q - 1), (3j(c)
= -1,
(-l)j+1, f3j(d) = -1, f3j(zd) = (-l)j+I 0, (3j(b m) = _(8 j m + 8- j m)
If 1 :s; j :s; (1/2)(q - 1), then < f3j,{3j >= 1, (3j(1) > 0 and so {3j is an irred uci ble character of G. This verifies the fourth row of the character table. Step 4. Our aim here is to demonstrate that the irreducible characters of G are Ie, A, al,' .. , a(q-3)/2, {31,"" {3(q-l)/2, Xl, X2, /1, /2
Projective Character Tables
274
where Xl, X2 are as in Step 2 and ,1,,2 are two additional irreducible characters satisfying :
11(Z)
+ 12(1) 11(ZC) + 12(ZC) n 11(an ) + 12(a ) II (1)
-V,1(1), 12(Z) = -v,2(1) q - 1, 11(Z) + 12(Z) = -v(q - 1), 11(C) + 12(C) v, 11(d) + 12(d) = -1, 11(zd) + 12(zd) = v 0, 11(bm) + 12(bm) = 2( _1)m+1
= -1
Moreover, we show that
n(l) Put T
= X2(1) = (1/2)(q + 1), 11(1) = 12(1) = (1/2)(q -
= (3(q+1)/2
(in the notation of Step 3). Then < T, T r = II
1)
>= 2 and therefore
± 12
for some irreducible characters II and 12 of G. A direct verification shows that all inner products among lc,>..,ai,(3j",T are zero. Hence all the irreducible characters listed in Step 4 are distinct, except possibly Xi and "tiBut T(Z) = -vT(I), forcing 11(Z) = -V,1(1), 12(Z) = -v'2(1). Hence, by Step 2, the Xi and Ij are distinct. We next show that T is II + 12, not II - 12, and verify the degrees of Xi and Ij, which will establish the assertion of Step 4 (by applying Step 3). Now u = ± 1 and we treat the cases u = 1 and v = -1 separately. First assume that v = 1. Then 11(Z) = -,1(1), 12(Z) = -,2(1), so J( eq1, J( eq2 do not contain < Z ». On the other hand, by Step 2, J( erX1, J( erX2 do contain < Z >. It follows that the irreducible characters of PSL 2 (q) are:
The sum of the squares of their degrees is IPSL 2(q)1= (1/2)q(q2 -1). Thus we must have 1 + q2
q-5
q-l
+ -4-(q + 1)2 + -4-(q q(q2 _ 1) = --'-----'2
which forces
1)2 + X1(1)2
+ X2(1)2
8 Projective character tables for PSL 2 (q)
275
But X1(1) and X2(1) are positive integers and X1(1) ± X2(1) = q + 1 by Step 2. Hence X1(1) = X2(1) = (1/2)(q + 1). Because the sum of squares of the degrees of all irreducible characters of G is equal to IGI, we deduce that 2 2 1 2 /1 (1) + /2 (1) = 2(q - 1) Now we know that
q - 1 = T(1)
= /1(1) ± /2(1)
and that /1(1) and /2(1) are positive integers. It therefore follows that T(l) = /1(1)+/2(1), so T = /1 +/2, /1(1) = /2(1) = (1/2)(q-1), as desired. Next assume that v = -1. In this case, /1 and /2 are characters of PSL 2(q) and Xl, X2 are not. The desired conclusion can now be obtained by applying the argument similar to the case v = 1. Step 5. Here we prove the theorem for the case u = 1. The assumption v = 1 means that q == l(mod 4). Hence, by Theorem 8.4(i), all irreducible characters of G are lR-valued. It x E G - [a(1/4)(Q-1)j, then by Theorem 8.4(ii), we have 1 ICa/(x < z »1 = 2ICa(x)1 while for
x
E
[a(1/4)(Q-1)j,
ICa/(x < z
»1 = ICa(x)1
Recall also that Xl, X2 are the only two irreducible characters of G/ < z > not fully known. Applying the orthogonality relation in the group G/ < z >, we find the values
Because we also know X1(X) + X2(X) by Step 2, and < Xi,la >= 0, we complete the table of values of Xl and X2. By the foregoing, /1 and /2 are the only irreducible characters of G not fully known. Orthogonality relations in G for ICa ( x)1 give the values of
Because we also know /l(X)
+ /2(X)
by Step 4, and
Projective Character Tables
276
we easily compute the character table of G. Step 6. In this last step, we prove the theorem for the remaining case u = -1. Now u = -1 means q == -1(mod4). Hence, by Theorem 8.5(i), G has precisely four irreducible characters which are not R-valued. Note that 10, A and the (ti and ;3j are all R-valued. Hence Xl, X2, /1, 1'2 are not R-valued, which forces
Xl
= X2
and
"h
= /2
Note also that, by Theorem 8.5(ii), the only x's in G with xz E [x] are the x's in [b(1/4)(q+l)]. Hence again we know ICo/(x < Z > )1. Now /1 and 1'2 are the only irreducible characters of G/ < Z > not fully known. Applying the orthogonality relations in the group G/ < z > gives us the values of
Because we also know
by Step 4, and < Ii, 10 > = 0, we complete the table of values of 11,12. By the foregoing, Xl, X2 =X1 are the only irreducible characters of G not fully known. Orthogonality relations for ICo( x)1 give the values of
Taking into account that, by Step 2, we also know
X1(X) + X2(X) = X1(a:)
+ X1(X)
and Xi(ZX) = -Xi(X), we easily complete the character table of G. This concludes the proof of the theorem. • We now turn to the case when q is a power of 2. The conjugacy classes of S L 2 ( q) in this case are given by Theorem 8.6 and we use the notation of that theorem. Finally, we remind the reader that if q is a power of 2, then
With this information at our disposal, we now proceed to prove the following result.
8 Projective character tables for PSL 2 (q)
277
Theorem 8.8. (Schur (1907), Jordan (1907)). Let q = 2t for some t ~ 1, let E be a primitive (q - 1)-th root of 1 in C and let fJ be a primitive (q + 1)-th root of 1 in C. Then the character table for G = SL 2(q) is
1G A (Xi
j3j
[1] [cI 1 1 q 0 1 q+1 q - 1 -1
[an] 1 1 Em
[b m ] 1 -1
+ E- m 0
0
-( t5
Jm
+ fJ
Jm)
where
1 ~ i ~ (1/2)(q - 2) , 1 ~ j ~ q/2
1 ~ n ~ (1/2)(q - 2) , 1 ~ m ~ q/2 Proof. For the sake of clarity, we divide the proof into two steps. Step 1. Here we demonstrate that the functions A, (Xi, 1 ~ i ~ (1/2)(q-2), listed in the table, are irreducible characters of G = SL2(q). As a point of departure, we put
and H = { [
~
~-1]
Ix E r q , y E r;}
Then P is a Sylow 2-subgroup of G, P
= P < a >, Pn < a > = 1
and
IHI
=
IPII < a> I =
q(q - 1)
Next observe that [c] n H has order q - 1. If 1 ~ n
~
which is a set of cardinality 2q. Note also that
[b m ] n H = 0
(1 ~ m ~ q/2)
(1/2)(q - 2), then
Projective Character Tables
278
Applying the information above, we can now compute XG , for any character X of H. Given i E {O, 1, ... ,q - I}, let Ai be the linear character of H given by
~-k] ~ Eik
x, : [ ~k
Then P ~ J( er Ai and Aq-l = AO = 1H. Next we note that the values of the
q + 1, E
in
A7 are as follows: A7(c) = 1
+ E- in , A7(bm ) =
°
A7
Assume that i E {I, 2, ... , (1/2)(q - 2)}. Then O'i = satisfies < O'i, O'i >= 1 and therefore O'j is an irred ucible character of G. This verifies the third row of the character table. Now observe that < >= 2 and
Ag, Ag
Ag
Hence == 1G + A for some irreducible character A of G. It is clear that A takes the prescribed values. This verifies the second row of the character table. Step 2. We now show that the functions 1 :S j :S q/2, as listed in the character table, are irreducible characters of G. By Step 1, this will complete the proof of the theorem. Consider the linear character flj of < b > given by
e;
Then flY has the following values:
q(q - 1), flY(C) ==
°
0, fly(b m ) = ajm + a- jm
=
Given j E {1,2, ... ,q/2}, let f3j AAr - Ar - flr, where Aj as in Step 1. Then the values of the generalized character (Jj are as follows: q - 1, /3j(c) = -1 0, /3j(b m) = _(ajm
+ a- jm)
8 Projective character tables for PSL 2 (q)
219
Moreover, < (3j,(3j >= 1 and (3j(l) > O. Thus (3j is an irreducible character of G which takes the prescribed values. Finally, the sum of the squares of the degrees of la, A, ai and (3j is
thus completing the proof. •
D. Projective character tables for P S L 2 (q) We can now easily achieve our aim, which is to provide projective character tables for PSL2(q), q a prime power. The only case which will be omitted is the a-character table for PSL 2(9) ~ A 6 , where the cohomology class of a E Z2(PSL2(9),C*) is of order 3 or 6. In what follows, all characters are assumed to be C-characters. First, we quickly dispose of the case where q is even. In that case
Moreover, by Theorem 16.3.2 in Vol.2, the Schur multiplier of SL 2 (q) is trivial unless q = 4, in which case the Schur multiplier is of order 2. Thus, if q i- 4, then all projective character tables of SL 2 (q) are determined by the ordinary character table of SL 2 (q) given by Theorem 8.8. In case q == 4, we have SL 2(4) ~ As. Hence all projective character tables of SL 2(4) are determined by the character table of SL 2(4) (given by Theorem 8.8) and the spin character table of a covering group of As ~ S L 2 ( 4) (given by Theorem 6.6). Hence all projective character tables for PSL2(q), where q is even, have been already determined. By the above, we can concentrate on the case where q is an odd prime power. We remind the reader that if q i- 9, then the Schur multiplier of P S L 2 ( q) is of order two, while for q = 9 the order of the Schur multiplier of P S L 2 ( q) is 6. Thus, by Theorem 4.5, the ordinary character table for PSL 2(q) together with the spin character table of the double cover SL 2(q) of PSL 2(q) determine all projective character tables for PSL 2(q), with the exception of the a-character table of PSL 2(9), where 0' E Z2(PSL 2(9),C*) is such that the cohomology class of 0' is of order 3 or 6. We now proceed to determine the character table for PSL 2(q), q being odd. For any x E SL 2(q), let x denote the image of x in PSL 2(q). Then the conjugacy class [x] of x in PSL 2(q) is the image of the conjugacy class [x]
As
Projective Character Tables
280
of SL 2(q). Assume that q == 1(mod4). Then, by Theorem 8.4(iv),
[IJ, [eJ, [dJ, raj, [a 2j,
, [a(1/4)(q-5)j, [a(I/4)(q-I)J
[bJ, WJ,
, [b(1/4)(q-I)J
are all distinct conjugacy classes of PSL 2 (q).
Let q be an odd prime power and let q == 1(mod4). Denote by e a primitive (q - 1)-th root of 1 in C and by h a primitive (q + 1)th root of 1 in C. Then the character table for G = PSL2(q) is Theorem 8.9.
1e
[1J 1
[anJ
[bmJ
1
1 -1
q 1 q+1 Ckn /lk q-1 0 Ot (_1)n Xl (1/2)(q + 1) X2 (1/2)(q + 1) (_1)n
A
0
htm 0 0
[eJ 1
[dJ
0
0
1
1 1 -1 -1 (1/2)(1 + Jq) (1/2)(1 - .Jq) (1/2)(1 - Jq) (1/2)(1 + Jq)
q-1 1 -< n -< - 4- ,
q-1 1
1
q- 1 1
-
-
4
'
Proof. The irreducible characters of PSL 2 (q) can be identified with all irreducible characters X of SL 2 {q) with < z >~ J( erx, which is equivalent to X(z) > O. Since q == 1(mod4), we have v = (_1)(1/2)(q-l) = 1. Setting /lk = Q2k and Ot = f32t, the result follows from Theorem 8.7 . • Turning to the spin character table for S L 2(q), q == l( mod 4), we remark that by Theorem 8.4(iii),
1 ::; n ::; (1/4)(q - 5), 1 ::;
m ::;
(1/4)(q - 1)
are all distinct representatives of associate pairs of conjugacy classes of the group SL 2(q).
8 Projective character tables for PSL 2 (q)
281
Theorem 8.10. Let q be an odd prime power and let q == 1(mod4). Denote by E a primitive (q - I)-the root of 1 in C and by 8 a primitive (q + l)-th root of 1 in C. Then the spin character table for SL 2(q) is
[1] J.lk Ot /1 /2
q+1 q- 1 (1/2)(q - 1) (1/2)(q - 1)
where ei«
[an] Ekn
[b m]
0 0 0
btm (_l)m+l (-lr+ 1
0
= E(2k-l)n + E-(2k-l)n, 1~
ti ~
btm
(1/4)(q - 5),
1 ~ k ~ (1/4)(q - 1),
[c] [d] 1 1 -1 -1 (1/2)(-1 +.Jij) (1/2)(-1 - .Jij) (1/2)(-1 - Jij) (1/2)(-1 + Jij)
= _(b(2t-l)m + b-(2t-l)m) 1 ~ m ~ (1/4)(q - 1)
1~ t
~
(1/4)( q - 1)
Proof. The spin character table for SL 2 (q) is obtained from the character table of SL 2(q) by choosing only those irreducible characters X of SL 2(q) for which X(z) < O. Since q == 1( mod 4), we have v = (_1)(1/2)(q-l) = 1. Hence, setting J.Lk = Q2k-l and Ot = (32t-l, the result follows from Theorem 8.7. • We now turn to the case where q == -1( mod 4). Recall that, by Theorem 8.5(iv),
[I] ,[a] , [a 2 ]
,
[b]' [b 2 ] ,
, [a(1/4)(q-3)] ,[c], [d] , [b(1/4)(q-3)] ,
W 4)(Q+l )] 1/
are all distinct conjugacy classes of PSL2(q).
Theorem 8.11. Let q be an odd prime power and let q == -1(mod4). Denote by E a primitive (q -1 )-th root of 1 in C and by b a primitive (q+ 1 )-th root of 1 in
Projective Character Tables
282
--- --------_._--
[an] [c] [b m] [d] 1 1 1 1 1 1a -1 A q 1 0 0 1 1 0 q+1 Ekn Ilk q-1 8 -1 -1 0 Ot tm 11 (1/2)(q - 1) 0 (_l)m+I (1/2)(-1 + R) (1/2)(-1- R) 12 (1/2)(q - 1) 0 (_1)m+T (1/2)(-1 - R) (1/2)( -1 + R)
[1]
1 ~ n ~ (1/4)(q - 3), 1 ~ k ~ (1/4)(q - 3),
1 ~ m ~ (1/4)(q+ 1) 1 ~ t ~ (1/4)(q - 3)
Proof. The irreducible characters of PSL 2 (q) can be identified with all irreducible characters X of SL 2(q) for which X(z) > O. Since q == -1(mod4), we have 11 = (-1 )(1/2)(q-1) = -1. Setting Ilk = D:2k and (}t = f32t, the result follows by virtue of Theorem 8.7. • Finally, we consider the spin character table for SL 2(q), q == -1(mod4). Owing to Theorem 8.5(iii),
(1 ~ n
~
(1/4)(q - 3), 1 ~ m ~ (1/4)(q - 3))
are all distinct representatives of associate pairs of conjugacy classes of SL 2 (q).
Theorem 8.12. Let q be an odd prime power and let q == -1(mod4). Denote by E a primitive (q-1 )-th root of 1 in C and by 8 a primitive (q+ 1 )-th root of 1 in C. Then the spin character table for S L 2 ( q) is
[an] [b m] [1] [c] [d] q+1 0 1 1 Ekn Ilk ()t q-1 -1 0 s.; -1 0 (1/2)(1 + R) (1/2)(1- R) Xl (1/2)(q + 1) (_1)n 0 (1/2)(1- R) (1/2)(1 + R) X2 (1/2)(q+ 1) (-l)n where Ekn = E(2k-l)n + C(2k-1)n, 8tm = _(8(2t-l)m
+ 8-(2t-l)m)
1 ~ n ~ (1/4)(q - 3),
1 ~ m ~ (1/4)(q - 3)
1 ~ k ~ (1/4)(q - 3),
1 ~ t ~ (1/4)(q
+ 1)
9 Nonisomorphlc groups with the same projective characater tables
283
Proof. By definition, the spin character table for S L 2 ( q) is obtained from the character table of SL 2(q) by choosing only those irreducible characters X of SLz(q) for which X(z) < O. Since q == -1(mod4), we have v = (_l)(1/Z)(Q-l) = -1. Hence, setting Ilk = a2k-l and ()t = f32t-l, the result follows from Theorem 8.7. •
9
Nonisomorphic groups with the same projective character tables
A. Introduction All characters below are assumed to be C-characters. Let G be a finite group. Then the character table of G carries a lot of information on the structure of G. In fact, by Theorem 22.1.1 in Vol.I, it determines the degrees of irreducible characters, the orders of centralizers of elements (in particular, the order of G), the number of elements in each conjugacy class of G, Z(G) and G', the lattice of normal subgroups of G and the set of primes which divide the order of any given element g of G. Unfortunately, the character table of G does not determine G up to isomorphism, since dihedral and quaternion groups of order 8 have the same character tables. On the other hand, such classical groups as Sn and An are determined by their character tables (see Nagao (1957) and Oyama (1964)). The proof of the facts concerning Sn and An relies on the property that the class multiplication constants are determined by the character table (see Theorem 21.1.2 in VoLl). The question of whether the character table of a given group determines this group up to isomorphism is especially important in the theory of finite simple groups. For example, in characterizing a known simple group, it may be convenient to know that no other group has the same character table. A typical situation is described in G. Higman's paper (Higman (1971)) where it is shown that Janko's first group is determined by its character table. It is natural to enquire what happens if "the character table of G" is replaced by "the projective character tables of G". In other words, do all the projective character tables of G determine G up to isomorphism? According to Hoffman and Humphreys (1987b), this question was first raised by Morris. Let us first of all give a precise meaning to our question. The following definition takes into account that the projective character tables corresponding to cohomologous cocycles determine each other (see
Projective Character Tables
284
Lemma 1.2.5). Let G 1 and G 2 be two finite groups and let M( Gi) be the Schur multiplier of Gi, i = 1,2. By saying that G 1 and G 2 have the same projective character tables, we mean that there is a bijective correspondence Q:i f-+ 13i between the representatives of cohomology classes in M(Gd and M(G 2 ) , respectively, such that for each i, the Q:i-character table C, of G 1 coincides with the 13i-character table D, of G 2 (upon a suitable permutation of rows and columns of Dd. Thus if G1 and G 2 have the same projective character tables, then M( Gd and M( G 2 ) have the same order. For this reason, the dihedral and quaternion groups of order 8 cannot have the same projective character table, since the orders of their Schur multiplier are different. In case G 1 and G 2 satisfy IM(Gdl = IM(G 2 )1 = 2, our question can be reformulated as follows. Let Gj and Gi be any given covering groups of G 1 and G 2 , respectively. Then all projective character tables of G; are determined by : (i) The character table of Gi. (ii) The spin character table of Gi. (see Theorem 4.5). Thus our question can be reformulated as follows: Assume that the groups G 1 and G 2 have the same character table and that Gj and Gi have the same spin character table. Is it true that G 1 ~ G 2 ? It is the purpose of this section to provide a negative answer. The corresponding example involves groups G 1 and G 2 of order 32.
B. The groups G 1 and G 2 Let E E {O, I} and let G = G( E) be the group generated by 91,92,93,94 and 95 subject to the relations
9i [92,g5]
[9i,9j]
g? = 1, 95
= gl, gg = 93
and
91
[93,94] = gl, [94,95] = g2, 1 for the remaining 1:S i, j
= 9~
:s 5
Let G 1 be the group G(O) and G 2 be the group G(l). Our aim here is to show that G 1 and G 2 are nonisomorphic groups of order 32 with the same character table. We treat both groups simultaneously by examining the structure of G = G(E). In what follows, we put /3(G) = [G',G].
Lemma 9.1.
The group G = G(E) satisfies the following properties:
9 Nonisomorphic groups with the same projective characater tables
(i) G' =< 91,92 > is of order 4. (ii) GIG' ~ 1£4 X 1£2 and,in particular, (iii) /3(G) = Z(G) =< 91 .>.
IGI
285
= 32.
Proof. (i) By definition, [91,92J = 1 and so < 91,92 > is of order 4. Since 91 and 92 are commutators, we have < 91,92 >~ G'. By definition, we also have < 91 >~ Z(G). Since
we see that < 91,92 > is a normal subgroup of G. Since the corresponding factor group is obviously abelian, it follows that the group G' =< 91,92 > is of order 4. (ii) The abelian group GIG' is generated by the elements 94G' and 95G' of order 2 and 4, respectively. Hence GIG' ~ 1£4 X 1£2. (iii) It is clear that 91 = [92,95J E /3(G). But, by (ii), G is a 2-group, so /3(G) is a proper subgroup of /2(G) = G'. Hence /3(G) =< 91 ». Assume that 9 E Z( G) and write 9 = 9t9~9J9~, 0 :S; i,j, k :S; 1,0 :S; t :S; 3. Then 9~9~91 E Z(G) and we show that j = k = t = 0, which will complete the proof. Since 92 commutes with 94, we see that 92 commutes with 91. Hence [92, 95J =11 forces t = O. Since 93 commutes with 92, it follows that 93 commutes with 9~' Hence [93,94J =11 forces k = O. Finally, since [92,95) =11, it follows that j = 0, as required . • In what follows, for any 9 E G, [9) denotes the conjugacy class of G. Lemma 9.2. as follows:
All distinct conju9acy classes of the qroup G
= G(E)
are
[lJ, [91], [92), [93], [9293), [94], [9394) [95), [9395], [9495], [939495J
The cardinalities of these conju9acy classes are
and the remaininq conju9acy classes have cardinality 4. Moreover,
G(O) '1- G(l) Proof. The assertion regarding conjugacy classes of G and their cardinalities follow directly from the defining relations of G. If E = 1, then there
Projective Character Tables
286
are precisely 3 elements of order two, namely 91,92,9192' If E = 0, then there is at least one more such element, e.g. 94. Hence G(O) ~ G(1). • To simplify the notation, let us label the conjugacy classes as follows:
where 1 E C l , 91 E C 2 , 92 E C3 , 93 E C4 , 9293 E C s, 94 E C6, 9394 E C 7 , 95 E C s , 9395 E C g, g4g5 E C lO , 93g495 E Cn. Lemma 9.3.
Xl
X2 X3 X4 XS X6 X7 XS Xg XlO Xu
The group G = G(E) has the [ollounnq character table
Cl
C2
C3
C4
Cs
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 -1 -1 -1 -1
1 1 1 1 -1 -1 -1 -1
2 2 4
C6
1 1 -1 -1 1 1 -1 -1 2 -2 2 -2 0 2 -2 -2 2 0
-4
0
0
0
0
C lO
1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -t t -1 - t t -t 1 t 1 -t t 0 0 0
1 -1 -1 1
1 -1 -1 1
t
-t
-t
t
0 0
Cs
Cu
Cg
C7
0 0
0 0
-t
t
t
-t
0 0
0
0
0 0
Proof. By Lemma 9.1(ii), GIG' is of order 8. Hence G has precisely 8 linear characters, say Xl, ... ,Xs. Now GIG' =< g4G' > X < g5G' >, where the first factor is of order 2 and the second is of order 4. Hence, if X is a linear character of G, then X(94) = ±1 and X(9s) = ±1, ±i. Since, by Lemma 9.1(i), G' =< 91,92 >, it follows that Xl, ... , Xs have the prescribed values. Since IGI = 32 and G has 11 conjugacy classes, the remaining three irreducible characters of G, say Xg, XlO and Xn satisfy
X9(1) = XlO(1) = 2 and
Xn(1) = 4
If < 91 > ~ J( erXn, then a group of order 16 has an irreducible character of degree 4, which is impossible. Thus Xu (Yl) = -4 and row orthogonality
9 Nonisomorphic groups with the same projective characater tables
287
shows that Xu vanishes on the remaining nine conjugacy classes. By the foregoing, we are left to verify that X9 and XlO have the prescribed values. Applying the column orthogonality for C l and C2 , we see that
Thus X9 and XlO contain 91 in their kernel, so X9 and XlO can be regarded as irreducible characters of G = GjZ(G). Note also that
Moreover, since by Lemma 9.1(i), G' =< 91,92 >, we see that 92 rJ. J(erX9, 92 rJ. J(erxlO. Thus X9(C3) = -2 and XlO(C3) = -2. Since 93Z(G) is a central element of order two in G, we also have
By column orthogonality relation, applied to Cl and C 4 , X9(C4 ) and XlO(C4 ) must have the opposite sign. Hence we may assume that X9(C4) = 2 and XlO(C4 ) = -2, in which case X9(C5 ) = -2 and XlO(C5 ) = 2. The remaining entries for X9 and XlO follow from < X9,X9 >=< XlO, XlO >= 1. • Corollary 9.4. character table.
The qroups G1
= G(O)
and G2
= G(l)
have the same
Proof. The character table for G = G(£), e E {O, I}, does not depend upon the choice of E• •
C. The double covers of G l and G 2 Let e E {O,I} and let G*(c) be the group generated by a central involution Z together with Xl, X2, X3, X4 and X5 subject to the relations:
=
21
Xl
2
'X2
= Z, X32 = ZXl, X52 = X3
an d
= Xl
2"
X4
= ZXI, [X2, X4] = Z, [X3' X4] = Xl, [X4, X5] = X2 [Xi, Xj] = 1 for the remaining 1 ~ i,j ~ 5
[X2, X5]
Then it is easily seen that G*( E) is a double cover of G(c) via the exact sequence: 1
-.<
Z
>-. G*(E) L G(c) -. 1
Projective Character Tables
288
where
f(Xd = gi
for all
1
~
i ~ 5
Since Z = [X2,X4] E [G*(E),G*(E)] n Z(G*(E», we see that
IM(G(E))I
is even
It will be shown later (see Theorem 9.7) that M (G( E)) is of order two. In what follows, for any 9 E G*( E), [g] denotes the conjugacy class of g. Lemma 9.5.
Xl X2 X3 X4
Xs X6 X7
XS
[1] 2 2 2 2 2 2 2 2
The spin character table for G*(E) is as follows:
[Xl] -2
-2
[X3]
0 0 0 0
-2 -2 2 2i 2 -2i 2 -2i 2 2i
[xs] 1 +i 1- i -1+i -1-i
[X3 XS]
[X4XS]
[X3X4 XS]
-2i 2i 2i -2i
1- i 1 +i -1- i -1+i
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
l+i 1- i -1 + i -1- i
-l+i -1-i 1 +i 1- i
[X2 X3]
Proof. For the sake of clarity, we divide the proof into three steps. Step 1. Here we show that it suffices to construct spin characters Xl, ... , Xs with the prescribed values on the chosen conjugacy classes. So assume that such spin characters have been found. By Theorem 4.4(ii), the sum of the squares of the degrees of spin characters of G*(E) is equal to IG(E)I = 32. Thus XI, ... ,XS are all characters of G*(E). Since no two columns in the table are the same, the chosen conjugacy classes are distinct. Since there are no zero columns, no chosen conjugacy class is self-associate (see Lemma 4.1(iii»). Finally, since no column is obtained from another column by multiplying by -1, we see that no two distinct conjugacy classes are associate (see Lemma 4.1(i). Thus the chosen conjugacy classes form a full set of distinct representatives of associate pairs of conjugacy classes of G*(E). Step 2. Here we construct spin characters Xl, X2, X3 and X4 with the prescribed values. Put H = G*(E) and HI =< Z, Xl, X2, Xs >. Then HI is a subgroup of index 2 in H with H / HI =< X4HI >. It is clear that H~ =< ZXI >
9 Nonisomorphic groups with the same projective characater tables
289
and HdH~
=< xzH~
>
X
< xsH~
>~ 1£4
X
1£4
Let ,X be the linear character of HI with 'x(xz) = 'x(xs) = i. Then 'x(X3) = 'x(xs)Z = -1, 'x(XI) = 'x(z) = 'x(xz)Z = -1. Now put Xl = ,XH. Then XI(Z) = -2 < 0 and Xl is irreducible (since otherwise, by Frobenius reciprocity, ,X extends to a character of H, which is impossible in view of Z E H'). Hence Xl is a spin character. We have:
xI(Xd XI(X3) XI(XZ X3) XI(XS) XI(X3XS)
'x(Xd + 'x(x 4 lxIX4) = 'x(xd + 'x(xd = -2 'x(X3) + 'x(x4lx3X4) = 'x(X3) + 'x(x3xd = 0 'x(XZX3) + 'x(x4lxZX3X4) = 'x(XZX3) + 'x(XZZX3X4) = -2i 'x(xs) + 'x(x4lxSX4) = 'x(xs) + 'x(XSX2 1) = 1 + i 'x(X3XS) + 'x(X4IX3XSX4) = 'x(X3XS) + 'x(X3XIXSX21) = 1- i
Setting Xz = Xl, we see that the spin characters Xl and Xz have the prescribed values. Now let ,X be another linear character of HI, namely 'x(xz) = -i, 'x(xs) = i. Then 'x(X3) = -1, 'x(xd = 'x(z) = -1. Setting X3 = ,XH, it follows that X3 is a spin character of H with X3(X4XS) = X3(X3X4XS) = O. Moreover, we have
-2, X3(X3) = 0, X3(XZX3) = 2i -1 + i, X3(X3XS) = -1 - i Setting X4 = X3, we see that the spin characters X3 and X4 have the prescribed values. Step 3. We now complete the proof by constructing spin characters Xs, X6, X7 and Xs. Put Hz =< Z, Xl, Xz, X3, X4XS >. Then Hz is a subgroup of index 2 in H with H/H z =< X4HZ >. It is clear that H~ =< Xl > and
Let ,X be the linear character of Hz with 'x(xz) = 'x(X4XS) = i. Then 'x(z) = 'x(xz)Z = -1, 'x(xd = 1, 'x(XZX3) = 'x((X4XS)2) = -1, 'x(X3) = i (since
Projective Character Tables
290
(X4X5)2 = x~+lX2X3)' Setting X5 of H. We have
= >..H, it is clear that X5 is a spin character
+ >"(x41XIX4) = 2 >"(X3) + >"(X41x3X4) = >"(X3) + >"(X3Xt) = 2i >"(X2X3) + >"(x41X2X3X4) = >"(X2X3) + >"(X2ZX3Xl) = 0 >"(X4X5) + >"(x41x4X5X4) = i + 1 >"(X3X4X5) + >"(X41x3X4X5X4) = -1 + i
>"(Xd
x5(xd X5(X3) X5(X2 X3) X5(X4 X5) X5(X3 X4 X5)
Since X5, X3X5 rt. H 2, we also have X5(X5) = X5(X3X5) = O. Setting X6 = X5, we see that spin characters X5 and X6 have the prescribed values. Now let>" be another character of H 2, namely >"(X2) = -i, >"(X4X5) = i. Then X7 = >..H is a spin character of H with the prescribed values. Finally, setting XS = X7, the result follows. •
Corollary 9.6. Let G 1 = G(O), G2 = G(1), Gj = G*(O) and Gi G*(1). Then Gi is a double cover of Gi, i = 1,2, and the spin character tables for
Gi
and
Gi are
the same.
Proof. We have already observed that Gi is a double cover of Gi, i =:: 1,2. Moreover, by Lemma 9.5, the spin character table for G*(E) does not depend upon the choice of E E {O, I}. So the corollary is true. • D. The main result We have now accumulated all the necessary information for the proof of the main result below. In view of our discussion in Sec.A, it provides two nonisomorphic groups with the same projective character tables.
Theorem 9.7. (Hoffman and Humphreys (1987b)). Let £ E {O, 1} and let G = G(E) be the qroup generated by 91,92,93,94 and 95 subject to the relations 9r = 9~ = 1, 9~ = 91, 9g = 93 and 9~ = gf [92,95]
= [93,94] = 91, [94,95] = 92,
= 1 for the remainin9 1 S; i,j S; 5 Put G 1 = G(O) and G2 = G(I). Then Gl and G2 are nonisomorphic groups of order 32 with IM(Gdl = IM(G2 )1= 2 such that: [gj,gj]
9 Nonisomorphic groups with the same projective characater tables
291
(i) G 1 and G 2 have the same character table. (ii) A covering group Gi of G 1 and a covering group Gi of G 2 have the same spin character table.
Proof. Let the group G*(E) be defined as in Sec.C, let Gi = G*(O) and let Gi = G*(l). By Corollary 9.4, the groups G 1 and G2 have the same character table, while by Corollary 9.6, Gi is a double cover of Gi, i = 1,2, and the spin character table for Gi and Gi are the same. Note that, since in the construction of G*(E), Z E [G*(E),G*(E)], Gi is a covering group of Gi, i = 1,2, provided we show that M(Gd is of order 2. Since, by Lemmas 9.1 and 9.2, G t and G 2 are nonisomorphic groups of order 32, we are left to verify that for E E {O, I} IM(G(E))I = 2 Setting N =< g5,g2 >, we see that N is a normal subgroup of G = G(E) having index 2 and
g58 = 1,g22 = 1,92-1 9592 = 955 Hence, by Corollary 10.1.26 in Vol.2, M(N) = 1. Setting 9 = 94, we have GIN =< gN >. Denote by CNIN,(g) the subgroup of elements of NIN' fixed under conjugation by g. Since N' =< gl >, a direct calculation shows that CNINI(g) = {N',g2N',g~N',g2g~N'} Let L be the subgroup of CN/NI(g) generated by g2 N' elements of the form
(x E N)
(XN')(g-l xg)N' Then a direct calculation shows that
Hence, by Theorem 11.10.4 in Vo1.2,
/M(G)/ = ICNIN,(g)1 = 2
ILl
as desired. •
= gl N' = N'
and all