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:
- naturality in : for every and ,
::
Image:Trace diagram naturality 1.svg
- naturality in : for every and ,
::
Image:Trace diagram naturality 2.svg
- dinaturality in : for every and
::
Image:Trace diagram dinaturality.svg
- vanishing I: for every , (with being the right unitor),
::
Image:Trace diagram vanishing.svg
- vanishing II: for every
::
Image:Trace diagram associativity.svg
- superposing: for every and ,
::
Image:Trace diagram superposition.svg
- yanking:
::
(where is the symmetry of the monoidal category).
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
- {{cite journal
| author1-link = André Joyal |first1=André |last1=Joyal
|author2-link=Ross Street |first2=Ross |last2=Street
|first3=Dominic |last3=Verity
| year = 1996
| title = Traced monoidal categories
| journal = Mathematical Proceedings of the Cambridge Philosophical Society
| volume = 119
|issue=3 | pages = 447–468
| doi = 10.1017/S0305004100074338
|bibcode=1996MPCPS.119..447J |s2cid=50511333 }}
{{Category theory}}
{{categorytheory-stub}}