Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A braided rigid category has a Drinfeld morphism

Statement

In a braided rigid monoidal category there is a natural isomorphism

uX:X→X∨∨,

called the Drinfeld morphism (or Drinfeld isomorphism), defined by

X→1X⊗coev⁡X∨X⊗X∨⊗X∨∨→cX,X∨⊗1X∨∨X∨⊗X⊗X∨∨→ev⁡X⊗1X∨∨X∨∨.

Write

dX,Y:X∨∨⊗Y∨∨→∼(X⊗Y)∨∨

for the monoidal comparison of the double-dual functor. Then

dX,Y∘(uX⊗uY)=uX⊗Y∘cY,X∘cX,Y.

Thus u need not be monoidal: the double braiding is precisely its monoidality obstruction.

Facts & Assumptions

Given: A braided rigid monoidal category with braiding c and chosen left duals.

[L1]

Braiding is natural and satisfies the two hexagons (Braiding). Duals satisfy the evaluation/coevaluation zig-zags (Rigid object and rigid monoidal category).

[L2]

Double duality has the monoidal comparisons dX,Y (The double dual is a monoidal functor). In calculations, reassociations, unit constraints and chosen-dual comparison maps are understood.

Proof

technique · direct
1.1L1givenalgebra

Bending a crossing. For any object Y, naturality at evaluation and coevaluation, followed by the two hexagons and the zig-zags, gives cX∨,Y=(ev⁡X⊗1Y⊗1X∨)(1X∨⊗cX,Y−1⊗1X∨)(1X∨⊗1Y⊗coev⁡X). Indeed expand cY,X⊗X∨=(1X⊗cY,X∨)(cY,X⊗1X∨) in naturality at coev⁡X, then tensor on the left with X∨ and apply ev⁡X to cancel the adjacent cup and cap. Replacing cA,B throughout by cB,A−1 gives the companion identity for cY,X∨−1. These are algebraic identities, independent of a graphical calculus.

2.1L1step 1.1algebraconstruct

A second left dual of X∨. Put eX′=ev⁡XcX,X∨:X⊗X∨→1 and hX′=cX∨,X−1coev⁡X:1→X∨⊗X. These give X as a left dual of X∨. To check the first zig-zag, expand (eX′⊗1X)(1X⊗hX′); move the crossing incident to the cup across that cup by step 1.1, cancel the resulting inverse crossing pair, and the remaining composite is (1X⊗ev⁡X)(coev⁡X⊗1X)=1X. For the other zig-zag expand (1X∨⊗eX′)(hX′⊗1X∨); the companion bending identity cancels the crossing pair and leaves (ev⁡X⊗1X∨)(1X∨⊗coev⁡X)=1X∨.

3.1L1step 2.1algebraconstruct

Comparison and inverse. If (A,eA,hA) and (B,eB,hB) are left duals of an object Z, the maps (eA⊗1B)(1A⊗hB):A→B and (eB⊗1A)(1B⊗hA):B→A are inverse: substitution of either composite permits first the Z,B zig-zag and then the A,Z zig-zag, leaving the identity. They are the unique maps intertwining the evaluations, since tensoring that intertwining equation with hB recovers the displayed formula. Apply this to Z=X∨, A=X from step 2.1, and B=X∨∨ with its chosen duality. The comparison is precisely the displayed uX, and its inverse is vX=(ev⁡X∨⊗1X)(1X∨∨⊗cX∨,X−1)(1X∨∨⊗coev⁡X). Thus vXuX=1X and uXvX=1X∨∨. For f:X→Y, the mate equations for f,f∨, and naturality of c show that both uYf and f∨∨uX intertwine the same evaluation pairing; uniqueness of the comparison gives uYf=f∨∨uX.

4.1L1L2step 1.1step 3.1algebra∎

Tensor relation. Work first with the canonical tensor dual (X⊗Y)∨=Y∨⊗X∨. Its evaluation is ev⁡Y(1Y∨⊗ev⁡X⊗1Y), and the coevaluation of its dual is (1Y∨⊗coev⁡X∨⊗1Y∨∨)coev⁡Y∨. Insert these into the formula for uX⊗Y. Expand its middle braiding using, successively, cA⊗B,C=(cA,C⊗1B)(1A⊗cB,C) and cA,B⊗C=(1B⊗cA,C)(cA,B⊗1C). This produces the four crossings of X,Y with Y∨,X∨. Bend the X,Y∨ crossing across its Y evaluation and the Y,X∨ crossing across its X evaluation by the two identities of step 1.1. The remaining X,X∨ and Y,Y∨ crossings and their cups and caps are respectively uX and uY, while the two bent crossings on the input are cX,Y−1cY,X−1. Consequently the expanded composite is uX⊗Y=(uX⊗uY)cX,Y−1cY,X−1. Reinsert the chosen-dual comparison dX,Y from [L2] and multiply on the right by cY,XcX,Y to obtain exactly the stated identity. Steps 3.1 and 4.1 prove the natural-isomorphism and obstruction claims.

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources