## Reflection groups

In order to understand the intuition underlying the theory of Coxeter groups(and Weyl groups in particular groups in particular), you can go through the theory of reflection groups which I’ll only superficially treat preceding my exposition of Coxetr systems and the associated representation theory.

Consider some Euclidean space and a vector . A reflection associated with is a linear operator which sends to and point-wise fixes the orthogonal hyperplane/subspace .

If the reflection is , then it can represented as:

Clearly is an orthogonal transformation and the set of all reflections in can be recognized as the subgroup of (orthogonal group of ) consisting of elements of order 2.

I recommend checking out Humphrey’s book on Reflection groups to get a basic idea on root systems and simple systems which will be useful in the discussion about Weyl groups.

One example is the group which is generated by the set of transpositions for all (a simple exercise), hence making it a reflection group. Let . Here, the elements satisfy the following relations:

The last relation is called a **braid relation **and is a key concept in the definition of Coxeter groups. These relations, when generalized in a particular manner, yield Coxeter groups.

Consider some simple system and let be the group generated by the simple reflections. For some , let where and repetitions are allowed.

The length of is defined as the as the smallest value of for which such an expression exists.

## Coxeter Groups

A Coxeter group is a group with a set of generators, satisfying:

where if and if . If no relation exists between ,then is represented as .

here, is the order of . if ,then since all have order 2. For order 3, the relation is . These are simply the braid relations which we discussed before.

The pair is called a **Coxeter system**. The matrix associated by the natural indexing through the set is called the Coxeter matrix and is obviously symmetric.

Example: Consider the set of generators with . let be the generated Coxeter group.

Map the generators respectively to the following elements in .

By calculating the order of the products of these generators, we see that there is a homomorphism .

Note that is generated by the two elements of the form:

Hence the image set includes PSL(2,\mathbb{Z}) as a subgroup. Also, has index 2.Note that the elements all have determinant . So, the images of these elements under the homomorphism isn’t included in . Hence, the homomorphism is surjective. It is a simple exercise to prove that . Hence, .

## Lemma:

There is a homomorphism given by

Proof:

It is clear that for all . For , their reduced expressions can be represented as and . Hence the maximum value that can be attained by . Hence, .

Taking .

So replacing for some , we get . **(1)**

Now, consider some and a reduced expression .

. So, . From equation (1), .

Now since we have loosened the definitions and generalized reflection groups to Coxeter groups, we will need to redefine the machinery underlying reflections of a vector space.

Assume that is a vector space over having a basis So, the elements are in one-to-one correspondence with the generators. Since we are dealing with a discrete indexed set and not a continuum of vectors in a Euclidean space, we will need a better way to understand ‘angles’ between and . So we define a bilinear form on the vector space as follows:

.

This seems like a legitimate definition. Connecting the order of to the represent an ‘angle’.

Note that is interpreted to be -1 if there is no relation between i.e .

Clearly, is also symmetric. With this symmetric bilinear form, we can define reflections associated with the generators as follows

. Again, similar to the reflections described earlier, point-wise fixes the hyperplane .

## Proposition I:

preserves the bilinear form on i.e . Hence, the subgroup generated by all reflections preserve .

Let , then the reflections clearly stabilize , as can be verified through simple calculations.

Also, restricting the symmetric bilinear form to makes it *positive-semidefinite. *To prove this, just take an arbirtary element element given by where and expand bilinearly to obtain

.

All this this culminates into a very basic theorem, yielding the representation of the Coxeter group.

## Theorem:

There is a unique homomorphism which maps to and the image, preserve the symmetric bilinear form on .

This group representation is commonly also referred to as the **geometric representation** of , the Coxeter group.

This is a very basic and cursory introduction to reflection groups and Coxeter groups which is all I had time to flesh out this week due to other obligations. In following posts, I plan to expand on various topics including Coxeter-Dynkin diagrams, Kazdhan-Lusztig polynomials and especially the extremely important study of affine Weyl groups and Iwahori-Hecke algebras which I’ve felt is a grossly criminal offense to omit from my exposition on Coxeter groups. I’ve also been reading a few papers on the rich theory of modular representations of Hecke algebras and modern results in connection to cellular algebra and the study of combinatorics of *tableaux *which I’ll promptly delineate along with a bit of discussion on state-of-the-art results in the field.

–