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 ,
- naturality in : for every and ,
- dinaturality in : for every and
- vanishing I: for every , (with being the right unitor),
- vanishing II: for every
- superposing: for every and ,
- 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.
gollark: ZenScript is a horrible language.
gollark: Which would need something like four other size-24 reactors providing fuel.
gollark: 3.84MRF/t on deuterium/tritium.
gollark: Depends on the fuel.
gollark: You use powered lights?
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.CS1 maint: multiple names: authors list (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.