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.
Bruguières--Virelizier, Lemma 8.1, proves under the bare braided-autonomous hypotheses that the displayed natural transformation is an isomorphism, gives its explicit inverse, and proves its tensor relation; Remark 8.2 identifies symmetry as exactly the case in which it is monoidal. Shibata--Shimizu, Section 6.4, independently uses the same map as the Drinfeld isomorphism of an arbitrary braided rigid monoidal category and uses in the pivotal/twist correspondence. EGNO formula (8.30) and Proposition 8.9.3 give the same map and tensor relation in their strict chosen-dual convention.
A braiding is natural in both variables and satisfies the hexagon identities (Braiding).
With chosen left duals, the double-dual assignment is a monoidal endofunctor, with comparison maps of the displayed type (The double dual is a monoidal functor).
Proof
The displayed composite is well typed because rigidity provides and , while the braiding supplies the middle swap. Naturality of the braiding in [L1] makes the assignment natural in .
After inserting the monoidal comparison from [L2], both sides of the displayed tensor relation are morphisms . The relation in [F1] is exactly this compatibility in a convention that suppresses the comparison. In particular, it records the precise obstruction to being monoidal: the double braiding appears between and the transported map .
The explicit inverse in [F1] is defined under the same braided-rigid hypotheses as the displayed map, so every is an isomorphism. Together with step 1.1, this makes a natural isomorphism in every braided rigid monoidal category; step 1.2 records why it need not be monoidal.
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
- 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)