This paper explicitly computes the center of a monoidal 2-category related to 3+1D Dijkgraaf-Witten Topological Quantum Field Theory, providing a detailed mathematical description of topological defects.
Contribution
It offers a concrete calculation of the center of the monoidal 2-category for twisted G-graded categories, advancing the mathematical understanding of 3+1D Dijkgraaf-Witten TQFT.
Findings
01
The center is a braided monoidal 2-category.
02
The sylleptic center of this category is trivial.
03
Provides a mathematical framework for topological defects in 3+1D TQFT.
Abstract
In this work, for a finite group G and a 4-cocycle ω∈Z4(G,k×), we compute explicitly the center of the monoidal 2-category 2VecGω of ω-twisted G-graded 1-categories of finite dimensional k-vector spaces. This center gives a precise mathematical description of the topological defects in the associated 3+1D Dijkgraaf-Witten TQFT. We prove that this center is a braided monoidal 2-category with a trivial sylleptic center.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
The center of monoidal 2-categories in 3+1D Dijkgraaf-Witten Theory
Liang Kong
Shenzhen Institute for Quantum Science and Engineering, and Department of Physics, Southern University of Science and Technology, Shenzhen, 518055, China
In this work, for a finite group G and a 4-cocycle ω∈Z4(G,k×), we compute explicitly the center of the monoidal 2-category 2VecGω of ω-twisted G-graded 1-categories of finite dimensional k-vector spaces.
This center gives a precise mathematical description of the topological defects in the associated 3+1D Dijkgraaf-Witten TQFT.
We prove that this center is a braided monoidal 2-category with a trivial sylleptic center.
1. Introduction
The notion of the center of a monoidal 2-category was introduced long time ago [BN, C, KV].
As far as we know, there is, however, no explicit computation of the centers of any non-trivial monoidal 2-categories. In recent years, the demand for such computation from physics becomes paramount. In this work, we consider a very simple case motivated from the physics of 3+1D topological orders.
Let V be the 1-category of finite dimensional k-vector spaces (i.e. 1Vec).
The ground field k is assumed to be C throughout the paper.
Let G be a finite group and ω∈Z4(G,k×) a 4-cocycle. Let 2VecGω be the 2-category of G-graded 1-categories of finite semisimple V-module categories, equipped with a ω-twisted monoidal structure, which makes 2VecGω a non-strict monoidal 2-category.
The goal of this paper is to compute the center of 2VecGω as a braided monoidal 2-category.
It can be viewed as 3+1D Dijkgraaf-Witten theory for a finite group G [DW].
We give a definition of the center of monoidal 2-categories in Section 2.
It is a weak version of Crans’ definition of the center of semi-strict monoidal 2 categories [C].
Our first main result is that the center of a monoidal 2-category is a braided monoidal 2-category, see Theorem 2.2.
We further compute explicitly the center Z(2VecGω) of the monoidal 2-category 2VecGω in Section 3.
Although any monoidal 2-category has a semi-strict model [GPS], it is more convenient for us to consider non semi-strict monoidal 2-categories 2VecGω when we compute the center of 2VecGω.
The analogue on the level of 1-categories is known as the twisted Drinfeld double of a finite group G. Let 1VecGχ be the χ-twisted monoidal 1-category of G-graded finite dimensional k-vector spaces for χ∈Z3(G,k×).
Let Cl be the set of conjugacy classes of G, and CG(h) be the centralizer of h∈G.
There is a the transgression map τh:Ck+1(G,k×)→Ck(CG(h),k×).
Willerton used it to give a geometric description of the twisted Drinfeld double, and showed that there is an equivalence of 1-categories:
[TABLE]
where 1Rep(CG(h),τh(χ)) is the 1-category of representations of the central extension of CG(h) determined by the 2-cocycle τh(χ) [DPR, W].
Our second result generalizes this from 1-categories to 2-categories.
Theorem 1.1**.**
There is an equivalence of 2-categories:
[TABLE]
where 2Rep(CG(h),τh(ω)) is the 2-category of right module categories over the monoidal 1-category 1VecCG(h)τh(ω).
The braided monoidal structure of Z(2VecGω) will be explicitly described in Section 3.2.
We expect a similar generalization to n-categories.
Conjecture 1.2**.**
For ω∈Zn+2(G,k×) and a properly defined notion of an n-category, we have an equivalence of n-categories:
[TABLE]
While we are preparing this paper, a beautiful work on the definition of a fusion 2-category by Douglas and Reutter appeared online [DR].
They introduced the notion of the 2-categorical idempotent completion, which is used to define that of 2-categorical semisimpleness.
Our result further confirms their definition.
In particular, Z(2VecGω) is idempotent complete and semisimple.
We expect that it is a fusion 2-category.
We next discuss the sylleptic center of braided monoidal 2-categories which is a generalization of Crans’ definition in the semi-strict case [C] in Section 3.4.
Our third result is that the sylleptic center of Z(2VecGω) is trivial. Thus Z(2VecGω) should be an example of the yet-to-be-defined modular tensor 2-category.
Theorem 1.3**.**
The sylleptic center of Z(2VecGω) is equivalent to 2Vec as 2-categories.
Our motivations of this work are threefold.
(1) It was proposed in [LKW2] that 2VecGω describes an anomalous 2+1D topological order, and its gravitational anomaly (or its bulk) is a 3+1D topological order consisting of topological excitations precisely described by the braided monoidal 2-category Z(2VecGω). The objects in Z(2VecGω) represent string-like topological excitations, 1-morphisms represent particle-like topological excitations and 2-morphisms represent instantons. We compute Z(2VecGω) explicitly and summarize the result in Theorem 1.1. It is also known that the low energy effective theory of this 3+1D topological order is the well-known 3+1D Dijkgraaf-Witten TQFT associated to (G,ω) [DW]. Therefore, Theorem 1.1 also classifies all topological defects in the 3+1D Dijkgraaf-Witten TQFT. In particular, the monoidal 1-category of endomorphisms of the vacuum (i.e. particle-like excitations) is equivalent to the category Rep(G) of the representations of G. Moreover, Theorem 1.1 provides an efficient way to detect the physical difference between two anomalous 2+1D topological orders 2VecGω1 and 2VecGω2 by measuring their gravitational anomalies (i.e. centers), which are different not only in their braiding structures but also on the level of 2-categories (see Example 3.4).
(2) It is well-known that the topological excitations in a 2+1D topological order form a modular tensor 1-category (MTC). The 3+1D analogue of MTC, i.e. the yet-to-be-defined modular tensor 2-category, should include Z(2VecGω) as an example. Our second motivation is to find the correct definition of a (braided) fusion 2-category and that of a modular tensor 2-category. It is worthwhile to point out that, even in this simple case, in order to reveal the intertwined relation between the braidings and the 4-cocycle ω, it is more convenient to work in the non semi-strict setting.
(3) Our third motivation is to find a categorification of conformal blocks by integrating a modular tensor 2-category over 2-dimensional manifolds via factorization homology (see a recent review [AF] and references therein).
Douglas and Reutter constructed a state-sum invariant for 4-manifolds associated to any fusion 2-category.
We expect that the integration of Z(2VecGω) is related to their invariant associated to 2VecGω.
This work is the first in a series of works on (braided) fusion 2-categories. Our long term goal is to develop a mathematical theory of modular tensor 2-categories and a physical theory of the condensations of topological excitations in 3+1D topological orders. For example, the forgetful functor Z(2VecGω)→2VecGω is precisely the mathematical description of a physical condensation process.
Acknowledgement: Thank the referee for many useful suggestions. Thank Christopher L. Douglas for correcting typos. Liang Kong is partially supported by Guangdong Innovative and Entrepreneurial Research Team Program (Grant No. 2016ZT06D348), by the Science, Technology and Innovation Commission of Shenzhen Municipality (Grant Nos. ZDSYS20170303165926217 and JCYJ20170412152620376), and by the NSFC grant No. 11971219. Yin Tian is partially supported by the NSFC grants No. 11601256 and 11971256. Shan Zhou is partially supported by Simons Foundation grant No. 488629.
2. The center of monoidal 2-categories
In this section, we give a definition of the center of monoidal 2-categories.
It is a weak version of Crans’ definition of the center of semi-strict monoidal 2-categories in [C].
We use Gurski’s definition of monoidal bicategories and braided monoidal bicategories [G1, Section 2.4].
We prove that the center of a monoidal 2-category is a braided monoidal 2-category in Theorem 2.2.
Convention: In this paper, a (braided) monoidal 2-category is defined as a (braided) monoidal bicategory in the sense of Gurski, such that its underlying bicategory is a 2-category, see [GPS, Definitions 2.6].
We briefly recall the notion of a monoidal bicategory which is defined as a tricategory with one object.
We refer the reader to [G1] for more detail on tricategories and the coherence.
For two bicategories B,B′, let Bicat(B,B′) denote the bicategory of functors B→B′, natural transformations and modifications.
Let B=(B,⊗,I,a,l,r,π,μ,ρ,λ) be a monoidal 2-category.
It consists of the following data:
(1)
B is a 2-category, ⊗ is the monoidal bifunctor in Bicat(B×B,B), and I is the tensor unit;
2. (2)
a is the adjoint equivalence in Bicat(B×B×B,B), consisting of a pair a:(−⊗−)⊗−→−⊗(−⊗−) and its adjoint equivalence a∗:−⊗(−⊗−)→(−⊗−)⊗−;
3. (3)
l and r are the adjoint equivalences in Bicat(B,B), where l:I⊗−→− and r:−⊗I→−;
4. (4)
π is the invertible modification for a, and μ,ρ,λ are the invertible modifications for a,l,r.
It satisfies certain axioms which are omitted here.
We define the center Z(B) in three steps: (1) the 2-category; (2) the monoidal structure; and (3) the braiding.
Step 1: the 2-category Z(B).
Objects. An object A~=(A,RA,−,R(A∣−,?)) consists of an object A of B, an adjoint equivalence RA,−:A⊗−→−⊗A in Bicat(B,B), and an invertible modification R(A∣−,?):
[TABLE]
such that the following axiom holds:
[TABLE]
where the four isomorphisms “≅” are those defining the naturality of a in B.
1-morphisms. A 1-morphism (f,Rf,−):(A,RA,−,R(A∣−,?))→(A′,RA′,−,R(A′∣−,?)) consists of a 1-morphism f:A→A′ in B, and an invertible modification Rf,−:
[TABLE]
such that the following diagram commutes:
[TABLE]
where all vertical arrows are 1-morphisms induced by f:A→A′ in B.
2-morphisms. A 2-morphism α:(f,Rf,−)⇒(f′,Rf′,−) is a 2-morphism α:f⇒f′ in B
such that α⋅Rf,−=Rf′,−⋅α, i.e. the following diagram commutes:
[TABLE]
where the 2-isomorphisms in the front and back are Rf,X and Rf′,X, respectively.
Composition of 1-morphisms. Given two 1-morphisms (f,Rf,−) and (g,Rg,−), the composition
[TABLE]
where gf is the composition in B, and Rgf,− is given by the following composition of 2-morphisms:
[TABLE]
Remark 2.1*.*
The main difference between our definition and Crans’ definition is that we are working with monoidal 2-categories instead of semi-strict monoidal 2-categories.
The monoidal structure of 2VecGω is not semi-strict when ω is nontrivial.
Although any monoidal 2-category has a semi-strict model [GPS], we do not know how to compute the center of the semi-strict model of 2VecGω directly.
On the other hand, by working with non semi-strict associators, we can see explicitly the relation between the braidings and the associators (see Diagram (2.1) and Eq. (3.2)). This relation affects not only the braiding structure but also the objects of the center.
More precisely, the underlying 2-categories of the center of 2VecGω could be inequivalent for different classes ω, see Example 3.4.
Step 2: the monoidal structure.
We construct a monoidal 2-category (Z(B),⊗,I~,a~,l~,r~,π~,μ~,λ~,ρ~).
Tensor product of two objects (A,RA,−,R(A∣−,?))⊗(B,RB,−,R(B∣−,?))=(AB,RAB,−,R(AB∣−,?)), where RAB,− is an adjoint equivalence given by the composition:
[TABLE]
and R(AB∣−,?) is an invertible modification:
[TABLE]
Tensor product of an object A~=(A,RA,−,R(A∣−,?)) and a 1-morphism (g,Rg,−):(B,RB,−,R(B∣−,?))→(B′,RB′,−,R(B′∣−,?)) is a 1-morphism (Ag,RAg,−):A~B~→A~B′~, where Ag:AB→AB′ is the 1-morphism in B, and RAg,− is an invertible modification defined by the following diagram:
[TABLE]
where all vertical arrows are 1-morphisms induced by g.
Tensor product of a 1-morphism (f,Rf,−):A~→A~′ and an object B~ is a 1-morphism (fB,RfB,−):A~B~→A~′B~, where fB:AB→A′B is the 1-morphism in B, and RfB,− is an invertible modification:
[TABLE]
where all vertical arrows are 1-morphisms induced by f.
The unit I~=(I,RI,−,R(I∣−,?)), where RI,− is an adjoint equivalence I−l−r∗−I, and R(I∣−,?) is an invertible modification:
[TABLE]
An associator a~:(A~B~)C~→A~(B~C~) is a 1-morphism (a,Ra,−), where a:(AB)C→A(BC) is the associator in B, and Ra,− is an invertible modification:
[TABLE]
An equivalence l~:I~A~→A~ is a 1-morphism (l,Rl,−), where l:IA→A is the equivalence in B, and Rl,− is an invertible modification:
[TABLE]
An equivalence r~:A~I~→A~ is a 1-morphism (r,Rr,−), where r:AI→A is the equivalence in B, and Rr,− is an invertible modification:
[TABLE]
Invertible modifications π~,μ~,λ~,ρ~ are defined in the same way as in B.
We need to show that they are well-defined 2-morphisms in Z(B), i.e. they satisfy the axiom in (2.3).
We check the case of λ~ in the following and leave other cases to the reader.
The invertible modification λ~:l~⇒l~∘a~ is defined as λ:l⇒l∘a in B.
We need to show that the following diagram commutes:
[TABLE]
where the 2-isomorphisms in the front and back are Rl,X and Rl∘a,X, respectively.
We decompose the diagram into pieces:
[TABLE]
The commutativity of each piece follows from the definition of Rl,− in (2.7) and the axioms in B.
Step 3: the braiding.
The braiding of two objects A~=(A,RA,−,R(A∣−,?)) and B~=(B,RB,−,R(B∣−,?)) is a 1-morphism RA~,B~=(RA,B,RRA,B,−):A~B~→B~A~ in Z(B), where RA,B=RA,−(B):AB→BA is the adjoint equivalence in B, and RRA,B,− is an invertible modification:
[TABLE]
The braiding of an object A~=(A,RA,−,R(A∣−,?)) and a 1-morphism (g,Rg,−) is an invertible modification RA,−(g).
The braiding of a 1-morphism (f,Rf,−) and an object B~=(B,RB,−,R(B∣−,?)) is an invertible modification Rf,−(B).
Two invertible modifications
[TABLE]
and R(A~,B~∣C~) is given by:
[TABLE]
So R(A~,B~∣C~) only differs from the identity by the two units idA(BC)⇒aa∗ and id(CA)B⇒a∗a.
Theorem 2.2**.**
The center Z(B) defined above is a braided monoidal 2-category.
Proof.
See [G1, Section 2.4] for Gurski’s definition of a braided monoidal bicategory.
Step 2 makes Z(B) a monoidal 2-category.
The adjoint equivalence R:⊗⇒⊗∘τ in Bicat(Z(B)×Z(B),Z(B)), and the invertible modifications R(A~∣B~,C~),R(A~,B~∣C~) are defined in Step 3.
The four axioms are about 2-isomorphisms in Hom(((A~B~)C~)D~,D~((A~B~)C~)),Hom(A~((B~C~)D~),((B~C~)D~)A~),Hom((A~B~)(C~D~),(C~D~)(A~B~)) and
Hom((A~B~)C~,C~(B~A~)), respectively.
The first one follows from the definition of Ra,− in the associator a~:(A~B~)C~→A~(B~C~) as in (2.6).
The second is the same as the axiom in (2.1).
The third follows from the definition of RAB,− in the tensor product A~B~ as in (2.4).
The last one follows from the definition of RRA,B,− in the braiding RA~,B~ as in (2.10).
∎
3. Computation of Z(2VecGω)
A monoidal bicategory is defined as a tricategory with one object.
We refer to [G1, Section 4.1] for the definition of tricategories.
A monoidal 2-category is a monoidal bicategory whose underlying bicategory is a 2-category.
Let V be the 1-category of finite dimensional k-vector spaces (i.e. 1Vec).
Let 2Vec be the 2-category of 1-categories of finite semisimple V-module categories [Os1]. More precisely, objects in 2Vec are of the form V⊞n, where ⊞ is the direct sum; 1-morphisms are the V-module functors; 2-morphisms are V-module natural transformations.
The only simple object is V whose endomorphism 1-category End(V)≅V.
The tensor product ⊠ in 2Vec is the Deligne tensor product.
Consider the monoidal 2-category (2VecGω,⊠,I,a,l,r,π,μ,ρ,λ).
It is isomorphic to a direct sum of ∣G∣ copies of 2Vec as 2-categories.
The simple objects are δg for g∈G.
Any object is of the form A=⊞g∈GAg, where Ag∈2Vec is the g-component.
Tensor product of two simple objects is δg⊠δg′=δgg′.
The unit object I=δ1.
The adjoint equivalences a,l,r are all identities (i.e. a,l,r and the 2-isomorphisms defining their naturalities are all identities).
The invertible modifications ρ and λ are determined by π,μ and the axioms.
So the monoidal structure is completely determined by π and μ.
Moreover, π is described by a cocycle ω∈Z4(G,k×):
[TABLE]
and μ is described by a 2-cochain in C2(G,k×) which satisfies certain compatibility conditions with ω.
We restrict ourself to the normalized case: (1) ω is a normalized cocycle, i.e. ω(x1,x2,x3,x4)=1 if xi=1 for some i; and (2) the 2-cochain μ is trivial, i.e. μ(x1,x2)=1 for all xi.
In this case, μ,ρ,λ are all trivial so that the unit is strict. In particular, it means that the invertible modifications defined by (2.5),(2.7),(2.8) are all identities.
As a consequence, the diagram (2.9) is automatically commutative.
Remark 3.1*.*
It is expected that isomorphism classes of monoidal structures on 2VecG are classified by H4(G,k×).
Any class in H4(G,k×) has a normalized representative.
So our restriction to the normalized case is inessential.
3.1. The 2-category
We first compute Z(2VecGω) as a 2-category.
Let A~=(A,RA,−,R(A∣−,?)) be an object of Z(2VecGω).
The half braiding RA,− gives an equivalence of categories RA,g:A⊠δg→δg⊠A, for any g∈G.
Since 2VecGω is a 2-category, RA,−(idδg)=idRA,g.
The equation RA,X⊞Y=RA,X⊞RA,Y implies that RA,− is completely determined by the collection {RA,g}.
Let Cl denote the set of conjugacy classes of G.
We write h∈c and [h]=c if h∈G is in a conjugacy class c∈Cl.
Any object of Z(2VecGω) has a direct sum decomposition A~=⊞c∈ClA~c into its c-components due to the half braiding.
It induces a decomposition Z(2VecGω)=⊞c∈ClZ(2VecGω)c of the 2-category.
3.1.1. The component Z(2VecGω)c
We give an explicit description of one component Z(2VecGω)c following Step 1 in Section 2.
Let {h1,…,hs} denote all elements of G in the class c.
Objects. For an object A~c=(Ac,RA,−,R(A∣−,?)), its underlying object Ac=⊞iAhi in 2Vec.
The half braiding is a collection of equivalences
[TABLE]
for hig=ghj.
The invertible modification R(A∣g,g′)=⊞iR(hi∣g,g′):
[TABLE]
for hig=ghj,hjg′=g′hk.
Here we omit 1-associators which are all identities.
The modifications R(hi∣gg′,g′′),R(hi∣g,g′),R(hj∣g′,g′′),R(hi∣g,g′g′′) together with the 4-cocycle π should satisfy the axiom in (2.1), for A=Ahi,X=δg,Y=δg′,Z=δg′′.
All adjoint equivalences a are identities so that the four isomorphisms ‘≅’ are identities.
This axiom gives an equation of the 2-isomorphisms:
[TABLE]
for hig=ghj,hjg′=g′hk,hkg′′=g′′hl, and
[TABLE]
We introduce a handy notation for Equation (3.2): Eq(hi∣g,g′,g′′). It is a consequence of the axiom in (2.1), which can be simplified by omitting 1- and 2-associators as follows:
[TABLE]
1-morphisms. A 1-morphism is (f,Rf,−):(Ac,RA,−,R(A∣−,?))→(Ac′,RA′,−′,R(A′∣−,?)′) consists of a 1-morphism f=⊞ifi,fi:Ahi→Ahi′, and an invertible modification Rf,g=⊞iRfi,g:
[TABLE]
The invertible modifications Rfi,g,Rfj,g′,Rfi,gg′ should satisfy the axiom in (2.2) for A=Ahi,A′=Ahi′,X=δg,Y=δg′.
The axiom is simplified to the following diagram by omitting identity 1-associators:
[TABLE]
where the 2-isomorphism in the back is Rfi,gg′.
We denote this compatibility condition for 1-morphisms as Eq1(hi∣g,g′).
2-morphisms. A 2-morphism α:(f,Rf,−)⇒(f′,Rf′,−) is a 2-morphism α=⊞iαi,αi:fi⇒fi′
which satisfies the axiom in (2.3) for A=Ahi,A′=Ahi′,X=δg:
[TABLE]
We denote this compatibility condition for 2-morphisms as Eq2(hi∣g).
3.1.2. The restriction to one grading
For an object A~c, its underlying object Ac=⊞h∈cAh in 2Vec, where Ah are all equivalent to each other by the requirement of the half braiding.
We pick up a grading h∈c, and let CG(h)={g∈G∣gh=hg} denote the centralizer of h in G.
We focus on the component Ah and the half braiding with δx for x∈CG(h) in the following.
For x∈CG(h), the equivalence Rh,x:Ahδx→δxAh induces an autoequivalence of Ah:
[TABLE]
where the first and last maps are grading shifts in 2VecGω which are identities in 2Vec.
For x,y∈CG(h), the 2-modification R(h∣x,y) as in (3.1) induces a 2-isomorphism m(x,y):ρyρx⇒ρxy by taking the natural grading shifts to Ah.
Thus, the collection {ρx∣x∈CG(h)} gives a weak right action of CG(h) on the 1-category Ah.
For x,y,z∈CG(h), the modifications R(h∣xy,z),R(h∣x,y),R(h∣y,z),R(h∣x,yz) satisfy Eq(h∣x,y,z):
[TABLE]
Note that hi=hj=hk=hl=h in this case.
Translating to the weak action of CG(h) on Ah, the 2-isomorphisms satisfy the following equation:
[TABLE]
The action is associative up to a twisting determined by ω∈Z4(G,k×).
Consider the transgression map τh:Ck+1(G,k×)→Ck(CG(h),k×) defined by:
[TABLE]
for xi∈CG(h).
It is straightforward to check that τh is a chain map.
It induces a map between cohomologies which is still denoted by τh.
We are mainly interested in the case of k=3.
It follows that Ah∈2Rep(CG(h),τh(ω)), i.e. it is a right module category over the monoidal 1-category 1VecCG(h)τh(ω).
So there is a forgetful map Z(2VecGω)c→2Rep(CG(h),τh(ω)) by taking its h-component.
On the level of morphisms, a 1-morphism (f,Rf,−) restricts to a collection {Rf,x:Ahδx→Ah′δx∣x∈CG(h)} of 2-isomorphisms.
This collection defines a 1-morphism in 2Rep(CG(h),τh(ω)).
Similarly, 2-morphisms in Z(2VecGω) restricts to 2-morphisms in 2Rep(CG(h),τh(ω)).
To sum up, we have a forgetful 2-functor
[TABLE]
by restricting to the h-component.
3.1.3. The equivalence of the forgetful functor
We show that the forgetful functor Φh is an equivalence of 2-categories in the following.
Fix a set of representatives {gi∈G∣i=1,…,s\mboxandg1=1} for the coset CG(h)\G.
Then {hi=gi−1hgi∣i=1,…,s} are all elements in c, and h1=h is the base point.
We construct a 2-functor Ψh:2Rep(CG(h),τh(ω))→Z(2VecGω)c in the inverse direction by extending the action of CG(h) on Ah to that of G on Ac.
Step 1: Objects.
Let M=(M,ρx,m(x,y)) be an object of 2Rep(CG(h),τh(ω)), where ρx is the action and m(x,y) is the 2-modification.
We want to extend ρx,m(x,y) from the h-component to hi-component via the path determined by gi.
Define Ψh(M)=(Mc,RM,−,R(M∣−,?)) as
[TABLE]
[TABLE]
where given i,j and g∈G, there is a unique x∈CG(h) such that gig=xgj.
The 2-modification R(M∣g,g′)=⊞iR(hi∣g,g′), and R(hi∣g,g′) is defined in the following order:
[TABLE]
where x,y∈CG(h) and g,g′∈G.
The initial data is to define R(h∣x,y)=m(x,y) and choose any 2-isomorphisms for R(h∣x,gi),R(h∣gi,g) only requiring that R(h∣x,1)=R(h∣1,g)=R(h∣1,1).
Eq(h∣x,y,gi) involves four 2-isomorphisms:
[TABLE]
So R(h∣x,g) for g=ygi is determined by the other three isomorphisms which are already given.
Similarly, Eq(h∣x,gi,g′) uniquely determines R(h∣g,g′) for g=xgi, and Eq(h∣gi,g,g′) uniquely determines R(hi∣g,g′).
Lemma 3.2**.**
The construction (Mc,RM,−,R(M∣−,?)) gives a well-defined object of Z(2VecGω)c.
Proof.
By definition it suffices to show that Eq(hi∣g,g′,g′′) in (3.2) holds for all g,g′,g′′∈G and all i=1,…,s.
The key point is that there is a compatibility condition between Equations
[TABLE]
from the axiom (2.1) for Mhiδgδg′δg′′δg′′′, where hig=ghj.
We denote this compatibility condition by CC(hi∣g,g′,g′′,g′′′).
If any four of the five equations hold then so is the remaining one.
We prove that Eq(hi∣g,g′,g′′) holds in the following order: (1) (h∣x,y,z),(h∣x,y,gi),(h∣x,gi,g),(h∣gi,g,g′), and (2) (h∣x,y,g),(h∣x,g,g′),(h∣g,g′,g′′),(hi∣g,g′,g′′), where x,y,z∈CG(h),g,g′,g′′∈G.
The equations in the first group holds from the construction.
The condition CC(h∣x,y,z,gi) implies that Eq(h∣x,y,g) holds for g=zgi since the other four equations Eq(h∣x,y,z), Eq(h∣xy,z,gi), Eq(h∣x,yz,gi), Eq(h∣y,z,gi) hold.
Similarly, the condition CC(h∣x,y,gi,g′) implies that Eq(h∣x,g,g′) holds for g=ygi; CC(h∣x,gi,g′,g′′) implies that Eq(h∣g,g′,g′′) holds for g=xgi; and CC(h∣gi,g,g′,g′′) implies that Eq(hi∣g,g′,g′′) holds.
∎
Step 2: 1-morphisms.
Let (f,Mf,x):(M,ρx,m(x,y))→(M′,ρx′,m′(x,y)) denote a 1-morphism in 2Rep(CG(h),τh(ω)), where f:M→M′, and Mf,x is the 2-modification for x∈CG(h).
We define Ψh(f,Rf,x)=⊞i(fi,Rfi,−):Ψh(M)→Ψh(M′), where fi:Mhi=MfM′=Mhi′, and Rfi,g is the 2-modification for g∈G given below.
The only constraint for a 1-morphism is Eq1(hi∣g,g′) in (3.4) for Ahi=Mhi,Ahi′=Mhi′.
Eq1(hi∣g,g′) contains five terms Rfi,g,Rfi,gg′,Rfj,g′ and R(hi∣g,g′),R(hi∣g,g′)′, where hig=ghj, and the last two terms are already given.
For the first three terms, any two of them determines the remaining one.
We define Rfi,g in the following order: Rf1,x,Rf1,gi,Rf1,g,Rfi,g for x∈CG(h),g∈G.
Note that h1=h is the base point.
The initial data is to define Rf1,x=Mf,x and Rf1,gi=id for all i=1,…,s.
Eq1(h1∣x,gi) implies that Rf1,g for g=xgi is uniquely determined by Rf1,x and Rf1,gi.
Eq1(h1∣gi,g) implies that Rfi,g is uniquely determined by Rf1,gi and Rf1,gig.
An argument similar to the proof of Lemma 3.2 shows that Ψh(f,Rf,x)=⊞i(fi,Rfi,−) gives a well-defined 1-morphism in Z(2VecGω)c.
It suffices to show that Eq1(hi∣g,g′) holds for all g,g′∈G.
There is a compatibility condition between
[TABLE]
from (3.4) for Mhiδgδg′δg′′.
We denote this compatibility condition as CC1(hi∣g,g′,g′′).
If any three of the four constraints hold then so is the remaining one.
We prove that Eq1(hi∣g,g′) holds in the following order: (1) (h1∣x,y),(h1∣x,gi),(h1∣gi,g), and (2) (h1∣x,g),(h1∣g,g′),(hi∣g,g′),(hi∣g,g′,g′′), where x,y∈CG(h),g,g′∈G.
The constraints in the first group holds from the construction.
The condition CC1(h1∣x,y,gi) implies that Eq1(h1∣x,g) holds for g=ygi; CC1(h1∣x,gi,g′) implies that Eq1(h1∣g,g′) holds for g=xgi; and CC1(h1∣gi,g,g′) implies that Eq1(hi∣g,g′) holds.
Step 3: 2-morphisms.
Let α:(f,Mf,x)⇒(f′,Mf′,x) be a 2-morphism in 2Rep(CG(h),τh(ω)).
We define Ψh(α)=⊞iαi:Ψh(f,Mf,x)⇒Ψh(f′,Mf′,x), where αi:fi⇒fi′ is given below.
The only constraint for a 2-morphism is Eq2(hi∣g) in (3.5).
The term αj is determined by αi since Rfi,g and Rfi′,g are isomorphisms.
We define α1=α as the 2-morphism in 2Rep(CG(h),τh(ω)), and define αi from α1 and Eq2(h1∣gi) for i=2,…,s.
A similar argument shows that Ψh(α)=⊞iαi gives a well-defined 2-morphism in Z(2VecGω)c.
We complete the definition of the 2-functor Ψh:2Rep(CG(h),τh(ω))→Z(2VecGω)c.
To show that Φh and Ψh give an equivalence of 2-categories, it is obvious that Φh∘Ψh is the identity 2-functor.
It remains to show that Ψh is essentially surjective and fully faithful.
The proof is similar to the construction of Ψh above and we leave it to the reader.
Theorem 3.3**.**
There is an equivalence of 2-categories:
[TABLE]
by choosing one representative h for each class c∈Cl.
In particular, Z(2VecGω) is semisimple in the sense of Douglas and Reutter [DR].
Any object A~c of Z(2VecGω) is determined by one of its component Ah as an object of 2Rep(CG(h),τh(ω)) from Theorem 3.3.
It is known that any indecomposable object of 2Rep(CG(h),τh(ω)) is given by a pair (H,ψ), where H is a subgroup of CG(h), ψ∈C2(H,k×) such that dψ=τh(ω)−1∣H [Os2, Example 2.1].
Note that we consider right modules over 1VecCG(h)τh(ω) instead of left modules.
More precisely, the object associated to (H,ψ) is ⊞s∈H\CG(h)V(s), where each component V(s)=V.
The action of 1VecCG(h)τh(ω) is given by multiplication in CG(h) on the right.
The stablizer of V(1) is equivalent to 1VecH, and ψ determines its 1-associator.
Let V(H\K)=⊞s∈H\KV(s) for H<K.
We express any indecomposable object A~c as
[TABLE]
The presentation is independent of the choice of h∈c: A(h,H,ψ)≃A(g−1hg,g−1Hg,g∗(ψ)), where g∗(ψ)∈C2(g−1Hg,k×) is induced by conjugation.
We discuss a simple example where 2-categories Z(2VecGω) could be inequivalent for different classes ω.
Example 3.4*.*
Consider an abelian group G=Z2⊕Z2={1,s1,s2,s1s2}.
There is a canonical isomorphism f:Hk+1(G,Z)→Hk(G,k×) for k≥1 which commutes with the transgression map τh.
The cup product makes H∗(G,Z) a graded super commutative ring as
[TABLE]
see [Le, Proposition 4.1].
We have isomorphisms of abelian groups:
[TABLE]
The transgression map τh:Hk+1(G,Z)→Hk(G,Z) is a derivation τh(ab)=τh(a)b+aτh(b), where the signs are irrelevant since all groups are 2-torsion.
By properly choosing generators α,β, we could have τ1(γ)=0,τs1(γ)=α,τs2(γ)=β,τs1s2(γ)=α+β, and τh(α)=τh(β)=0, for all h∈G.
So
[TABLE]
Consider two classes ω0=1,ω1=f(αγ)∈H4(G,k×).
By Theorem 3.3, we obtain the following equivalences of 2-categories:
[TABLE]
The equivalence classes of indecomposable objects of 2Rep(G,χ) for χ∈H3(G,k×) are classified by the conjugacy classes of pairs (H,ψ) where H<G is a subgroup such that χ∣H=1, and ψ∈H2(H,k×), see [Os2, Example 2.1].
The number of equivalence classes of indecomposable objects of 2Rep(G,χ) is finite, denoted by c(G,χ).
Taking H=G, 2Rep(G) has an indecomposable object (G,ψ) for ψ∈H2(G,k×), while 2Rep(G,χ) does not have such an indecomposable object when χ is nontrivial.
So c(G,1)>c(G,χ), and the 2-categories 2Rep(G) and 2Rep(G,χ) are not equivalent for nontrivial χ.
Hence, Z(2VecGω0) and Z(2VecGω1) are not equivalent as 2-categories.
3.2. The braided monoidal 2-category
Before we compute the tensor product A(h,H,ψ)⊠A(h′,H′,ψ′), we first forget about the grading. We have A(h,H,ψ)≃V(H\G) as objects in 2Vec.
The half braiding induces a weak action of 1VecG on V(H\G) which is given by multiplication in G on the right.
The tensor product of two weak right 1VecG module categories is given by the Deligne tensor product, and we have
[TABLE]
where the sum is over the double coset H\G/H′, and Ht=t−1Ht∩H′.
A direct computation from (2.4) shows that A(h,H,ψ)⊠A(h′,H′,ψ′) contains a component A(ht,Ht,ψt),
where t∈H\G/H′, ht=t−1hth′,Ht=t−1Ht∩H′, and
[TABLE]
Here ψij,t(x1,x2)=ω(…,xi,t−1ht,…,xj,h′,…), for 0≤i≤j≤2. The underlying 2-category of A(ht,Ht,ψt) is precisely V(Ht\G) in (3.8).
Lemma 3.5**.**
Given A(h,H,ψ),A(h′,H′,ψ′) and t∈H\G/H′, we have Ht<CG(t−1hth′) and dψt=τt−1hth′(ω)−1∣Ht.
Proof.
We only check the case of t=1.
We have H1=H∩H′<CG(h)∩CG(h′)<CG(hh′).
Consider the trivial cochain χkl=1∈C3(H∩H′,k×):χkl(x1,x2,x3)=dω(…,xk,h,…,xl,h′,…),
for 0≤k≤l≤3.
A direct computation shows that
[TABLE]
when restricting to H∩H′.
So dψ1=τhh′(ω)−1∣H∩H′.
∎
Proposition 3.6**.**
The tensor product of two indecomposable objects in Z(2VecGω) is given by
[TABLE]
where the sum is over t∈H\G/H′.
Proof.
Lemma 3.5 implies that A(ht,Ht,ψt) is well-defined.
Each component of the right hand side appears in the tensor product at least once.
It follows from (3.8) that each of them appears at most once.
∎
The 1-associators in 2VecGω are all identities.
In the contrast, a 1-associator a~:(A~B~)C~→A~(B~C~) is a 1-morphism (a,Ra,−), where a:(AA′)A′′→A(A′A′′) is the identity in 2VecGω, and Ra,− is an invertible modification given by Diagram (2.6) which might be nontrivial.
The associators l~,r~ are all identities since the 4-cocycle ω is normalized.
Invertible modifications π~,μ~,λ~,ρ~ are defined in the same way as in 2VecGω.
In particular, μ~,λ~,ρ~ are all identities, and π~ is given by ω.
The braiding of two objects A~=(A,RA,−,R(A∣−,?)) and B~=(B,RB,−′,R(B∣−,?)′) is a 1-morphism RA~,B~=(RA,B,RRA,B,−):A~B~→B~A~ in Z(2VecGω), where RA,B=RA,−(B):AB→BA is determined by the half braiding associated to A~ and the grading of B, and RRA,B,− is an invertible modification given in Diagram (2.10).
More precisely, RA,B=⊞Rhi,g:
[TABLE]
for x∈Ahi,y∈Bg, and ρg:Ahi→Ahj is the action of G on A for hig=ghj.
When B is concentrated in the grading 1, we have
[TABLE]
where ΣA,B is the canonical permutation equivalence between the Deligne tensor products which simply permutes the two factors A and B as objects of 2Vec.
Remark 3.7*.*
The naturality 2-isomorphism RA,f associated to a 1-morphism f:B→B′ is the identity when B and B′ are concentrated in the grading 1.
The invertible modifications R(A~∣B~,C~)=R(A∣−,?)(B,C)=R(A∣B,C) is given by the half braiding associated to A~,
and R(A~,B~∣C~) is the identity as in Diagram (2.12) since the 1-associators are the identities.
In summary, Z(2VecGω) is a braided monoidal 2-category whose underlying 2-category is given in Theorem 3.3, and the monoidal structure is given by Proposition 3.6, and the braiding structure is given by the half-braidings as explained in Step 3 in Section 2.
Example 3.8*.*
Consider G=Z2={1,s},ω=1. There are two conjugacy classes: h=1,h=s.
We have an equivalence Z(2VecZ2ω)=Z(2VecZ2ω)1⊞Z(2VecZ2ω)s≃2Rep(Z2)⊞2Rep(Z2) of 2-categories from Theorem 3.3.
Up to isomorphism 2Rep(Z2) has two indecomposable objects: the unit I and the regular representation T=1VecZ2.
A complete set of isomorphism classes of indecomposable objects of Z(2VecZ2ω) is {I,T,Is,Ts}, where the subscript s denotes the nontrivial grading.
The nontrivial 1-categories of 1-morphisms are
[TABLE]
We illustrate these structures in the following quiver:
[TABLE]
For the monoidal structure, I is the unit, and we have
where g=1 for Y=I,T, g=s for Y=Is,Ts, and ρg:X→X is the action of G on X.
If X=T,Ts and Y=Is,Ts, then RX,Y=ΣX,Y; otherwise RX,Y=ΣX,Y from (3.11).
3.3. The unit component
The unit component Z(2VecGω)c for c=1 is a braided monoidal sub-2-category of Z(2VecGω).
In this case, h=1,CG(h)=G and τ1(ω) is a coboundary for any ω∈Z4(G,k×).
If ω is normalized, then τ1(ω)=1.
So 2Rep(CG(1),τ1(ω)) is equivalent to the 2-category 2Rep(G) of module categories over 1VecG.
In particular, Z(2VecGω)1≃2Rep(G) as braided monoidal 2-categories.
Corollary 3.9**.**
There is an inclusion 2Rep(G)↪Z(2VecGω) of braided monoidal 2-categories for any ω∈Z4(G,k×).
The 2-category 2Rep(G) is well studied in [Os2].
More precisely, any indecomposable object of 2Rep(G) is given by a pair A=A(H,ψ), where H<G and ψ∈Z2(H,k×).
The isomorphism class of A(H,ψ) is determined by the conjugacy class of H and the cohomological class [ψ]∈H2(H,k×).
There are two distinguished objects of Z(2VecGω)1: one is the unit I=A(H,ψ) for H=G,ψ=1; the other one is T=A(H,ψ) for H=1,ψ=1.
As objects of 2Rep(G), I=V is the trivial representation, and T=1VecG is the regular representation of 1VecG.
The endomorphism 1-categories are
[TABLE]
For indecomposable objects M,N of 2Rep(G), bimodules Hom2Rep(G)(M,N) and Hom2Rep(G)(N,M) induces the Morita equivalence between End2Rep(G)(M) and End2Rep(G)(N).
Thus, 2Rep(G) is the idempotent completion of the delooping of Rep(G) in the sense of Douglas and Reutter [DR].
We illustrate these structures in the following quiver which is connected.
where the sum is over t∈H\G/H′, Ht=t−1Ht∩H′, and ψt=t∗(ψ)∣Ht⋅ψ′∣Ht from (3.9) since ω is normalized.
In particular, A(H,ψ)⊠T≅T⊠A(H,ψ)≅T⊞H\G.
Moreover, the monoidal structure is strictly associative since the invertible modifications in Diagram (2.6) are all identities.
The braiding RA~,B~=(RA,B,RRA,B,−):A~B~→B~A~, where RA,B=RA,−(B)=ΣA,B:AB→BA from (3.11) since B is concentrated in grading 1, and the invertible modification RRA,B,− in Diagram (2.10) is the identity.
The invertible modifications R(A~∣B~,C~),R(A~,B~∣C~) are all identities.
3.4. The sylleptic center
We briefly discuss the sylleptic center of 2Rep(G) and Z(2VecGω).
Crans gave a definition of the sylleptic center of a braided monoidal 2-category in the semistrict case [C, Section 5.1].
We need a weak version. We propose the following definition without checking the coherence.
Definition 3.10**.**
Let C be a braided monoidal 2-category, and let D be a full monoidal sub-2-category. The sylleptic centralizer of D in C, denoted by ZC(D), is a 2-category defined as follows:
(1)
An object in ZC(D) is a pair (A,vA,−), where A is an object of C, and vA,− is an invertible modification
[TABLE]
for all X∈D such that the following axiom holds for all X,Y∈D:
[TABLE]
Note that this is an equality between two 2-morphisms, each of which is a composition of 2-morphisms defined by above two diagrams.
2. (2)
A 1-morphism from (A,vA,−) to (A′,vA′,−) is a 1-morphism f:A→A′ in C such that the following diagram commutes:
[TABLE]
where all vertical arrows are induced by f, and the 2-isomorphism in the back is the identity 2-isomorphism.
3. (3)
A 2-morphism is defined in the same way as in C.
When D=C, ZC(C) is called the sylleptic center of C.
The monoidal, the braiding and the syllepsis structures on ZC(D) can be generalized from Crans’ definition in a similar way. We omit the detail here.
Proposition 3.11**.**
The sylleptic center of 2Rep(G) is equivalent to 2Rep(G) as 2-categories.
Proof.
Let (A,vA,−) be an object of the sylleptic center of 2Rep(G).
The braiding of 2Rep(G) is symmetric, i.e. RX,A∘RA,X=idAX for any X.
We prove that the modification vA,X=ididAX as follows.
Taking X=Y=I in the axiom (3.21) gives vA,I2=vA,I since R(A∣X,Y),R(X,Y∣A) are identities.
It follows that vA,I is the identity.
The semisimple 2-category 2Rep(G) is equivalent to the module category of 1Rep(G), i.e. the idempotent completion of the delooping of 1Rep(G). The 2-category 2Rep(G) has only one connected component since 1Rep(G) is fusion, see [DR, Remark 2.1.22].
In other words, there exists a nontrivial 1-morphism f:I→X for any object X of 2Rep(G).
The naturality of vA,− associated to f is described by the following diagram:
[TABLE]
Then Rf,A is the identity since A is concentrated in the grading 1, and RA,f is the identity from Remark 3.7.
It follows that vA,X=ididAX.
Therefore, an object (A,vA,−) of the sylleptic center of 2Rep(G) is completely determined by A as an object of 2Rep(G).
For 1-morphism from (A,vA,−) to (A′,vA′,−), any 1-morphism f:A→A′ in 2Rep(G) satisfies Diagram (3.22) since all 2-isomorphisms are identities there.
∎
Remark 3.12*.*
The 2-category 2Rep(G) has a natural syllepsis structure viewed as the sylleptic center of 2Rep(G).
This syllepsis structure is symmetric in the sense of Crans [C], i.e. idRX,Y⋅vX,Y=vY,X⋅idRX,Y as 2-morphisms from RX,Y∘RY,X∘RX,Y to RX,Y.
As a result, 2Rep(G) is an E4 algebra.
Theorem 3.13**.**
The sylleptic center of Z(2VecGω) is equivalent to 2Vec as 2-categories.
Proof.
Let (A~,vA~,−) be an indecomposable object of the sylleptic center of Z(2VecGω), where vA~,X~:idA~X~⇒RX~,A~∘RA~,X~ gives an isomorphism between the identity and the double braiding.
Take X~=T=A(h,H,ψ) for h=1,H=1,ψ=1.
The half braiding RA~,T=ΣA~,T from (3.11) since T is concentrated in grading 1.
So the other half braiding RT,A~=ΣT,A~.
It follows from (3.10) that A~ is concentrated in the grading 1 since T is the regular representation in 2Rep(G).
So A~ is an object of Z(2VecGω)1≃2Rep(G).
For any X~, the half braiding RX~,A~=ΣX~,A~ which implies that RA~,X~=ΣA~,X~.
Then A~ has to be the trivial representation in 2Rep(G) by taking X~=Th=A(h,H,ψ) for h∈G,H=1,ψ=1.
We have A~=A(1,G,ψ), where ψ∈Z2(G,k×) is determined by R(A~∣X~,Y~).
Taking X~=Th,Y~=Th′, the axiom in (3.21) gives
[TABLE]
since R(X~,Y~∣A~) is the identity.
This implies that ψ=dγ, where γ∈Z1(G,k×) is a 1-cochain determined by vA~,Th.
Therefore, the underlying object A~ of (A~,vA~,−) is isomorphic to the unit I in Z(2VecGω).
We next show that I1=(I,vI,−) and I2=(I,vI,−′) are isomorphic to each other.
Define a 1-morphism (f,Rf,−):I1→I2, where f=idI and Rf,X~=vI,X~⋅vI,X~′−1.
It is easy to check that (f,Rf,−) is well-defined and gives an isomorphism.
So up to isomorphism there is only one indecomposable object I0=(I,vI,−),vI,X~=ididX~ in the Sylleptic center.
We finally compute End(I0).
Let f:I→I be a 1-morphism in Z(2VecGω), i.e. f∈End(I)≃Rep(G).
It follows from (3.22) that Rf,X~ is the identity for any X~ since RX~,f is the identity.
So f has to be the trivial representation in Rep(G) by taking X~=Th as above.
We conclude that End(I0)≃1Vec.
∎
Theorem 3.13 is consistent with the expectation that Z(2VecGω) should be an example of the yet-to-be-defined notion of a unitary modular tensor 2-category.
Similar to Definition 3.10, the notion of the relative sylleptic center of a full subcategory of a braided monoidal 2-category can be defined.
A combination of the proofs of Proposition 3.11 and Theorem 3.13 shows that the sylleptic centralizer of 2Rep(G) in Z(2VecGω) is equivalent to 2Rep(G). A unitary modular tensor 2-category C, equipped with a braided monoidal fully faithful embedding 2Rep(G)↪C, is called a modular extension of 2Rep(G). Such a modular extension is called minimal if the relative sylleptic center of 2Rep(G) in C is braided monoidally equivalent to 2Rep(G). By Corollary 3.9, Proposition 3.11 and Theorem 3.13, Z(2VecGω) is precisely a minimal modular extension of 2Rep(G) for ω∈Z4(G,k×). Motivated by the classification theory of 2+1D symmetry protect topological orders [LKW1] and its 3+1D analogue [CGLW, LKW2], we propose the following conjecture.
Conjecture 3.14**.**
The equivalence classes of minimal modular extensions of 2Rep(G) are classified by H4(G,k×).
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AF] D. Ayala, J. Francis, A factorization homology primer , preprint 2019, ar Xiv:1903.10961.
2[BN] J. C. Baez, M. Neuchl, Higher dimensional algebra, I. Braided monoidal 2-categories , Adv. Math. 121 (1996), 196-244.
3[C] S. E. Crans, Generalized centers of braided and sylleptic monoidal 2-categories , Adv. Math. 136 (1998), 183-223.
4[CGLW] X. Chen, Z.-C. Gu, Z.-X. Liu, X.-G. Wen, Symmetry protected topological orders and the group cohomology of their symmetry group , Phys. Rev. B 87 155114 (2013).
5[DPR] R. Dijkgraaf, V. Pasquier and P. Roche, Quasi Hopf algebras, group cohomology and orbifold models , Nuclear Physics B (Proc. Suppl) 18B (1990), 60-72.
6[DW] R. Dijkgraaf, E. Witten, Topological Gauge Theories and Group Cohomology . Comm. Math. Phys. 129 (2) (1990), 393-429.
7[DR] C. L. Douglas and D. J. Reutter, Fusion 2-categories and a state-sum invariant for 4-manifolds , preprint 2018, ar Xiv:1812.11933.
8[EGNO] P. Etingof, S. Gelaki, D. Nikshych, V. Ostrik, Tensor categories , Mathematical Surveys and Monographs, 205. American Mathematical Society, Providence, RI, 2015.