Cyclic shifts of tensor powers in braided monoidal categories #
In a braided monoidal category C, the first factor of tensorPow X (n + 1) = X ⊗ tensorPow X n
can be braided past tensorPow X n and re-bracketed onto the right using tensorPowSuccIso X n.
This gives the cyclic shift automorphism TauCeti.tensorPowShiftIso X n of tensorPow X (n + 1).
For n = 0 the shift is the identity (TauCeti.tensorPowShiftIso_zero), and for n + 1 it
factors into a single braiding of the first two factors followed by the shift on the remaining
n + 1 factors (TauCeti.tensorPowShiftIso_succ_hom). In a symmetric rigid category with its
canonical pivotal structure (TauCeti.symmetricPivotalCategory), composing with
tensorPowShiftIso X n computes the Ng–Schauenburg Frobenius–Schur rotation operator.
Main declarations #
TauCeti.tensorPowShiftIso: the cyclic shift automorphism oftensorPow X (n + 1)in a braided monoidal category;TauCeti.tensorPowShiftIso_zeroandTauCeti.tensorPowShiftIso_succ_hom: base case and recursive decomposition of the cyclic shift;TauCeti.tensorPowShiftIso_hom_naturality: naturality with respect totensorPowMap.
The cyclic shift automorphism of tensorPow X (n + 1) in a braided monoidal category: braid
the first factor X past tensorPow X n and re-bracket on the right.
Instances For
The forward morphism of tensorPowShiftIso.
The inverse morphism of tensorPowShiftIso.
On the first tensor power X ⊗ 𝟙_ C, the cyclic shift is the identity.
Recursive decomposition of the cyclic shift on tensorPow X (n + 2): swap the first two
factors with the braiding, then apply the cyclic shift on the remaining n + 1 factors.
The cyclic shift commutes with the tensor powers of any morphism.
The cyclic shift commutes with the tensor powers of any morphism.