Semisimple Cellular Algebras
- Semisimple cellular algebras are finite-dimensional associative algebras with an anti-involution and cell datum that ensures every cell module is irreducible.
- They provide a structured module theory where explicit constructions, criteria for semisimplicity, and clear classification of representations are established.
- This framework underpins diagram algebras and links to Lie theory and categorification, offering practical insights for representation and computational algebra.
Semisimple cellular algebras are finite-dimensional associative algebras equipped with an anti-involution and a combinatorially rich cell datum, which ensure a highly structured module theory in which all simple modules can be constructed explicitly from “cell modules” associated with this datum. In the semisimple case, these cell modules are simple and provide a complete set of pairwise non-isomorphic irreducible representations. The cellular framework encompasses a wide range of classical and modern algebras—most notably diagram algebras such as the Temperley–Lieb, Brauer, partition, and their various extension and deformation families—enabling deep structural analysis, explicit criteria for semisimplicity, and connections to Lie theory and categorification.
1. Cellular Algebras: Structure and Cell Data
A cellular algebra is an associative unital algebra over a commutative ring equipped with a quadruple :
- is a finite partially ordered set,
- for each , is a finite set,
- is an -basis of ,
- is an involutive -linear anti-automorphism.
Multiplication satisfies the “cellular triangularity” condition: for all and all basis elements , the product is an -linear combination of elements modulo terms indexed by . The anti-involution satisfies .
Cell modules are constructed by right action of on the -span of (fixing a row index ), modulo higher terms. The associated Gram matrix is defined via a canonical -valued bilinear form on . If all these forms are nondegenerate, cellular structure yields an explicit complete set of simple modules.
Semisimple cellular algebras are those for which is semisimple as a ring and every cell module is simple, i.e., equals its simple quotient.
2. Semisimplicity Criteria
The semisimplicity of a cellular algebra is controlled by the nondegeneracy of cell module forms and, in diagrammatic and affine settings, by the invertibility of certain bilinear or “sandwich” matrices.
- In twisted semigroup algebras (including partition, Brauer, Temperley–Lieb algebras), is semisimple if and only if, for every -class , the group algebra is semisimple and an associated “twisted sandwich matrix” is invertible (Wilcox, 2010).
- For affine cellular algebras, is semisimple if and only if the associated scheme is reduced and 0-dimensional and the bilinear forms in all layers are isomorphisms. Over a perfect field, this is equivalent to separability (Li et al., 2023).
- For graded symmetric cellular algebras, semisimplicity is equivalent to the graded subspace (generated from the homogeneous cellular basis via the symmetrizing trace) filling the centralizer of the degree-zero component (Li et al., 2017).
- In wreath products, is semisimple if and only if both and are semisimple (Green, 2018).
- For KLRW and cyclotomic KLR algebras, semisimplicity is characterized by “entirely semisimple” crystal graphs: the cellular algebra is semisimple if the crystal graph (encoding the combinatorics of the basis) admits no nontrivial face permutations (Mathas et al., 2023).
3. Explicit Constructions and Examples
a) Diagram Algebras as Cellular Algebras
- The Temperley–Lieb, Brauer, cyclotomic Brauer, and partition algebras are all realized as twisted semigroup algebras and inherit cellularity. Partition algebra cell indices are parametrized by pairs (number of connections, partition shape), and the Brauer algebra by pairs (Wilcox, 2010, Geetha et al., 2012, Scrimshaw, 2022).
- Wreath products and -Brauer algebras (where is cyclic cellular with involution and trace) preserve cyclic (hence cellular and, under cell-form nondegeneracy, semisimple) structure (Geetha et al., 2012).
- Cellular bases can be built recursively via Jones basic constructions—using towers of algebras and “branching diagrams,” with path indices on modules and explicit relations for induction and restriction (Enyang et al., 2011).
b) Wreath Product and Cellular Wreath Product
- The cellular wreath product generalizes by “decorating” the diagrams of (a partition algebra subalgebra or diagram algebra) with tensor factors from 's cellular basis (Scrimshaw, 2022). The cell modules factor as products of those from and .
| Example Algebra | Cell Indices | Semisimplicity Criterion |
|---|---|---|
| Brauer, TL, Partition | Cell forms nondegenerate, sandwich invert. | |
| multipartitions | and semisimple | |
| Affine cellular (e.g., KLR) | crystal paths | Crystal entirely semisimple |
c) Cyclotomic and Graded Algebras
- Graded cellular structures exist for KLR, KLRW, and their cyclotomic quotients (Mathas et al., 2021, Mathas et al., 2023). Graded decomposition numbers can be explicitly computed in level one using the cellular basis constructed from crystal combinatorics. Weighted KLRW and cyclotomic KLRW algebras are quasi-hereditary or affine quasi-hereditary except in types where nontrivial face permutations occur in the crystal.
d) Centralizer and Endomorphism Algebras
- For tilting modules in highest weight or standard categories (e.g., category for rational Cherednik algebras), endomorphism algebras are cellular. The cellular basis is constructed from morphisms factorizing through summands, with cell modules given by hom-spaces from standard and costandard objects. In the case of Hecke algebras for real reflection groups, this construction recovers known cellularity (Bellamy et al., 2021).
4. Representation Theory and Cell Modules
Cell modules provide the essential building blocks for representation theory:
- In the semisimple case, cell modules are irreducible and exhaust all simple modules.
- The dimension of the algebra is given by . For the cellular wreath product , the dimension formula involves both factors (Scrimshaw, 2022).
- Simple modules are indexed by those labels (or pairs, multipartitions, or paths, depending on the algebra) where the associated bilinear form is nondegenerate.
The explicit construction of cell modules—via diagram combinatorics, Murphy/branching basis formulas, or path representations—allows for linear-algebraic checks of simplicity and Cartan decompositions, and in cases such as the -Brauer algebra gives rise to closed-form criteria for simple modules and semisimplicity parameters (Nguyen, 2012, Nguyen, 2013).
5. Lie-Theoretic Connections: The Plesken Lie Algebra
The Plesken Lie algebra associated to a semisimple cellular algebra with anti-involution is the -eigenspace,
In the semisimple setting, , where . The Plesken Lie algebra decomposes canonically:
where is the orthogonal Lie algebra of skew-symmetric matrices. For diagram algebras, this yields explicit decompositions—planar rook and Temperley–Lieb algebras, when semisimple, correspond to direct sums of orthogonal Lie algebras with dimensions determined by the underlying combinatorics of the cell modules (Holm et al., 28 Aug 2025).
6. Extensions and Generalizations
- Affine cellular algebras, graded cellular algebras, and relative cellular algebras extend the theory to settings with schemes of higher complexity, gradings, or multiple partial orders localized to idempotents (Ehrig et al., 2017, Li et al., 2017, Li et al., 2023).
- In positive characteristic and quantum settings, many diagram and modular analogues are only “relative” cellular; their Cartan matrices are positive semi-definite, not definite, but much of the cellular machinery—and, in the semisimple locus, full structure—remains (Ehrig et al., 2017).
- Connections to Schur–Weyl dualities and categorification are prevalent, with cellular structure often controlling the essential representation-theoretic and homological invariants.
7. Applications and Impact
Semisimple cellular algebras provide:
- Explicit module-theoretic control (structure, classification, dimensions) for large classes of algebras in representation theory, statistical mechanics, knot theory, and categorification.
- Powerful, combinatorial bases enabling algorithmic calculations of irreducibles, Cartan invariants, and decomposition numbers.
- Decompositions of associated Lie algebras (via Plesken's construction) into direct sums of orthogonal Lie algebras tightly controlled by cell module dimensions.
This framework not only unifies key results for classical objects such as symmetric groups and diagram algebras, but also offers systematic methods for constructing and verifying semisimple structures in new algebraic and categorified settings.