Traced monoidal category
In category theory, a traced monoidal category is a category with some extra structure which gives a reasonable notion of feedback.
A traced symmetric monoidal category is a symmetric monoidal category C together with a family of functions
called a trace, satisfying the following conditions (where we sometimes denote an identity morphism by the corresponding object, e.g., using U to denote ):
- naturality in X: for every and ,
![](../I/m/Trace_diagram_naturality_1.svg.png)
Naturality in X
- naturality in Y: for every and ,
![](../I/m/Trace_diagram_naturality_2.svg.png)
Naturality in Y
- dinaturality in U: for every and
![](../I/m/Trace_diagram_dinaturality.svg.png)
Dinaturality in U
- vanishing I: for every ,
![](../I/m/Trace_diagram_vanishing.svg.png)
Vanishing I
- vanishing II: for every
![](../I/m/Trace_diagram_associativity.svg.png)
Vanishing II
- superposing: for every and ,
![](../I/m/Trace_diagram_superposition.svg.png)
Superposing
- yanking:
(where is the symmetry of the monoidal category).
![](../I/m/Trace_diagram_yanking.svg.png)
Yanking
Properties
- Every compact closed category admits a trace.
- Given a traced monoidal category C, the Int construction generates the free (in some bicategorical sense) compact closure Int(C) of C.
References
- André Joyal, Ross Street, Dominic Verity (1996). "Traced monoidal categories". Mathematical Proceedings of the Cambridge Philosophical Society. 3: 447–468. doi:10.1017/S0305004100074338.
This article is issued from Wikipedia - version of the 3/23/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.