Wisconsin Bourbaki Seminar
Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 24 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.
§3
-
Let be a finite dimensional real vector space with an inner product. Let be a finite subgroup of the orthogonal
group of generated by reflections. Let be a discrete subgroup of
stable under Let be the group of affine transformations of
generated by and translations by vectors in Let
be the set of hyperplanes in such that
and let be the set of such that there exists a hyperplane
such that
-
Show that is generated by (affine) reflections if and only if generates
as a
-
Consider with the scalar product
Let
and let be the dihedral group generated by the
Let be the discrete subgroup of generated by
the The subgroup is stable
under Show that is not generated by reflections.
Solution.
-
Assume that generates
is generated by and translations in
Translations in are generated by translations in
So it is sufficient to show that translations by vectors in are generated by reflections.
Let and let be the corresponding translation. Suppose that
is orthogonal to Then
-
-
is order since
and thus
-
fixes the hyperplane
since if is on
the hyperplane then
is a corresponding point on the hyperplane
and thus
It follows from b) and c) that is the reflection about the
hyperplane So
Thus translations by elements of are generated by reflections.
Suppose that is generated by reflections.
If let
denote the translation by the vector Then if we let
is normalized by
and hence the group of affine transformations of is the semidirect product of by
since only the identity is both a translation and an
element of Thus, since
is stable under every element of is uniquely expressible as
for some and
and hence
is normalized by
Now consider an affine reflection
The reflection is determined by its fixed set, which is an affine hyperplane. This affine hyperplane may be written as
where is a (linear) hyperplane, and
is perpendicular to Then
and acts by
for (To get from
to we add
then add it again to get its mirror image.
This is since the orthogonal projection of in the affine hyperplane is simply
See the diagram.)
But if we let be the orthogonal
reflection in then for
So it follows that any affine reflection in is uniquely expressible as
where
and is orthogonal to
(and hence
Now suppose is arbitrary. Then
may be written as a product of affine reflections
in say
with
and where
is an affine reflection. By the remark
above it follows that for all
Now note that if
then
Applying this repeatedly to the right hand side of we get
where
Thus and
(which is not used).
But is clearly stable under and
permutes and is orthogonal. Thus it folllows from the
definition of that
Therefore, since for
each of
Thus lies in the of elements of
and hence generates
-
See attached picture.
-
Let be a finite dimensional vector space over
a finite subgroup of generated by reflections. Show that
every element of order in is generated by pairwise commuting reflections belonging to
Solution. The proof is by induction on the dimension of If
then there is only one element of order in
and this is certainly a reflection. Assume
and let be an element of order We may choose a basis of
such that the matrix of with respect to this basis is diagonal with digonal entries
There are two cases:
Case 1. fixes a nonzero subspace of pointwise.
Let be the set of hyperplanes such that is generated by the reflections in these hyperplanes. Define
Then, by Proposition 2, Chapt. V §3, is generated by reflections in the hyperplanes
in the set
Since fixes is an element of
and
acts on and
By induction we have that
where are pairwise commuting reflections. If we let
be the reflection which acts on by the identity and on as
then
It is clear that since the reflections
are pairwise commuting so are the reflections
The reflections
are elements of since they are reflections in hyperplanes in
Case 2. The only element which fixes is
Then for all
Since is in the center of
is in the center of Since is generated by reflections we can write
as a product of reflections. Since
is in the center
Let Then
Since then
and so by case 1 we may write
as a product of pairwise commuting reflections Since
it follows that
for each So can be written as a product of pairwise commuting reflections.
Notes. Recall that The longest element of the Weyl group is an element of order
It is interesting to write these elements as a product of pairwise commuting reflections.
-
Let be a finite dimensional real vector space and let be a finite subgroup of
generated by reflections. Let
Suppose that is a subspace of
stable under and let be the order of the restriction
of to
Show that there exists of order leaving
stable and such that
Solution. Let
By Proposition 2 §3.3, is generated by reflections. Let be a chamber of
Let
be another chamber. By Lemma 2 §3.1, there is an
such that So
Then
-
stabilizes since both and
stabilize
-
since fixes pointwise.
-
It remains to show that has order
Suppose that Then,
since we have that
Since the order of is it follows that
We will show that
Since stabilizes a chamber of so does
Since
and is the identity on it follows that
is the identity on
So
Since and
stabilizes a chamber of
it follows from Theorem 1 §3.2, that is the identity in
Therefore
is the identity in
-
-
Let be a commutative field and let be an dimensional vector space over
Let be a symmetric bilinear form on
and let
be the null space of Suppose that
Show that the null space of the
extension of to
is dimension
-
Suppose that and that is positive. Let
be a base of
and let
Suppose that for
Suppose that does not admit a partition
such that
for all and Let
be the cofactor of
in the matrix Show that
for all
-
Let
be a vector with all coordinates which generates the null space Show that
are proportional to
Solution.
-
The extension of the bilinear form on to
is given by, Alg. Chapt III §11.5 formula 30,
Let and complete this to a basis
of
The set of vectors
is a basis of Let
be the matrix given by
and let denote the matrix with the
row and the column removed. Then for any such that
since is a matrix with top row containing all zeros. It follows that all the basis vectors
are in the null space of the form on
Furthermore, since
and is a matrix such that the first row and the first column are zero,
Thus the vector
is not an element of the null space of the form on
-
Let
and be the matrices given in the proof of part a). Then
Then for any basis vector we have that
by Cramer’s rule. Since we have that
for all It follows that
is an element of By Lemma 4 §3.5 it follows that is spanned by a vector
such that for all Since
it follows that
for some constants A similar argument shows that
for some constants Since
and the
for all Then since
Setting we have that
for all and Since is positive semidefinite
we know that
We have already seen in part a) that
So and
we have that It follows that
for all
-
From the proof of part b) we have that
where It follows that
So is proportional to
-
Let
be a positive degenerate quadratic form on such that
for
Suppose that does not admit a partition
such that for
-
Show that, if one puts one gets a positive nondegenerate form by restricting to the
coordinates
-
Show that for all
-
Show that if one replaces one of the with a value
the new form is nonpositive.
Solution.
-
By Lemma 4 §3.5, we have that the subspace of isotropic vectors is dimension and that this space is generated by a vector
such that for all If the form on
given by
is degenerate then there is a nonzero vector
such that The vector
must be a multiple of This is a contradiction to the fact that is nonzero.
-
Since the is positive we have that, for each
where is the vector with coordinate
and all other coordinates If
then by a) we must have that This is a contradiction. So
for all
-
Let
be a vector such that for all and such that
Then, if the new form is positive we have that
which is clearly a contradiction.
Notes. The null space of a form is defined to be
Let be the set of isotropic vectors for
It is clear that if the since
So Suppose that the form is positive and let
Let and let
Then
If then we may choose
such that
So
It follows that So if is positive.
-
Let be a real symmetric matrix with
rows and columns.
-
Put
For all one has that
-
Let
Set Then
-
If there exist numbers
such that
and if for
then the quadratic form
is positive degenerate.
-
Let
be a quadratic form on such that
for Suppose that
does not admit a partition such that
for and
Show that this form is positive degenerate if and only if there exist
such that
Solution.
-
Begin with the right hand side.
since is symmetric.
-
Replace by
and by
in a). Then
Substituting, the formula in a) is
The trivial cancellations give the desired identity.
-
Since
the identity in b) reduces to
Since for and
for all we have that the right hand side is
It follows that the form is positive. The form is degenerate since
-
follows immediately from c).
In view of Lemma 4 §3.5 it is sufficient to show that if
is a vector such that and that
for all then
Let
Let
and
Then, since the form is positive,
for arbitrary values of the and This is only possible if
for all values of So
Notes. Parts 8a) and 8b) are known as Crosby’s Lemma and are proved on pp. 177-178 of the book Regular Polytopes by H.S.M. Coxeter. See also the historical remarks pp. 185.
page history