Professional Documents
Culture Documents
G. Hiss, R. Kessar and B. Külshammer-An Introduction To The Representation Theory of Finite Groups (2012)
G. Hiss, R. Kessar and B. Külshammer-An Introduction To The Representation Theory of Finite Groups (2012)
G. Hiss, R. Kessar and B. Külshammer-An Introduction To The Representation Theory of Finite Groups (2012)
of Finite Groups
by
G. Hiss, R. Kessar and B. Klshammer
Last Updated: 30/05/2012
Introduction
These notes are adapted from three short courses given by the above at a summer school
entitled An Introduction to the Representation Theory of Finite Groups" held at RWTH
Aachen University between the 27th and 29th of September 2010. The three short courses
were entitled
An Introduction to Ordinary Representation Theory given by Hiss,
An Introduction to Modular Representation Theory given by Klshammer,
An Introduction to Block Theory given by Kessar.
The summer school was organised by Jrgen Mller, Natalie Naehrig and Gabriele
Nebe as part of the DFG priority program in representation theory. These notes follow
very closely the original lectures given by the above at this summer school, although some
changes have been made. Mainly these changes are in the addition of some background
material but also some of the proofs which were left as exercises have been fleshed out.
These notes are not officially endorsed by the three lecturers and are are merely the scribers
own notes.
Contents
Background Material
0.1 Algebras and Modules . . . . . . . . . . . . . . . . . . . . . . . . . . . .
0.2 Categories . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
1
4
.
.
.
.
.
.
.
.
7
7
9
10
10
11
13
18
19
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
21
21
22
22
24
24
25
26
27
27
28
29
29
29
30
32
.
.
.
.
.
33
33
34
36
37
40
Contents
3.6
3.7
3.8
3.9
3.10
3.11
3.12
3.13
3.14
3.15
3.16
3.17
3.18
ii
Brauers Third Main Theorem . . . . . .
Fusion System of a Block . . . . . . . . .
Structure of Centric Brauer Pairs . . . . .
Known Results . . . . . . . . . . . . . .
Alperins Weight Conjecture . . . . . . .
Brous Abelian Defect Group Conjecture
Finiteness . . . . . . . . . . . . . . . . .
Weak Donovan Conjecture . . . . . . . .
Blocks in Characteristic 0 . . . . . . . . .
Blocks and the cde Triangle . . . . . . .
Brauers Second Main Theorem . . . . .
Block Orthogonality Relations . . . . . .
Characters and Morita Equivalence . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
41
41
42
43
43
44
44
45
45
48
49
49
50
0. Background Material
In this section we will gather together some basic background material that may be unfamiliar. We also outline the notation that we will use for the remainder of these notes.
0.1
Section 0.1
Remark 0.1.3. We can define modules for an arbitrary ring but here we have chosen to
define them only for F-algebras as this is the only context in which we will need them. As
any F-algebra contains a copy of F we have any A-module is in fact an F-vector space. In
light of this we will refer to the dimension of M, sometimes denoted dim M or dimF (M),
as the dimension of M as an F-vector space.
Remark 0.1.4. We can also define right A-modules and right A-submodules in an analogous way. All A-modules and submodules are assumed to be left A-modules and submodules unless otherwise stated. If we wish to emphasise whether M is a left, (resp. right),
A-module then we will write M as A M, (resp. MA ).
Let M be an A-module and N 6 M a submodule of M. We can form the quotient
group M/N and indeed this is again an A-module called the quotient module.
Definition 0.1.5. Let A, B be two F-algebras. We say M is an (A, B)-bimodule if M is a
left A-module and a right B-module such that for all a A, b B and m M we have
a (m b) = (a m) b. We will emphasise this bimodule structure with the notation A MB .
If M and N are A-modules then we write HomA (M, N) for the abelian group of all
group homomorphisms f : M N, which respect the action of A. In other words we
have f (a m) = a f (m) for all m M, a A. Furthermore we denote HomA (M, M) by
EndA (M) the group of all endomorphisms of M.
Definition 0.1.6. Assume A is an F-algebra and M is an A-module. We say M is finitely
generated if there exists a finite subset {m1 , . . . , ms } M such that every element of M
P
is an A-linear combination of the mi , (in other words M = si=1 Ami ).
We will assume that all A-modules are finitely generated unless specifically stated
otherwise. In particular A itself is finitely generated. We recall the following fundamental
result concerning finitely generated modules.
Proposition 0.1.7. An A-module M is finitely generated if and only if for every ascending
chain
M1 6 M2 6 M3 6
of submodules Mi 6 M terminates. In other words there exists an index j such that
Mj = Mk for all k > j.
Let us now introduce a collection of A-modules which will be the building blocks for all
other modules.
Definition 0.1.8. An A-module S is called simple if S is non-zero and the only submodules
of S are {0} and S. Furthermore an A-module M has a composition series if there exists
a finite series of submodules
{0} = M0 < M1 < < Mk1 < Mk = M
Section 0.1
such that the quotient modules Mi /Mi1 are simple for all 1 6 i 6 k. The modules
{Mi /Mi1 | 1 6 i 6 s} are called the factors of the composition series and k is called the
length of the composition series.
Let us recall some basic results on modules, which are analogues of the usual isomorphism theorems for groups and rings. These are left as an easy exercise for the reader.
Theorem 0.1.9. Let A be an F-algebra and M and N two A-modules.
(i) Assume f : M N is an A-module homomorphism then Ker(f ) and Im(f ) are
submodules and we have an isomorphism M/ Ker(f ) Im(f ).
(ii) Assume M and N are submodules of a common A-module then we have an isomorphism (M + N)/M
= N/(M N).
(iii) Assume N is a submodule of M. There exists a one to one inclusion-preserving
correspondence, P 7 P/N, between submodules P of M which contain N and
submodules of M/N.
The existence of a composition series for a finitely generated A-module follows easily from
part (iii) of Theorem 0.1.9 and Proposition 0.1.7. There is a small caveat to the existence
of a composition series in that many composition series may exist for a module. However
the next result says at least that the length and factors are independent of the choice of
a composition series. We call the common length of a composition series the composition
length of M and the factors the composition factors of M.
Theorem 0.1.10 (Jordan-Hlder). Suppose that an A-module M has two composition
series
{0} = M0 < M1 < < Mk = M,
{0} = N0 < N1 < < N` = N,
then there exists a bijection
: {M1 /M0 , . . . , Mk /Mk1 } {N1 /N0 , . . . , N` /N`1 }
such that X and (X) are isomorphic for all X {M1 /M0 , . . . , Mk /Mk1 }.
Proof. We prove this by induction on the length of the composition series. Any module
having a composition series of length 1 must be simple and the theorem is trivially true
for simple modules. Let us now assume the theorem is true for all modules which have
a composition series whose length is less than k. There are two main cases to consider.
Firstly assume Mk1 = N`1 then removing M from the composition series gives a composition series for Mk1 = N`1 . By assumption we have k 1 = ` 1 k = ` and
Mi /Mi1
= Ni /Ni1 for all 1 6 i 6 k 1. Finally as Mk1 = N`1 we clearly have
M/Mk1 = M/N`1 so the theorem is proved.
Section 0.2
Now assume that Mk1 6= N`1 then we will consider the following submodule V =
Mk1 N`1 of M. As Mk1 6= N`1 we must have that V is a proper submodule of either
Mk1 or N`1 . Let us assume without loss of generality that Mk1 N`1 is a proper
submodule of Mk1 , in particular N`1 6 Mk1 . By (iii) of Theorem 0.1.9 we have Mk1
is a maximal submodule of M because the quotient M/Mk1 is simple. Therefore we have
Mk1 Mk1 + N`1 M which implies Mk1 + N`1 M because N`1 6 Mk1 . By (ii)
of Theorem 0.1.9 we have isomorphisms
M/Mk1
= N`1 /(Mk1 N`1 )
M/N`1
= Mk1 /(Mk1 N`1 ),
(0.1)
in particular the quotient modules N`1 /(Mk1 N`1 ) and Mk1 /(Mk1 N`1 ) are simple.
Let {0} = L0 < L1 < < Ls1 < Ls = Mk1 N`1 be a composition series for
Mk1 N`1 then by Eq. (0.1) we have composition series
{0} = L0 < L1 < < Ls1 < Mk1 N`1 < Mk1 ,
{0} = L0 < L1 < < Ls1 < Mk1 N`1 < N`1
of Mk1 and N`1 . We may now use the induction hypothesis because Mk1 and N`1
clearly have composition series whose length is less than k. Using this we have the above
composition series must have the same length as the composition series
{0} = M0 < M1 < < Mk2 < Mk1 ,
{0} = N0 < N1 < < N`2 < N`1 .
In particular we have k = `. Now again by Eq. (0.1) we have the following are composition
series
{0} = L0 < L1 < < Ls1 < Mk1 Nk1 < Mk1 < Mk ,
{0} = L0 < L1 < < Ls1 < Mk1 Nk1 < Nk1 < Nk
of M. The theorem then follows by comparing these composition series with the original
composition series using the induction hypothesis and Eq. (0.1).
0.2
Categories
In this section we will recall some of the fundamental terminology used in the language
of categories. We will not recall the notions of triangulated or derived categorories but
instead refer the reader to [Wei94, Chapter 10].
Definition 0.2.1. A category C consists of a class of objects Obj(C) and a set of morphisms HomC (M, N) defined for each pair of objects M, N Obj(C). For each object M
Obj(C) there must exist an identity morphism IdM HomC (M, M) and for any three objects L, M, N C there must exist a composition function HomC (L, M) HomC (M, N)
HomC (L, N). These composition functions must satisfy
Section 0.2
F (M)
(M 0 )
(M)
G(M)
F (M 0 )
G(f )
G(M 0 )
Section 0.2
1.1
Representations
GL(V )
X0
GLd (F)
Definition 1.1.2. A representation X : G GL(V ) is reducible if V = {0} or there exists
a proper G-invariant vector subspace {0} < W < V , (i.e. X(g)W 6 W for all g G).
Equivalently there exists a basis of V such that for all g G we have
"
#
0
X
(g)
0
W
,
X0 (g) =
0
X0V /W (g)
where XW , XV /W are representations of G on W , V /W with respective degrees dim W and
dim V /W . We say X is irreducible if it is not reducible.
Definition 1.1.3. Two representations X : G GL(V ), Y : G GL(V ) are equivalent if
there exists an isomorphism of vector spaces : V W such that the following diagram
is commutative for all g G.
V
X(g)
W
Facts 1.1.4.
Y(g)
Section 1.1
?
X01 (g)
X02 (g)
0
X (g) =
...
0
0
Xr (g)
where the X0i : G GLdi (F), for 1 6 i 6 r are irreducible matrix representations.
The Xi are uniquely determined by X, (up to possible reordering and equivalence). We
will see once we have introduced the language of modules that this is a consequence
of 0.1.10.
(2) There exists only finitely many irredudible F-representations of G, (up to equivalence).
Example 1.1.5.
(1) Let V = F then this vector space is 1-dimensional and the map X01 : G GL1 (F)
=
0 1
(12) 7 1 0
0 0
0
1
0 0 1
(123) 7 1 0 0 .
0 1 0
Note that as these two elements generate the whole group, and our representation is
a group homomorphism, it is enough to specify the representation on the generating
set. Let {e1 , e2 , e3 } be the standard basis of V = C3 then W = he1 + e2 + e3 i is a
G-invariant subspace of B. Now take {e1 + e2 + e3 , e1 , e2 } to be a basis of V and
consider the change of basis matrix C. We get an equivalent representation given
by Y0 (g) = CX0 (g)C 1 which is given by
1 0 0
(12) 7 0 0 1
0 1 0
1 0 0
(123) 7 0 0 1 .
0 1 1
Section 1.3
0 1
(12) 7
1 0
#
"
0 1
.
(123) 7
1 1
X(g) = X((g))
for all g G.
(5) For example we have a surjective group homomorphism : S3 S2 , where S3 is
as in (3) and S2 = h(12)i, given by ((12)) = (12) and ((123)) = 1. We also
have an easy to describe 1-dimensional representation of S2 given by (12) 7 (1).
Therefore we get a 1-dimensional representation of S3 given by (12) 7 (1) and
(123) 7 (1), (which we call the sign representation of S3 ).
1.2
Characters
Section 1.4
1.3
10
For this section we assume F = C. We will now state some fundamental theorems of
ordinary representation thoery, which we will prove later.
Theorem 1.3.1. If Irr(G) is an irreducible character of G then (1) divides |G|.
P
2
Theorem 1.3.2.
Irr(G) (1) = |G|.
Theorem 1.3.3. | Irr(G)| is the same as the number of conjugacy classes of G.
Exercise 1.3.4. Let G be the alternating group A5 then |G| = 60 = 4 3 5. This group
has 5 conjugacy classes with representatives (1), (12)(34), (123), (12345), (13524).
Theorems 1.3.1 and 1.3.3 imply
{(1) | Irr(G)} = {1, 3, 3, 4, 5}.
Note that at least one of the irreducible characters has degree 1 because the trivial representation is always a 1-dimensional irreducible representation of G.
1.4
We now restrict to the case that F = C is the field of complex numbers and we let
k := | Irr(G)|.
Definition 1.4.1. 1 = g1 , g2 , . . . , gk G be representatives of the conjugacy classes of G
then we have {1G = 1 , 2 , . . . , k } = Irr(G). The (square) matrix (i (gj ))16i6j6k is the
ordinary character table of G.
Example 1.4.2. Let G = S3 be the symmetric group on three letters. We have already
seen three irreducible representations of G, namely the trivial representation, sign representation and the 2-dimensional representation computed in (1.5)(3). As there are three
conjugacy classes in S3 this must be all the irreducible characters. We easily see from this
information that the character table of G is given by
1
2
3
1
1
1
2
(12)
1
1
0
(123)
1
1
1
Theorem 1.4.3 (Orthogonality Relations). Let us keep the notation of Definition 1.4.1.
For all 1 6 i, j, ` 6 k we have
1 X
i (g)j (g 1 ) = ij ,
|G| gG
k
X
i=1
(1.1)
(1.2)
Section 1.5
11
k
X
ai i ,
i=1
1.5
Modules
Formally we define FG to be the vector space of all maps Maps(G, F) whose multiplication
is given by the convolution product, (i.e. we define the product of two maps to be ( ?
P
)(x) = hg=x (h)(g) where g, h G).
Now FG is an F-vector space whose dimension is clearly dimF (FG) = |G|. Multiplication
is a distributive extension of multiplication in G.
Section 1.5
12
Example 1.5.2. Assume F = Q is the field of rational numbers and G = S3 . Two typical
elements of the group algebra QS3 are given by
1
1
1 + (12)
2
2
and
1
(23) (123)
2
gG
F-representations
XW appears in the reducible representation XV
XV /W
XV an irreducible representation
XV and
representations
X0 W equivalent
XU 0
X0V =
0 X0W
Using the language of modules above we have Theorem 0.1.10 implies (1) of Facts 1.1.4.
Proposition 1.5.4. If S is a simple FG-module then S
= FG/U for some U 6 FG.
Section 1.6
13
1.6
0
X01 (g)
X02 (g)
0
,
XV (g) =
..
0
0
X` (g)
for all g G where X0i is the corresponding matrix representation of the simple
module Si .
If we have two FG-modules V , W then we know V
= W V and W have the same
composition factors, (by the Jordan-Hlder theorem).
Also if char(F) = 0 then we have V
= W if and only if V = W . In other
words this is saying that the character of a representation uniquely determines that
representation up to isomorphism.
Theorem 1.6.3 (Maschkes Theorem). If |G| F then FG is semisimple.
Proof. Let V be an FG module and U 6 V a submodule. It suffices to show that there
exists a complementary submodule W 6 V such that we get a direct sum decomposition
V = U W as FG-modules. If this is true then we can repeat the argument until we have
expressed V as a direct sum of simple modules.
If we consider V as an F-vector space then we know any vector subspace U has a
complementary subspace W 0 such that V = U W 0 is a direct sum of vector spaces. What
Section 1.6
14
1 X 1 0
g (g v ).
|G| gG
We see that the condition of |G| F is critical as other wise this map is not defined.
We first claim that is an FG-homomorphism, i.e. that is a linear map which respects
the action of FG on V . By the linearity of 0 it is clear that is linear, hence we need only
show that (g v ) = g (v ) for all g G and v V . However its easy to see that we
have
1 X 1 0
h (h (g v )),
|G| hG
1 X 1 0
h (hg v ),
=
|G| hG
1 X
=
(hg 1 )1 0 ((hg 1 )g v ),
|G| hG
!
1 X 1 0
=g
h (h v ) .
|G| hG
(g v ) =
P
P
Note that for any g G we have hG h = hG hg and so we can replace h by hg 1 in
the above summation.
Next we claim that is a projection on to U as well, i.e. |U = IdU . Indeed for any
u U and g G we have g u U because U is an FG-module and so
(u) =
1 X 1
1 X
1 X 1 0
g (g u) =
g gu =
u = u,
|G| gG
|G| gG
|G| gG
1 X 1 0
1 X 1 0
1 X 1
1 X
g (g V )
g (V )
g U
U = U.
|G| gG
|G| gG
|G| gG
|G| gG
Section 1.6
15
k
M
Matdi (C).
i=1
Proof. Recall that a submodule of CG is just a left ideal of the algebra and a simple
submodule is a minimal left ideal, (i.e. a non-zero ideal which contains no proper left
ideals). Then let us define
X
L
Ai :=
Si
=L6CG
We claim that each Ai is a two-sided ideal of CG. For some distinct 1 6 i, j 6 k let
L Ai be a minimal left ideal contained in Ai and a Aj . As Aj is a left ideal we have
La Aj and either La = {0} or is a minimal left ideal isomorphic to Si . However Aj
cannot contain a left ideal isomorphic to Si and so we must have La = {0}. Therefore we
have Ai Aj = {0} unless i = j which means
Ai CG =
k
X
Ai Aj = Ai
j=1
Section 1.6
16
With this structural result we may now prove two of three big theorems that we stated
in Section 1.3. The remaining theorem will require slightly more work.
Proof (of Theorem 1.3.2). This is clear as G forms a basis of CG and the dimension of
Matdi (C) is di2 .
Lemma 1.6.7. Let Ci with 1 6 i 6 k be the conjugacy classes of G. We define the
corresponding class sums to be
Ci :=
x FG
xCi
gxg 1 =
y = Ci
y Ci
xCi
so clearly Ci Z(FG). Recall also that the conjugacy classes are pairwise disjoint and
hence the class sums will be linearly independent. Finally it is left to show that Z(FG) =
P
span{C1 , . . . , Ck }. Let hG h h Z(FG) then for any g G we have
!
g
X
hG
h h g 1 =
X
hG
h h
h (ghg 1 ) =
hG
h h.
hG
Hence for any h G we have ghg 1 = h , which means the map h 7 h is constant on
conjugacy classes so were done.
Proof (of Theorem 1.3.3). Let {S1 , . . . , Sk } be a set of representatives for the isomorphism classes of simple modules of G. By Theorem 1.6.6 we have Z(CG)
= ki=1 C so
dimC (Z(CG)) = k. However by Lemma 1.6.7 we also have dimC (Z(CG)) is the number
of conjugacy classes of G so were done.
The Artin-Wedderburn theorem will also allow us to now prove the orthogonality relations that appeared in Theorem 1.4.3.
Proof (of Theorem 1.4.3). Let i := Si , for 1 6 i 6 k, be the irreducible characters of
G. Recall from the proof of Theorem 1.6.6 that we have a direct sum decomposition
CG = ki=1 Ai .
(1.3)
Section 1.6
17
character are
|G|
(g) =
0
Let us write ej =
hG
g 1 ej =
if g = 1,
otherwise.
h g 1 h (g 1 ej ) =
hG
h (g 1 h) = g |G|.
hG
Pk
By the decomposition in Eq. (1.3) we have = i=1 i (1)i , where here we are using
the fact that Ai is a direct sum of dimC Si modules isomorphic to Si . Using the above
equality we have
k
X
i (1)i (g 1 ej ) = (g 1 ej ) = g |G|.
(1.4)
i=1
0
if i 6= j,
i (g 1 ej ) =
i (g 1 ) otherwise.
Putting this into Eq. (1.4) we obtain our desired formula for the idempotent ej , namely
we have
i (1)i (g 1 )
i (1) X
g =
ej =
i (h1 )h.
|G|
|G| hG
The orthogonality relation in Eq. (1.1) now follows from the orthogonality of the
idempotents and the expression we just obtained. In particular for each i, j {1, . . . , k}
we have
i (1)j (1) X X
i (1) X
1
1
(h
)
(k
)hk
=
i (h1 )h,
i
j
i,j
2
|G|
|G| hG
hG kG
X
i (1) X X
ei ej = i,j ei
X
1 X |G|
1
i (g` )j (g`1 ) = i,j
i (g` )j (g`1 ) = i,j
|G| `=1 |CG (g` )|
|CG (g` )|
`=1
Section 1.7
18
because |G| = |C` ||CG (g` )| by the orbit stabiliser theorem. Let us define two k k matrices
X and Y such that Xi,j = 1/|CG (gj )|i (gj ) and Yi,j = j (gi1 ). The above relation is then
just given by the matrix product XY = Ik . However as these matrices are clearly invertible
this is equivalent to YX = Ik which is simply
k
X
`=1
X
1
` (gi1 )` (gj ) = i,j
` (gj )` (gi1 ) = |CG (gj )|i,j .
|CG (gj )|
`=1
1.7
Integrality
Tr X(x) = [G : CG (g)](g) i =
xCi
[G : CG (g)](g)
. (1.5)
(1)
As the class sums form a basis for Z(CG) we have for each 1 6 i, j 6 k that
Ci Cj =
k
X
`=1
ci,j,` C`
Section 1.8
19
for some ci,j,` C. However as Ci Cj is clearly contained in the subring ZG, comparing
basis elements we see that ci,j,` Z. Applying X and using Eq. (1.5) we have
X(Ci )X(Cj ) =
k
X
ci,j,` X(C` ) i j =
`=1
k
X
ci,j,` `
`=1
k
X
(j,` i ci,j,` )` = 0.
(1.6)
`=1
Let us now define a matrix C by setting Cj,` = ci,j,` for all 1 6 j, ` 6 k. We can express
Eq. (1.6) as the matrix product
1
.
(i Ik C) .. = 0.
k
We may assume without loss of generality that C1 = {1} then X(C1 ) = I 1 = 1.
Therefore the system of equations determined by the matrix i Ik C has a non-trivial
solution, namely the column vector given above, so by a standard result in linear algebra
det(i Ik C) = 0. Hence i is a root of the characteristic polynomial p(X) = det(XIk C).
From linear algebra we know p(X) is monic and p(X) Z[X] as C takes values in Z, in
other words i is an algebraic integer.
Proof (of Theorem 1.3.1). Let g1 , . . . , gk be representatives for the conjugacy classes of
G. Using the orthogonality relation Eq. (1.1) we have
|G| =
(g)(g
)=
k
X
i=1
gG
1.8
Throughout this section F will be any field and H will be any subgroup of G.
Definition 1.8.1. Assume V is an FG-module and W is an FH-module.
We denote by VH the restriction of V to H, where the H action is given via the
embedding FH FG.
We define W G := FG FH W to be the induced module, (where W is induced from
H to G).
Note the second definition make sense as FH is naturally an (FG, FH)-bimodule.
Section 1.8
20
Remark 1.8.2.
(1) Let W = F with the trivial FH-action then W G affords a permutation representation
(over F) arising from the quotient map G G/H. Choose coset representative
g1 , . . . , g` such that we have a disjoint union
G=
`
G
gi H.
i=1
`
M
(gi FH FH F) =
i=1
`
M
(gi FH F).
i=1
`
X
i=1
2.1
Modular Systems
Qp
Zp
Fp
where the vertical arrows are given simply by inclusion. Sometimes it is useful to have F
algebraically closed and this can be achieved by extending further.
Exercise 2.1.6. It is impossible to have K and F algebraically closed and the valuation
discrete.
We now assume that p is fixed and (K, O, F) is a splitting p-modular system for all subgroups of G.
Section 2.3
2.2
22
Change of Coefficients
Representations over O provide a bridge between representations over fields of characteristic 0 and fields of characteristic p.
Definition 2.2.1. A finitely generated OG-module L is called an OG-lattice if it is projective as an O-module.
Remark 2.2.2. If L is such a module then KL := KO L is a finitely generated KG-module
and FL := F O L is a finitely generated FG-module.
In this way we get functors
KGmod OGlat FGmod
where KGmod denotes the category of finitely generated KG-modules.
A natural question to now ask is which KG-modules, respectively FG-modules, come
from OG-lattices? In the case of KG-modules we have the following result.
Proposition 2.2.3. For any finitely generated KG-module V there exists an OG-lattice L
such that V
= KL.
Remark 2.2.4.
(i) If V is a finitely generated KG-module and L is an OG-lattice such that V
= KL
then we call L an O-form of V . In general L is not unique up to isomorphism.
(ii) Let V : G GLn (K) and L : G GLn (O) be corresponding matrix representations then there is an element A GLn (K) such that
L (g) = AV (g)A1
for all g G. Suppose that L (g) = (ij (g)) for g G then
L : G GLn (F),
g 7 (ij (g))
is a matrix representation for FL where := + J (O) for O.
Definition 2.2.5. A finitely generated FG-module M is called liftable if M
= FL for some
OG-lattice L.
Remark 2.2.6. It is true that most FG-modules are not liftable.
2.3
Brauer Characters
Section 2.4
23
Section 2.5
2.4
24
Grothendieck Groups
We denote by R(KG) the Grothendieck ring of KG. This is defined to be the quotient
of the free abelian group generated by the isomorphism classes [M] of finitely generated
KG-modules M by the subgroup U generated by all expressions [M] [M 0 ] [M 00 ] such
that
0 M 0 M M 00 0
is a short exact sequence of finitely generated KG-modules.
The sum and product in R(KG) is given by the direct sum and tensor product K
respectively. The elements [[Vi ]] := [Vi ] + U, (for i = 1, . . . , k), where {V1 , . . . , Vk } is a
transversal for the isomorphism classes of simple KG-modules form a Z-basis of R(KG).
Recall that k = k(G) is the number of conjugacy classes of G. We then have 1R(KG) = [[K]]
where K = KG is the trivial KG-module. For finitely generated KG-modules M and N we
have [[M]] = [[N]] M
= N.
Moreover R(KG) can be identified with the character ring
Ch(G) := {1 2 | 1 , 2 are characters of finitely generated KG-modules}.
The Grothendieck ring of R(FG) is defined in a similar way. The set {[[S1 ]], . . . , [[S` ]]}
is a Z-basis for R(FG) where {S1 , . . . , S` } is a transversal for the isomorphism classes
of simple FG-modules. For finitely generated FG-modules M and N we have [[M]] =
[[N]] R(FG) M and N have the same composition factors (including multiplicities).
Moreover R(FG) can be identified with the Brauer character ring
BCh(G) := {1 2 | 2 , 2 are Brauer characters of finitely generated FG-modules}.
The elements in Ch(G) and BCh(G) are called virtual characters and virtual Brauer characters.
2.5
Section 2.6
25
`
X
dij j .
j=1
The decomposition number dij is the multiplicity of a simple FG-module Sj with the Brauer
character j as a composition factor of FLi where Li is an O-form of a simple KG-module
Vi with character i . In particular we have dij N. We can then form a matrix D Zk`
such that Dij = dij called the decomposition matrix.
Brauer proved that d is always surjective (via his characterisation of characters). Thus
there is X Z`k such that XD = 1` . Thus all the elementary divisors of D are equal.
Morever
R(FG) = {d(x) | x R(FG)}.
2.6
Projective FG-modules
Every indecomposable FG-module P has the form, (up to isomorphism), P = FGe where
e is an idempotent which is primitive because P is indecomposable. Then P has a unique
maximal submodule Rad(P ), (called the radical of P ), such that P/ Rad(P ) is a simple
FG-module. The map P 7 P/ Rad(P ) gives a bijection
(
)
isomorphism class of indecomposable
projective FG-modules
)
.
FG-modules
Let P(FG) be the Grothendieck group of projective FG-modules. This is the free
abelian group generated by the isomorphism classes [P ] of the finitely generated projective
FG-modules quotiented by the subgroup generated by all expressions [P ] [P 0 ] [P 00 ] such
that
0 P 0 P P 00 0
is a (split) short exact sequence of projective FG-modules. Now P(FG) has a product
coming from F but in general it does not have an identity element. If {P1 , . . . , P` } is
a transversal for the isomorphism classes of indecomposable projective FG-modules then
[P1 ], . . . , [P` ] forms a Z-basis of P(FG).
There is a natural map c : P(FG) R(FG) defined by c([P ]) = [[P ]] which is called
the Cartan map. With P1 , . . . , P` as above set Si := Pi / Rad(Pi ) to be the simple quotient
of Pi then we write
`
X
[[Pi ]] =
cij [[Sj ]].
j=1
We can then form a matrix C Z`` such that Cij = cij called the Cartan matrix. Each
Cartan invariant cij is the multiplicity of Sj as a composition factor of Pi then cij N0 .
Section 2.8
26
We will see that C is symmetric and positive definite. Brauer proved that the elementary
divisors of C are given in the following way.
Let {g1 , . . . , g` } be a transversal for the p 0 -conjugacy classes of G. For j = 1, . . . , ` let
Tj be a Sylow p-subgroup of CG (gj ) then |T1 |, . . . , |T` | are the elementary divisors of C.
In particular
`
Y
det C =
|Tj |
j=1
is a power of p. Thus, if two finitely generated projective FG-modules P and P 0 have the
same composition factors (including multiplicities) then P
= P 0.
2.7
Projective OG-modules
Let P be a finitely generated OG-module then P is an OG-lattice and FP is a finitely generated projective FG-module. Moreover if P is indecomposable then FP is indecomposable.
This gives a bijection
(
)
isomorphism class of indecomposable
projective OG-modules
)
isomorphism classes of indecomposable
projective FG-modules
One can define a Grothendieck group P(OG) in the usual way and then one can identify
P(OG) and P(FG) by tensoring with F. There is a natural map e : P(OG) R(KG)
defined by e([P ]) = [KP ]. Brauer proved the following reciprocity theorem.
Theorem 2.7.1. If Pj is an indecomposable projective OG-module and Sj = FPj / Rad(FPj )
is the corresponding simple FG-module then
e([Pj ]) =
k
X
dij [[Vi ]]
i=1
where {V1 , . . . , Vk } is a transversal for the isomorphism classes of simple KG-modules and
dij are the decomposition numbers.
Corollary 2.7.2.
(i) C = DT D where C is the Cartan matrix.
(ii) e is injective and the image of e : P(OG) R(KG) = Ch(G) consists of all
Ch(G) such that |G\Gp0 = 0. Moreover the following diagram commutes
P(OG)
P(FG)
This diagram is called the cde-triangle.
R(KG)
d
R(FG)
Section 2.9
2.8
27
p-Solvable Groups
2.9
Relative Projectivity
In this section we will only work with FG-modules but similar results also hold for OGlattices.
Theorem 2.9.1 (KrullSchmidt). Every finitely generated FG-module M has a decomposition M = M1 Mt where M1 , . . . , Mt are indecomposable FG-modules. Moreover
M1 , . . . , Mt are unique up to isomorphism and reordering.
For H 6 G a subgroup of G we have functors
Restriction: ResGH : FGmod FHmod given by M 7 M.
Induction: IndGH : FHmod FGmod given by N 7 FG FH N.
For K, H 6 G two subgroups of G and a finitely generated FH-module N we have a
Mackey decomposition. Namely
ResGK (IndGH (N)) =
gHg
IndK
KgHg 1 (ResKgHg 1 (g N))
KgHK\G/H
Section 2.11
28
Definition 2.9.4. Let M and N be finitely generated FG-modules then the linear map
TrGH : HomFH (M, N) HomFG (M, N) defined by
f 7
gHG/H
2.10
Section 2.13
2.11
29
2.12
Warning: If M is a simple FG-module with vertex Q then its Green correspondent is not
in general simple.
Conjecture 2.12.1 (Feit,79). Let Q be a finite p-group then there are only finitely many
isomorphism classes of indecomposable FQ-modules which are sources of simple FGmodules for overgroups G > Q.
Theorem 2.12.2. Let Q be a finite p-group and let n N then there are only finitely many
isomorphism classes of (indecomposable) FQ-modules of dimension n which are sources
of simple FG-modules for overgroups G > Q.
2.13
Section 2.14
30
Definition 2.13.1.
(i) A finitely generated FP -module is called a permutation module if it has an F-basis
X permuted by the action of P , (i.e. gx X for all g P and x X).
(ii) A finitely generated FP -module M is called an endopermutation FP -module if EndF (M)
is a permutation module. note that we define a module structure on EndF (M) by
(g f )(m) = gf (g 1 m) for all g G, f EndF (M) and m M.
Remark 2.13.2. We have EndF (M)
= M M where M = HomF (M, F) is the dual of
M.
Example 2.13.3. Let FP be the trivial module for P then IndGH (FP ) is an endopermutation
module.
We now give a list of properties of endopermutation modules that are known to hold.
(i) Permutation modules are endopermutation modules.
(ii) If M is an endopermutation FP -module then so are M and M where
0 M PM M 0
is a short exact sequence and PM M is a projective cover of M.
(iii) Let M be a permutation FP -module with permutation basis X and let : M F
be the augmentation map given by
X
xX
x x 7
xX
2.14
Section 2.14
31
Definition 2.14.6. A finite p-group Q is said to have normal p-rank 1 if every normal
abelian subgroup of Q is cyclic.
Remark 2.14.7. Such a group is either cyclic, a quarternion group such that |Q| > 8, a
dihedral group of order |Q| > 16 or a semidihedral group such that |Q| > 16.
Definition 2.14.8 (Bouc). A subgroup S 6 P is called genetic if NP (S)/S has normal
p-rank 1. In this case ZP (S) is defined by the equality ZP (S)/S = Z(NP (S)/S).
Definition 2.14.9. For genetic subgroups S, T 6 P one writes S lP T if there are
x, y P such that x T ZP (S) 6 S and y S ZP (T ) 6 T .
Remark 2.14.10. The relation lP is an equivalence relation. A transversal for the equivalence classes is called a genetic basis of P .
Theorem 2.14.11 (Bouc). Let G be a genetic basis of P then
0
if F4 6 F,
otherwise.
Section 2.15
32
Remark 2.14.12. Boucs proof makes use of connections with the Burnside ring of P ,
i.e. the Grothendieck ring of finite P -sets and the Grothendieck ring R(QP ) which was
investigated before (Roquette, RitterSegal).
Theorem 2.14.13. If G is a p-solvable group then the sources of the simple FG-modules
are torsion endopermutation modules so their classes belong to the torsion subgroup of
the relevant Dade group.
2.15
Let A(FG) be the Green ring of FG. This is defined to be the Grothendieck ring of all
finitely generated FG-modules quotiented by the subgroup generated by relations [M]
[M 0 ] [M 00 ] where
0 M 0 M M 00 0
is a split short exact sequence in FGmod. We have A(FG) is a commutative ring which
in general is not Noetherian.
Definition 2.15.1. An FG-module M is called algebraic if there are a0 , . . . , ak Z such
that
a0 + a1 [M] + + an [M]n = 0
and the ai are not all 0.
Remark 2.15.2. This means that the tensor powers F, M, M M, M M M, . . . have
altogether only finitely many indecomposable direct summands (up to isomorphism).
Theorem 2.15.3 (BergerFeit). If G is a p-solvable group then the simple FG-modules
are algebraic.
Remark 2.15.4. The proof of this result needs a consequence of the classification of finite
simple groups.
This result of BergerFeit implies Theorem 2.14.13. A corollary of their result is that
Feits conjecture holds for the subclass of p-solvable groups.
3. Block Theory
3.1
Measuring Semisimplicity
(3.2)
Section 3.2
34
3.2
Module Decompositions
{blocks of FG}
Section 3.2
35
Pt
i=1
mi di = n. We then have
X
1
xg g 1 b.
[G : H]
gG/H
H H (x) =
gG/H
= xb,
which is x becuase b is the identity of the block algebra B and x B. Hence H H = 1
so H splits as required.
Definition 3.2.4 (Brauer). A defect group of b (or B) is a p-subgroup P of G which is
minimal with respect to the property that P splits.
Proposition 3.2.5. We have {1} : B F B B is split if and only if B is a semisimple
algebra if and only if B
= Matn (F) for some n.
Proof. Omitted.
Section 3.3
36
3.3
H 2 (G, F )
isomorphism classes of
Section 3.4
37
3.4
b-Brauer Pairs
BrP (C) :=
x if C = {x}.
Proposition 3.4.3. BrP is a surjective homomorphism of k-algebras.
Proof. Let Ci , Cj ClP (G) be two arbitrary P -conjugacy classes of G then there exist
integers ci,j,k Z such that
`
X
Ci Cj =
ci,j,k Ck ,
(3.3)
k=1
where ` = | ClP (G)|. This follows from the fact that the class sums form an F-basis of
(FG)P and the structure constants are in Z by the same argument used in the proof of
Section 3.4
38
g g if |C | = |C | = 1,
i j
i
j
`
X
k=1
ci,j,k gk .
|Ck |=1
gG
gCG (P )
g g.
(3.4)
(3.5)
If i 6= j then
Section 3.4
39
so bi Z((FG)P ) and as BrP is surjective we have BrP (bi ) Z(FCG (P )). In particular
we have
1 = BrP (1) = BrP (b1 ) + + BrP (br ),
(3.6)
which is an orthogonal idempotent decomposition of 1 in Z(FCG (P )). Comparing this
with a block decomposition 1 = e1 + + es of 1 in FCG (P ) we have a partition
{blocks of FCG (P )} =
E(bi )
16i6r
eE(bi )
Definition 3.4.5. Let b be a block of FG. A b-Brauer pair is a pair (P, e) where P is a
p-subgroup of G and e is a block of FCG (P ) such that e EP (b).
Let us define B(b) to be the set of all b-Brauer pairs. Note that this set can never be
empty because ({1}, b) B(b)! If e is a block of FCG (P ) then g e is a block of FCG (g P )
and if
X
BrP (b) =
e
eE)P (b)
then we have
X
e.
eEP (b)
(FG)Q
BrP
BrQ
FCG (P )
FCG (Q)
Section 3.6
40
gCG (P )
3.5
Let P 6 G be a p-subgroup of G then P is a defect group of FGb if and only if any Brauer
pair (P, e) of the block e of F[CG (P )/Z(P )] has trivial defect group and p - [NG (P, e) :
P CG (P )].
Theorem 3.5.1. If P is a defect group of FGb then BrP (b) is a block of FNG (P ) with
defect group P and the map C 7 BrP (C) is a bijection between the set of blocks of FG
with defect group P and the set of blocks of FNG (P ) with defect group P .
Definition 3.5.2. The principal block of FG is the (unique) block of FG containing the
trivial FG-module. Equivalently it is the block not contained in the kernel of the augmentation map FG k given by
X
X
g g 7
g .
gG
gG
Section 3.8
3.6
41
B(b) {p-subgroups of G}
of G-posets and the defect groups of FGb are the Sylow p-subgroups of G.
Example 3.6.1. Assume p = 2 and let G be GLn (q) such that 2 - q then we have a
bijection
(
{blocks of FG}
denoted b(s) (s). The Sylow p-subgroups of CG (s) are defect groups of b(s) . Suppose
the defect group P of FGb(s) is cyclic. If n is odd there exists a unique element of B(b(s) )
whose first component is P . If n is even then there are n elements of B(b(s) ) whose first
component is P .
Definition 3.6.2. If P is a defect group of FGb then the block BrP (b) of FNG (P ) is called
the Brauer correspondent of b.
3.7
Assume (P, eP ) is a maximal b-Brauer pair. For each subgroup Q 6 P denote by eQ the
unique block of FCG (Q) such that (Q, eQ ) B(b) is a b-Brauer pair and (Q, eQ ) 6 (P, eP ).
Definition 3.7.1. The fusion system of FGb is the category F := F(P,eP ) (G, b) whose objects are the p-subgroups of P and whose morphisms are defined in the following way. Let
Q, R 6 P be subgroups of P then we define HomF (Q, R) to be the set of all homomorphism : Q R such that there exists g G with g (Q, eQ ) 6 (R, eR ) and (x) = gxg 1
for all x Q.
Remark 3.7.2. We note that HomF (Q, R) is contained in the set of all injective group
homomorphisms Q R. Also composition in F is just given by composition of functions.
The fusion system F has many nice properties. For instance it is a result of Puig that
F is a saturated fusion system on P . In particular if Q 6 P then we have AutF (Q) =
HomF (Q, Q) 6 Aut(Q). Define OutF (Q) to be the image of AutF (Q) under the canonical
map Aut(Q) Out(Q) then OutF (P ) is a p 0 -group. The reason for this is that
AutF (Q) = NG (Q, eQ )/CG (Q)
OutF (Q)
= NG (Q, eQ )/QCG (Q).
Section 3.8
3.8
42
Let (P, eP ) be a maximal b-Brauer pair and denote by F the fusion system F(P,eP ) (G, b).
Definition 3.8.1. We say a subgroup Q 6 P is F-centric if CP (R) = Z(R) for any
subgroup R 6 P in the F-isomorphism class of Q. This is also sometimes called selfcentralising.
Example 3.8.2. The group P itself is F-centric.
Proposition 3.8.3. A subgroup Q is F-centric if and only if F[CG (Q)/Z(Q)]
eQ has trivial
defect group.
The above result then says that Q is F-centric if and only if F[CG (P )/Z(Q)]
eQ is a
matrix algebra over k. Let us define
C := CG (Q)/Z(Q)
= QCG (Q)/Q C NG (Q, eQ )/Q =: N
then eQ is an N-stable
block of FC with trivial group. Therefore we have a corre2
sponding 2-cocycle class N,
C, F ) = H 2 (OutF (Q), F ) because
C,
eQ = Q H (N/
C
N/
= OutF (Q). By Theorem 3.3.4 we have FN e is a matrix algebra over FQ (OutF (Q)).
Theorem 3.8.4 (KlshammerPuig). Suppose that Q 6 P is F-centric. There exists a
finite group LQ such that we have a short exact sequence
1 Q LQ OutF (Q) 1
and an equivalence of categories mod(FNG (Q, eQ )eQ ) mod(FQ LQ ) where Q also
denotes the pull back of Q to an element of H 2 (LQ , F ).
Let us consider the special case of this result when Q = P which we have already
said is F-centric. The group OutF (P ) is a p 0 -group so P is a Sylow p-subgroup of LP .
By the SchurZassenhaus theorem we have LP is a semidirect product P o E where E is
isomorphic to OutF (P ).
Theorem 3.8.5. We have equivalences of categories
mod(FNG (P ) BrP (b)) mod(FNG (P, eP )eP ) mod(FP (P o E))
where E is a p 0 subgroup of Out(P ).
Theorem 3.8.6. If P CG is a normal subgroup of G then we have an equivalence mod(FGb)
mod(FP (P o E)) for some subgroup E 6 Out(P ).
Theorem 3.8.7 (KlshammerPuig,Dade). Suppose G is a p-solvable group then there
exists a subgroup Q of P and a subgroup E of Out(Q) such that we have an equivalence
mod(FGb) mod(F (L)) for some L and H 2 (L, F ) such that
1 Q L Out(Q) 1
Section 3.10
43
3.9
Known Results
Remark 3.9.1. In the following cases Alperins Weight Conjecture and Brous Abelian
Defect Group Conjecture are known to hold, (we will state these conjectures below).
Assume b is a block of G then we consider the local datum of the block algebra FGb
to be the set {P, F, Q | Q 6 P is an F-centric subgroup}.
(i) If P = {1} then FGb M F and `(FGb) = 1.
(ii) If OutF (Q) is a p-group for every Q 6 P which is F-centric then FGb M FP and
`(FGb) = 1. This comes from the Nilpotent block theorem of Puig, BrouPuig Source algebra of FGb.
(iii) If P is cyclic then FGb M some Brauer tree algebra and `(FGb) = | OutF (P )|.
Note we also always have
FGb D FNG (P ) BrP (b).
This is due to BrauerDadeThomsonJanezGreenReidtman and Richard by the
Green correspondence.
(iv) Assume p = 2 and P is either isomorphic to C2 C2 , a dihedral, semidihedral or
generalised group then
FGb M (some) Erdmann algebra
and `(FGb) = 1, 2 or 3. This is due to BrauerOlsson and Erdmann by Auslander
Reiten theory.
3.10
Section 3.12
44
Q6P
where the sum is taken over a set of representatives of the F-isomorphism classes of
F-centric subgroups.
The usual formulation of this conjecture is
`(FGb) =
where the sum runs over a set of representatives for the G-conjugacy classes of p-subgroups
of G.
Assume now that Q is trivial for all Q. If P is abelian then P is the only F-centric
subgroup so Alperins Weight Conjecture in this case becomes
`(FGb) = `0 (FP (OutF (P )))
which reformulating states that
`(FGb) = `0 (FNG (P ) BrP (b)).
Alperins Weight Conjecture is also know when p = 2 and P is a metacyclic group, (i.e.
P contains a cyclic normal subgroup whose corresponding quotient group is also cyclic), by
Benjamin Sambale (2010). Also when P
= C2 C2 C2 this is also known to hold by work
of KessarKoshitaniLinckelmann which uses the classification of finite simple groups.
3.11
3.12
Finiteness
Say b is a P -block if P is a finite group such that the defect groups of FGb are isomorphic
to P .
Theorem 3.12.1 (BrauerFeit,56). If b is a P -block then we have
`(FGb) 6 dimF (Z(FGb)) 6 |P |2 .
Section 3.14
45
Theorem 3.12.3. Let a = |P |2 then there are at most p a F-algebras which occur as
centres of P -blocks.
The centre of a finite dimensional F-algebra is an invariant of the Morita equivalence
class of the algebra.
Conjecture 3.12.4 (Donovan). There are only finitely many Morita equivalence classes
of P -blocks.
This conjecture is known when P is cyclic, C2 C2 , Q8 and is almost known for the
groups given in part (iv) of Section 3.9.
3.13
C(b1 )
0
...
0
..
0
C(b
)
.
2
C=
..
...
.
0
0
...
0 C(br )
where b1 , . . . , br are the blocks of FG and C(bi ) is an `(bi ) `(bi ) matrix, (where `(bi ) 6
|P |2 ). The matrix C(b) is called the Cartan matrix of the block algebra FGb.
Conjecture 3.13.1 (Weak Donovan Conjecture). There are only finitely many Cartan
matrices of P -blocks.
Conjecture 3.13.2 (Rationality Conjecture). There exists a natural number d, depending only on P , such that any P -block is Mortia equivalent to an algebra which has an
Fp -form.
It is known that Conjecture 3.12.4 is equivalent to knowing Conjecture 3.13.1 and
Conjecture 3.13.2.
3.14
Blocks in Characteristic 0
Let (K, O, F) be a p-modular system which is a splitting p-modular system for all subgroups
of G and let us denote by J (O) the maximal ideal of O. Then we have the following
sequence of ring homomorphisms
Section 3.14
46
If O then we denote by
the element + J (O) F. These ring homomorphisms
then extend to homomorphisms
KG
OG
FG
P
P
where the map OG FG is given simply by gG g g 7 gG
g g. A block of OG
is a primitive idempotent of Z(OG). Note that the surjective homomorphism OG FG
restricts to a surjective homomorphism
Z(OG)
Z(FG)
of OG such
Idempotent Lifting: For each block b of FG there exists a unique block b
FG
= FGb1 FGbr
Irr(G, b)
16i6r
Section 3.14
47
Recall from the proof of Theorem 1.4.3 we have the central primitive idempotent
corresponding to is given by
e =
(1) X
(g 1 )g Z(KG).
|G| gG
We then have
=
b
X
Irr(G,b)
X
X
1
e =
|G| gG
(1)(g 1 ) g.
(3.7)
Irr(G,b)
Recall from Theorem 1.7.2 that for each C ClG (G) and x C we have
:=
(C)
|G|(x)
O.
(1)|CG (x)|
Theorem 3.14.1. We have two characters , 0 Irr(G) belong to the same block of FG
0 (C)
(mod J (O)) for all p 0 -conjugacy classes C of G.
if and only if (C)
For any natural number n N let p (n) denote the number a such that p a is the
highest power of p dividing n.
Definition 3.14.2. Let b be a block of FG and Irr(G). The defect of is the value
p (|G|) p ((1)) N {0}.
The defect of b is then the value
b = max{p (|G|) p ((1)) | Irr(G, b)}.
For any Irr(G, b) the height of is defined to be
ht() = p ((1)) + b p (|G|) > 0
From the definitions we see that for any character Irr(G, b), (where b is a block of
FG), we have ht() = 0 is of maximal defect amongst all the elements of Irr(G, b).
In particular Irr(G, b) always contains a character of height 0.
Proposition 3.14.3. If P is a defect group of a block b of FG then |P | = p b .
Proposition 3.14.4. Let b be a block of FG and Irr(G, b) then the following are
equivalent.
(i) b = 0,
(ii) P = {1},
(iii) FGb is a matrix algebra,
Section 3.15
48
is a matrix algebra,
(iv) OG b
(v) (x) = 0 for all g G Gp0 ,
(vi) | Irr(G, b)| = 1.
3.15
R(KG)
P(FG)
d
c
R(FG)
At the level of virtual characters we can think of this as the triangle of maps
7
{ Ch(G, b) | |GGp0 = 0}
Ch(G, b)
BCh(G, b)
Proposition 3.15.2. For Ch(G, b) we define
: G K by
p b (g) if g G 0 ,
p
(g)
=
0
if g G \ Gp0 ,
for all g G. The followng hold
(i)
Ch(G, b)
Section 3.17
49
0 =
Irr(G,b)
X
Irr(G,b)
i =
Irr(G,b)
Irr(G,b)
where the last inequality is obtained from part (ii) of Proposition 3.15.2. Calculating from
the definition we see that
h
0 ,
0 i =
p 2b X
0 (g)0 (g 1 ),
|G| gG
p0
2b
p
|G|
=p
2b
0 (g)0 (g 1 ),
gG
h0 , 0 i,
= |P |2 .
Finally we need only notice that | Irr(G, b)| = dimF (Z(FGb)).
3.16
Let c Gp then for any Cl(G) we let dx () : CG (x)|p0 K be the map given by
y 7 (xy ).
The resulting map dx : Ch(G) {class functions CG (x)p0 K} is the generalised decomposition map with respect to x. For Irr(G) we write
dx () =
x
d,
IBr(CG (x))
for the generalised decomposition number, (note that this may not be an integer).
Theorem 3.16.1. Let b be a block of FG and e a block of FCG (x). If (hxi, e) B(b) is
x
not a b-Brauer pair then d,
= 0 for all Irr(G, b) and all IBr(CG (x), e).
3.17
Theorem 3.17.1.
Section 3.18
50
(i) Suppose that x, y G are such that xp and yp are not G-conjugate then
X
(x)(y 1 ) = 0
Irr(G,b)
(y )0 (y 1 ) = 0.
s(x)
Let (P, eP ) be a maximal b-Brauer pair (Q, eQ ) 6 (P, eP ) for all Q 6 P and F the corresponding Fusion system. Say x, y P are F-isomorphic if there exists an automorphism
: hxi hy i in F such that (x) = y .
Theorem 3.17.2. For any block b of FG we have
| Irr(G, b)| =
`(FCG (x)ehxi )
xP/F
3.18
c the respective
Let H 6 G be a subgroup of G, b a block of FG, c a block of FH and b,
lifts. We define the truncated induction functor
References
[Wei94] Charles A. Weibel. An introduction to homological algebra, volume 38 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge,
1994. ISBN 0-521-43500-5; 0-521-55987-1. xiv+450 pp.