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
called the Drinfeld morphism (or Drinfeld isomorphism), defined by
Write
for the monoidal comparison of the double-dual functor. Then
Thus need not be monoidal: the double braiding is precisely its monoidality obstruction.
Facts & Assumptions
Given: A braided rigid monoidal category with braiding and chosen left duals.
Braiding is natural and satisfies the two hexagons (Braiding). Duals satisfy the evaluation/coevaluation zig-zags (Rigid object and rigid monoidal category).
Double duality has the monoidal comparisons (The double dual is a monoidal functor). In calculations, reassociations, unit constraints and chosen-dual comparison maps are understood.
Proof
Bending a crossing. For any object , naturality at evaluation and coevaluation, followed by the two hexagons and the zig-zags, gives Indeed expand in naturality at , then tensor on the left with and apply to cancel the adjacent cup and cap. Replacing throughout by gives the companion identity for . These are algebraic identities, independent of a graphical calculus.
A second left dual of . Put and . These give as a left dual of . To check the first zig-zag, expand ; 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 . For the other zig-zag expand ; the companion bending identity cancels the crossing pair and leaves .
Comparison and inverse. If and are left duals of an object , the maps and are inverse: substitution of either composite permits first the zig-zag and then the zig-zag, leaving the identity. They are the unique maps intertwining the evaluations, since tensoring that intertwining equation with recovers the displayed formula. Apply this to , from step 2.1, and with its chosen duality. The comparison is precisely the displayed , and its inverse is Thus and . For , the mate equations for , and naturality of show that both and intertwine the same evaluation pairing; uniqueness of the comparison gives .
Tensor relation. Work first with the canonical tensor dual . Its evaluation is , and the coevaluation of its dual is . Insert these into the formula for . Expand its middle braiding using, successively, and . This produces the four crossings of with . Bend the crossing across its evaluation and the crossing across its evaluation by the two identities of step 1.1. The remaining and crossings and their cups and caps are respectively and , while the two bent crossings on the input are . Consequently the expanded composite is . Reinsert the chosen-dual comparison from [L2] and multiply on the right by to obtain exactly the stated identity. Steps 3.1 and 4.1 prove the natural-isomorphism and obstruction claims.
Depends on
Used by
- A braiding alone does not define a link trace Counterexample
- Modular ribbon fusion category and Hopf-link data Definition
- The ribbon evaluation of an X-colored closed braid Definition
- The pointed Z/2 semion metric group Example
- Writhe normalization cancels a ribbon kink Example
- Balancing and the Hopf-link character identity Lemma
- Multicolored ribbon graphs with arbitrary coupons have a unique evaluation Lemma
- The corrected finite rank-one R series gives the full tilting ribbon structure Lemma
- The explicit Fibonacci model has a positive spherical pivotal structure Lemma
- The ribbon trace equals the framed-closure evaluation Lemma
- What is needed before a trace can be written Remark
- A ribbon object defines a unique framed-tangle evaluation functor Theorem
- A twist on a braided rigid category is the same thing as a pivotal structure of Drinfeld type Theorem
- The rank-one tilting quotient matches the Temperley-Lieb ribbon convention Theorem
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
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, formula (8.30), Proposition 8.9.3, and Proposition 8.10.6 (standard reference, not scraped)
- A. Bruguières and A. Virelizier, Hopf monads, Lemma 8.1 and Remark 8.2 (standard reference, not scraped)
- T. Shibata and K. Shimizu, Modified traces and the Nakayama functor, Section 6.4 (standard reference, not scraped)