algebraic monoids and their hecke algebras
play

Algebraic Monoids and Their Hecke Algebras Jared Marx-Kuo, Vaughan - PDF document

Algebraic Monoids and Their Hecke Algebras Jared Marx-Kuo, Vaughan McDonald, John M. OBrien, & Alexander Vetter University of Minnesota REU in Algebraic Combinatorics August 2, 2018 Problem 6 Group (UMN) Algebraic Monoids August 2,


  1. Algebraic Monoids and Their Hecke Algebras Jared Marx-Kuo, Vaughan McDonald, John M. O’Brien, & Alexander Vetter University of Minnesota REU in Algebraic Combinatorics August 2, 2018 Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 1 / 30

  2. Outline 1 Introduction Background on Monoids Examples of Renner Monoids 2 Monoid Representation Theory Definitions Induced Representations 3 Representations of Renner Monoids Rook Monoid Representations Symplectic Rook Monoid Representations 4 Hecke algebras of monoids The Borel-Matsumoto theorem for finite monoids 5 References Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 2 / 30

  3. Introduction In this presentation, we explore algebraic monoids, their Hecke algebras, and their representations. We seek to produce analogous results from finite algebraic group representation theory in the setting of algebraic monoids. We focus on the representation theory of the rook monoid R n and the symplectic rook monoid RSp 2 n , and their Hecke algebras, H ( R n ) and H ( RSp 2 n ), respectively. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 3 / 30

  4. Background on Monoids Definition A monoid is a semigroup (assoc. mult.) with identity. Contained in every monoid, M , is a group of units (i.e., invertible elements) G ( M ). By studying M, we gain valuable insight into the action of G ( M ), informing its representation theory. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 4 / 30

  5. Background on Monoids Definition A monoid is a semigroup (assoc. mult.) with identity. Contained in every monoid, M , is a group of units (i.e., invertible elements) G ( M ). By studying M, we gain valuable insight into the action of G ( M ), informing its representation theory. Definition M is an algebraic monoid if it is a Zariski-closed subset of Mat n ( F ) for some n 2 Z and F a field. Furthermore, M is reductive if G(M) is a reductive group and M is an irreducible algebraic variety. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 4 / 30

  6. Properties of reductive monoids If M is reductive, G ( M ) has a Borel subgroup B , e.g. the invertible upper triangular matrices in the case of Mat n ( F ). Furthermore, M has a Renner decomposition as the disjoint union of double cosets of B : G M = BrB (1) r 2 R where R , the Renner monoid of M , encodes vital structural information about M . The group of units of R is the Weyl group of G ( M ). Furthermore, R has the decomposition R = G ( R ) E ( T ) (2) where E ( T ) is a set of idempotents. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 5 / 30

  7. Rook Monoid The “Rook Monoid” is the Renner monoid of the algebraic monoid Mat n ( F ). R n is realized as the set of all n ⇥ n matrices with entries 0 and 1 such that each row and column has at most one nonzero entry. We call this the Rook monoid because if we view the ones as rooks, then this monoid is the set of all n ⇥ n chessboard with at most n non-attacking rooks. Its unit group G ( R n ) is isomorphic to the symmetric group, S n . Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 6 / 30

  8. Rook Monoid Examples Example 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 A , A , A , A 2 R 3 0 0 0 0 1 0 1 0 0 0 0 1 @ @ @ @ 0 0 0 0 0 0 0 0 1 1 0 0 Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 7 / 30

  9. Rook Monoid Examples Example 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 A , A , A , A 2 R 3 0 0 0 0 1 0 1 0 0 0 0 1 @ @ @ @ 0 0 0 0 0 0 0 0 1 1 0 0 Example (er... Non-example) 0 1 0 1 0 1 0 1 1 0 0 0 0 1 0 0 1 1 0 0 A , A , A , A 62 R 3 1 0 0 0 1 0 1 0 0 0 1 1 @ @ @ @ 0 0 0 0 1 0 0 0 1 0 0 1 Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 7 / 30

  10. Symplectic Rook Monoid Similarly, the symplectic Rook monoid is the Renner monoid for the more complicated algebraic monoid whose unit group is the symplectic group Sp 2 n ( F ). Further, The B n Weyl group embeds as G ( RSp 2 n ). Nice presentation: Theorem 0 1 0 . . . 0 1 0 . . . 1 0 = { A 2 R 2 n | AJA T = 0 or J } , RSp 2 n ⇠ B C J = B C . . . . . . @ A 1 0 0 . . . Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 8 / 30

  11. Symplectic Rook Monoid Examples Example 0 1 0 1 0 1 0 1 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 B C B C B C B C A , A , A , A 2 RSp 4 B C B C B C B C 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 @ @ @ @ 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 9 / 30

  12. Symplectic Rook Monoid Examples Example 0 1 0 1 0 1 0 1 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 B C B C B C B C A , A , A , A 2 RSp 4 B C B C B C B C 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 @ @ @ @ 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Example (er... Non-example) 0 1 0 1 0 1 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 B C B C B C B C A , A , A , A 62 RSp 4 B C B C B C B C 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 @ @ @ @ 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 1 Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 9 / 30

  13. Representations of Monoids Let M, N be monoids. A map ϕ : M ! N is a homomorphism of monoids if the following hold: For all m i 2 M , π ( m 1 m 2 ) = π ( m 1 ) π ( m 2 ). For e M , e N the identity elements of M and N respectively, π ( e M ) = e N . Let V be a vector space over k . A morphism π : M ! End k ( V ) is called a representation of M. We denote representations as the pair ( π , V ). A representation is irreducible if it has no proper subrepresentations. If V is finite dimensional, we define the character χ : M ! k of π as the function defined by χ ( m ) = tr ( π ( m )) for all m 2 M . Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 10 / 30

  14. Induced Representations Let N be a submonoid of M and ( π , V ) a representation of N. We have that ( π , V ) induces a representation (Ind M N π , Ind M N V ) of M. Define Ind M N V = { f : M ! V | f ( nm ) = π ( n ) f ( m ) } 8 n 2 N, m 2 M (Ind M N π )( m ) f ( x ) = f ( xm ) 8 x, m 2 M . We proved that the following result holds in the case of monoids: Frobenius Reciprocity for finite monoids If N is a submonoid of M, ( π , V ) a representation of N, and ( σ , W ) a representation of M, then N V, W ) ⇠ Hom M (Ind M = Hom N ( V, W ) (3) as vector spaces over F Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 11 / 30

  15. Rook Monoid Representations [Solomon, 2002] The irreducible representations of R n are indexed by partitions of at most n . Further, these representations are derived from representations of S k for k 2 { 0 , . . . , n } . Let λ be a partition of k , and let V λ be the corresponding irreducible representation of S k . I There exists an irreducible representation W λ of R n . � n I dim ( W λ ) = � dim ( V λ ) k Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 12 / 30

  16. Rook Monoid Representations [Solomon, 2002] The irreducible representations of R n are indexed by partitions of at most n . Further, these representations are derived from representations of S k for k 2 { 0 , . . . , n } . Let λ be a partition of k , and let V λ be the corresponding irreducible representation of S k . I There exists an irreducible representation W λ of R n . � n I dim ( W λ ) = � dim ( V λ ) k We note that “conjugacy classes” of the monoid are also indexed by partitions of at most n . It turns out the character table of any Renner monoid is block upper triangular, when the representations are the columns and conjugacy classes are the rows. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 12 / 30

  17. Character Table of R n Let Ch k be the character table of S k . Then define Y n to be the following block diagonal matrix: 0 1 Ch n Ch n � 1 B C B C Y n = . . . B C B C Ch 1 @ A Ch 0 Let M n be the character table of R n . Solomon found explicit descriptions of the matrices A and B such that M n = AY n = Y n B (4) The A matrix comes from combinatorics of cycle structures. The B matrix comes from the Pieri rules for induced representations. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 13 / 30

  18. Pieri Rules and Induced Representations Our motivation in this section comes from restricting our monoid representations to their corresponding group of units. Using [Solomon, 2002] and [Li et al., 2008], we obtain the following result: Theorem Let W n be a Weyl group of type A n , B n , C n , or D n , with corresponding Renner monoids RW n . Let χ be a character of S r , and χ ⇤ the associated character of W n . Then χ ⇤ | W n = Ind W n S k ⇥ W n − k ( χ ⌦ η n � k ) In particular, when the Weyl group is A n , the above restriction produces the well-known Pieri rules. From this result, we can now describe the B matrix as Solomon does. Problem 6 Group (UMN) Algebraic Monoids August 2, 2018 14 / 30

Recommend


More recommend