Diagrammatic Categories which arise from Representation Graphs
Abstract
The main result of this paper utilizes the representation graph of a group , , and gives a general construction of a diagrammatic category . The proof of the main theorem shows that, given explicit criteria, there is an equivalence of categories between a quotient category of and a full subcategory of with objects being the tensor products of finitely many irreducible -modules.
1. Introduction
In this paper, we provide a framework in which we can develop diagrammatic categories from the data of a representation graph (or McKay quiver) for a group . In general, there is a full and essentially surjective functor from this diagrammatic category onto a full monoidal subcategory of the category of all finite dimensional -modules. Furthermore, we provide criteria which, when satisfied, results in an induced functor which is faithful and, thus, an equivalence of categories.
While this paper focuses on the relationship between our diagrammatic construction and -modules over , the results of the main theorem extend to other contexts. For example, one can consider a fusion category. In a fusion category, the fusion rule can be described as a graph. Using this graph, we may define a diagrammatic category utilizing the construction in this paper which will be categorically equivalent to the fusion category with which we started.
To provide some concrete examples, we will focus on the following context for this paper. Felix Klein classified the finite subgroups of the special unitary group, . There are two infinite families of finite subgroups along with 3 exceptional subgroups: the cyclic groups of order , ; the binary dihedral groups, , of order ; the binary tetrahedral group ; the binary octahedral group ; and the binary icosahedral group . Around 1980, McKay made the observation that certain affine Dynkin diagrams and the representation graphs associated with these finite subgroups are identical [1]. We will focus on the cyclic groups and the binary tetrahedral group along with their representation graphs. See Section 2.1 for details.
As a motivating example, consider for , , the diagrammatic TemperleyβLieb algebras, , were developed by the authors of the same name in [2]. For , there are isomorphisms between the endomorphism algebra
of the natural module for and the TemperleyβLieb algebra . In [3], Barnes, Benkart, and Halverson combined the work of McKay and TemperleyβLieb by describing the endomorphism algebras of the finite subgroups of and presenting diagrammatics for the and cases.
The study of endomorphism algebras like can be generalized to more general homomorphism spaces. For example, we can study for all . This gives us new tools, new perspective, and a richer understanding of the representation theory. With this generalization in mind, the diagrammatic TemperleyβLieb category was developed, see [4] and [5]. This category admits a fully faithful monoidal functor to the category whose objects are tensor products of and the morphisms are all -linear maps. In particular, the TemperleyβLieb algebras appear as endomorphism algebras in the TemperleyβLieb category.
Surprisingly, entire categories can be easier to derive than individual endomorphism algebras. In particular, the TemperleyβLieb category has generating diagrams known as the cup, cap, and identity strand, and there is a diagrammatic basis for each space of homomorphisms, Hom, which can be described as all non-crossing diagrams with nodes on the bottom of the diagram and nodes on the top.
In this paper, we explore diagrammatic categories which expand the set of generating objects which correspond to all of the simple -modules and provide explicit relations giving a diagrammatic description of the monoidal full subcategory generated by the irreducible -modules, -mod. In order to give a more general constructions, in section 4, we utilize the representation graph of a group , , and give a general construction of a diagrammatic category . The proof of the main theorem shows that, given explicit criteria, there is an equivalence of categories between a quotient category of and -mod. In the final section, we give a few final remarks regarding generalization to directed graphs and give a few examples which show that these results apply outside of the context of and its finite subgroups.
We shall close out the introduction with a discussion of certain directions in which this work might extend. For the constructions in this paper, the functor to the category of -modules can be thought of as a functor to the category of -vector spaces once we forget the -action. In other words, we have a representation of each of these diagrammatic categories. Just as one group can have many representations, one category can have many interesting representations. This is an active area of research.
For example, Sam and Snowden explore the representation theory of the Brauer category in [6]. They specifically mention that much of the theory they develop could be transferable to other categories, like the TemperleyβLieb categories and its variants. In particular, we expect it applies to the categories introduced in this paper.
Similarly, Brundan and Vargas give a concrete diagrammatic definition of the affine partition category, and use it to study the representation theory of the partition category [7]. It is with these two papers in mind that we may ask the following questions.
Question 1.1.
Can we classify and study the representations of the diagrammatic categories associated to the finite subgroups of ? In particular, what is the categorical representation theory of these diagrammatic categories, and can we extend some notions such as highest weight module, semi-simplicity, irreducible modules, etc. to these categories?
In addition to the above questions, there are other directions one might consider exploring. The hands-on combinatorial nature of this area makes it easy to compute interesting examples and special cases. Another direction could be to explore how these categories react to changes in certain parameters. For example, the TemperleyβLieb category, when not considering the connection to , can be defined with a parameter where is the TemperleyβLieb category for . What would introducing such a parameter to these diagrammatic categories change about the combinatorics or representation theory? For example, one might explore how these categories decategorify.
2. Representation Graphs and Diagrammatic categories
This section discusses some of the background material this paper utilizes. Specifically, we provide the construction of a representation graph, and we give some pertinent background for monoidal categories and an example of a diagrammatic category.
2.1. Representation Graphs and the McKay Correspondence
This section is a summary of the work in [3], which covers this material more comprehensively. Their work provided important motivating ideas for the constructions in this paper.
Let us set some notation. Let be a set of isomorphism class representatives for the simple -modules. Let be some -module, not necessarily simple.
Definition 2.1.
The representation graph is a directed graph with nodes labeled by , and if where is the multiplicity of in , has directed edges from node to node . In the event that there is a pair of directed edges, one from to and one from to , we will represent this by a single undirected edge between to .
To illustrate the definition, let us construct an example explicitly.
Example 2.2.
Let and let . Let for . Notice that is simple, and in fact for each , there is one irreducible -module of dimension . From the ClebschβGordon formula, for all . Thus, the representation graph is the undirected graph
where the node corresponds to .
In the 19th century, Felix Klien classified all the finite subgroups of . There are two families indexed by : the cyclic groups and the binary dihedral groups ; along with three exceptional groups: the binary tetrahedral group, ; binary octahedral group, ; and binary icosahedral group, . In 1980, McKay made his rather beautiful observation that the representation graphs of these groups using the natural module for as the defining module are in one-to-one correspondence with the affine Dynkin diagrams of certain types. The following example makes explicit the correspondence when considering the binary tetrahedral group.
Example 2.3.
The binary tetrahedral group is generated by , , and where
and . Furthermore, the simple -modules can be characterized as follows: there are three -dimensional simple -modules which we will call , , and , three -dimensional simple -modules which we will call , , and , and one -dimensional simple -modules which we will call . To make this construction explicit, we fix an isomorphism class representative for each simple -module.
is the trivial module.
where
, , , ,
, .
where
, , ,
, , ,
, , and .
where
, , , ,
,
.
where
, , , ,
,
.
where
, , .
where
, , .
Notice that where is the natural module for . Now, we are ready to build the representation graph . Firstly, the th node of corresponds to the simple -module . Using the definition of the simples above, we can compute explicitly the direct sum decompositions of certain modules. In particular,
(2.1) | ||||||||
(2.2) | ||||||||
(2.3) |
Thus,
(2.4) |
is the realization of the representation graph . Observe that this is the affine Dynkin diagram .
In a similar manner, the representation graphs for the other finite subgroups of , , , , and , respectively correspond to the Dynkin diagram , , , and .
It is advantageous for this paper to establish some notation. Given a representation graph , we let be the set of all paths from to . We let be the subset of consisting of all paths of length . A path can be identified with a -tuple which traverses the nodes for .
Example 2.4.
Considering the representation graph of , from (2.4). There are paths of length from the node labeled by to the node labeled by . Thus, has elements, namely , , , , and .
2.2. Diagrammatic TemperleyβLieb Category
As the main goal of this paper is to develop diagrammatic categories which describe certain categories of representations, let us begin with a few categorical notions. In order to define a category, one must give a collection of objects and a collection of morphisms which contains the identity morphism for each object, are closed under composition, and satisfy associativity. The diagrammatic categories in this paper will all be strict, monoidal, and -linear. The following are the necessary definitions from [8] with some of the technical details suppressed.
Definition 2.5.
A monoidal category is a quintuple , where is a category, is a bifunctor called the tensor product bifunctor, is the associator and a natural isomorphism for all objects and in , is an object of , and is the unitor and an isomorphism, all subject to the pentagon axiom and the unit axiom.
Essentially, a monoidal category allows for tensor products of objects and morphisms in which there is an associator and a unit object. A -linear category asserts that the class of morphisms are in fact vector spaces over the field and with composition acting linearly.
In a similar way to group or monoid presentation, we can define a -linear monoidal category using generators and relations. For a technical discussion of this, see [8, 9]. Let be a monoidal category. A collection of objects in generates the objects of if every object can be realized as the tensor product of elements of . Furthermore, a collection of morphisms in generates the morphisms of if every morphism can be realized using linear combinations, compositions, and tensor products of elements of . On the other hand, given a set of objects and a set of morphisms , we can construct the free monoidal category on these sets. One can also impose relations on morphisms between objects. Let be a collection of relations for morphisms in , and let be the tensor ideal generated by . If is generated by and , then the quotient category is said to be generated by and subject to the relations .
Definition 2.6.
A strict monoidal category is a monoidal category in which the associator and the unitor are identity morphisms.
There is a subtle issue with the functors in this paper. All of our diagrammatic categories are strict, yet the target categories are from representation theory, and the unitor of the category of -modules for a group is not the identity morphism. However, this is not really an issue since we have Mac Laneβs Strictness Theorem from [8, 9].
Theorem 2.7.
Any monoidal category is monoidally equivalent to a strict monoidal category.
In order to give an example of the above definitions, let us first discuss some motivation. Much of our discussion will be centered around defining diagrammatic algebras and categories which are specifically designed to mirror the workings of a category coming from representation theory.
For example, consider the well-known TemperleyβLieb algebra which can be defined by generators and subject to the relations
The algebra can be viewed diagrammatically as well where
.
Then the TemperleyβLieb algebra has a basis given by the following diagrams:
The composition product is given by vertically stacking diagrams as shown in the next example. Furthermore, whenever there is a closed connected component, we delete it and multiply the resulting diagram by a factor of .
Example 2.8.
Let
.
We connect the diagrams in the obvious way:
and we use isotopies to straighten out connected components, as well as delete any connected components contained completely in the middle of the diagram to get
By setting , we get the following theorem.
Thus, we have a diagrammatic presentation for the endomorphism algebra End.
We are now ready to give an example of a monoidal -linear category given by generators and relations. In particular, we can generalize this description and obtain the TemperleyβLieb category by allowing the number of vertices on top and bottom to vary. Thus, can be defined as the monoidal -linear category generated by one object and the morphisms
,ββββ , ββββ and .
Composition is given by vertical concatenation, when this is possible. The monoidal product is given by horizontal concatenation. These operations are subject to the same relations as above, namely isotopy equivalence and a factor of gets multiplied for each closed connected component deleted. There is then a fully faithful functor
given on objects by . This functor defines an equivalence into . From this equivalence, we have a diagrammatic basis for the spaces of -invariant homomorphisms, Hom for all . In particular, the non-crossing diagrams with nodes on bottom and nodes on top and where each node has valence precisely form this basis.
For this paper, the categories we work with will be semisimple. That is, every object in the category will be isomorphic to the direct sum of simple objects.
3. Categories with Irreducible -modules as Objects
Let us explore some new families of categories. We will again use the convention that the empty diagram is the morphism from to which represents multiplication by where is the identity object.
Definition 3.1.
Let be the -linear monoidal category with objects generated by with the tensor product being defined by concatenation. Denote the concatenation of the integers as . The morphisms are generated by the following diagrams:
where . We will sometimes refer to these as the identity diagram, the merge diagram, and the split diagram respectively.
We impose the following relations:
(3.1) |
(3.2) |
(3.3) |
where , and .
Remark 3.2.
It is worth noting that the when using the split map on an integer mod , we must specify which two integers are the target. For example,
(3.4) |
are equal if and only if and .
Given a diagram , we will denote as the number of split diagrams used in the construction of and as the number of merge diagrams used in .
Lemma 3.3.
The difference is precisely the difference between the number of tensor factors in the target and the number of tensor factors in the source.
Proof.
Fix a diagram with . Notice, there are tensor factors corresponding to strings on the bottom of . Reading the from bottom to top, observe that a merge diagram will subtract one from the number of tensor factors of the top of , and a split diagram will add one to the number of tensor factors of the top of the . Furthermore, an identity strand will not change the number of tensor factors. Thus, . β
Lemma 3.4.
Any diagram in is equal to as morphisms in .
Proof.
Let
(3.5) |
be a diagram in Hom. From Lemma 3.3, the number of merge diagrams in is equal to the number of split diagrams in . So, we induct on the number of split diagrams in , . If , then as well, and must be the identity strand on .
Now, assume we have that any diagram is equal to the identity strand on for for some . Suppose . Then, we can isolate a highest split diagram in . Thus we have
ββββ
where only contains identity strands and merge diagrams. In particular, since has at least two tensor factors in the domain and only one tensor factor in the codomain, by Lemma 3.3, must contain at least one merge diagram. Using the associativity relation for merge diagrams in (3.3) iteratively, we can position a merge diagram directly above the split diagram. Hence,
(3.6) | |||||
(3.7) |
where has splits, i.e. . Therefore, using the induction hypothesis
(3.8) |
β
The above lemmas will be helpful in proving Theorem 3.7. Now let us explore a particular category from representation theory.
We denote as the full -linear monoidal subcategory of where the generating objects are the irreducible -modules where . As all irreducible -modules are -dimensional, and
then by Schurβs Lemma, Hom is either -dimensional or -dimensional. If it is -dimensional, then for some . We pick bases for these irreducible -modules and let denote our chosen basis vector of .
We can choose -module homomorphisms,
where ,
where , and
is the identity map. Notice that for all .
Theorem 3.5.
There exists a well-defined functor of monoidal -linear categories determined by the following rules:
, ,
for each .
Proof.
We check that the above relations are preserved by the functor .
As
Thus,
(3.9) |
As
Thus,
(3.10) |
Thus,
(3.11) |
As
Thus,
(3.12) |
As
Thus,
(3.13) |
Therefore, the functor is well defined.
β
Theorem 3.6.
The functors are full.
Proof.
It suffices to show that given and a morphism where , there exists a morphism such that . As and are one dimensional -modules, they are irreducible as -modules, and thus, up to scaling, there is only one non-zero morphism. Said another way, we need only show there exists a such that .
We construct a diagram from to where there are . Consider the following diagram:
for . If , we replace the split diagram with the identity strand. We continue to stack the split diagram until and tensor with the identity strand where needed. This process is finite, and thus, we get the resulting diagram:
It is clear that the image of this diagram under the functor is a non-zero homomorphism which sends the vector to the vector , and therefore, is full. β
Theorem 3.7.
The functor is faithful.
Proof.
Let and . We have that Hom has dimension iff and otherwise. Thus, it suffices to show that there is one morphism up to scaling by in between and when .
Consider a diagram where :
Using the relation from 3.2:
we can rewrite as
.
Now, consider using the relation iteratively to get the following equality:
ββββ
where and , and since , then . Thus by Lemma 3.4 the diagram on the right hand side of the equation is equal to
where . Thus, there is one diagram up to scaling in . Therefore, the functor is faithful.
β
Now that we are familiar with a specific example of the type of diagrammatic category we would like to construct, the next section develops diagrammatic categories which utilize the representation graphs given a group and a module .
4. The Categories -mod and
Let be a directed graph with no multiple parallel edges, that is, no two nodes have two or more directed edges with the same direction between them, and with the set of vertices indexed by the set . For example, let be the representation graph of one of the finite subgroups of as discussed in 2. The constructions in this section can be used to define a diagrammatic category associated to the graph . Furthermore, as we have done in this paper, one can start with a semisimple symmetric monoidal -linear category over some field and consider the full subcategory where the objects are monoidally generated by the simple objects. Regardless of whether or not this category comes from representation theory, we may construct a representation graph. That is, we may fix a simple object and construct the graph with nodes corresponding to the simple objects and a directed edge from vertex to vertex if the simple object corresponding to is a direct summand of . If this directed graph has no multiple edges, then using the ideas in this section, one can diagrammatically define a category which is categorically equivalent to .
4.1. The Category -mod
We first consider when is the representation graph for a group . Let be a group, not necessarily finite, and let be a -module such that the resulting representation graph is a connected graph with no multiple parallel edges. Furthermore, we will assume that corresponds to a node in . That is, we will assume is a simple -module. It is worth mentioning here that and the finite subgroups of are examples of such , but there are others as well. See [11, 12, 13, 14].
First, let us set some notation. Let be a set of fixed isomorphism class representatives of simple -modules with being an indexing set for the finite-dimensional simple -modules. Furthermore, as is a simple -module and is an indexing set for the simple, -modules, one of the elements of corresponds to . For notational convenience, we let this index be the symbol . In particular, we will use and interchangeably. Furthermore, for , we will also use to denote that is adjacent to in . Note that in an undirected graph implies .
Definition 4.1.
We let -mod be the full monoidal subcategory of -mod with objects generated by where .
Notice, the morphisms of this category are elements of the -vector spaces
where and .
We define certain -module homomorphisms concretely. Since has no multiple edges by assumption, the space Hom is -dimensional for each adjacent to in and -dimensional otherwise. We may choose to fix a map in Hom for each adjacent to and name them . Notice that the choice of each , while non-trivial, is only up up to a scalar by Schurβs Lemma. Furthermore, with the fixed, for each which is adjacent to in there are unique non-zero -module homomorphisms, which we name , which span Hom such that the following is satisfied:
(4.1) |
Remark 4.2.
If has multiple edges from to , then Hom has dimension greater than . In this case, we may still define a set of maps which when extended linearly describe the whole space. If the set is minimal, this is analogous to choosing a basis for Hom. Furthermore, the relationships between the maps in Hom and the maps in Hom would require exploration. As most groups admit representation graphs which contain multiple edges between nodes, it would be interesting to explore the extension of the ideas in this section to these much more ubiquitous representation graphs.
Let us consider an example: let be the binary tetrahedral group. We will use notation consistent with Example 2.3.
Example 4.3.
We let -mod be the full monoidal subcategory of -mod with objects generated by with . Notice, the morphisms of this category are in Hom.
We will consider the following -module homomorphisms:
We will then define to be the map satisfying the relation
Recall from Section 2.1 that is the set paths from to of length and is subset of . Let where and . We fix to be the map from onto the irreducible submodule using the previously fixed maps, and , in the following way:
Since the identity maps and the are canonical (up to scaling), so then is .
Similarly, we let be the map from into such that . For each irreducible -module , there is a minimal such that , and since the representation graph has no multiple edges, this corresponds to a single path . Thus, shows up exactly once in , and thus we let and be the corresponding projection and inclusion maps.
4.2. The Category
Now we turn to a diagrammatic category which needs only the data of the representation graphs presented in the previous section to construct.
Definition 4.4.
We let be the -linear monoidal category with objects generated by and morphisms generated by the following diagrams:
where such that is adjacent to in the representation graph, .
The generators are subject to the following relations:
(4.2) |
Let us set some notation for some morphisms in the category . Recall the notation we introduced in Section 2.1: for , we let
, and
Lemma 4.5.
As morphisms in
for all .
Proof.
We proceed by induction on . For , the statement is precisely the second relation in Definition 4.4. Now let us suppose that
for some . Using this hypothesis, we have
which was to be shown. β
The following gives an example of the construction of a diagrammatic category in this way.
4.3. The Functor
The following definitions and theorems show that there is a full functor from onto . Recall the maps and given before (4.1).
Definition 4.7.
We let be the monoidal -linear functor determined by the following rules:
Note that by the way and were chosen, the relations in (4.2) are automatically satisfied. If the reader is exploring graphs with multiple edges, this definition must be expanded.
As there will be no confusion as to which representation graph, for the rest of this section we will suppress the in the notation of Definitions 4.4 and 4.7 and say that
Lemma 4.8.
The functor is full onto and
for any and any .
Proof.
To prove that is full onto Hom, it suffices to show that Hom is spanned by
which we will show by inducting on .
Since the representation graph of does not contain any multiple edges, then up to scaling
is canonical for all . Thus each Hom is either or spanned by . Furthermore, since is simple, and
the base case is trivial.
Now suppose that Hom is spanned by for some and for all . Then we consider Hom.
Since , we can construct , where and . So up to scaling, we have morphisms
which are canonically based on the path in the representation graph. Thus for each , there is a canonical projection . Therefore, is full on Hom for all and .
It is analogously shown using , , and where that is full onto Hom.
β
As the reader will have no doubt noticed, the proof of the previous lemma marks the first place where our representation graph is required to contain no multiple edges. In the following lemmas, we use this as well. We construct projection and inclusion maps which, in our case, are canonical but will not be for a representation graph which contains multiple edges.
Lemma 4.9.
The functor is full onto
for .
Proof.
By the previous lemma and the fact that is a monoidal, -linear functor, it suffices to show that any morphism in Hom can be realized through -linearity, composition, and tensor products of morphisms in Hom and Hom.
Let . For each , there exists a minimal such that , and thus there are morphisms, Hom and Hom such that . Thus,
and since
then is full onto Hom for .
An analogous argument shows is full onto Hom. β
Lemma 4.10.
The functor is full onto Hom for any .
Proof.
Given a morphism, and a path , we have in the image of canonical projections, , and inclusions, , onto and from such that and . Thus, we have
where the sums are taken over all paths of length and from to . Since and , is full onto Hom for any . β
Theorem 4.11.
The functor is full.
Proof.
Consider a morphism . Using notation from the proofs above, we have
and by setting and , we have that
and
Therefore the functor is full. β
4.4. The Induced Functor
We now explore the kernel of . Assume is a tensor ideal of such that for all objects in , for every morphism . Let . Then there is an induced functor
Let us assume that for any
That is, in we have for all
(4.3) |
where is the Kronecker delta and .
Lemma 4.12.
Suppose the equality in 4.3 is satisfied. The functor is faithful on Hom and Hom for all and .
Proof.
Recall that is full, the set forms a basis for
and . Thus, the are linearly independent.
It then suffices to show that any diagram in Hom can be written as a linear combination of the diagrams where . It will be convenient to instead show the following equality:
where is a diagram in .
We induct on . For , an immediate consequence of the relation (4.3) is that any diagram is either the identity on , or it is . For , the second relation in (4.2) results in the following:
,
which was to be shown.
Now, suppose that any diagram in Hom can be written as a linear combination of the diagrams where , and let the following diagram be a diagram in Hom for some . Using the second relation in (4.2), we get that
Now we set
resulting in
and thus, by the induction hypothesis,
which shows the desired result. Therefore, the is faithful on Hom for all .
By considering the vertical reflection of each diagram, the analogous argument shows that is faithful from Hom.
β
Lemma 4.13.
The functor is faithful on Hom for all .
Proof.
Let be the set of all diagrams in Hom. Now suppose that
where only finitely many of the are non-zero.
Let . Then
Now notice that for any ,
and thus by the previous lemma, we have the following equalities:
and since , we have
Therefore, is faithful from Hom for all . β
Theorem 4.14.
The functor is faithful on .
Proof.
Let be the set of all diagrams in Hom where for all and .
Suppose . Then we also have
and using the fact that is a monoidal -linear functor along side the lemmas above, we have the following string of equalities:
Since is faithful on Hom, then
This implies that
and thus
Now notice, since with not , we finally have
where is the non-zero scalar . Therefore, is faithful. β
Combining the fullness result given in Theorem 4.11 and the faithfulness results in Theorem 4.14 yields the following result.
Theorem 4.15.
Let be a representation graph which is connected and contains no multiple parallel edges. Let be a tensor ideal of which satisfies (4.3). Then there is an equivalence of categories
Of course, it remains to determine , for example, by giving a set of relations. This will presumably depend on the specifics of the representation theory of and would need to be determined on a case-by-case basis.
In this current setting, determining seems to require computation over on the representation theory side to determine diagrammatic relations. Depending on the specific example, this can be a non-trivial task. In the next section, we give another way of determining .
5. Final Remarks
It is worth noting that we can be even more general in our set up with much the same result. Suppose instead that we begin with a semi-simple, monoidal, -linear category and restrict to the full subcategory monoidally generated by the simple objects, which we can denote as , the objects of which can be indexed by . By fixing an object of , we may construct a directed graph in an analogous way to a representation graph. Assume is a directed, connected graph which does not contain any multiple parallel edges between vertices, we may form the following definition. For convenience, we will identify the unit object of , , with the vertex of corresponding to .
Definition 5.1.
Let be defined as the monoidal -linear category with objects generated by and and morphisms generated by
for all and adjacent to in the directed graph . The generating diagrams are subjected to the following relations:
, βββ , βββ
Denote by the simple object of corresponding to the index . Let be a map in . As has no multiple edges and is simple, is unique, up to scaling. Let be in , such that . Furthermore, we can define a unique, up to scaling, map, in when is a direct summand of , and let in such that .
Now, we can define a monoidal, -linear functor
which is given on the generating objects and morphisms as follows:
and extend monoidally and -linearly. The proofs are analogous to show is a full functor from to .
Furthermore, we can define an induced faithful functor from where we let be the tensor ideal generated by the following relations:
, where is the Kronecker delta, and ,
ββββ and ββββ .
The proofs are analogous to show this construction admits of a fully faithful functor.
Let us now explore some limitations on these constructions. First, we need connectedness in our representation graph as the following will illuminate. Consider a finite group with the set an exhaustive list of irreducible -modules, up to isomorphism, and let the defining module, , for our representation graph be the trivial module for . Then we have that is
which would result in a diagrammatic category which does not recover any homomorphisms in even when shows up in the direct sum decomposition of .
Another limitation of our construction is that we assumed the representation graph has no multiple edges between two vertices. This corresponds to a multiplicity free condition on the direct sum decomposition of the tensor product of the defining module and each simple module. Without this condition, there is not a canonical way to decompose this tensor product into simples, and we must make non-trivial choices.
On the other hand, please note that we make no assumption that these graphs be finite. In particular, the representation graphs , , and where is the natural module for , have infinitely many nodes. In this situation, our approach still applies and we can construct a diagrammatic category which encodes the corresponding representation theory.
Beyond the subgroups of , there are numerous representation graphs in the literature. They often are aptly named McKay graphs. Here are just a few places the reader can explore: [15][13], [14], [11], and [12]. In particular, the following example uses Evansβ and Pughβs explicit computation of a representation graph to construct a diagrammatic category for a setting unlike any other in this paper.
Example 5.2.
Let denote the projective special linear group of degree over the finite field of order . This is an irreducible primitive group of order . There are nine irreducible -modules. We will follow the notation from Evans and Pugh and let the irreducible -modules be indexed in the following way: let the trivial module of dimension be denoted ; there are four -dimensional irreducible modules denoted , , , and ; there is one -dimensional irreducible module denoted ; finally, there are three -dimensional irreducible modules , , and . For consistency with the notation in this paper, let . Thus, Evans and Pugh compute the representation graph to be the following undirected graph:
Now we can construct the monoidal -linear diagrammatic category . Keeping consistent with the notation from Definition 4.4, let
The set of objects are generated by and the morphisms are generated by
We shall finish this paper with two more examples. The following examples show that the constructions in this paper apply to situations outside of representation theory. The first is the universal Verlinde category, which is a symmetric fusion category defined in [15]. The second is a slightly more exotic fusion category. In particular, the Fibonacci category has objects which have non-integer dimensions. For a more comprehensive understanding of this setting, see [16].
Example 5.3.
Let be a field of positive characteristic , be the cyclic group of order , and Rep be the category of finite dimensional -modules over . Furthermore, we say that a morphism is negligible if for all other morphisms , where tr represents the trace. Ostrik defines the universal Verlinde category, Verp, to be the quotient of Rep by the negligible morphisms. Ostrik further gives a characterization of the simple objects and the fusion rule for Verp, which results in the following fusion graph:
where the node labeled by corresponds to defining object. Thus, our construction provides a diagrammatic realization of Verp.
Example 5.4.
Let be the semi-simple, monoidal, -linear category in which are generated by two objects, and , which follow the following tensor product decomposition rules:
Now, define as the full subcategory monoidally generated by and . Thus, we can construct the following graph with generating object :
.
From the graph , we can construct and functor
consistent with the other constructions in this paper.
References
- [1] John McKay. Shorter notes: Cartan matrices, finite groups of quaternions, and Kleinian singularities. Proceedings of the American Mathematical Society, 81(1):153β154, 1981.
- [2] H.N.V. Temperley and ElliotΒ H Lieb. Relations between the βpercolationβ and βcolouringβ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the βpercolationβ problemβpercolationβ problem. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 322(1549):251β280, 1971.
- [3] JeffreyΒ M. Barnes, Georgia Benkart, and Tom Halverson. McKay centralizer algebras. Proceedings of the London Mathematical Society, 112(2):375β414, 2016.
- [4] Vladimir Turaev. Quantum invariants of knots and 3-manifolds. De Gruyter, Berlin, 2nd edition, 1994.
- [5] Joshua Chen. The Temperley-Lieb categories and skein modules. arXiv:1502.06845[math.QA], 2014.
- [6] StevenΒ V. Sam and Andrew Snowden. The representation theory of Brauer categories I: Triangular categories. arXiv:2006.04328[math.RT], 2020.
- [7] Jonathan Brundan and Max Vargas. A new approach to the representation theory of the partition category. arXiv:2107.05099[math.RT], 2021.
- [8] P.Β Etingof, S.Β Gelaki, D.Β Nikshych, and V.Β Ostrik. Tensor Categories. Mathematical Surveys and Monographs. American Mathematical Society, 2016.
- [9] S.M. Lane, S.J. Axler, Springer-VerlagΒ (Nowy Jork)., F.W. Gehring, and P.R. Halmos. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer, 1998.
- [10] B.Β W. Westbury. The representation theory of the Temperley-Lieb algebras. Mathematische Zeitschrift, 219(1):539β569, 1995.
- [11] Avraham Aizenbud and Inna Entova-Aizenbud. Mckay trees, 2021.
- [12] DavidΒ E. Evans and Mathew Pugh. Spectral measures for g2, ii: Finite subgroups. Reviews in Mathematical Physics, 32(08):2050026, 2020.
- [13] Alexander Kirillov and Viktor Ostrik. On a -analogue of the McKay correspondence and the classification of conformal field theories. Advances in Mathematics, 171(2):183β227, 2002.
- [14] Dane Frenette. McKay graphs. PhD thesis, Library and Archives Canada = Bibliothèque et Archives Canada, Ottawa, 2010.
- [15] Viktor Ostrik. On symmetric fusion categories in positive characteristic. Selecta Mathematica, 26:36, 2020.
- [16] Thomas Booker and Alexei Davydov. Commutative algebras in fibonacci categories. Journal of Algebra, 355(1):176β204, 2012.