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:𝐂(XβŠ—U,YβŠ—U)→𝐂(X,Y)

called a trace, satisfying the following conditions:

  • naturality in X: for every f:XβŠ—Uβ†’YβŠ—U and g:Xβ†’X,
TrX,YU(f∘(gβŠ—idU))=TrX,YU(f)∘g
Naturality in X
  • naturality in Y: for every f:XβŠ—Uβ†’YβŠ—U and g:Yβ†’Y,
TrX,YU((gβŠ—idU)∘f)=g∘TrX,YU(f)
Naturality in Y
  • dinaturality in U: for every f:XβŠ—Uβ†’YβŠ—U and g:Uβ†’U
TrX,YU((idYβŠ—g)∘f)=TrX,YU(f∘(idXβŠ—g))
Dinaturality in U
  • vanishing I: for every f:XβŠ—Iβ†’YβŠ—I, (with ρX:XβŠ—Iβ‰…X being the right unitor),
TrX,YI(f)=ρY∘f∘ρXβˆ’1
Vanishing I
  • vanishing II: for every f:XβŠ—UβŠ—Vβ†’YβŠ—UβŠ—V
TrX,YU(TrXβŠ—U,YβŠ—UV(f))=TrX,YUβŠ—V(f)
Vanishing II
  • superposing: for every f:XβŠ—Uβ†’YβŠ—U and g:Wβ†’Z,
gβŠ—TrX,YU(f)=TrWβŠ—X,ZβŠ—YU(gβŠ—f)
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