\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{Sandbox}

$\backslash$linebreak

\textbf{M-Theory and Mathematics 2020}

\href{nyuad.nyu.edu/en/institute-events.html}{Research Institute of NYUAD}

New York University, Abu Dhabi

\textbf{Confirmed speakers:}

\begin{tabular}{l|l|l}
&&\\
\hline 
[[Katrin Becker]]&[[David Berman]]&[[Peter Bouwknegt]]\\
[[Martin Cederwall]]&[[Chong-Sun Chu]]&[[Jacques Distler]]\\
[[Michael Duff]]&[[José Figueroa-O'Farrill]]&[[Domenico Fiorenza]]\\
[[Sergei Gukov]]&[[Fei Han]]&[[Chris Hull]]\\
[[Amer Iqbal]]&[[Branislav Jurčo]]&[[Neil Lambert]]\\
[[Varghese Mathai]]&[[Christian Saemann]]&[[Henning Samtleben]]\\
[[Hisham Sati]]&[[Urs Schreiber]]&[[Ashoke Sen]]\\
[[Eric Sharpe]]&[[Dmitri Sorokin]]&[[Meng-Chwan Tan]]\\
\end{tabular}

$\backslash$begin\{xymatrix\} $\backslash$mathrm\{Maps\}{\tt \symbol{94}}\{$\backslash$ast/!\} $\backslash$big( S{\tt \symbol{94}}3, S{\tt \symbol{94}}3 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$mathrm\{fib\}\_\{($\backslash$mathrm\{ev\}\_$\backslash$ast)\} \} $\backslash$ar@\{\}r|-\{ $\backslash$simeq\_\{$\backslash$mathbb\{Q\}\} \} \& $\backslash$underset\{ n $\backslash$in $\backslash$mathbb\{Z\} \}\{$\backslash$sqcup\} $\backslash$ast $\backslash$ar@\{{\tt \symbol{94}}\{(\}-{\tt \symbol{62}}\}d $\backslash$ $\backslash$mathrm\{Maps\} $\backslash$big( S{\tt \symbol{94}}3, S{\tt \symbol{94}}3 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$mathrm\{ev\}\_$\backslash$ast \} $\backslash$ar@\{\}r|-\{ $\backslash$simeq\_\{$\backslash$mathbb\{Q\}\} \} \& $\backslash$underset\{ n $\backslash$in $\backslash$mathbb\{Z\} \}\{$\backslash$sqcup\} S{\tt \symbol{94}}3 $\backslash$ard{\tt \symbol{94}}-\{ ($\backslash$mathrm\{id\}\_\{S{\tt \symbol{94}}3\})\_\{n $\backslash$in $\backslash$mathbb\{N\}\} \} $\backslash$ S{\tt \symbol{94}}3 $\backslash$ar@\{=\}r \& S{\tt \symbol{94}}3 $\backslash$end\{xymatrix\}

$\backslash$begin\{xymatrix\} $\backslash$mathrm\{Maps\}{\tt \symbol{94}}\{$\backslash$ast/!\} $\backslash$big( S{\tt \symbol{94}}4, S{\tt \symbol{94}}4 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$mathrm\{fib\}\_\{($\backslash$mathrm\{ev\}\_$\backslash$ast)\} \} $\backslash$ar@\{\}r|-\{ $\backslash$simeq\_\{$\backslash$mathbb\{Q\}\} \} \& $\backslash$underset\{ n $\backslash$in $\backslash$mathbb\{Z\} \}\{$\backslash$sqcup\} S{\tt \symbol{94}}3 $\backslash$ar@\{{\tt \symbol{94}}\{(\}-{\tt \symbol{62}}\}d $\backslash$ $\backslash$mathrm\{Maps\} $\backslash$big( S{\tt \symbol{94}}4, S{\tt \symbol{94}}4 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$mathrm\{ev\}\_$\backslash$ast \} $\backslash$ar@\{\}r|-\{ $\backslash$simeq\_\{$\backslash$mathbb\{Q\}\} \} \& $\backslash$big( S{\tt \symbol{94}}4 $\backslash$times S{\tt \symbol{94}}3 $\backslash$big) $\backslash$sqcup $\backslash$big( $\backslash$underset\{ n $\backslash$neq 0 $\backslash$in $\backslash$mathbb\{Z\} \}\{$\backslash$sqcup\} S{\tt \symbol{94}}7 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$big( p\_1, (h\_\{$\backslash$mathbb\{H\}\})\_\{n $\backslash$neq 0 $\backslash$in $\backslash$mathbb\{N\}\} $\backslash$big) \} $\backslash$ S{\tt \symbol{94}}4 $\backslash$ar@\{=\}r \& S{\tt \symbol{94}}4 $\backslash$end\{xymatrix\}

$\backslash$begin\{xymatrix\} $\backslash$mathrm\{Maps\}{\tt \symbol{94}}\{$\backslash$ast/!\} $\backslash$big( S{\tt \symbol{94}}2, S{\tt \symbol{94}}2 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$mathrm\{fib\}\_\{($\backslash$mathrm\{ev\}\_$\backslash$ast)\} \} $\backslash$ar@\{\}r|-\{ $\backslash$simeq\_\{$\backslash$mathbb\{Q\}\} \} \& $\backslash$underset\{ n $\backslash$in $\backslash$mathbb\{Z\} \}\{$\backslash$sqcup\} S{\tt \symbol{94}}1 $\backslash$ar@\{{\tt \symbol{94}}\{(\}-{\tt \symbol{62}}\}d $\backslash$ $\backslash$mathrm\{Maps\} $\backslash$big( S{\tt \symbol{94}}2, S{\tt \symbol{94}}2 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$mathrm\{ev\}\_$\backslash$ast \} $\backslash$ar@\{\}r|-\{ $\backslash$simeq\_\{$\backslash$mathbb\{Q\}\} \} \& $\backslash$big( S{\tt \symbol{94}}2 $\backslash$times S{\tt \symbol{94}}1 $\backslash$big) $\backslash$sqcup $\backslash$big( $\backslash$underset\{ n $\backslash$neq 0 $\backslash$in $\backslash$mathbb\{Z\} \}\{$\backslash$sqcup\} S{\tt \symbol{94}}3 $\backslash$big) $\backslash$ard{\tt \symbol{94}}-\{ $\backslash$big( p\_1, (h\_\{$\backslash$mathbb\{C\}\})\_\{n $\backslash$neq 0 $\backslash$in $\backslash$mathbb\{N\}\} $\backslash$big) \} $\backslash$ S{\tt \symbol{94}}2 $\backslash$ar@\{=\}r \& S{\tt \symbol{94}}2 $\backslash$end\{xymatrix\}

The explanation by the laws of topology of surprising stability effects in dynamical physical systems goes back, at least, to Lord Kelvin, who observed that vortices in what was then thought to be the space-filling ether, would take the shape of knots, which, much like smoke rings in air, would move and vibrate but not break their linked and knotted structure.

(See e.g. Lomonaco 96 http://www.ams.org/books/psapm/051/) Kraph 03 onlinelibrary.wiley.com/doi/abs/10.1034/j.1600-0498.2002.440102.x

While Kelvin and his contemporaries were famously wrong about the existence of a space-filling ether, the idea of knotted topological structures appearing in physical substances and stabilizing their shapes turned out to be spot-on and has seen dramatic confirmation in a multitude of of physical systems, ranging over all scales, from fundamental particle physics, over solid state physics to cosmology.

In fundamental particle physics it remains an open problem to explain the existence of protons and neutrons, hence of atomic nuclei and hence of ordinary matter(!), as stable bound states of fundamental quarks. In the guise of the Mass Gap Problem, this is one of the Millenium Problems whose solution awaits a million dollar award by the Clay Maths Institute. While still open, the best contender for an answer are knotted topological structures in the pion field known as Skyrmions (e.g. Atiyah-Manton 89). Recently Skyrmions have been shown to correctly explain the properties of atomic nuclei all the way from Helium up to Carbon (Lau-Manton 14), a feat that no other model achieves. Moreover, the Skyrmion model of nucleons has been found to be implied by realizations of quantum chromodynaics in string theory (Sakai-Sugimoto 04, 05, Sugimoto 16).

In solid state physics, there have been three phases of matter known since antiquity (solid, fluid, gas) and one more discovered in the 20th century (plasmas) but the 21st century saw the discovery of an entirely new class of phases of matter visible at low tempterature in quantum crystals and known as \emph{topological phases of matter}. Here the stable knotted structures appear in patterns of the energy bands that electrons in these materials may occupy. Topological phases in particular control the behaviour of graphene, the new ultralight ultrastrong carbon crystal that was discovered in 2004.

Finally, on the very largest scales of the universe, topological defects in te space-filling Higgs field which was famously discovered a few years ago, are thought to play an important role in the explanation of properties of the cosmic microwave background. This includes cosmic monopoles, vertices and cosmic strings.

$\ldots$

\begin{enumerate}%
\item Indented block with citation at end

\end{enumerate}
\begin{quote}%
I would have written you a shorter letter, but I didn't have enough time.


\end{quote}
Other indented bloc

\begin{quote}%
Hit the road, jack, and don't you come back no more.


\end{quote}
\begin{enumerate}%
\item Yet another

\end{enumerate}
\begin{displaymath}
A
  \;\coloneqq\;
  \left(
    \underoverset{n}{i = 1}{\bigoplus}
     Sym
     \Big(
       \big(
         H_{n-i}(X)
       \big)
       [i] 
     \Big) 
  \right)
  \otimes
  \underoverset{i = 2}{2n}{\bigotimes}
  Sym
  \Big(
    \big(
      H_{2n - i}(X)
    \big)[i - 1]
  \Big)
\end{displaymath}
\begin{displaymath}
H_n\big( S^3, \mathbb{R}\big)
  \;=\;
  \left\{
  \itexarray{
    \mathbb{R} &\vert& n \in \{0,3\}
    \\
    0 &\vert& \text{otherwise}
  }
  \right.
\end{displaymath}
\begin{displaymath}
a_{{}_{3}}
\end{displaymath}
\begin{displaymath}
b_{{}_{4-3}}
  ,
  b_{{}_{4-0}}
\end{displaymath}
\begin{displaymath}
v_{{}_{8-4}}
  ,
  v_{{}_{8-1}}
\end{displaymath}
\begin{displaymath}
s_{{}_{6}}
  \;=\;
  -
  b_{{}_{4-3}}
  \vee 
  b_{{}_{4-3}}  
  \otimes
  a_{{}_{3}}
  \wedge 
  a_{{}_{3}}
\end{displaymath}
\begin{displaymath}
CE
  \Big( 
    \mathfrak{l}
    Maps
    \big(
      S^3, S^4
    \big)
  \Big)
  \left(
  \begin{aligned}
    d\, b_4 & = 0
    \\
    d\, b_1 & = 0
    \\
    d\, v_{{}_{4}} & = 2 \cdot b_{{}_{4}} \wedge b_{{}_{1}}
    \\
    d\, v_{{}_{7}} & = 2 \cdot b_{{}_{4}} \wedge b_{{}_{4}}
  \end{aligned}
  \right)
\end{displaymath}
\begin{equation}
\underset{
    \color{blue}
    \itexarray{
      \phantom{A}
      \\
      \text{graph complex}
      \\
      \text{of n-point Feynman diagrams}
      \\
      \text{for Chern-Simons theory}
      \\
      \text{on} \; \Sigma 
    }
  }{
    Graphs_n(\Sigma)
  }
  \underoverset{
    \simeq_{\mathrlap{qi}}
  }
  {
    \color{blue}
    \itexarray{
      \text{assign Feynman amplitudes}
      \\
      \text{of free CS/AKSZ theory}
      \\
      \phantom{A}
    }
  }
  {
    \longrightarrow
  }
  \underset{
    \color{blue}
    \itexarray{
      \phantom{A}
      \\
      \text{de Rham algebra}
      \\
      \text{of semi-algebraic differential forms}
      \\
      \text{on the FM-compactification}
      \\
      \text{of the configuration space of n points}
      \\
      \text{in}\; \Sigma
    }
  }{
  \Omega^\bullet_{PA}
  \big(
    Conf_n\big(  \Sigma \big)
  \big)
  }
  \,.
\label{TheQuasiIsomorphism}\end{equation}
$\Sigma$

$\underline{A} \colon C \in \mathcal{C}(A) \mapsto C$

$\{\rho_C \vert C \subset A \; \}$

$I'$

$\rho \colon A \to \mathbb{C}$

$\rho_C \colon C \subset  A \to \mathbb{C}$

$\sfrac{1}{2}$

\begin{displaymath}
\cdots
\end{displaymath}
\begin{displaymath}
\{\Gamma_{\mu}, \Gamma_\nu\} = \pm 2 g_{\mu \nu}
\end{displaymath}
\begin{displaymath}
(\Gamma_0)^2 = \pm 1
\end{displaymath}
\begin{displaymath}
\wedge \;\; \Leftrightarrow
\end{displaymath}
\begin{displaymath}
\itexarray{
  & (M \otimes M) \otimes M
    & \stackrel{\alpha}{\longrightarrow}
  & M \otimes (M \otimes M)
    & \stackrel{1 \otimes \mu}{\longrightarrow}
  & M \otimes M
  \\
  & {}_{\mu \otimes 1}\searrow
    &&
    && \swarrow_{\mu}
  &
  \\
  &&
  M \otimes M
    & \stackrel{\mu}{\longrightarrow}
  M
  &&
}
\end{displaymath}
\begin{tabular}{l|l|l|l}
$H \subset G$&$N_G H$&$W_G H$&$\left\vert W_G H\right\vert$\\
\hline 
$1 \subset \mathbb{Z}_2$&$\mathbb{Z}_2$&$\mathbb{Z}_2$&$2$\\
$\mathbb{Z}_2 \subset \mathbb{Z}_2$&$\mathbb{Z}_2$&$1$&$1$\\
\end{tabular}

\newline | [[A0]]  =  [[D1]] | | | | [[U(1)]]  $\simeq$  [[Spin(2)]] | | [[A1]]$\times$[[A1]]  =  [[D2]] | | | | [[SU(2)]]$\times$[[SU(2)]]  $\simeq$  [[Spin(4)]] | | [[A3]]  =  [[D3]] | | [[cyclic group of order 4]]  $\mathbb{Z}_4$ | [[cyclic group of order 4]]  $2 D_2 \simeq \mathbb{Z}_4$ | [[SU(4)]]  $\simeq$  [[Spin(6)]] | | [[D4]] | [[dihedron]] on  [[bigon]] | [[Klein four-group]]  $D_4 \simeq \mathbb{Z}_2 \times \mathbb{Z}_2$ | [[quaternion group]]  $2 D_4 \simeq$ [[Q8]] | [[SO(8)]], [[Spin(8)]] | | [[D5]] | [[dihedron]] on  [[triangle]] | [[dihedral group of order 6]]  $D_6$ | [[binary dihedral group of order 12]]  $2 D_6$ | [[SO(10)]], [[Spin(10)]] | | [[D6]] | [[dihedron]] on  [[square]] | [[dihedral group of order 8]]  $D_8$ | [[binary dihedral group of order 16]]  $2 D_{16}$ | [[SO(12)]], [[Spin(12)]] | | $D_{n \geq 4}$ | [[dihedron]],  [[hosohedron]] | [[dihedral group]]  $D_{2(n-2)}$ | [[binary dihedral group]]  $2 D_{2(n-2)}$ | [[special orthogonal group]], [[spin group]]  $SO(2n)$, $Spin(2n)$ | | $E_6$ | [[tetrahedron]] | [[tetrahedral group]]  $T$ | [[binary tetrahedral group]]  $2T$ | [[E6]] | | $E_7$ | [[cube]],  [[octahedron]] | [[octahedral group]]  $O$ | [[binary octahedral group]]  $2O$ | [[E7]] | | $E_8$ | [[dodecahedron]],  [[icosahedron]] | [[icosahedral group]]  $I$ | [[binary icosahedral group]]  $2I$ | [[E8]] |

$\backslash$begin\{tikzpicture\}

$\backslash$node (Spin6) at (0,1.4) \{$\mathrm{Spin}(6)$\}; $\backslash$node (SU4) at (3.4,1.4) \{$\mathrm{SU}(4)$\};

$\backslash$draw\href{Spin6}{white} to node \{$\backslash$color\{black\}$\simeq$\} (SU4);

$\backslash$node (center) at (0,0) \{\}; $\backslash$node (topright) at (30:1) \{\}; $\backslash$node (left) at (180-30:1) \{\}; $\backslash$node (botright) at (0,-1) \{\};

$\backslash$draw\href{center}{fill=black} circle (.1); $\backslash$draw\href{topright}{fill=black} circle (.1); $\backslash$draw\href{botright}{draw=lightgray, fill=lightgray} circle (.1); $\backslash$draw\href{left}{fill=black} circle (.1);

$\backslash$draw (center) to (topright); $\backslash$draw\href{center}{lightgray} to (botright); $\backslash$draw (center) to (left);

$\backslash$begin\{scope\}shift=\{(3.4,0)\} $\backslash$node (center) at (0,0) \{\}; $\backslash$node (left) at (-1,0) \{\}; $\backslash$node (right) at (+1,0) \{\};

$\backslash$draw\href{center}{fill=black} circle (.1); $\backslash$draw\href{left}{fill=black} circle (.1); $\backslash$draw\href{right}{fill=black} circle (.1);

$\backslash$draw (center) to (left); $\backslash$draw (center) to (right); $\backslash$end\{scope\} $\backslash$end\{tikzpicture\}

$\backslash$begin\{tikzpicture\} $\backslash$node (center) at (0,0) \{\}; $\backslash$node (topright) at (60:1) \{\}; $\backslash$node (botright) at (-60:1) \{\}; $\backslash$node (left) at (180:1) \{\};

$\backslash$draw\href{center}{fill=black} circle (.1); $\backslash$draw\href{topright}{fill=black} circle (.1); $\backslash$draw\href{botright}{fill=black} circle (.1); $\backslash$draw\href{left}{fill=black} circle (.1);

$\backslash$draw (center) to (topright); $\backslash$draw (center) to (botright); $\backslash$draw (center) to (left); $\backslash$end\{tikzpicture\}

$\left\vert \nabla \phi \right\vert = const$

\newline $\backslash$begin\{tikzpicture\} $\backslash$draw node at (0,0) \{$X$\}; $\backslash$end\{tikzpicture\}

$\varnothing$

$\to$

\hypertarget{coend_calculus}{}\section*{{Coend calculus}}\label{coend_calculus}

\emph{Guest post by \href{http://tetrapharmakon.github.io/}{Fosco Loregian} and \href{https://twitter.com/8ryceClarke}{Bryce Clarke}.}

\begin{quote}%
Pastro, Craig, and Ross Street. \href{http://www.tac.mta.ca/tac/volumes/21/4/21-04abs.html}{Doubles for monoidal categories.} Theory and applications of categories 21.4 (2008): 61-75.


\end{quote}
\emph{Coend calculus} rules the behaviour of certain universal objects associated to functors of two variables $T : C^{op}\times C \to D$; intuitively, $end(T)$ stands to $T$ as the limit $\lim\, F$ of $F : A \to B$ stands to $F$; the major difference is that $end(T)$ takes into account the fact that $T$ eats at the same time two ``terms'' of the same ``type'' $C$, once covariantly in the second component, and once contravariantly in the first: on arrows $f : c\to c'$ the functor $T$ acts in fact as follows:

\begin{displaymath}
\begin{array}{ccccc}
&& T(c',c) && \\
&\overset{T(f,c)}\swarrow && \overset{T(c',f)}\searrow &\\
T(c,c) &&&& T(c',c')
\end{array}
\end{displaymath}
Now, a distinguising feature of the objects that depend contra-covariantly on the same variable is that they can be \emph{integrated}: given a sufficiently regular function $f(x)$, its dependence from $x$ can be thought as ``covariant'' (and defined, say, on a topological vector space $V\cong \mathbf{R}^n$), whereas the ``$d x$'' in the symbol

\begin{displaymath}
\int f(x)d x
\end{displaymath}
is contravariant (it belongs to a certain dual space of covectors on $V$); altogether, the integral can be thought as exhibiting a contra-covariant dependence from $x$.

Ends and coends are associated to functors $T : C^{op}\times C \to D$ in a similar fashion that resembles integration: they are certain objects $\int_c T(c,c)$ (the end) and $\int^c T(c,c)$ (the coend), canonically associated to $T$, treating $c$ as a mute variable (meaning that $\int_c T(c,c)$ and $\int_{c'} T(c',c')$ are the same object), and satisfying a ``commutative rule of integrals'' analogous to

\begin{displaymath}
\int f(x,y) d x d y = \int \Big(\int f(x,y)d x\Big) d y = \int \Big(\int f(x,y)d y\Big) d x
\end{displaymath}
The end of $T$ is endowed with projections on the ``symmetrized components'' $\int_c T(c,c) \to T(c',c')$, one for each object $c'$; dually, the coend $\int^c T(c,c)$ is endowed with injections $T(c',c') \to \int^c T(c,c)$.

All in all, this happens also for colimits, so the two constructions are -at least intuitively- tightly related: this intuition can of course be made more precise. Every universal object built in category theory can be thought either as a subobject of a product (a limit), or as a quotient of a coproduct (a colimit), and co/ends make no exception:

\begin{itemize}%
\item An \emph{end} arises as an ``object of invariants'' $\int_c T$ for the action of $T$ given by the functions on arrows $T_{x y} : \hom_{C^{op}\times C}(x,y) \to \hom_D(T x, T y)$, and it is defined as the subobject of $\prod_{c\in C} T(c,c)$ of those elements invariant under this action.
\item Dually, a \emph{coend} arises as a ``quotient space'' of $\coprod_{c\in C}T(c,c)$ by a suitable equivalence relation generated by the same functions $T_{x y} : \hom_{C^{op}\times C}(x,y) \to \hom_D(T x, T y)$, i.e. as a \emph{space of orbits} for the action.

\end{itemize}
More on this will be explained later on in the discussion.

What is more important now, and quite astounding, is that such contra-covariant actions arise at every corner of category theory: using co/ends it is possible to re-state the Yoneda lemma and the theory of Kan extensions, and to find plenty of applications to algebra, topology, geometry\ldots{} and functional programming. :-)

\hypertarget{dinaturality}{}\subsection*{{Dinaturality}}\label{dinaturality}

As already said, a functor $T : C^{op}\times C \to D$ acts on morphisms as

\begin{displaymath}
\begin{array}{ccccc}
&& T(c',c) && \\
&\overset{T(f,c)}\swarrow && \overset{T(c',f)}\searrow &\\
T(c,c) &&&& T(c',c')
\end{array}
\end{displaymath}
given \emph{two} such functors, say $P,Q : C^{op}\times C \to D$, we can consider the two diagrams

\begin{displaymath}
\begin{array}{ccccc}
&& P(c',c) && \\
&\overset{P(f,c)}\swarrow && \overset{P(c',f)}\searrow &\\
P(c,c) &&&& P(c',c')
\end{array}
\end{displaymath}
and

\begin{displaymath}
\begin{array}{ccccc}
Q(c,c)&&&& Q(c',c')\\
&\underset{Q(c,f)}\searrow&& \underset{Q(f,c')}\swarrow& \\
&&Q(c,c')&&
\end{array}
\end{displaymath}
Given two functors $F,G : A \to B$ a natural transformation can be seen as a family of maps that ``fill the gap'' between $F(f)$ and $G(f)$ in a commutative square; in a similar fashion, a \emph{dinatural} transformation between the above $P,Q$ can be seen as a way to close a certain diagram that testifies a transformation from the arrow action of $P$ to the arrow action of $Q$:

\begin{displaymath}
\begin{array}{ccccc}
&& P(c',c) && \\
&\overset{P(f,c)}\swarrow && \overset{P(c',f)}\searrow &\\
P(c,c) &&&& P(c',c')\\
\!\!\!\!{\color{red} \alpha_c\downarrow} &&&&\,\,\,\,\,\,\,{\color{red}\downarrow\alpha_{c'}} \\
Q(c,c)&&&& Q(c',c')\\
&\underset{Q(c,f)}\searrow&& \underset{Q(f,c')}\swarrow& \\
&&Q(c,c')&&
\end{array}
\end{displaymath}
Just as co/limits are defined via suitable transformation to/from a constant, so are co/ends:

\begin{itemize}%
\item If $Q : C^{op}\times C \to D$, a \emph{wedge for $Q$ with base $x$} consists of a dinatural transformation from the constant functor on $x\in D$, i.e. of a family of morphisms $\alpha_c : x\to Q(c,c)$ such that for each $f :c\to c'$ the above hexagon reduces to a commutative square:\begin{displaymath}
\begin{array}{ccc}
x &\to& Q(c,c)\\
\downarrow && \downarrow\\
Q(c',c') &\to & Q(c,c')
\end{array}
\end{displaymath}

\item If $P : C^{op}\times C \to D$, a \emph{cowedge for $P$ with tip $y$} consists of a dinatural transformation to the constant functor on $y\in D$, i.e. of a family of morphisms $\alpha_c : P(c,c) \to y$ such that for each $f :c\to c'$ the above hexagon reduces to a commutative square:\begin{displaymath}
\begin{array}{ccc}
P(c',c) &\to& P(c,c)\\
\downarrow && \downarrow\\
P(c',c') &\to & y
\end{array}
\end{displaymath}
There exists a category $Wd(Q)$ of wedges, defined with an obvious choice of morphisms between bases; similarly, there is a category of cowedges $Cwd(P)$.



\end{itemize}
The \emph{end} $\int_c Q(c,c)$ of $Q$ is now defined as a terminal object in the category of its wedges; dually, the \emph{coend} $\int^c P(c,c)$ of $P$ is the initial object of the category of its cowedges. Of course, we say ``the'' end because such an initial object is unique up to unique isomorphism when it exists.

So far, so good. In fact, we didn't stray much far from plain old category theory, as it is possible to show the following:

\emph{Lemma (co/ends are colimits)}: Given $Q : C^{op}\times C \to D$ there exist a category $\text{tw}\, C$ and a functor $Q^\tau : \text{tw}\, C \to D$ such that

\begin{displaymath}
\int_c Q(c,c) \cong \lim \,Q^\tau
\end{displaymath}
For those who know: the end of $Q$ is the \href{https://ncatlab.org/nlab/show/weighted+limit}{weighted colimit} of $Q : C^{op}\times C \to D$ with the $\hom_C$ functor $C^{op}\times C \to Set$, and thus the category $\text{tw}\, C$ is nothing more, nothing less than the \href{https://ncatlab.org/nlab/show/category+of+elements}{category of elements} of $\hom_C$; this allows for a very explicit presentation of $\text{tw}\, C$:

\begin{itemize}%
\item objects: the arrows of $C$, $f : c \to c'$;
\item morphisms: the commutative squares\begin{displaymath}
\begin{array}{ccc}
c &\leftarrow& d \\
{}^f\downarrow && \downarrow^g\\
c' &\to& d'
\end{array}
\end{displaymath}


\end{itemize}
\emph{Corollary (hom commutes with all ends):} As a consequence of the fact that $\int_c Q$ is a limit, there is an isomorphism

\begin{displaymath}
\hom_C\Big(y, \int_c P(c,c)\Big) \cong \int_c \hom_C(y, P(c,c)) \qquad\qquad{(ccnt)}
\end{displaymath}
natural in $y$. Dually,

\begin{displaymath}
\hom_C\Big( \int^c P(c,c), y \Big )\cong \int_c \hom_C(P(c,c), y). \qquad\qquad{(ccnt)}
\end{displaymath}
natural in $y$.

(of course, a coend is just an end in the opposite category!)

But why are co/ends denoted as integrals? The notation dates back to Yoneda,

\begin{quote}%
Yoneda, Nobuo. ``\href{http://alpha.math.uga.edu/~lorenz/YonedaExtExactSequences.pdf}{On Ext and exact sequences.}'' J. Fac. Sci. Univ. Tokyo Sect. I 8.507-576 (1960): 1960.


\end{quote}
(in particular, see §4 but beware that the notation is reversed; a coend is denoted $\int_a$ and an end $\int_a^\ast$!) and it is essentially motivated by the fact that an end behaves like an integral:

\emph{Theorem (Fubini rule):} Let $P : C^{op}\times C \times D^{op}\times D \to E$ be a functor; then

\begin{displaymath}
\int^c\left(\int^d P(c,c,d,d)\right) \cong
\int^{(c,d)}P(c,d,c,d)
\cong \int^d\left(\int^c P(c,c,d,d)\right) \qquad\qquad{(Fub)}
\end{displaymath}
in the sense that if one of the three objects exists, so do the other two, and they are all canonically isomorphic (the category $C^{op}\times C \times D^\text{op}\times D$ is of course equal to $(C\times D)^\text{op}\times( C \times D)$). Similarly, there is such a rule for ends.

Thus, in category theory integration with respect to a variable is a process that can happen in whatever order we desire: given a permutation $\sigma$ of the set $\{1,\dots,n\}$, whenever the integral

\begin{displaymath}
\int^{c_{\sigma 1}}\int^{c_{\sigma 2}}\cdots \int^{c_{\sigma n}} P(c_{\sigma 1},  c_{\sigma 1}, c_{\sigma 2}, c_{\sigma 2}, \dots, c_{\sigma n}, c_{\sigma n})
\end{displaymath}
exists, then so does

\begin{displaymath}
\int^{(c_1,\dots, c_n)} P(c_1, c_1, c_2, c_2, \dots, c_n, c_n)
\end{displaymath}
\emph{Proof.} The slickest proof I know for this goes as follows: assume all coends exist; then, sending a functor $P : C^{op}\times C \to D$ to its coend is a functor $\int^C : [C^{op}\times C, D] \to D$, and it is easy to see that it is a left adjoint (for those who know, $\int^C$ is a particular kind of weighted colimit, and every such weighted colimit admits a right adjoint expressed in terms of the weight: but now it's easy to prove that these right adjoints commute, thus yielding the Fubini rule by uniqueness of adjoints).

\hypertarget{the_building_blocks_of_coend_calculus}{}\subsection*{{The building blocks of co/end calculus}}\label{the_building_blocks_of_coend_calculus}

Here we explore how co/ends allow to rediscover category theory from scratch.

\hypertarget{natural_transformations}{}\subsubsection*{{Natural transformations}}\label{natural_transformations}

\emph{Theorem (Natural transformations as an end)} Let $F,G : C \to D$ be two functors; then, there is an isomorphism

\begin{displaymath}
Nat(F,G) \cong \int_c \hom_D(F c,G c) \qquad\qquad{(nat)}
\end{displaymath}
\emph{Proof.} There is a natural choice for a wedge $\omega : Nat(F,G) \to \hom(F c,G c)$, that sends a natural transformation to its $c$-component; it remains to show that this is indeed a terminal wedge. Given another wedge $\alpha : A \to \hom(F c, G c)$, the wedge condition translates into the equation

\begin{displaymath}
\begin{array}{ccc}
A &\overset{\alpha_{a c}}\to& \hom(F c,G c) \\
{}_{\alpha_{a c'}}\downarrow && \downarrow_{G f \circ -} \\
\hom(F c', G c') &\underset{- \circ F f}\to & \hom(F c, G c')
\end{array}
\end{displaymath}
valid for every $a\in A$; but this is only a convoluted way to say that for every $a\in A$ the family

\begin{displaymath}
\{\alpha_{a,c} : F c \to G c\}
\end{displaymath}
is a natural transformation.

Two important remarks:

\begin{enumerate}%
\item In an additive setting, the wedge condition for $\alpha$ can be easily translated into the fact that natural transformations appear form the kernel of a certain map; the intuition that naturality is a cocycle condition is more or less what led Yoneda to study ends and coends in homological algebra.


\item Even in a non-additive setting, one can easily see that a natural transformation $\alpha : F \Rightarrow G$ is a map that equalizes the action of $F,G$ on arrows; this means that the following diagram

\begin{displaymath}
Nat(F,G) \to \prod_{c\in C} \hom(F c, G c) \underset{G f_\ast}{\overset{F f^\ast}\rightrightarrows} \prod_{c\to c'} \hom(F c, G c')
\end{displaymath}
is an equalizer; there is nothing special here, as for \emph{every} functor $T : C^{op}\times C \to D$ there is a similar equalizer diagram

\begin{displaymath}
\int_c T(c,c) \to  \prod_{c\in C} T(c,c) \underset{T f_\ast}{\overset{T f^\ast}\rightrightarrows} \prod_{c\to c'} T(c, c')
\end{displaymath}


\end{enumerate}
\href{https://mathoverflow.net/questions/20580/coend-computation-continued/20592}{Here}`s a discussion on what is the coend of the hom functor; I claim that the following object represents the coend of $\hom(F-,G-)$, perhaps you know where the same object appears under a different name, and where it is used for some purpose? I find this particularly intriguing in the case of a monoid $M$ regarded as single-object category:

\begin{itemize}%
\item the end of $\hom_M$ is the \emph{center} of the monoid, i.e. the subset $\{m\in M\mid mx=xm \forall x\in M\}$;
\item the coend of $\hom_M$ corresponds to something like the $\pi_0$ of the monoid.

\end{itemize}
I didn't expect these construction to be dual, and yet they are!

\emph{Claim} (but also: exercise for the reader). Let $C$ be a small category. The coend

\begin{displaymath}
\int^c \hom_C(c,c)
\end{displaymath}
is the set of connected components of the ``endo-comma'' category whose objects are endomorphisms of $C$, and whose morphisms $(u : x \to x) \to (v : y \to y)$ are the $f : x \to y$ such that $f u = v f$. More generally, if $F,G: C \to D$ are functors there is an isomorphism

\begin{displaymath}
\int^c \hom(F c, G c) \cong \pi_0((F/G)_{end})
\end{displaymath}
where the endomorphism comma is defined similarly.

\hypertarget{the_yoneda_lemma_and_kan_extensions}{}\subsubsection*{{The Yoneda lemma and Kan extensions}}\label{the_yoneda_lemma_and_kan_extensions}

\begin{quote}%
On the first day He created the Yoneda lemma, and He saw that it was good:


\end{quote}
\emph{Theorem (The ninja Yoneda lemma)} Let $F : C^{op} \to Set$; then for every object $a\in C$,

\begin{displaymath}
F a\cong \int^c F c \times \hom_C(a,c) \cong
\int_c \Set(\hom_C(c,a), F c)
\end{displaymath}
\emph{Proof.} The set $\int_c \Set(\hom_C(c,a), F c)$ is the set of natural transformations from $\hom(-,c)$ to $F$, and thus the non-ninja Yoneda lemma yields an isomorphism between this set and $F a$. Dually, call $F\otimes y$ the functor

\begin{displaymath}
a\mapsto \int^x F x\times \hom_C(a,x)
\end{displaymath}
Then, we have

\begin{displaymath}
\begin{array}{rl}
Nat(F\otimes y, G) &\cong \int_a Set(F x\times \hom_C(a,x), G a)\\
&\displaystyle\cong\int_a\int_x Set(F x\times \hom_C(a,x), G a)\\
&\displaystyle\cong\int_a\int_x Set(F x, [\hom_C(a,x), G a])\\
&\displaystyle\cong\int_x Set(F x, \int_a[\hom_C(a,x), G a])\\
&\displaystyle\cong\int_x Set(F x, Nat(y(x), G))\\
&\displaystyle\cong Nat(F, G)
\end{array}
\end{displaymath}
Each of these steps can be easily justified in light of what we already proved:

\begin{itemize}%
\item the fact that the hom functor preserves ends;
\item the Fubini rule for ends;
\item the fact that the set of natural transformations between two functors is an end.

\end{itemize}
This natural deduction-style kind of proof is half-jokingly called ``coend-fu'' ((端楔術 : literally “the art of handling terminal wedges”) in \href{https://arxiv.org/abs/1501.02503}{my note, soon-ish a book, on coends}.

Incidentally, the isomorphism $F a\cong \int^c F c \times \hom_C(a,c)$ is precisely the sense in which ``every presheaf is a colimit of representable functors''; the colimiting diagram has domain the category of elements of $F$, and the natural functor $\Sigma : El(F) \to C \to [C^{op},Set]$ has colimit $F$.

\begin{quote}%
On the second day, He created Kan extensions, and category theory was complete.


\end{quote}
\emph{Theorem (Kan extensions are co/ends)} Let $A \xleftarrow{G} B\xrightarrow{F} C$ be a span of functors; if the coend

\begin{displaymath}
\int^b \hom_A(G b, a) \times F b
\end{displaymath}
exists, then it is the value at $a$ of the left Kan extension of $F$ along $G$; dually, is the end

\begin{displaymath}
\int_b F b ^ {\hom_A(a, G b)}
\end{displaymath}
exists, then it is the value at $a$ of the right Kan extension of $F$ along $G$.

\emph{Proof.} The proof is another lengthy, but completely straightforward, kata using the coend-fu we already know:

\begin{displaymath}
\begin{array}{rl}
  Nat(\text{Lan}_G F, H) &\textstyle \cong \int_a  \hom(\text{Lan}_G F( a ), H  a ) \\
    & \textstyle \cong \int_a     \hom\Big( \int^c \hom(G c, a )\times F c, H a  \Big)  \\
  Fub  & \textstyle \cong \int_{ a  c} \hom\Big( \hom(G c, a )\times F c, H a  \Big)         \\
    & \textstyle \cong \int_{ a  c} \hom\Big( F c,[\hom(G c, a ), H a ] \Big)       \\
  ccnt & \textstyle \cong \int_c    \hom\Big( F c,\int_a  [\hom(G c, a ), H a ] \Big)   \\
  nat  & \textstyle \cong \int_c    \hom\Big( F c,Nat(\hom(G c,-), H) \Big)      \\
  nat  & \textstyle \cong \int_c    \hom\Big( F C,H G C \Big) = Nat(F, H G)   \\
 \end{array}
\end{displaymath}
\hypertarget{bimodules}{}\section*{{Bimodules}}\label{bimodules}

\href{http://www.tac.mta.ca/tac/volumes/21/4/21-04abs.html}{This} Pastro and Street paper makes heavy use of the theory of \emph{bimodules}. Let's dig deeper into their structure. First of all, let us define a bicategory as follows:

\begin{itemize}%
\item objects are (unitary) rings $R,S,\dots$
\item 1-cells $M : R \to S$ are modules ${}_S M_R$, left over $R$ and right over $S$.
\item 2-cells $\varphi : {}_R M_S \to {}_R N_S$ are $R$-$S$-linear homomorphisms of modules.

\end{itemize}
The composition of 1-cells is the tensor product of modules: ${}_R M \otimes_S N_T$ is a $R$-$T$-bimodule for every $R$-$S$bimodule $M$ and every $S$-$T$-bimodule $N$ (so in particular this is not a strict 2-category); 2-cells are composed horizontally and vertically, using the obvious function composition, and bifunctoriality of the $\otimes$ operation.

Good! There is a 2-categorical characterization of modules. What is good for? Well: rings are monoids in the category of abelian groups. We could have done the very same thing taking (plain) monoids, i.e. monoids in the category of sets, and defining a category of ``bimodules'' as sets with a left action of some monoid, and a right action of some other monoid.

What is interesting now is that we can generalize the same construction, with no additional cognitive loading, and take $X,Y,Z\dots$ to be multi-object monoids: we define a bicategory $Mod$ as follows:

\begin{itemize}%
\item objects are categories $C,D, E,\dots$
\item 1-cells $P : C \mathrel{&#8696;} D$ are functors $P : D^{op}\times C \to Set$
\item 2-cells are natural transformations between functors.

\end{itemize}
A functor $P : D^{op}\times C \to Set$ is a multiobject module on which the multiobject monoids $C,D$ act.

So categories really are monoids, and are also eager to act on sets.

A bimodule is also called a profunctor, a distributor, a correspondence, a span,\ldots{} and possibly with many other names; each of these names comes from a certain intuition behind their nature that leads to the definition of the same bicategory:

\begin{itemize}%
\item they are called \emph{profunctors} because they generalize functors: some profunctors are called \emph{representable}, and they are the ones of the form $\hom(b, F a)$ for some functor $F : A \to B$ between categories. A pro-functor thus works ``\href{https://www.etymonline.com/word/pro-}{on behalf} of a functor'', as well as a relation generalizes a function.


\item \ldots{}which is why some people prefer to call them \emph{relators}: just as a func-tion is a special kind of rela-tion, a func-tor is a special kind of rela-tor.


\item they are called \emph{distributors}: as the nLab says,

{\tt \symbol{62}} Jean Bénabou, who invented the term and originally used “profunctor,” now prefers “distributor,” which is supposed to carry the intuition that a distribut\emph{or} generalizes a funct\emph{or} in a similar way to how a distribution generalizes a function.

There's in fact a beautiful story about this: Lawvere defined a notion of \href{https://ncatlab.org/nlab/show/Lawvere+distribution}{distribution} between toposes, such that the points of a topos $p : Set \to \mathcal{E}$ behave like Dirac delta functions, and such that distributions between presheaf toposes are exactly profunctors.


\item they are called \emph{correspondences} or \emph{spans} because of the \href{https://ncatlab.org/nlab/show/Grothendieck+construction}{Grothendieck construction}: every presheaf $P : D^{op}\times C \to Set$ has a category of elements $El(P)$ that in this case is a discrete fibration over $D^{op}\times C$



\end{itemize}
Well\ldots{} until now we cheated a bit. In order to get a bicategory we need to define a composition law for 1-cells and show that it is bifunctorial, and I didn't tell you how to do it: but it turns out it is really easy, if you know coend-fu! Indeed, the intuition of a bimodule as a ``matrix indexed by its domain'' and the rule to compose two relations guide us to find an expression to meaningfully compose $Q : A \mathrel{&#8696;} B, P : B \mathrel{&#8696;} C$. We can define

\begin{displaymath}
(P \diamond Q) (a,c) = \int^b P(a,b)\times Q(b,c)
\end{displaymath}
boils down, on discrete domains $A,B\in\Set$ to a ``matrix product of sets'' like

\begin{displaymath}
(P \diamond Q)_{a c} = \sum_{b\in B} P_{a b}\times Q_{b c}
\end{displaymath}
There is also a connection between the ways in which profunctors compose, and the way in which \emph{relations} do. Indeed, look how the two concepts closely resemble each other:

\begin{displaymath}
\begin{array}{cccccc}
(x,z)\in S\circ R & \iff & \exists y\in Y & \big((x,y)\in R\big) & \wedge & \big((y,z)\in S\big) \\
  (P\diamond Q)(x,z) & = & \int^y & Q(x,y) & \times & P(y,z) \\
\end{array}
\end{displaymath}
Finally: yes, you can make this precise by saying that sets are discrete categories, or even more precisely categories enriched over \href{https://ncatlab.org/nlab/show/%28-1%29-categoryhttps://ncatlab.org/nlab/show/%28-1%29-category}{truth values}, and that relations are precisely the $\{0,1\}$-enriched version of profunctors, as they are functions $A\times B \to \{0,1\}$!

\hypertarget{doubles_for_monoidal_categories}{}\section*{{Doubles for monoidal categories}}\label{doubles_for_monoidal_categories}

One of the key results of the paper \href{http://www.tac.mta.ca/tac/volumes/21/4/21-04abs.html}{Doubles for Monoidal Categories} is the canonical equivalence of categories:

\begin{displaymath}
\mathbf{Tamb}(\mathcal{C}) \simeq [\mathbf{Doub}(\mathcal{C}), \mathbf{Set}]
\end{displaymath}
This theorem has since been labelled by some as the ``fundamental theorem of optics'', as it provides the link between the category of Tambara modules $\mathbf{Tamb}(\mathcal{C})$ and the double $\mathbf{Doub}(\mathcal{C})$ of the monoidal category $\mathcal{C}$, now also known as the \emph{category of optics}. To unpack this theorem, we first begin with the definition of a Tambara module.

\hypertarget{tambara_modules}{}\subsection*{{Tambara modules}}\label{tambara_modules}

The category of (bi)modules $\mathbf{Mod}$ forms a bicategory, however when we choose a particular category $\mathcal{C}$ we may instead consider the monoidal category $\mathbf{Mod}(\mathcal{C})$ whose:

\begin{itemize}%
\item objects are endomodules $P \colon \mathcal{C}^{op} \times \mathcal{C} \rightarrow \mathbf{Set}$;
\item morphisms are natural transformations;
\item monoidal product is module composition:\begin{displaymath}
(P \diamond Q) (X,Y) = \int^Z P(X,Y)\times Q(Y,Z)
\end{displaymath}
One may ask the question: \emph{what happens when $\mathcal{C}$ has the structure of a monoidal category?}



\end{itemize}
\textbf{Definition}: Let $\mathcal{C}$ be a monoidal category. A (left) \emph{Tambara module} on $\mathcal{C}$ consists of:

\begin{itemize}%
\item a profunctor $P \colon \mathcal{C}^{op} \times \mathcal{C} \rightarrow \mathbf{Set}$;
\item a family of functions $\tau_{A}(X,Y) \colon P(X, Y) \rightarrow P(A \otimes X, A \otimes Y)$ called the \emph{Tambara structure maps}, which are natural in $X, Y$ and dinatural in $A$, satisfying the equations:

\end{itemize}
\hyperlink{Backus1977}{Backus' 1977 lecture} [[\#Backus1977|Backus' 1977 lecture]] [[functional programming\#Backus1977|Backus' 1977 lecture]]

[[\#top|Top of page]]

Create a [[Dev Sandbox]]

[[Dev Sandbox 2]]



\end{document}