Last update: 7 March 2014
Bratteli Diagrams
A Bratteli diagram is a graph with vertices from a collection of sets and edges that connect vertices in to vertices in We assume that the set contains a unique vertex denoted It is possible that there are multiple edges connecting any two vertices. We shall call the vertices shapes. The set is the set of shapes on level If is connected by an edge to a shape we write
A multiplicity free Bratteli diagram is a Bratteli diagram such that there is at most one edge connecting any two vertices. Alternatively we could define a multiplicity free Bratteli diagram to be a ranked poset which is ranked by the nonnegative integers and such that there is a unique vertex on level called Identifying the poset with its Hasse diagram we see that these two definitions are the same since the poset condition implies that the resulting Bratteli diagram is multiplicity free. In order to make sure that we do not make careless statements in this paper. We make this assumption to simplify our proofs and our notation. See [GHJ1989] for the more general setting.
The Bratteli diagrams which we will be most interested in, see Figures 1 and 2, are multiplicity free and arise naturally in the representation theory of centralizer algebras. Other examples of Bratteli diagrams arise from differential posets [Sta1988] and towers of algebras [GHJ1989]. The Bratteli diagrams in Figures 1 and 2 are described further in Sections 4 and 5 respectively.
Paths and Tableaux
Let be a multiplicity free Bratteli diagram and let and where A path from to is a sequence of shapes such that and In the poset sense the path is a saturated chain from to (If we are working in the nonmultiplicity free setting we must distinguish paths which "travel" from to along different edges.) A tableau of shape is a path from to such that and for each We write if is a tableau of shape We say that the length of is if
Let us make the following (hopefully suggestive) notations.
is the set of tableaux of shape
is the set of tableaux of length
is the set of paths from to
is the set of paths from to any shape on level
is the set of paths from to any shape on level
Similarly, we define
is the set of pairs of paths
is the set of pairs of paths such that
is the set of pairs of paths
is the set of pairs of paths such that
Path Algebras
For each define an algebra over a field with basis and multiplication given by Note that Every element can be written in the form for some constants In this way we can view each element as weighted sum of pairs of paths, where the weight of a pair of paths is the constant We shall refer to the collection of algebras as the tower of path algebras corresponding to the Bratteli diagram
Each of the algebras is isomorphic to a direct sum of matrix algebras where denotes the algebra of matrices with entries from and Thus, the irreducible representations of are indexed by the elements of Furthermore, the dimensions of these irreducible representations are equal to and thus, the set of tableaux is a natural index set for a basis of the irreducible indexed by
The Inclusions
Given a path from to and a path from to define to be the concatenation of the two paths (the shape is not repeated since that would not produce a path).
Let Define an inclusion of as follows: For each view as an element of by the formula In particular we have an inclusion of into for every Let and let be the irreducible representation of corresponding to Then the restriction of to decomposes as where The multiplicity free condition on the Bratteli diagram guarantees that this decomposition is multiplicity free.
The Centralizer of Contained in
Define Let us extend the notation in (1.3) and define for each pair the following result appears in [GHJ1989, Proposition 2.3.12].
The elements are a basis of
Proof. | |
First let us show that the elements Let and let Then Similarly one shows that giving that Now we show that if then is a linear combination of Suppose Let and let Then This implies that unless for some and unless for some Thus, must be of the form If and then This implies that for all Let us denote this coefficient by Then Thus, if then is a linear combination of The elements are independent since the elements are. |
Let be the tower of path algebras corresponding to a multiplicity free Bratteli diagram A and suppose that are elements such that
(1) | For each the elements generate |
(2) | for all such that |
Proof. | |
It follows from the relations on the that commutes with The result then follows from Proposition (1.4). |
Let be the tower of path algebras corresponding to a multiplicity free Bratteli diagram A and suppose that are elements such that
(1) | For each the elements generate |
(2) | for all such that |
(3) | for all |
Proof. | |
Using the braid relation (3) for the elements we have It follows that commutes with By induction we have that for all Thus, commutes with The result now follows from Proposition (1.4). |
Remark. All of the above results hold even if the Bratteli diagram is not multiplicity free since the main result Proposition (1.4) holds in that case. We have stated these results only for the multiplicity free case in order to simplify our notation. See [GHJ1989] for the more general setting.
Centralizers of Tensor Power Representations
Let be a field. We shall assume that is characteristic zero and algebraically closed. Let be a Hopf algebra over such that all finite dimensional representations of are completely reducible. Let be a finite dimensional representation of and define Let be an index set for the finite dimensional irreducible representations of Let be an index set for the finite dimensional representations of It is natural to view as a subset of since, by Schur-Weyl duality, the has a decomposition where is the irreducible indexed by and is the irreducible indexed by
For there is a natural inclusion given by where acts as on the first factors of and as the identity on the last tensor factors. By convention we shall set If is an irreducible then, by Schur's lemma,
The Bratteli Diagram for Tensor Powers of
Assume that is an irreducible Let for some Then there is a branching rule for tensoring by which describes the decomposition as The multiplicities are nonnegative integers. This decomposition is multiplicity free if all the multiplicities Let Then the branching rule for inclusion describes the decomposition as There is a standard reciprocity result for branching rules ([Bou1981] Chpt. VIII §5 Ex. 17, see also [Ram1991-4] Theorem 5.9 for a simple proof), that states that the constants appearing in (1.8) and (1.9) are the same.
We define a Bratteli diagram for tensor powers of or equivalently, a Bratteli diagram for the tower of algebras as follows. Let the elements of the set be the vertices on level A vertex is connected to a vertex by edges. This Bratteli diagram is multiplicity free if the corresponding branching rule for tensoring by is multiplicity free.
Identification of the Centralizer Algebras with Path Algebras
By working inductively, we can view the algebras as path algebras for the Bratteli diagram for tensor powers of Let us denote this Bratteli diagram by and denote the corresponding path algebras by Clearly can be identified with the corresponding path algebra For each let denote the irreducible module corresponding to Suppose that there is an identification of with the path algebra so that is a decomposition of so that the The element is a projection onto the irreducible
Given a tableau and a shape such that let be the path given by Since the branching rule for tensoring by is multiplicity free, there is a unique decomposition into nonisomorphic irreducible Define to be the unique projection onto the irreducible in the decomposition (1.10). In this way we can define elements for every and we have that is a decomposition of into irreducible This makes an identification of each basis element of the path algebra with a transformation in Now, for each pair of paths choose nonzero transformations and normalize them so that as transformations in In this way, one can identify the path algebra with the algebra This identification is not canonical, there is the following freedom in the choice of the normalization of the transformations and For any nonzero constant one may to get another solution.
Suppose that an identification of the centralizer algebras with the path algebras is given. This identification determines a choice of the irreducible representations of in the following way. If and then the maps for determine a complete set of nonisomorphic irreducible representations of In this paper we shall find path algebra formulas for the generators of tensor power centralizer algebras, and thus, in essence, we are finding the irreducible representations.
This is a typed version of the paper A Ribbon Hopf Algebra Approach to the Irreducible Representations of Centralizer Algebras: The Brauer, Birman-Wenzl, and Type A Iwahori-Hecke Algebras by Robert and Arun
The paper was received June 24, 1994; accepted September 12, 1994.
Supported in part by National Science Foundation Grant DMS-9300523 to the University of Wisconsin.
Supported in part by National Science Foundation Postdoctoral Fellowship DMS-9107863.