SlideShare a Scribd company logo
1 of 51
Download to read offline
Representation theory of monoids and monoidal categories
Or: Cells and actions
Daniel Tubbenhauer
Joint with Marco Mackaay, Volodymyr Mazorchuk, Vanessa Miemietz and Xiaoting Zhang
June 2022
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 1 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Careful
There are zillions of choices involved
and I show you a categorification not the categorification
There is no unique way of doing this!
Actually, everything works for 2-categories/bicategories,
but I won’t touch this in this talk
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Careful
There are zillions of choices involved
and I show you a categorification not the categorification
There is no unique way of doing this!
Actually, everything works for 2-categories/bicategories,
but I won’t touch this in this talk
Today
I explain monoid and fiat rep theory
fiat monoidal categories
categorify
−
−
−
−
−
→ certain fin dim algebras ⊃ monoid algebras
fiat reps
categorify
−
−
−
−
−
→ reps of certain fin dim algebras ⊃ monoid reps
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Examples of monoidal categories
G-graded vector spaces V ectG , module categories Rep(G), same for monoids
Rep(Hopf algebra), tensor or fusion or modular categories,
Soergel bimodules (“the Hecke category”),
categorified quantum groups, categorified Heisenberg algebras, ...
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Examples of monoidal categories
G-graded vector spaces V ectG , module categories Rep(G), same for monoids
Rep(Hopf algebra), tensor or fusion or modular categories,
Soergel bimodules (“the Hecke category”),
categorified quantum groups, categorified Heisenberg algebras, ...
Examples of reps of these
Categorical modules, functorial actions,
(co)algebra objects, conformal embeddings of affine Lie algebras, the LLT algorithm,
cyclotomic Hecke/KLR algebras, categorified (anti-)spherical module, ...
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Examples of monoidal categories
G-graded vector spaces V ectG , module categories Rep(G), same for monoids
Rep(Hopf algebra), tensor or fusion or modular categories,
Soergel bimodules (“the Hecke category”),
categorified quantum groups, categorified Heisenberg algebras, ...
Examples of reps of these
Categorical modules, functorial actions,
(co)algebra objects, conformal embeddings of affine Lie algebras, the LLT algorithm,
cyclotomic Hecke/KLR algebras, categorified (anti-)spherical module, ...
Applications of categorical representations
Representation theory (classical and modular), link homologies, combinatorics,
TQFTs, quantum physics, geometry, ...
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Adjoining identities is “free” and there is no essential difference between
semigroups and monoids, or inverses semigroups and groups
The main difference is semigroups/monoids vs. inverses semigroups/groups
Today I will stick with the more familiar monoids and groups
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Adjoining identities is “free” and there is no essential difference between
semigroups and monoids, or inverses semigroups and groups
The main difference is semigroups/monoids vs. inverses semigroups/groups
Today I will stick with the more familiar monoids and groups
In a monoid information is destroyed
The point of monoid theory is to keep track of information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Adjoining identities is “free” and there is no essential difference between
semigroups and monoids, or inverses semigroups and groups
The main difference is semigroups/monoids vs. inverses semigroups/groups
Today I will stick with the more familiar monoids and groups
In a monoid information is destroyed
The point of monoid theory is to keep track of information loss
Monoids appear naturally in categorification
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Example
Z is a group Integers
N is a monoid Natural numbers
Example
Cn = ha|an
= 1i is a group Cyclic group
Cn,p = ha|an+p
= ap
i is a monoid Cyclic monoid
Example
Sn = Aut({1, ..., n}) is a group Symmetric group
Tn = End({1, ..., n}) is a monoid Transformation monoid
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Finite groups are kind of random...
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
The cell orders and equivalences:
Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes.
I H cells = intersections of left and right cells
I Slogan cells measure information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I H cells = intersections of left and right cells
I Slogan cells measure information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Example (group-like)
All invertible elements form the smallest cell
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Example (group-like)
All invertible elements form the smallest cell
Example (cells of N)
Every element is in its own cell, only 0 is idempotent
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Example (group-like)
All invertible elements form the smallest cell
Example (cells of N)
Every element is in its own cell, only 0 is idempotent
Example (cells of C3,2, idempotent cells colored)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Example (group-like)
All invertible elements form the smallest cell
Example (cells of N)
Every element is in its own cell, only 0 is idempotent
Example (cells of C3,2, idempotent cells colored)
Example (cells of T3, idempotent cells colored)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Computing these “egg box diagrams” is one of the main tasks of monoid theory
GAP can do these calculations for you (package semigroups)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Examples (no specific monoids)
Grey boxes are idempotent H cells
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The simple reps of monoids
φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid
I A K-linear subspace W ⊂ V is S-invariant if S  W ⊂ W Substructure
I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements
I Careful with different names in the literature: S-invariant !
subrepresentation, simple ! irreducible
I A crucial goal of representation theory
Find the periodic table of simple S-representations
S3
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid
I A K-linear subspace W ⊂ V is S-invariant if S  W ⊂ W Substructure
I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements
I Careful with different names in the literature: S-invariant !
subrepresentation, simple ! irreducible
I A crucial goal of representation theory
Find the periodic table of simple S-representations
S3
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid
I A K-linear subspace W ⊂ V is S-invariant if S  W ⊂ W Substructure
I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements
I Careful with different names in the literature: S-invariant !
subrepresentation, simple ! irreducible
I A crucial goal of representation theory
Find the periodic table of simple S-representations
S3
Frobenius ∼1895+
+and others
For groups and K = C this theory is really satisfying
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid
I A K-linear subspace W ⊂ V is S-invariant if S  W ⊂ W Substructure
I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements
I Careful with different names in the literature: S-invariant !
subrepresentation, simple ! irreducible
I A crucial goal of representation theory
Find the periodic table of simple S-representations
S3
Frobenius ∼1895+
+and others
For groups and K = C this theory is really satisfying
What about monoids?
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Example (groups)
Groups have only one cell – the group itself
H-reduction is trivial for groups
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Example (cells of C3,2, idempotent cells colored)
Three simple reps over C:
one for 1 and two for Z/2Z
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Example (cells of C3,2, idempotent cells colored)
Three simple reps over C:
one for 1 and two for Z/2Z
Example (cells of T3, idempotent cells colored)
Six simple reps over C:
three for S3, two for S2 and one for S1
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Example (cells of C3,2, idempotent cells colored)
Trivial rep of 1 induces to C3,2 and has apex Jb
Ja, Ja2 , Jt act by zero
Trivial rep of Z/2Z induces to C3,2 and has apex Jt
Nothing acts by zero
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Example (no specific monoid)
Five apexes: bottom cell, big cell, 2x2 cell, 3x3 cell, top cell
Simples for the 2x2 cell are acted on as zero by elements from 3x3 cell, top cell
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Examples (no specific monoids)
All of these have four apexes
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
Categorification of monoid reps
I Usual answer ? = monoidal cats
I I need more structure than plain monoidal cats Specific categorification!
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Categorification of monoid reps
I Finitary = linear + additive + idempotent split + finitely many
indecomposables + fin dim hom spaces Cat of a fin dim algebra
I Fiat = finitary + involution + adjunctions + monoidal
I Fusion = fiat + semisimple
I Reps are on finitary cats
Finitary + fiat are additive analogs of tensor cats
Tensor cats as in Etingof–Gelaki–Nikshych–Ostrik ∼2015
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Categorification of monoid reps
Examples instead of formal defs
I Let C = Rep(G) (G a finite group)
I C is monoidal and nice. For any M, N ∈ C , we have M ⊗ N ∈ C :
g(m ⊗ n) = gm ⊗ gn
for all g ∈ G, m ∈ M, n ∈ N. There is a trivial representation 1
I The regular cat representation M : C → End(C ):
M //
f

M ⊗
f ⊗

N // N ⊗
I The decategorification is the regular representation
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Categorification of monoid reps
I Let K ⊂ G be a subgroup
I Rep(K) is a cat representation of Rep(G), with action
ResG
K ⊗ : Rep(G) → End(Rep(K)),
which is indeed a cat action because ResG
K is a ⊗-functor
I The decategorifications are N-representations
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Categorification of monoid reps
I Let ψ ∈ H2
(K, C∗
) (group field is now C)
I Let V(K, ψ) be the category of projective K-modules with Schur multiplier ψ,
i.e. vector spaces V with ρ: K → End(V) such that
ρ(g)ρ(h) = ψ(g, h)ρ(gh), for all g, h ∈ K
I Note that V(K, 1) = Rep(K) and
⊗: V(K, φ)  V(K, ψ) → V(K, φψ)
I V(K, ψ) is also a cat representation of C = Rep(G):
Rep(G)  V(K, ψ)
ResG
K Id
−
−
−
−
−
−
→ Rep(K)  V(K, ψ)
⊗
−
→ V(K, ψ)
I The decategorifications are N-representations
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Categorification of monoid reps
I Let ψ ∈ H2
(K, C∗
) (group field is now C)
I Let V(K, ψ) be the category of projective K-modules with Schur multiplier ψ,
i.e. vector spaces V with ρ: K → End(V) such that
ρ(g)ρ(h) = ψ(g, h)ρ(gh), for all g, h ∈ K
I Note that V(K, 1) = Rep(K) and
⊗: V(K, φ)  V(K, ψ) → V(K, φψ)
I V(K, ψ) is also a cat representation of C = Rep(G):
Rep(G)  V(K, ψ)
ResG
K Id
−
−
−
−
−
−
→ Rep(K)  V(K, ψ)
⊗
−
→ V(K, ψ)
I The decategorifications are N-representations
Classical
An S module is called simple (the “elements”)
if it has no S-stable ideals
We have the Jordan–Hölder theorem: every module is built from simples
Goal Find the periodic table of simples
Categorical
A C module is called simple (the “elements”)
if it has no C -stable monoidal ideals
We have the weak Jordan–Hölder theorem: every module is built from simples
Goal Find the periodic table of simples
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Categorification of monoid reps
I Let ψ ∈ H2
(K, C∗
) (group field is now C)
I Let V(K, ψ) be the category of projective K-modules with Schur multiplier ψ,
i.e. vector spaces V with ρ: K → End(V) such that
ρ(g)ρ(h) = ψ(g, h)ρ(gh), for all g, h ∈ K
I Note that V(K, 1) = Rep(K) and
⊗: V(K, φ)  V(K, ψ) → V(K, φψ)
I V(K, ψ) is also a cat representation of C = Rep(G):
Rep(G)  V(K, ψ)
ResG
K Id
−
−
−
−
−
−
→ Rep(K)  V(K, ψ)
⊗
−
→ V(K, ψ)
I The decategorifications are N-representations
Folk theorem?
Completeness All simples of Rep(G, C) are of the form V(K, ψ)
Non-redundancy We have V(K, ψ) ∼
= V(K0
, ψ0
)
⇔
the subgroups are conjugate and ψ0
= ψg
, where ψg
(k, l) = ψ(gkg−1
, glg−1
)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
Clifford, Munn, Ponizovskiı̆ categorically
The cell orders and equivalences (X, Y, Z indecomposable, ⊂
⊕ = direct summand):
Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes.
I H cells SH = Add(X ∈ H, 1) mod higher terms
I Slogan cells measure information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
The cell orders and equivalences (X, Y, Z indecomposable, ⊂
⊕ = direct summand):
Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes.
I H cells SH = Add(X ∈ H, 1) mod higher terms
I Slogan cells measure information loss
Compare to monoids:
Indecomposables instead of elements, ⊂
⊕ instead of =
Otherwise the same!
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
The cell orders and equivalences (X, Y, Z indecomposable, ⊂
⊕ = direct summand):
Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes.
I H cells SH = Add(X ∈ H, 1) mod higher terms
I Slogan cells measure information loss
Example (cells of Rep(G, C))
Only one cell since 1 ⊂
⊕ XX∗
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
The cell orders and equivalences (X, Y, Z indecomposable, ⊂
⊕ = direct summand):
Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes.
I H cells SH = Add(X ∈ H, 1) mod higher terms
I Slogan cells measure information loss
Example (cells of Rep(G, C))
Only one cell since 1 ⊂
⊕ XX∗
Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
The cell orders and equivalences (X, Y, Z indecomposable, ⊂
⊕ = direct summand):
Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes.
I H cells SH = Add(X ∈ H, 1) mod higher terms
I Slogan cells measure information loss
Example (cells of Rep(G, C))
Only one cell since 1 ⊂
⊕ XX∗
Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored)
Example (cells of the Hecke category of type B2, pseudo idempotent cells colored)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Example (cells of Rep(G, C))
No reduction
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Example (cells of Rep(G, C))
No reduction
Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored)
Two apexes, three simples (2+1)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Example (cells of Rep(G, C))
No reduction
Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored)
Two apexes, three simples (2+1)
Example (cells of the Hecke category of type B2, pseudo idempotent cells colored)
Three apexes, four simples (1+2+1)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Adjoining identities is “free” and there is no essential difference between
semigroups and monoids, or inverses semigroups and groups
The main difference is semigroups/monoids vs. inverses semigroups/groups
Today I will stick with the more familiar monoids and groups
In a monoid information is destroyed
The point of monoid theory is to keep track of information loss
Monoids appear naturally in categorification
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I H cells = intersections of left and right cells
I Slogan cells measure information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Example (group-like)
All invertible elements form the smallest cell
Example (cells of N)
Every element is in its own cell, only 0 is idempotent
Example (cells of C3,2, idempotent cells colored)
Example (cells of T3, idempotent cells colored)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Computing these “egg box diagrams” is one of the main tasks of monoid theory
GAP can do these calculations for you (package semigroups)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Example (cells of Rep(G, C))
No reduction
Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored)
Two apexes, three simples (2+1)
Example (cells of the Hecke category of type B2, pseudo idempotent cells colored)
Three apexes, four simples (1+2+1)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
There is still much to do...
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 7 / 7
Where are we?
Groups Monoids
Fusion mon-
oidal cats
Fiat mon-
oidal cats
Group reps Monoid reps
Fusion reps Fiat reps
generalize
categorify
rep theory
I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+
++ many others
Representation theory of (finite) monoids
I Goal Find some categorical analog
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Associativity ⇒ reasonable theory of matrix reps
I Southeast corner ⇒ reasonable theory of matrix reps
Adjoining identities is “free” and there is no essential difference between
semigroups and monoids, or inverses semigroups and groups
The main difference is semigroups/monoids vs. inverses semigroups/groups
Today I will stick with the more familiar monoids and groups
In a monoid information is destroyed
The point of monoid theory is to keep track of information loss
Monoids appear naturally in categorification
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I H cells = intersections of left and right cells
I Slogan cells measure information loss
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Example (group-like)
All invertible elements form the smallest cell
Example (cells of N)
Every element is in its own cell, only 0 is idempotent
Example (cells of C3,2, idempotent cells colored)
Example (cells of T3, idempotent cells colored)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The theory of monoids (Green ∼1950+
+)
I Each H contains no or 1 idempotent e; every e is contained in some H(e)
I Each H(e) is a maximal subgroup No internal information loss
Computing these “egg box diagrams” is one of the main tasks of monoid theory
GAP can do these calculations for you (package semigroups)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
The simple reps of monoids
Clifford, Munn, Ponizovskiı̆ ∼1940+
+(H-reduction)
There is a one-to-one correspondence

simples with
apex J (e)

one-to-one
←
−
−
−
−
→

simples of (any)
H(e) ⊂ J (e)

Reps of monoids are controlled by their maximal subgroups
I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex
I In other words (smod means the category of simples):
S-smodJ (e) ' H(e)-smod
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Clifford, Munn, Ponizovskiı̆ categorically
Categorical H-reduction
There is a one-to-one correspondence

simples with
apex J

one-to-one
←
−
−
−
−
→

simples of (any)
SH ⊂ SJ

Almost verbatim as for monoids
I Each simple has a unique maximal J whose SH does not kill it Apex
I In other words (smod means the category of simples):
S -smodJ (e) ' SH-smod
Example (cells of Rep(G, C))
No reduction
Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored)
Two apexes, three simples (2+1)
Example (cells of the Hecke category of type B2, pseudo idempotent cells colored)
Three apexes, four simples (1+2+1)
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
Thanks for your attention!
Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 7 / 7

More Related Content

More from Daniel Tubbenhauer

More from Daniel Tubbenhauer (7)

The mathematics of AI (machine learning mathematically)
The mathematics of AI (machine learning mathematically)The mathematics of AI (machine learning mathematically)
The mathematics of AI (machine learning mathematically)
 
Three colors suffice
Three colors sufficeThree colors suffice
Three colors suffice
 
A primer on computer algebra
A primer on computer algebraA primer on computer algebra
A primer on computer algebra
 
Knots and algebra
Knots and algebraKnots and algebra
Knots and algebra
 
Why category theory?
Why category theory?Why category theory?
Why category theory?
 
Temperley-Lieb times four
Temperley-Lieb times fourTemperley-Lieb times four
Temperley-Lieb times four
 
Some history of quantum groups
Some history of quantum groupsSome history of quantum groups
Some history of quantum groups
 

Recently uploaded

Bacterial Identification and Classifications
Bacterial Identification and ClassificationsBacterial Identification and Classifications
Bacterial Identification and Classifications
Areesha Ahmad
 
Pests of mustard_Identification_Management_Dr.UPR.pdf
Pests of mustard_Identification_Management_Dr.UPR.pdfPests of mustard_Identification_Management_Dr.UPR.pdf
Pests of mustard_Identification_Management_Dr.UPR.pdf
PirithiRaju
 
Biogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune Waterworlds
Biogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune WaterworldsBiogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune Waterworlds
Biogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune Waterworlds
Sérgio Sacani
 
The Mariana Trench remarkable geological features on Earth.pptx
The Mariana Trench remarkable geological features on Earth.pptxThe Mariana Trench remarkable geological features on Earth.pptx
The Mariana Trench remarkable geological features on Earth.pptx
seri bangash
 
Module for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learningModule for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learning
levieagacer
 
development of diagnostic enzyme assay to detect leuser virus
development of diagnostic enzyme assay to detect leuser virusdevelopment of diagnostic enzyme assay to detect leuser virus
development of diagnostic enzyme assay to detect leuser virus
NazaninKarimi6
 

Recently uploaded (20)

Bacterial Identification and Classifications
Bacterial Identification and ClassificationsBacterial Identification and Classifications
Bacterial Identification and Classifications
 
FAIRSpectra - Enabling the FAIRification of Analytical Science
FAIRSpectra - Enabling the FAIRification of Analytical ScienceFAIRSpectra - Enabling the FAIRification of Analytical Science
FAIRSpectra - Enabling the FAIRification of Analytical Science
 
High Profile 🔝 8250077686 📞 Call Girls Service in GTB Nagar🍑
High Profile 🔝 8250077686 📞 Call Girls Service in GTB Nagar🍑High Profile 🔝 8250077686 📞 Call Girls Service in GTB Nagar🍑
High Profile 🔝 8250077686 📞 Call Girls Service in GTB Nagar🍑
 
GBSN - Microbiology (Unit 3)
GBSN - Microbiology (Unit 3)GBSN - Microbiology (Unit 3)
GBSN - Microbiology (Unit 3)
 
Pests of mustard_Identification_Management_Dr.UPR.pdf
Pests of mustard_Identification_Management_Dr.UPR.pdfPests of mustard_Identification_Management_Dr.UPR.pdf
Pests of mustard_Identification_Management_Dr.UPR.pdf
 
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
 
Biogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune Waterworlds
Biogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune WaterworldsBiogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune Waterworlds
Biogenic Sulfur Gases as Biosignatures on Temperate Sub-Neptune Waterworlds
 
The Mariana Trench remarkable geological features on Earth.pptx
The Mariana Trench remarkable geological features on Earth.pptxThe Mariana Trench remarkable geological features on Earth.pptx
The Mariana Trench remarkable geological features on Earth.pptx
 
Site Acceptance Test .
Site Acceptance Test                    .Site Acceptance Test                    .
Site Acceptance Test .
 
Thyroid Physiology_Dr.E. Muralinath_ Associate Professor
Thyroid Physiology_Dr.E. Muralinath_ Associate ProfessorThyroid Physiology_Dr.E. Muralinath_ Associate Professor
Thyroid Physiology_Dr.E. Muralinath_ Associate Professor
 
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 60009654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
 
Module for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learningModule for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learning
 
Introduction to Viruses
Introduction to VirusesIntroduction to Viruses
Introduction to Viruses
 
development of diagnostic enzyme assay to detect leuser virus
development of diagnostic enzyme assay to detect leuser virusdevelopment of diagnostic enzyme assay to detect leuser virus
development of diagnostic enzyme assay to detect leuser virus
 
Pulmonary drug delivery system M.pharm -2nd sem P'ceutics
Pulmonary drug delivery system M.pharm -2nd sem P'ceuticsPulmonary drug delivery system M.pharm -2nd sem P'ceutics
Pulmonary drug delivery system M.pharm -2nd sem P'ceutics
 
module for grade 9 for distance learning
module for grade 9 for distance learningmodule for grade 9 for distance learning
module for grade 9 for distance learning
 
Molecular markers- RFLP, RAPD, AFLP, SNP etc.
Molecular markers- RFLP, RAPD, AFLP, SNP etc.Molecular markers- RFLP, RAPD, AFLP, SNP etc.
Molecular markers- RFLP, RAPD, AFLP, SNP etc.
 
GBSN - Biochemistry (Unit 1)
GBSN - Biochemistry (Unit 1)GBSN - Biochemistry (Unit 1)
GBSN - Biochemistry (Unit 1)
 
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
 
FAIRSpectra - Enabling the FAIRification of Spectroscopy and Spectrometry
FAIRSpectra - Enabling the FAIRification of Spectroscopy and SpectrometryFAIRSpectra - Enabling the FAIRification of Spectroscopy and Spectrometry
FAIRSpectra - Enabling the FAIRification of Spectroscopy and Spectrometry
 

Representation theory of monoids and monoidal categories

  • 1. Representation theory of monoids and monoidal categories Or: Cells and actions Daniel Tubbenhauer Joint with Marco Mackaay, Volodymyr Mazorchuk, Vanessa Miemietz and Xiaoting Zhang June 2022 Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 1 / 7
  • 2. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
  • 3. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Careful There are zillions of choices involved and I show you a categorification not the categorification There is no unique way of doing this! Actually, everything works for 2-categories/bicategories, but I won’t touch this in this talk Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
  • 4. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Careful There are zillions of choices involved and I show you a categorification not the categorification There is no unique way of doing this! Actually, everything works for 2-categories/bicategories, but I won’t touch this in this talk Today I explain monoid and fiat rep theory fiat monoidal categories categorify − − − − − → certain fin dim algebras ⊃ monoid algebras fiat reps categorify − − − − − → reps of certain fin dim algebras ⊃ monoid reps Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
  • 5. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Examples of monoidal categories G-graded vector spaces V ectG , module categories Rep(G), same for monoids Rep(Hopf algebra), tensor or fusion or modular categories, Soergel bimodules (“the Hecke category”), categorified quantum groups, categorified Heisenberg algebras, ... Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
  • 6. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Examples of monoidal categories G-graded vector spaces V ectG , module categories Rep(G), same for monoids Rep(Hopf algebra), tensor or fusion or modular categories, Soergel bimodules (“the Hecke category”), categorified quantum groups, categorified Heisenberg algebras, ... Examples of reps of these Categorical modules, functorial actions, (co)algebra objects, conformal embeddings of affine Lie algebras, the LLT algorithm, cyclotomic Hecke/KLR algebras, categorified (anti-)spherical module, ... Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
  • 7. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Examples of monoidal categories G-graded vector spaces V ectG , module categories Rep(G), same for monoids Rep(Hopf algebra), tensor or fusion or modular categories, Soergel bimodules (“the Hecke category”), categorified quantum groups, categorified Heisenberg algebras, ... Examples of reps of these Categorical modules, functorial actions, (co)algebra objects, conformal embeddings of affine Lie algebras, the LLT algorithm, cyclotomic Hecke/KLR algebras, categorified (anti-)spherical module, ... Applications of categorical representations Representation theory (classical and modular), link homologies, combinatorics, TQFTs, quantum physics, geometry, ... Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7
  • 8. The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 9. The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Adjoining identities is “free” and there is no essential difference between semigroups and monoids, or inverses semigroups and groups The main difference is semigroups/monoids vs. inverses semigroups/groups Today I will stick with the more familiar monoids and groups Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 10. The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Adjoining identities is “free” and there is no essential difference between semigroups and monoids, or inverses semigroups and groups The main difference is semigroups/monoids vs. inverses semigroups/groups Today I will stick with the more familiar monoids and groups In a monoid information is destroyed The point of monoid theory is to keep track of information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 11. The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Adjoining identities is “free” and there is no essential difference between semigroups and monoids, or inverses semigroups and groups The main difference is semigroups/monoids vs. inverses semigroups/groups Today I will stick with the more familiar monoids and groups In a monoid information is destroyed The point of monoid theory is to keep track of information loss Monoids appear naturally in categorification Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 12. The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Example Z is a group Integers N is a monoid Natural numbers Example Cn = ha|an = 1i is a group Cyclic group Cn,p = ha|an+p = ap i is a monoid Cyclic monoid Example Sn = Aut({1, ..., n}) is a group Symmetric group Tn = End({1, ..., n}) is a monoid Transformation monoid Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 13. The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Finite groups are kind of random... Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 14. The theory of monoids (Green ∼1950+ +) The cell orders and equivalences: Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes. I H cells = intersections of left and right cells I Slogan cells measure information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 15. The theory of monoids (Green ∼1950+ +) I H cells = intersections of left and right cells I Slogan cells measure information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 16. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 17. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Example (group-like) All invertible elements form the smallest cell Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 18. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Example (group-like) All invertible elements form the smallest cell Example (cells of N) Every element is in its own cell, only 0 is idempotent Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 19. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Example (group-like) All invertible elements form the smallest cell Example (cells of N) Every element is in its own cell, only 0 is idempotent Example (cells of C3,2, idempotent cells colored) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 20. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Example (group-like) All invertible elements form the smallest cell Example (cells of N) Every element is in its own cell, only 0 is idempotent Example (cells of C3,2, idempotent cells colored) Example (cells of T3, idempotent cells colored) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 21. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Computing these “egg box diagrams” is one of the main tasks of monoid theory GAP can do these calculations for you (package semigroups) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 22. The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Examples (no specific monoids) Grey boxes are idempotent H cells Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7
  • 23. The simple reps of monoids φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid I A K-linear subspace W ⊂ V is S-invariant if S W ⊂ W Substructure I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements I Careful with different names in the literature: S-invariant ! subrepresentation, simple ! irreducible I A crucial goal of representation theory Find the periodic table of simple S-representations S3 Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 24. The simple reps of monoids φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid I A K-linear subspace W ⊂ V is S-invariant if S W ⊂ W Substructure I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements I Careful with different names in the literature: S-invariant ! subrepresentation, simple ! irreducible I A crucial goal of representation theory Find the periodic table of simple S-representations S3 Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 25. The simple reps of monoids φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid I A K-linear subspace W ⊂ V is S-invariant if S W ⊂ W Substructure I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements I Careful with different names in the literature: S-invariant ! subrepresentation, simple ! irreducible I A crucial goal of representation theory Find the periodic table of simple S-representations S3 Frobenius ∼1895+ +and others For groups and K = C this theory is really satisfying Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 26. The simple reps of monoids φ: S → GL(V ) S-representation on a K-vector space V , S is some monoid I A K-linear subspace W ⊂ V is S-invariant if S W ⊂ W Substructure I V 6= 0 is called simple if 0, V are the only S-invariant subspaces Elements I Careful with different names in the literature: S-invariant ! subrepresentation, simple ! irreducible I A crucial goal of representation theory Find the periodic table of simple S-representations S3 Frobenius ∼1895+ +and others For groups and K = C this theory is really satisfying What about monoids? Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 27. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 28. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Example (groups) Groups have only one cell – the group itself H-reduction is trivial for groups Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 29. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Example (cells of C3,2, idempotent cells colored) Three simple reps over C: one for 1 and two for Z/2Z Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 30. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Example (cells of C3,2, idempotent cells colored) Three simple reps over C: one for 1 and two for Z/2Z Example (cells of T3, idempotent cells colored) Six simple reps over C: three for S3, two for S2 and one for S1 Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 31. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Example (cells of C3,2, idempotent cells colored) Trivial rep of 1 induces to C3,2 and has apex Jb Ja, Ja2 , Jt act by zero Trivial rep of Z/2Z induces to C3,2 and has apex Jt Nothing acts by zero Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 32. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Example (no specific monoid) Five apexes: bottom cell, big cell, 2x2 cell, 3x3 cell, top cell Simples for the 2x2 cell are acted on as zero by elements from 3x3 cell, top cell Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 33. The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Examples (no specific monoids) All of these have four apexes Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7
  • 34. Categorification of monoid reps I Usual answer ? = monoidal cats I I need more structure than plain monoidal cats Specific categorification! Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 35. Categorification of monoid reps I Finitary = linear + additive + idempotent split + finitely many indecomposables + fin dim hom spaces Cat of a fin dim algebra I Fiat = finitary + involution + adjunctions + monoidal I Fusion = fiat + semisimple I Reps are on finitary cats Finitary + fiat are additive analogs of tensor cats Tensor cats as in Etingof–Gelaki–Nikshych–Ostrik ∼2015 Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 36. Categorification of monoid reps Examples instead of formal defs I Let C = Rep(G) (G a finite group) I C is monoidal and nice. For any M, N ∈ C , we have M ⊗ N ∈ C : g(m ⊗ n) = gm ⊗ gn for all g ∈ G, m ∈ M, n ∈ N. There is a trivial representation 1 I The regular cat representation M : C → End(C ): M // f M ⊗ f ⊗ N // N ⊗ I The decategorification is the regular representation Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 37. Categorification of monoid reps I Let K ⊂ G be a subgroup I Rep(K) is a cat representation of Rep(G), with action ResG K ⊗ : Rep(G) → End(Rep(K)), which is indeed a cat action because ResG K is a ⊗-functor I The decategorifications are N-representations Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 38. Categorification of monoid reps I Let ψ ∈ H2 (K, C∗ ) (group field is now C) I Let V(K, ψ) be the category of projective K-modules with Schur multiplier ψ, i.e. vector spaces V with ρ: K → End(V) such that ρ(g)ρ(h) = ψ(g, h)ρ(gh), for all g, h ∈ K I Note that V(K, 1) = Rep(K) and ⊗: V(K, φ) V(K, ψ) → V(K, φψ) I V(K, ψ) is also a cat representation of C = Rep(G): Rep(G) V(K, ψ) ResG K Id − − − − − − → Rep(K) V(K, ψ) ⊗ − → V(K, ψ) I The decategorifications are N-representations Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 39. Categorification of monoid reps I Let ψ ∈ H2 (K, C∗ ) (group field is now C) I Let V(K, ψ) be the category of projective K-modules with Schur multiplier ψ, i.e. vector spaces V with ρ: K → End(V) such that ρ(g)ρ(h) = ψ(g, h)ρ(gh), for all g, h ∈ K I Note that V(K, 1) = Rep(K) and ⊗: V(K, φ) V(K, ψ) → V(K, φψ) I V(K, ψ) is also a cat representation of C = Rep(G): Rep(G) V(K, ψ) ResG K Id − − − − − − → Rep(K) V(K, ψ) ⊗ − → V(K, ψ) I The decategorifications are N-representations Classical An S module is called simple (the “elements”) if it has no S-stable ideals We have the Jordan–Hölder theorem: every module is built from simples Goal Find the periodic table of simples Categorical A C module is called simple (the “elements”) if it has no C -stable monoidal ideals We have the weak Jordan–Hölder theorem: every module is built from simples Goal Find the periodic table of simples Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 40. Categorification of monoid reps I Let ψ ∈ H2 (K, C∗ ) (group field is now C) I Let V(K, ψ) be the category of projective K-modules with Schur multiplier ψ, i.e. vector spaces V with ρ: K → End(V) such that ρ(g)ρ(h) = ψ(g, h)ρ(gh), for all g, h ∈ K I Note that V(K, 1) = Rep(K) and ⊗: V(K, φ) V(K, ψ) → V(K, φψ) I V(K, ψ) is also a cat representation of C = Rep(G): Rep(G) V(K, ψ) ResG K Id − − − − − − → Rep(K) V(K, ψ) ⊗ − → V(K, ψ) I The decategorifications are N-representations Folk theorem? Completeness All simples of Rep(G, C) are of the form V(K, ψ) Non-redundancy We have V(K, ψ) ∼ = V(K0 , ψ0 ) ⇔ the subgroups are conjugate and ψ0 = ψg , where ψg (k, l) = ψ(gkg−1 , glg−1 ) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 5 / 7
  • 41. Clifford, Munn, Ponizovskiı̆ categorically The cell orders and equivalences (X, Y, Z indecomposable, ⊂ ⊕ = direct summand): Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes. I H cells SH = Add(X ∈ H, 1) mod higher terms I Slogan cells measure information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 42. Clifford, Munn, Ponizovskiı̆ categorically The cell orders and equivalences (X, Y, Z indecomposable, ⊂ ⊕ = direct summand): Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes. I H cells SH = Add(X ∈ H, 1) mod higher terms I Slogan cells measure information loss Compare to monoids: Indecomposables instead of elements, ⊂ ⊕ instead of = Otherwise the same! Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 43. Clifford, Munn, Ponizovskiı̆ categorically The cell orders and equivalences (X, Y, Z indecomposable, ⊂ ⊕ = direct summand): Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes. I H cells SH = Add(X ∈ H, 1) mod higher terms I Slogan cells measure information loss Example (cells of Rep(G, C)) Only one cell since 1 ⊂ ⊕ XX∗ Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 44. Clifford, Munn, Ponizovskiı̆ categorically The cell orders and equivalences (X, Y, Z indecomposable, ⊂ ⊕ = direct summand): Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes. I H cells SH = Add(X ∈ H, 1) mod higher terms I Slogan cells measure information loss Example (cells of Rep(G, C)) Only one cell since 1 ⊂ ⊕ XX∗ Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 45. Clifford, Munn, Ponizovskiı̆ categorically The cell orders and equivalences (X, Y, Z indecomposable, ⊂ ⊕ = direct summand): Left, right and two-sided cells (a.k.a. L, R and J cells): equivalence classes. I H cells SH = Add(X ∈ H, 1) mod higher terms I Slogan cells measure information loss Example (cells of Rep(G, C)) Only one cell since 1 ⊂ ⊕ XX∗ Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored) Example (cells of the Hecke category of type B2, pseudo idempotent cells colored) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 46. Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 47. Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Example (cells of Rep(G, C)) No reduction Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 48. Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Example (cells of Rep(G, C)) No reduction Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored) Two apexes, three simples (2+1) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 49. Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Example (cells of Rep(G, C)) No reduction Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored) Two apexes, three simples (2+1) Example (cells of the Hecke category of type B2, pseudo idempotent cells colored) Three apexes, four simples (1+2+1) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7
  • 50. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7 The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Adjoining identities is “free” and there is no essential difference between semigroups and monoids, or inverses semigroups and groups The main difference is semigroups/monoids vs. inverses semigroups/groups Today I will stick with the more familiar monoids and groups In a monoid information is destroyed The point of monoid theory is to keep track of information loss Monoids appear naturally in categorification Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I H cells = intersections of left and right cells I Slogan cells measure information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Example (group-like) All invertible elements form the smallest cell Example (cells of N) Every element is in its own cell, only 0 is idempotent Example (cells of C3,2, idempotent cells colored) Example (cells of T3, idempotent cells colored) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Computing these “egg box diagrams” is one of the main tasks of monoid theory GAP can do these calculations for you (package semigroups) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7 Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7 Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Example (cells of Rep(G, C)) No reduction Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored) Two apexes, three simples (2+1) Example (cells of the Hecke category of type B2, pseudo idempotent cells colored) Three apexes, four simples (1+2+1) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7 There is still much to do... Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 7 / 7
  • 51. Where are we? Groups Monoids Fusion mon- oidal cats Fiat mon- oidal cats Group reps Monoid reps Fusion reps Fiat reps generalize categorify rep theory I Green, Clifford, Munn, Ponizovskiı̆ ∼1940+ ++ many others Representation theory of (finite) monoids I Goal Find some categorical analog Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 2 / 7 The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I Associativity ⇒ reasonable theory of matrix reps I Southeast corner ⇒ reasonable theory of matrix reps Adjoining identities is “free” and there is no essential difference between semigroups and monoids, or inverses semigroups and groups The main difference is semigroups/monoids vs. inverses semigroups/groups Today I will stick with the more familiar monoids and groups In a monoid information is destroyed The point of monoid theory is to keep track of information loss Monoids appear naturally in categorification Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I H cells = intersections of left and right cells I Slogan cells measure information loss Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Example (group-like) All invertible elements form the smallest cell Example (cells of N) Every element is in its own cell, only 0 is idempotent Example (cells of C3,2, idempotent cells colored) Example (cells of T3, idempotent cells colored) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The theory of monoids (Green ∼1950+ +) I Each H contains no or 1 idempotent e; every e is contained in some H(e) I Each H(e) is a maximal subgroup No internal information loss Computing these “egg box diagrams” is one of the main tasks of monoid theory GAP can do these calculations for you (package semigroups) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 3 / 7 The simple reps of monoids Clifford, Munn, Ponizovskiı̆ ∼1940+ +(H-reduction) There is a one-to-one correspondence simples with apex J (e) one-to-one ← − − − − → simples of (any) H(e) ⊂ J (e) Reps of monoids are controlled by their maximal subgroups I Each simple has a unique maximal J (e) whose H(e) does not kill it Apex I In other words (smod means the category of simples): S-smodJ (e) ' H(e)-smod Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 4 / 7 Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7 Clifford, Munn, Ponizovskiı̆ categorically Categorical H-reduction There is a one-to-one correspondence simples with apex J one-to-one ← − − − − → simples of (any) SH ⊂ SJ Almost verbatim as for monoids I Each simple has a unique maximal J whose SH does not kill it Apex I In other words (smod means the category of simples): S -smodJ (e) ' SH-smod Example (cells of Rep(G, C)) No reduction Example (cells of Rep(Z/3Z, F3), pseudo idempotent cells colored) Two apexes, three simples (2+1) Example (cells of the Hecke category of type B2, pseudo idempotent cells colored) Three apexes, four simples (1+2+1) Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 6 / 7 Thanks for your attention! Daniel Tubbenhauer Representation theory of monoids and monoidal categories June 2022 7 / 7