Traced monoidal category

From testwiki
Jump to navigation Jump to search

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

TrX,YU:𝐂(XU,YU)𝐂(X,Y)

called a trace, satisfying the following conditions:

  • naturality in X: for every f:XUYU and g:XX,
TrX,YU(f(gidU))=TrX,YU(f)g
Naturality in X
  • naturality in Y: for every f:XUYU and g:YY,
TrX,YU((gidU)f)=gTrX,YU(f)
Naturality in Y
  • dinaturality in U: for every f:XUYU and g:UU
TrX,YU((idYg)f)=TrX,YU(f(idXg))
Dinaturality in U
  • vanishing I: for every f:XIYI, (with ρX:XIX being the right unitor),
TrX,YI(f)=ρYfρX1
Vanishing I
  • vanishing II: for every f:XUVYUV
TrX,YU(TrXU,YUV(f))=TrX,YUV(f)
Vanishing II
  • superposing: for every f:XUYU and g:WZ,
gTrX,YU(f)=TrWX,ZYU(gf)
Superposing
  • yanking:
TrX,XX(γX,X)=idX

(where γ is the symmetry of the monoidal category).

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

Template:Category theory

Template:Categorytheory-stub