Wisconsin Bourbaki Seminar
Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 26 March 2014
Notes and References
This is an excerpt from notes of the Wisconsin Bourbaki Seminar, Fall 1993. The notes were written by Oliver Eng, Susan Hollingsworth, Mark Logan, Arun Ram and Louis Solomon.
§4
In the exercises below, designates a Coxeter system. One supposes that
is finite and its cardinality is called the rank of
We identify with a subgroup of
through
-
Let be the orthgonal to with respect to the form
Show that is the radical of and that
is a direct sum of absolutely simple, pairwise nonisomorphic modules and that the number of them is the same as the number of connected componenets in the graph
Solution. is a real vector space with basis
acts on by
for each By definition
We must show
-
where is the intersection of all maximal submodules of
-
is a direct sum of modules
corresponding to the connected components of the graph
-
The are simple.
-
The are pairwise nonisomorphic.
-
The are absolutely simple, i.e. upon extending to
they remain simple
-
Let and let be a maximal submodule of
Since
for all so is fixed by
Suppose Then is a
submodule of Since is maximal we must have that
So for each basis element
there exist and
such that
Thus
and
So
So which is clearly a contradiction. So and we have that
Now let We will show that
by showing
that for all
Suppose that there is some such
that
Then
and
since
So
Let be the connected component of
containing If and are adjacent in
then
and since
we will get that
In this way we get for all
If is connected then
and we get that This is a
contradiction since because is finite dimensional there exist maximal submodules of So
is not connnected.
For each labeling the components of let
be the span of the basis vectors such that
Then
is a submodule of Let
Then So is contained in some maximal submodule
All basis vectors in are contained in
and hence in So
but this is a contradiction.
So we have that for
all So
for all So
So
-
Let
be the connected components of the graph Let
be the span of the cosets
for all
Then is a submodule of and it is clear that
is a direct sum of the
-
Suppose that is a nonzero submodule of Let
Note that
and
for all
Since there exists
such that
Then
So
By a similar connectivity argument as above we have that for all
It follows that
Thus
is an irreducible submodule of
-
Suppose that
is a module homomorphism. Let be a vertex in
so that
Then
and so
On the other hand
So
for each vertex
Since
and we have that must be the zero map.
Thus and are not isomorphic.
-
Proposition 1, Chapt V §2, states that if is a group, an irreducible representation of
on a vector space and if there exists such that
is a pseudoreflection then is absolutely irreducible. Let be a vertex in
and let be a vertex of
which is connected to
Since
and since
if is connected to in it follows that
and that
is a pseudo reflection on
Thus it follows that is absolutely irreducible.
Notes. It seems that it would be instructive to understand this explicitly in the cases of
and
-
Suppose that If
let
where
Let
-
If show that is positive degenerate
(in which case is finite).
-
If show that is positive degenerate.
-
If show that is non degenerate, and of
signature
Show that in case a), the order of is given by the formula
Solution. Recall that acts on a vector space over with basis
and that the form satisfies
where
and
Then the matrix of the form is
The determinants of the principal minors are
and since we have that the
determinants of the principal minors are all Thus the form
is positive if
-
The possibilities such that are
where
-
The possibilities such that are
-
Given that is a decreasing function for
it follows from b) that
We show that
has signature
Case 1. Assume that
for some
Without loss of generality we may assume that
Then if we let
where and and
are uniquely determined such that
Since
and it follows that
has signature
Case 2.
for all Then the matrix of is given by
One checks that
Thus has signature
We know that
is a dihedral group of order
Use the formula
from Ex. 5 §3. Then we have that
So
Thus and
-
-
Let be an integer or
Show that requiring
is equivalent to requiring
-
Let be a discrete subgroup of of rank
Show that, if is
stable under then the integers
for belong to the set
-
Suppose that
for A family
of positive real numbers
is called radicielle if they satisfy the following conditions:
If is such a family, one puts
Show that one has
Deduce that the discrete subgroup with base
is stable under
-
With hypotheses as in c), suppose that the graph is a forest.
Show that then there exists at most one radicielle family
Solution. a) and b) were done in class.
-
If then
and so
If then
and so
If then
So
or
If then
So or
If then
So
or Note that in these cases we have that
-
Since the Coxeter graph is a forest we may let be a pendant node. By induction we may assume that there is
a radicelle family for the graph
Since is connected to a unique node of
we can certainly extend according to the rules above.
Notes. Suppose that is a finite reflection group with
a simple system such that for all
Define
where the are as given in c) above. We will show that
for all
Suppose the contrary. Then we may choose a simple system such that
and such that
So there exists and
such that Then
So and cannot be joined in the Coxeter graph by a sequence of edges labeled 3.
Let be the set of elements of which canot be joined to by edges labeled 3. Let
be the free group on and let be the normal closure of the set of relators for the
Coxeter system so that Define a map
If then
and if then
So factors through and thus is a homomorphism from
to Since
and
it follows that
and
are not conjugate in
On the other hand if the form is invariant under we have that
So and
are conjugate which is a contradiction. Therefore
for all
page history