-
Notifications
You must be signed in to change notification settings - Fork 0
/
2d-tqft-frobenius.tex
1988 lines (1770 loc) · 72.6 KB
/
2d-tqft-frobenius.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\documentclass[11pt, reqno]{amsart}
\usepackage[english]{babel}
\usepackage{layout}
\usepackage{afterpage}
\usepackage[
asymmetric,
textheight = 673pt,
marginparsep = 7pt,
footskip = 27pt,
hoffset = 0pt,
paperwidth = 597pt,
textwidth = 452pt,
marginparwidth = 101pt,
voffset = 0pt,
paperheight = 845pt,
]{geometry}
% Math stuff: do not mess with the ordering!
\usepackage{tikz}
\usepackage{mathtools}
\usepackage{amsthm}
\usepackage{amssymb}
\usepackage{stmaryrd}
\usepackage{tikz-cd}
\usepackage{tqft}
% Font
\usepackage[no-math]{newpxtext}
\usepackage{newpxmath}
% Set arrow tip to that of newpxmath
\tikzset{>=Straight Barb, commutative diagrams/arrow style=tikz}
% Utilities
\usepackage{enumerate}
\usepackage{todonotes}
\usepackage{graphicx}
% Color
\usepackage{xcolor}
\definecolor{brightmaroon}{rgb}{0.76, 0.13, 0.28}
% References
\usepackage{hyperref}
\hypersetup{
colorlinks = true,
allcolors = brightmaroon,
}
\usepackage[capitalize,nameinlink]{cleveref}
\usepackage[
backend = biber,
style = alphabetic,
]{biblatex}
\addbibresource{bibliography.bib}
% Table of contents: show subsections
\setcounter{tocdepth}{2}
\linespread{1.05}
\vfuzz=14pt % No more vbox errors all over the place
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** Environments **
\theoremstyle{definition}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{axiom}[theorem]{Axiom}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{remark}[theorem]{Remark}
\newtheorem{example}[theorem]{Example}
\newtheorem{notation}[theorem]{Notation}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** symbols **
\renewcommand{\qedsymbol}{\(\natural\)}
\renewcommand{\leq}{\leqslant}
\renewcommand{\geq}{\geqslant}
\renewcommand{\setminus}{\smallsetminus}
\renewcommand{\preceq}{\preccurlyeq}
% ':' for maps and '\colon' for relations on collections
\DeclareMathSymbol{:}{\mathpunct}{operators}{"3A}
\let\colon\relax
\DeclareMathSymbol{\colon}{\mathrel}{operators}{"3A}
% Disjoint unions over sets
\newcommand{\disj}{\amalg} % Disjoint union
\newcommand{\bigdisj}{\coprod} % Indexed disjoint union
\DeclareMathOperator{\Log}{Log}
\newcommand{\img}{\text{i}}
% Constant map
\DeclareMathOperator{\const}{cons}
% Multiplication map
\DeclareMathOperator{\mul}{mul}
\DeclareMathOperator{\Bd}{\partial}
\DeclareMathOperator{\Cyl}{Cyl}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** arrows **
% Alias for Rightarrow
\newcommand{\To}{\Rightarrow}
% Monomorphism arrow
\newcommand{\mono}{\rightarrowtail}
% Epimorphism arrow
\newcommand{\epi}{\twoheadrightarrow}
% Unique morphism
\newcommand{\unique}{\to}%{\dashrightarrow}
\newcommand{\xdashrightarrow}[2][]{\ext@arrow 0359\rightarrowfill@@{#1}{#2}}
% Isomorphism symbol
\newcommand{\iso}{\simeq}
\newcommand{\arrowiso}{\iso}
% Isomorphism arrow
\newcommand{\isoto}{\xrightarrow{\raisebox{-.6ex}[0ex][0ex]{\(\arrowiso\)}}}
% How isomorphisms are depicted in diagrams: either \sim or \simeq
\newcommand{\dis}{\iso}
\newcommand{\isounique}{%
\xdashrightarrow{\raisebox{-.6ex}[0ex][0ex]{\(\arrowiso\)}}
}%
% Natural transformation arrow
\newcommand{\nat}{\Rightarrow}
% Natural isomorphism
\newcommand{\isonat}{\xRightarrow{\raisebox{-.6ex}[0ex][0ex]{\(\arrowiso\)}}}
% Embedding arrow
\newcommand{\emb}{\hookrightarrow}
% Parallel arrows
\newcommand{\para}{\rightrightarrows}
% Adjoint arrows
\newcommand{\adj}{\rightleftarrows}
% Implication
\renewcommand{\implies}{\Rightarrow}
\renewcommand{\impliedby}{\Leftarrow}
% Limits
\DeclareMathOperator{\Lim}{lim} % Limit
\DeclareMathOperator{\Colim}{colim} % Colimit
\DeclareMathOperator{\Eq}{eq} % Equalizer
\DeclareMathOperator{\Coeq}{coeq} % Coequalizer
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** Common collections **
\newcommand{\Z}{\mathbf{Z}}
\newcommand{\N}{\mathbf{N}}
\newcommand{\Q}{\mathbf{Q}}
\newcommand{\CC}{\mathbf{C}}
\newcommand{\R}{\mathbf{R}}
\newcommand{\FF}{\mathbf{F}}
\renewcommand{\emptyset}{\varnothing}
\newcommand{\Uhs}{\mathbf{H}} % Upper half space
\newcommand{\Proj}{\mathbf{P}} % Projective space
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** Categories **
% Font for categories
\newcommand{\cat}{\texttt}
\newcommand{\catfont}{\texttt}
% Opposite category
\newcommand{\op}{\mathrm{op}}
% Common categories
\newcommand{\Set}{{\catfont{Set}}} % Sets
\newcommand{\FinSet}{{\catfont{FinSet}}} % Finite sets
\newcommand{\pSet}{{\catfont{pSet}}} % Pointed sets
\newcommand{\tOrd}{{\catfont{tOrd}}} % Totally ordered sets
\newcommand{\Vect}{{\catfont{Vect}}} % Vector spaces
\newcommand{\FinVect}{{\catfont{FinVect}}} % Finite vector spaces
\newcommand{\TVect}{{\catfont{TVect}}} % Topological vector spaces
\newcommand{\Ban}{{\catfont{Ban}}} % Banach spaces
\newcommand{\Grp}{{\catfont{Grp}}} % Groups
\newcommand{\Ab}{{\catfont{Ab}}} % Abelian groups
\newcommand{\GSet}[1]{{{#1}\text{-}\Set}} % G-sets
\newcommand{\Grpd}{{\catfont{Grpd}}} % Groupoids
\newcommand{\Mon}{{\catfont{Mon}}} % Monoidal category
\newcommand{\coMon}{{\catfont{coMon}}} % coMonoidal category
\newcommand{\rActMon}{{\catfont{rActMon}}} % right action category
\newcommand{\lActMon}{{\catfont{lActMon}}} % left action category
\newcommand{\BrMonCat}{{\catfont{BrMonCat}}} % Cat of braided monoidal cats
\newcommand{\Graph}{{\catfont{Graph}}} % Graphs
\newcommand{\SimpGraph}{{\catfont{sGraph}}} % Simple graphs
\newcommand{\ProfCol}{{\catfont{Prof}(\Col)}} % C-profile category
\newcommand{\Rng}{{\catfont{Ring}}} % Rings
\newcommand{\cRng}{{\catfont{CRing}}} % Commutative rings
\newcommand{\rMod}[1]{{\texttt{Mod}_{#1}}} % Right modules
\newcommand{\lMod}[1]{{{}_{#1}\catfont{Mod}}} % Left modules
\newcommand{\Mod}[1]{{#1\text{-}\catfont{Mod}}} % Modules over comm. ring
\newcommand{\Alg}[1]{{#1\text{-}\catfont{Alg}}} % Algebras
\newcommand{\cAlg}[1]{{#1\text{-}\catfont{CAlg}}} % Commutative algebras
\newcommand{\Psh}[1]{{\catfont{Psh}({#1})}} % Category of presheaves
\newcommand{\comma}{\downarrow} % Comma category separator
\DeclareMathOperator{\El}{El} % Category of elements
% Operators
\DeclareMathOperator{\Hom}{Mor} % Morphisms
\DeclareMathOperator{\Mono}{Mono} % Monomorphisms
\DeclareMathOperator{\Epi}{Epi} % Epimorphisms
\DeclareMathOperator{\Fct}{Fct} % Functors
\DeclareMathOperator{\Obj}{Obj} % Objects
\DeclareMathOperator{\Mor}{Mor} % Morphisms, again
\DeclareMathOperator{\End}{End} % Endomorphisms
\DeclareMathOperator{\Aut}{Aut} % Automorphisms
\DeclareMathOperator{\Id}{id} % Identity
\DeclareMathOperator{\im}{im} % Image
\DeclareMathOperator{\dom}{dom} % Domain
\DeclareMathOperator{\codom}{cod} % Codomain
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** algebra **
\DeclareMathOperator{\rank}{rank}
\DeclareMathOperator{\coker}{coker}
\DeclareMathOperator{\codim}{codim}
\DeclareMathOperator{\Tr}{tr} % Trace
\DeclareMathOperator{\Sym}{Sym} % Symmetric space
\DeclareMathOperator{\Alt}{Alt} % Alternating space
\DeclareMathOperator{\Ann}{Ann} % Annihilator
\DeclareMathOperator{\Char}{char}
\DeclareMathOperator{\Span}{span}
\DeclareMathOperator{\Inn}{Inn} % Inner automorphisms
\DeclareMathOperator{\eval}{eval}
\DeclareMathOperator{\sign}{sign}
% Matrices
\DeclareMathOperator{\Mat}{Mat}
\DeclareMathOperator{\GL}{GL}
\DeclareMathOperator{\SL}{SL}
\DeclareMathOperator{\PSL}{PSL}
\DeclareMathOperator{\SO}{SO}
\DeclareMathOperator{\SU}{SU}
\DeclareMathOperator{\Unit}{U}
\DeclareMathOperator{\Orth}{O}
% Symbol for the group of units --- for instance, the group of units of a ring
% \(R\) will be denoted by \(R^{\unit}\).
\newcommand{\unit}{\times}
% Orbit and stabilizer
\DeclareMathOperator{\Orb}{Orb}
\DeclareMathOperator{\Stab}{Stab}
% Left and right group actions
\newcommand{\laction}{\circlearrowright}
\newcommand{\raction}{\circlearrowleft}
% Ring ideals font
\newcommand{\ideal}[1]{\mathfrak{#1}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** Topology **
\let\Top\relax
\newcommand{\Top}{{\catfont{Top}}} % Topological spaces
\newcommand{\Cob}[1]{{#1}\text{-}{\catfont{cob}}} % Cobordisms
\newcommand{\tqft}[1]{{#1}\text{-}{\catfont{TQFT}}} % Cobordisms
\newcommand{\Frob}{{\catfont{Frob}}} % Frobenius algebras
\newcommand{\cFrob}{{\catfont{cFrob}}} % Commutative Frobenius algebras
\newcommand{\SymMon}{{\catfont{SymMon}}} % Symmetric monoidal functor category
% attaching spaces
\newcommand{\att}{\amalg} % Disjoint union
\newcommand{\bigatt}{\coprod} % Indexed disjoint union
\newcommand{\Man}{{\catfont{Man}}} % Manifolds
\newcommand{\trans}{\pitchfork} % Transversality
% Set operators
\DeclareMathOperator{\Vol}{vol} % Volume
\DeclareMathOperator{\Mesh}{mesh} % Mesh
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** Graphs **
% Colouring
\newcommand{\Col}{\mathfrak{C}}
\newcommand{\prof}[1]{\underline{#1}}
\DeclareMathOperator{\Edge}{Edge}
\DeclareMathOperator{\Vertex}{Vert}
\DeclareMathOperator{\Circ}{circ}
\DeclareMathOperator{\diam}{diam}
\newcommand{\emptygraph}{\varnothing}
\DeclarePairedDelimiterX{\size}[1]{\lVert}{\rVert}{#1}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ** MACROS END HERE **
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\author{Luiz Gustavo Mugnaini Anselmo \\ n\(^{\circ}\)USP:~11809746}
\title{
2-Dimensional Topological Quantum Field Theories \& Commutative Frobenius
Algebras
}
\begin{document}
\maketitle
\begin{abstract}
In this brief survey we study the categorical equivalence between
\(2\)-dimensional topological quantum field theories and commutative Frobenius
algebras. To that end, we develop some of the main tools to understand the main
result, which has an extensive use of the theory of manifolds and categories.
\end{abstract}
\section{Monoidal Categories}
The theory of monoidal categories plays a main role in our study of topological
quantum field theories and shall be used extensively. For a more thorough analysis
see~\cite{etingof}. If the reader is not acquainted with a working knowledge of
category theory, a good resource is~\cite{borceux}.
\begin{definition}
\label{def:monoidal-category}
A \emph{monoidal category} is a tuple
\((\cat M, \otimes, 1, \alpha, \lambda, \rho)\) consisting of:
\begin{itemize}\setlength\itemsep{0em}
\item A \emph{category} \(\cat M\).
\item A \emph{bifunctor} \(\otimes: \cat M \times \cat M \to \cat M\)
\item A distinguished object \(1 \in \cat M\) that is \emph{unitary} with
respect to \(\otimes\), that is:
\[
m \otimes 1 = m = 1 \otimes m
\]
for any object \(m \in \cat M\).
\item A \emph{natural isomorphism}
\[
\alpha: (- \otimes (- \otimes -))
\isonat ((- \otimes -) \otimes -)
\]
called \emph{associator}. We call \(\alpha\) a natural isomorphism in the
sense that given any triple of objects \((a, b, c)\) of \(\cat M\), the image
\[
\begin{tikzcd}
a \otimes (b \otimes c)
\ar[r, "{\alpha(a, b, c)}"', "\dis"]
&(a \otimes b) \otimes c
\end{tikzcd}
\]
is an isomorphism in \(\cat M\).
\item Two \emph{natural isomorphisms}
\[
\lambda: (1 \otimes -) \isonat (-)
\quad
\text{ and }
\quad
\rho: (- \otimes 1) \isonat (-)
\]
called \emph{left and right unitors}, respectively. In other words, given any
object \(a \in \cat M\) the arrows \(\lambda a: 1 \otimes a \isoto a\) and
\(\rho a: a \otimes 1 \isoto a\) are isomorphisms in \(\cat M\).
\end{itemize}
This data should satisfy the following two conditions:
\begin{itemize}\setlength\itemsep{0em}
\item (Triangle identity) Given any pair \((a, b)\) of objects in \(\cat M\),
the diagram
\[
\begin{tikzcd}
a \otimes (1 \otimes b) \ar[rr, "{\alpha(a, 1, b)}"]
\ar[rd, "\Id_a \otimes \rho b"']
& &(a \otimes 1) \otimes b \ar[ld, "\lambda a \otimes \Id_b"]
\\
&a \otimes b &
\end{tikzcd}
\]
commutes in \(\cat M\).
\item (Pentagon identity) Given any tuple \((a, b, c, d)\) of objects in
\(\cat M\), the diagram
\[
\begin{tikzcd}
&
&(a \otimes b) \otimes (c \otimes d)
\ar[rdd, "{\alpha(a \otimes b, c, d)}"]
&
\\
& & &
\\
a \otimes (b \otimes (c \otimes d))
\ar[dd, "{\Id_a \otimes \alpha(b, c, d)}"']
\ar[rruu, "{\alpha(a, b, c \otimes d)}"]
&
&
&((a \otimes b) \otimes c) \otimes d
\\
& & &
\\
% empty
a \otimes ((b \otimes c) \otimes d)
\ar[rrr, "{\alpha(a, b \otimes c, d)}"']
&
&
&(a \otimes (b \otimes c)) \otimes d
\ar[uu, "{\alpha(a, b, c) \otimes \Id_d}"']
\end{tikzcd}
\]
is commutative in \(\cat M\).
\end{itemize}
The tuple \((\cat M, \otimes, 1, \alpha, \lambda, \rho)\) is said to be a
\emph{strict monoidal category} if the three natural isomorphisms \(\alpha\),
\(\lambda\) and \(\rho\) are naturally isomorphic to the identity. If this is
the case, we shall refer to the category simply by the triple
\((\cat M, \otimes, 1)\).
\end{definition}
This monoidal structure can be also be carried to functors and natural
transformations:
\begin{definition}[Monoidal functor]
\label{def:monoidal-functor}
Let \((\cat M, \otimes, 1, \alpha, \lambda, \rho)\) and \((\cat N,
\widehat\otimes, \widehat 1, \widehat \alpha, \widehat \lambda, \widehat \rho)\)
be two (strict) monoidal categories. We say that a functor \(F: \cat M \to \cat
N\) is a (\emph{strict}) \emph{monoidal functor} if it preserves the actions of
the natural isomorphisms. To put concretely, we have:
\begin{itemize}\setlength\itemsep{0em}
\item The unit of \(\cat M\) is mapped to the unit of \(\cat N\), that is,
\(F 1 = \widehat 1\).
\item For any \(a \in \cat M\) one has
\(F (\lambda a) = \widehat \lambda (F a)\) and
\(F (\rho a) = \widehat \rho(F a)\).
\item For any pair \((a, b)\) of objects in \(\cat M\) there exists an
isomorphism \(F(a \otimes b) \iso F a \widehat \otimes F b\) in \(\cat
N\). In the strict case the isomorphism is replaced by an equality.
\item For any triple \((a, b, c)\) of objects in \(\cat M\) we have
\(F \alpha(a, b, c) = \widehat \alpha (F a, F b, F c)\).
\item For every two maps \(f\) and \(g\) in \(\cat M\) there exists an
isomorphism \(F(f \otimes g) \iso F f \widehat \otimes F g\) in \(\cat N\). As
before, in the strict case the isomorphism is replaced by an equality.
\end{itemize}
\end{definition}
\begin{definition}[Monoidal natural transformation]
\label{def:monoidal-natural-transformation}
Let \((\cat M, \otimes, 1, \alpha, \lambda, \rho)\) and
\((\cat N, \widehat\otimes, \widehat 1, \widehat \alpha, \widehat \lambda,
\widehat \rho)\) be two (strict) monoidal categories, and consider a pair of
parallel (strict) monoidal functors \(F, G: \cat M \para \cat N\). A natural
transformation \(\eta: F \nat G\) is said to be \emph{monoidal} if
\(\eta_1 = \widehat 1\), and for any pair of objects \(a, b \in \cat M\) the
diagram
\[
\begin{tikzcd}
F(a \otimes b) \ar[d, "\dis"']
\ar[r, "\eta_{a \otimes b}"]
&G(a \otimes b) \ar[d, "\dis"] \\
F a \widehat\otimes F b \ar[r, "\eta_a \widehat\otimes \eta_b"']
&G a \widehat\otimes G b
\end{tikzcd}
\]
commutes in the monoidal category \(\cat N\).
\end{definition}
The following theorem allows one to always work with a strictified version of a
given monoidal category. Its proof, however, is extensive and would not fit in
this short essay. For a proof, the curious reader can refer to~\cite{geiger}.
\begin{theorem}
\label{thm:strictification-mon-cat}
Every monoidal category is \emph{monoidally equivalent} to a \emph{strict}
monoidal category.
\end{theorem}
% \begin{proof}
% Let \((\cat M, \otimes, 1, \alpha, \lambda, \rho)\) be a monoidal
% category. We shall construct a strict monoidal category out of \(\cat M\). To
% that end, define a category \(\cat N\) where:
% \begin{itemize}\setlength\itemsep{0em}
% \item The objects of \(\cat N\) are pairs \((F, \eta)\) where \(F\) is an
% \emph{endofunctor} of \(\cat M\) and
% \[
% \eta: F(- \otimes -) \isonat F(-) \otimes (-)
% \]
% is a \emph{natural isomorphism} such that, for any triple \((a, b, c)\) of
% objects of \(\cat M\), the pentagonal diagram
% \[
% \begin{tikzcd}
% &
% &(F(a) \otimes b) \otimes c
% &
% \\
% & & &
% \\
% F(a \otimes b) \otimes c
% \ar[rruu, "\eta_{(a, b)} \otimes \Id_c"]
% &
% &
% & F(a) \otimes (b \otimes c)
% \ar[luu, "{\alpha(F a, b, c)}"']
% \\
% & & &
% \\
% F((a \otimes b) \otimes c)
% \ar[uu, "\eta_{(a \otimes b, c)}"]
% &
% &
% &F(a \otimes (b \otimes c))
% \ar[lll, "{F \alpha(a, b, c)}"]
% \ar[uu, "\eta_{(a, b \otimes c)}"']
% \end{tikzcd}
% \]
% \item A morphism \(\varepsilon: (F, \eta) \to (F', \eta')\) is a natural
% transformation \(\varepsilon: F \nat F'\) such that, given any pair \((a, b)\)
% of objects of \(\cat M\), the diagram
% \begin{equation}\label{eq:coherence-morphism-cat-N}
% \begin{tikzcd}
% F(a \otimes b) \ar[d, "\eta_{(a, b)}"']
% \ar[r, "\varepsilon_{a \otimes b}"]
% &F'(a \otimes b) \ar[d, "\eta'_{(a, b)}"]
% \\
% F(a) \otimes b \ar[r, "\varepsilon_a \otimes \Id_b"']
% &F'(a) \otimes b
% \end{tikzcd}
% \end{equation}
% commutes in \(\cat M\). Moreover, we define the composition of morphisms in
% \(\cat N\) to be given by the vertical composition of natural transformations.
% \item Define a bifunctor \(\widehat\otimes: \cat N \times \cat N \to \cat N\) as
% \((F, \eta) \widehat\otimes (F', \eta') \coloneq (F F', \widehat\eta)\), where
% \[
% \widehat\eta: F F'(- \otimes -) \nat F F'(-) \otimes (-)
% \]
% is the natural transformation given by the composition
% \[
% \begin{tikzcd}
% F F'(a \otimes b)
% \ar[rr, "F \eta'_{(a, b)}"']
% \ar[rrrr, bend left, "\widehat\eta_{(a, b)}"]
% &
% &F (F'(a) \otimes b)
% \ar[rr, "\eta_{(F' a, b)}"']
% &
% &F F'(a) \otimes b
% \end{tikzcd}
% \]
% for any pair of objects \((a, b)\) of \(\cat M\).
% \end{itemize}
% From this construction we find that the triple
% \((\cat N, \widehat\otimes, (\Id_{\cat M}, I))\)---where the natural
% transformation \(I: (- \otimes -) \isonat (- \otimes -)\) is the identity
% morphism \(I_{(a, b)} \coloneq \Id_{a \otimes b}\) in \(\cat M\) for any two
% \(a, b \in \cat M\)---is a \emph{strict monoidal category}, since:
% \begin{itemize}\setlength\itemsep{0em}
% \item The bifunctor \(\widehat\otimes\) satisfies \emph{equality} for both left
% and right unitors: given an object \((F, \eta) \in \cat N\), consider any two
% objects \(a, b \in \cat N\) then by the definition of \((F, \eta)
% \widehat\otimes (\Id_{\cat M}, I) = (F, \widehat\eta)\) and \((\Id_{\cat M},
% I) \widehat\otimes (F, \widehat\eta')\) one has
% \[
% \begin{tikzcd}
% {F(a \otimes b)} \ar[rr, "F \Id_{a \otimes b} = \Id_{F(a \otimes b)}"']
% \ar[rrrr, bend left, "\widehat\eta_{(a, b)}"]
% &&{F(a \otimes b)} \ar[rr, "\eta_{(a, b)}"']
% &&{F(a) \otimes b}
% \end{tikzcd}
% \]
% \[
% \begin{tikzcd}
% {F(a \otimes b)} \ar[rr, "\Id_{\cat M} \eta_{(a, b)} = \eta_{(a, b)}"]
% \ar[rrrr, bend right, "\widehat\eta'_{(a, b)}"']
% &&{F(a) \otimes b} \ar[rr, "I_{(Fa, b)} = \Id_{F(a) \otimes b}"]
% &&{F(a) \otimes b}
% \end{tikzcd}
% \]
% therefore \(\widehat\eta = \eta = \widehat\eta'\). Moreover, this also shows
% that the triangle identity is satisfied.
% \item Associativity follows from the associativity of morphisms and functors.
% \end{itemize}
% We now prove that \(\cat M\) and \(\cat N\) are equivalent categories. In order
% to do that, define a functor \(E: \cat M \to \cat N\) mapping objects
% \(a \mapsto (a \otimes (-), \alpha(a, -, -))\) and morphisms
% \(f \mapsto f \otimes (-)\). We now show that \(E\) is an equivalence of
% categories:
% \begin{itemize}\setlength\itemsep{0em}
% \item (Essentially surjective) Notice that, given any object
% \((F, \eta) \in \cat N\), we can define a morphism
% \[
% \varepsilon: (F 1 \otimes (-), \alpha(F1, -, -))
% \longrightarrow (F, \eta)
% \]
% by constructing a natural transformation
% \(\varepsilon: F 1 \otimes (-) \nat F\) where
% \(\varepsilon_a \coloneq \lambda_{a} \eta_{(1, a)}^{-1}\), which is an
% isomorphism \(F(1) \otimes a \iso F a\) for any \(a \in \cat M\)---showing
% that \(\varepsilon\) is a natural isomorphism, defining an isomorphism
% \(E(F 1) \iso (F, \eta)\).
% \item (Full) Let \(a, b \in \cat M\) be any two objects, and
% \(\varepsilon: E a \to E b\) be any morphism of \(\cat N\)---that is, a
% natural transformation \(\varepsilon: (a \otimes -) \nat (b \otimes -)\)
% satisfying the coherence diagram \cref{eq:coherence-morphism-cat-N}. Define
% \(f: a \to b\) to be the morphism in \(\cat M\) given by
% \(f \coloneq (\lambda b) \circ \varepsilon_1 \circ (\lambda^{-1} a)\). By the
% definition of \(E\), one has \(E f = f \otimes (-)\)---we wish to show that
% this agrees with \(\varepsilon\). Given any \(c \in \cat M\) the diagram
% \[
% \begin{tikzcd}
% a \otimes c \ar[rr, "{\Id_a \otimes \rho(c)^{-1}}"]
% \ar[d, "\varepsilon_c"']
% && a \otimes (1 \otimes c) \ar[rr, "{\alpha(a, 1, c)}"]
% \ar[d, "\varepsilon_{e \otimes c}"']
% \ar[rrrr, bend left=30, "{\Id_a \otimes \rho c}"]
% && (a \otimes 1) \otimes c \ar[rr, "{\lambda a \otimes \Id_c}"]
% \ar[d, "\varepsilon_1 \otimes \Id_c"]
% && a \otimes c \ar[d, "f \otimes \Id_c"]
% \\
% b \otimes c \ar[rr, "{\Id_b \otimes \rho(c)^{-1}}"']
% && b \otimes (1 \otimes c) \ar[rr, "{\alpha(b, 1, c)}"']
% \ar[rrrr, bend right=30, "{\Id_b \otimes \rho c}"']
% && (b \otimes 1) \otimes c \ar[rr, "{\lambda b \otimes \Id_c}"']
% && b \otimes c
% \end{tikzcd}
% \]
% is commutative in \(\cat M\): the left and center squares commute by the
% naturality of \(\varepsilon\), the up and down wings commute by the triangle
% identities, the right square commutes by the definition of \(f\). It follows
% from commutativity that \(\varepsilon_c = f \otimes \Id_c\), therefore
% \(E f = \varepsilon\).
% \item (Faithful) Let \(f\) and \(g\) be morphisms of \(\cat M\) such that \(E f
% = E g\), so that in particular \(f \otimes \Id_1 = g \otimes \Id_1\)---hence
% \(f = g\), proving injectivity on the morphism collections of \(\cat M\) and
% \(\cat N\).
% \item (Monoidal) First, it is clear that
% \(E 1 = (1 \otimes (-), \alpha(1, -, -)) \iso (\Id_{\cat M}, I)\). Moreover,
% for any pair of morphisms \(f\) and \(g\) of \(\cat M\) one has
% \[
% E(f \otimes g) = (f \otimes g) \otimes (-)
% \iso f \otimes (g \otimes -)
% = E f \widehat\otimes E g.
% \]
% Given any two \(a, b \in \cat M\), from definition:
% \[
% E (a \otimes b) = ((a \otimes b) \otimes (-), \alpha(a \otimes b, -, -))
% \iso (a \otimes (b \otimes -), \alpha(a \otimes b, -, -)),
% \]
% also we know that if
% \[
% (a \otimes (b \otimes -), \beta)
% \coloneq (a, \alpha(a, -, -)) \widehat\otimes (b, \alpha(b, -, -))
% = E a \widehat\otimes E b,
% \]
% then \(\beta\) is defined so that the up wing of the diagram
% \[
% \begin{tikzcd}
% a \otimes (b \otimes (c \otimes d))
% \ar[rr, "{a \otimes \alpha(b, c, d)}"']
% \ar[rrrr, bend left, "\beta_{(c, d)}"]
% \ar[d, "\alpha{(a, b, c \otimes d)}"']
% &&a \otimes ((b \otimes c) \otimes d)
% \ar[rr, "{\alpha(a, b \otimes c, d)}"']
% &&(a \otimes (b \otimes c)) \otimes d
% \ar[d, "\alpha{(a, b, c)} \otimes \Id_d"]
% \\
% (a \otimes b) \otimes (c \otimes d)
% \ar[rrrr, "\alpha{(a \otimes b, c, d)}"']
% && &&((a \otimes b) \otimes c) \otimes d
% \end{tikzcd}
% \]
% commutes in \(\cat M\) for any two \(c, d \in \cat M\)---the square commutes
% by the pentagon identity. This shows that
% \[
% \alpha(a, b, -): (a \otimes (b \otimes -), \beta)
% \isoto (a \otimes (b \otimes -), \alpha(a \otimes b, -, -))
% \]
% is an isomorphsim in \(\cat N\). Therefore
% \(E(a \otimes b) \iso E a \widehat \otimes E b\). For the left and right
% unitor isomorphisms \(E (\lambda a) \iso \widehat \lambda(E a)\) and
% \(E(\rho a) \iso \widehat \rho(E a)\) we shall simply argue that they both
% come straight from the triangle identity of \(\cat M\). Similarly,
% \[
% E(\alpha(a, b, c)) \iso \widehat \alpha(E a, E b, E c)
% \]
% works via a reduction to the pentagon identity in \(\cat M\).
% \end{itemize}
% This proves that \(E: \cat M \to \cat N\) is indeed a monoidal equivalence of
% categories.
% \end{proof}
As in algebraic contexts, we can also find monoids inside of a given monoidal
category.
\begin{definition}
\label{def:(co)monoids}
Let \((\cat M, \otimes, 1, \alpha, \lambda, \rho)\) be a monoidal category. We
define the following objects:
\begin{enumerate}[(a)]\setlength\itemsep{0em}
\item A \emph{monoid} in \(\cat M\) is a triple \((m, \mu, \theta)\) where we
have an object \(m \in \cat M\), a bifunctor
\(\mu: m \otimes m \to m\), referred to as a \emph{multiplication}, and a
functor \(\theta: 1 \to m\), called \emph{unit}, such that both diagrams
\[
\begin{tikzcd}
m \otimes (m \otimes m) \ar[d, "\Id_m \otimes \mu"']
\ar[r, "{\alpha(m, m, m)}"]
&(m \otimes m) \otimes m
\ar[r, "\mu \otimes \Id_m"]
&m \otimes m \ar[d, "\mu"] \\
m \otimes m \ar[rr, "\mu"']
&&m
\end{tikzcd}
\qquad
\begin{tikzcd}
1 \otimes m \ar[r, "\theta \otimes \Id_m"]
\ar[rd, "\rho"']
& m \otimes m \ar[d, "\mu"]
&m \otimes 1
\ar[l, "\Id_m \otimes \theta"']
\ar[ld, "\lambda"] \\
&m &
\end{tikzcd}
\]
commute in \(\cat M\). A morphism of monoids
\(\phi: (m, \mu, \theta) \to (m', \mu', \theta')\) is a morphism
\(\phi: m \to m'\) in \(\cat M\) satisfying
\(\phi \mu = \mu'(\phi \otimes \phi)\), and \(\phi \theta = \theta'\). We then
define the subcategory \(\Mon_{\cat M}\) of \(\cat M\) composed of monoidal
objects in \(\cat M\).
\item A \emph{comonoid} in \(\cat M\) is a triple \((c, \kappa, \sigma)\) where
\(c\) is an object of \(\cat M\), we have a bifunctor
\(\kappa: c \to c \otimes c\), called \emph{comultiplication}, and a functor
\(\sigma: c \to 1\), called \emph{counit}, such that both diagrams
\[
\begin{tikzcd}
c \otimes (c \otimes c)
&(c \otimes c) \otimes c
\ar[l, "{\alpha(c, c, c)^{-1}}"']
&c \otimes c
\ar[l, "\kappa \otimes \Id_c"']
\\
c \otimes c
\ar[u, "\Id_c \otimes \kappa"]
&&c \ar[ll, "\kappa"] \ar[u, "\kappa"']
\end{tikzcd}
\qquad
\begin{tikzcd}
1 \otimes c
& c \otimes c
\ar[l, "\sigma \otimes \Id_c"']
\ar[r, "\Id_c \otimes \sigma"]
&c \otimes 1
\\
&c \ar[u, "\kappa"'] \ar[lu, "\rho^{-1}"] \ar[ru, "\lambda^{-1}"'] &
\end{tikzcd}
\]
commute in \(\cat M\). A morphism of comonoids
\(\psi: (c, \kappa, \sigma) \to (c', \kappa', \sigma')\) is a morphism
\(\psi: c \to c'\) in \(\cat M\) satisfying
\(\kappa' \psi = (\psi \otimes \psi) \kappa\), and \(\sigma = \sigma'
\psi\). We then define the subcategory \(\coMon_{\cat M}\) of \(\cat M\)
composed of comonoidal objects in \(\cat M\).
\end{enumerate}
\end{definition}
An important example of the later is that of algebras and coalgebras in
the category of vector spaces---those are monoids and comonoids,
respectively. These will appear later in the text.
Monoids, groups and the like cannot live without the core concept of actions, so
now we also define them in this abstract context.
\begin{definition}[Monoid actions]
\label{def:monoid-actions}
Let \((\cat M, \otimes, 1)\) be a monoidal category, and
\((m, \mu, \theta) \in \Mon_{\cat M}\). A \emph{left-action} of the monoid
\((m, \mu, \theta)\) on an object \(a \in \cat M\) is a bifunctor
\(\sigma: m \otimes a \to a\) such that
\[
\begin{tikzcd}
m \otimes (m \otimes a)
\ar[r, "{\alpha(m, m, a)}"]
\ar[d, "\Id_m \otimes \sigma"']
&(m \otimes m) \otimes a
\ar[r, "\mu \otimes \Id_a"]
&m \otimes a
\ar[d, "\sigma"']
&1 \otimes a
\ar[l, "\theta \otimes \Id_a"']
\ar[ld, "\lambda"]
\\
m \otimes a \ar[rr, "\sigma"']
&
&a
&
\end{tikzcd}
\]
commutes in \(\cat M\). Right-actions are defined analogously.
Given any two left-actions \(\sigma: m \otimes a \to a\) and
\(\lambda: m \otimes b \to b\), we define a \emph{morphism of left-actions}
\(\phi: \sigma \to \lambda\) to be an arrow \(\phi: a \to b\) in \(\cat M\) such
that the square
\[
\begin{tikzcd}
m \otimes a
\ar[d, "\sigma"']
\ar[rr, "\Id_m \otimes \phi"]
&&m \otimes b \ar[d, "\lambda"]
\\
a \ar[rr, "\phi"']
&&b
\end{tikzcd}
\]
commutes in \(\cat M\). With these notions we are able to define two categories
\(\rActMon_{(\cat M, m)}\) and \(\lActMon_{(\cat M, m)}\), composed of right and
left actions of \(m\) on objects of \(\cat M\), respectively, and morphisms
between them.
\end{definition}
\section{Braided \& Symmetric Monoidal Categories}
So far, we've only talked about monoidal structures that have a non-commutative
associated product. In our context we would also like to understand the
situations where commutativity is allowed. For instance, in the category of
vector spaces we have a natural isomorphism \(V \otimes W \iso W \otimes V\) for
any pair \(V, W \in \Vect_k\). To that end, we define the concept of braiding,
and associated to it the notion of braided monoidal categories.
\begin{definition}[Braiding]
\label{def:braiding}
Given a monoidal category \((\cat M, \otimes, 1, \alpha, \lambda, \rho)\), we
define a \emph{braiding} of \(\cat M\) to be a natural isomorphism
\[
\gamma: (- \otimes -') \isonat (-' \otimes -),
\]
that is coherent with associativity and unitors of \(\cat M\), in the sense that
the diagrams
\[
\begin{tikzcd}
(a \otimes b) \otimes c
\ar[rr, "\gamma_{(a \otimes b, c)}"]
\ar[dd, "{\alpha^{-1}(a, b, c)}"']
&&c \otimes (a \otimes b)
\ar[dd, "{\alpha(c, a, b)}"]
\\
&&
\\
a \otimes (b \otimes c)
\ar[dd, "\Id_a \otimes \gamma_{(b, c)}"']
&&(c \otimes a) \otimes b
\ar[dd, "\gamma_{(c, a)} \otimes \Id_b"]
\\
&&
\\
a \otimes (c \otimes b)
\ar[rr, "\alpha{(a, c, b)}"']
&&(a \otimes c) \otimes b
\end{tikzcd}
\qquad
\qquad
\begin{tikzcd}
a \otimes (b \otimes c)
\ar[rr, "\gamma_{(a, b \otimes c)}"]
\ar[dd, "{\alpha(a, b, c)}"']
&&(b \otimes c) \otimes a
\ar[dd, "{\alpha(b, c, a)^{-1}}"]
\\
&&
\\
(a \otimes b) \otimes c
\ar[dd, "\gamma_{(a, b)} \otimes \Id_c"']
&&b \otimes (c \otimes a)
\ar[dd, "\gamma_{(c, a)} \otimes \Id_b"]
\\
&&
\\
(b \otimes a) \otimes c
\ar[rr, "\alpha{(b, a, c)}"']
&&b \otimes (a \otimes c)
\end{tikzcd}
\]
\[
\begin{tikzcd}
a \otimes 1 \ar[rr, "\gamma_{(a, 1)}"]
\ar[rd, "\lambda"']
&&1 \otimes a \ar[ld, "\rho"]
\\
&a &
\end{tikzcd}
\]
should commute for all triples \((a, b, c)\) of objects of \(\cat
M\). Naturally, we say that a monoidal category is braided if it is associated
with a braiding.
\end{definition}
% As an immediate corollary, we have the following behaviour of the braiding and
% morphisms of the category:
% \begin{corollary}
% \label{cor:braiding-morphisms}
% For any given pair of morphisms \(f: a \to b\) and \(g: c \to d\) in a braided
% monoidal category \(\cat M\), we have
% \[
% (g \otimes f) \gamma_{(a, c)} \iso \gamma_{(b, d)} (f \otimes g).
% \]
% \end{corollary}
A really important concept for us will be that of functors between braided
monoidal categories, they will play a central role in the last sections of this
essay.
\begin{definition}[Braided monoidal functor]
\label{def:braided-monoidal-functor}
A monoidal functor \(F: (\cat A, \gamma) \to (\cat B, \widehat \gamma)\) between
braided monoidal categories is said to be a \emph{braided monoidal functor} if
for every pair of objects \(a, b \in \cat A\) the braiding coherence square
\[
\begin{tikzcd}
F a \otimes F b \ar[r, "\widehat\gamma"] \ar[d, "\dis"']
&F b \otimes F a \ar[d, "\dis"] \\
F (a \otimes b) \ar[r, "F \gamma"'] &F (b \otimes a)
\end{tikzcd}
\]
commutes in \(\cat B\).
\end{definition}
% \begin{corollary}
% \label{cor:composition-of-braided-monoidal-functors}
% The composition of braided monoidal functors is again a braided monoidal
% functor.
% \end{corollary}
% \begin{proof}
% Indeed, if
% \((\cat A, \gamma) \xrightarrow F (\cat B, \widehat \gamma) \xrightarrow G (\cat
% C, \widetilde \gamma)\) are braided monoidal functors, then for every pair
% \(a, b \in \cat A\) one has the following commutative diagram in \(\cat C\):
% \[
% \begin{tikzcd}
% G F a \otimes G F b
% \ar[r, "\widetilde \gamma"]
% \ar[d, "\dis"']
% &GF b \otimes GF a
% \ar[d, "\dis"]
% \\
% G(F a \otimes F b)
% \ar[r, "G \widehat \gamma"]
% \ar[d, "\dis"']
% &G (F b \otimes F a)
% \ar[d, "\dis"]
% \\
% GF (a \otimes b)
% \ar[r, "G F \gamma"']
% &GF (b \otimes a)
% \end{tikzcd}
% \]
% \end{proof}
Now that we have both objects and functors between them, we may define a
category \(\BrMonCat\) composed of braided monoidal categories and braided
monoidal functors between them. We can further restrict the objects of this
category to obtain an even better behaved category:
\begin{definition}[Symmetric monoidal category]