Transvections and Hecke algebras
Abstract
We set up the double coset walk corresponding to the transvection class for .
Key words— ???????? 111AMS Subject Classifications: Primary ???; Secondary ???.
0 Introduction
1 Persi’s 26 July note
(1) Let . Let (I think of them as column vectors). Have . These determine a transvection
Thus you add a multiple of to . If you multiply by and divide by that doesn’t change so lets agree that and the last nonzero coordinate of is a . Since the case is the identity lets exclude that too.
(2) A flag is a chain of subspaces with . Of course . The distance between two flags and is a permutation defined as follows
Its not obvious but is a permutation and the map
with inverse given by . All of this is in Abel’s paper on the Jordan-Holder permutation.
(3) Example. Lets fix with and with for any . Let be the standard flag (). Let
I claim .
Proof.
What is ? We need the smallest so that . Well and . The smallest with is so .
What is ? We need . That is
Clearly does the job (from and get and so .
Similarly for .
Finally, what about ? Need . But . With get and so all of . ∎
(4)
Proposition 1.1.
Let have and for and and . Then, with the standard flag and ,
Proof.
For , , so so . What is ? We need . Since (and no smaller will do) then .
What is ? Need . The LHS is
The RHS is
We have and so .
Similarly for .
Lets do . Need
Clearly does the job ().
For , . ∎
(5) It’s important to note that can give the identity. This will happen if say has all for if and only if for .
Proof.
needs , eg , needs , eg , (for ) needs . This holds for all . Similarly, for all . ∎
(6) I think that the same thing holds for any flag and , can only be the identity or a transposition!
2 parsing Persi’s note
Let . For let denote the second entry of . Then
since adds the second entry of to the first entry and leaves all other entries of the same.
Let so that is in the same conjugacy class as . Then
So let . We want to say . This is ok since
provided . In other words, is the second column of . So letting be the first column of and the second column of then is the second row of and so
Probably there are no other restrictions on and other than they be nonzero.
3 Character computation for the coefficient of in
3.1 Symmetric functions
For with define the Hall-Littlewood polynomial by
where is the normalization that make the coefficient of in equal to . For define
The monomial symmetric functions and the Schur functions are given by
the evaluations of at and , respectively. For define by the generating function
The Big Schurs are defined by the determinant (see [Mac, Ch. III (4.5)])
Define , and by
By [Mac, (4,8) and (4.10)], and in the inner product of [Mac, Ch. III] so that
Thus
We have
giving
Thus
and so , where
(3.1) |
3.2 A character computation
Let be the finite field with elements, the group of invertible matrices with entries in and let be the subgroup of upper triangular matrices. Then
By [Mac, Ch. II (1.6) and Ch. IV (2.7)],
so that
and
Let be the representation of obtained by inducing the trivial representation from to . The Hecke algebra is . The algebra has basis with multiplication determined by
As a -bimodule,
where the sum is over partitions of , is the irreducible -module indexed by and is the irreducible -module indexed by .
Let be the conjugacy class of transvections in . A favorite representative of is , where denotes the identity matrix and is the matrix with in the entry and elsewhere. Let
where denotes the center of the group algebra of . The element acts on by
where is the operator that acts by the identity on the component and by on for .
Let be the element of that acts on by the identity and by on for . Let be given by
Use cycle notation for permutations in so that denotes the transposition in that switches and .
Note that at this specializes to the sum of the transpositions in the group algebra of the symmetric group. Use cycle notation for permutations. Then
and so that
if then . |
So .
Theorem 3.1.
Assume . Then
Proof.
In terms of the favorite basis of , the element is given by (see [CR81, (68.29)] or [HLR, (1.6)])
Thus, the expansion of in terms of the basis of is
(3.2) |
For a partition let be the favorite permutation of cycle type (a minimal length permutation which has cycle type ). By [Ra91, Th. 4.14],
since is a partition of . By [HR99, Theorem 4.9(c)],
Thus
Plugging this into (3.2), the coefficient of in is
Now use (3.1),
and
to get that the coefficient of in is
Since is 0 unless or and since the coefficient of in is then it follows from [Fr99, (2.2) Main Theorem] that
∎
The following corollary provides the connection to [Ra97, (3.16),(3.18),(3.20)] and [DR00, Proposition 4.9].
Corollary 3.2.
Let and let , for . Then
Proof.
Using that , check, by induction, that
Thus
∎
3.3 The example for
If then with and
In this case and
So and has basis and
is the matrix for multiplying by . The character values are
giving that acts on the same way as
and the matrix for multiplying by in the basis is
In this case and so that
Then
so that
so that the coefficient of in is and the coefficient of is . Thus
For , Theorem 3.1 says that
3.4 The example of
If then with
Then
Then
and the brute force computation showing that commutes with is
In this computation already, some flags in are ending up in after the application of .
In the basis , the matrices of multiplication by and are
The matrix of multiplication by is
where the last column comes from the computation
Thus the matrix of multiplication by is
with and so that the bottom row sums to Thus the matrix of which has row sums
and
Let
so that
giving
Let’s work out the and the matrix . By definition
giving , ,
and
Thus
Then
Since
and
then acts the same way as
Then
References
- [CR81] C.W. Curtis and I. Reiner, Methods of Representation Theory: With Applications to Finite Groups and Orders, Wiley Classics Lib. I and II, John Wiley & Sons, New York, 1981. MR0892316.
- [DR00] P. Diaconis and A. Ram, Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques, Michigan Mathematical Journal 48 (2000), 157–190. MR1786485
- [Fr99] A. Francis, The minimal basis for the centre of an Iwahori-Hecke algebra, J. Algebra 221 (1999) 1–28, MR1722901.
- [Mac] I.G. Macdonald, Symmetric functions and Hall polynomials, Second edition, Oxford Mathematical Monographs, Oxford University Press, New York, 1995. ISBN: 0-19-853489-2, MR1354144.
- [HR99] T. Halverson and A. Ram, Bitraces for and the Iwahori-Hecke algebra of type , Indag. Mathem. N.S. 10 (1999) 247–268, MR1816219.
- [HLR] T. Halverson, R. Leduc and A. Ram, Iwahori-Hecke algebras of type A, bitraces and symmetric functions, Int. Math. Research Notices (1997) 401–416. MR1443319.
- [Ra91] A. Ram, A Frobenius formula for the characters of the Hecke algebras, Invent. Math. 106 (1991), 461-488, MR1134480.
- [Ra97] A. Ram, Seminormal representations of Weyl groups and Iwahori-Hecke algebras, Proceedings of the London Math. Soc. (3) 75 (1997), 99–133, MR1444315.
4 Some Hecke algebra multiplications
The Hecke algebra is . The algebra has basis with multiplication determined by
Take . We have .
This gives the matrrix for multiplication by :
Then, prodcuts by are
This gives the matrrix for multiplication by
Then products with
The matrix of multiplication by is
Thus the matrix of mutliplication by is
and the matrix of multiplication by is
5 Row reduction for
For define
and for define
Then, coset representatives of cosets of in the double cosets in
and
so that (or, in general, ).
If and then
If then
If then
Thus the reflection relation is
(5.1) |
Since
then the building relation is
(5.2) |
The reflection relations and the building relations are the relations for rearranging s. Since
the x-interchange relations are
where we assume that . Since
then the h-past-y relation is (letting )
(5.3) |
The h-past-x relation is
(5.4) |
The x-past-y relations are
(5.5) | ||||
where and . These follow from
5.1 Transvections in
The size of is
The number of transvections is
and these should distribute among the flags as either or (which differ just by the sizes of the corresponding double cosets). Consider
and the th column of is except with an extra added to the th entry. So
Case 1: and . Then
which has matrix
The flag
and
Case 2: and . Then
which has matrix
The group consists of matrices which, grouped in conjugacy classes are
It is generated by and which both have order 2, and there are two elements of order 3.
The group consists of matrices. It is generated by which all have order 2. Let’s write the 8 elements of in the form
For sanity of computation, record
Letting denote conjugation by , Then
Let be the conjugacy class of . Then is
Then is
Next, is
Finally is