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.
In a rigid category every morphism of monoidal functors is an isomorphism
Statement
Let be strong monoidal functors from a rigid monoidal category to a monoidal category . Then every monoidal natural transformation is a natural isomorphism.
Facts & Assumptions
Given: A rigid monoidal category , a monoidal category , strong monoidal functors , and a monoidal natural transformation .
Every object of has chosen duals because is rigid (Rigid object and rigid monoidal category).
A monoidal natural transformation respects both the tensor structure and the unit structure (Monoidal natural transformation).
Compatible maps between two left duals of the same object are unique (Duals are unique up to a unique compatible isomorphism).
Proof
Because is rigid, choose for each object a left dual . Since and are strong monoidal, they send the duality maps of to duality maps of and : after transporting the images of and across the strong monoidal structure isomorphisms, is a left dual of and is a left dual of .
Define using the transported duality maps by the composite This construction uses and as left duals of and from step 1.1; it does not identify a left dual of with .
Expand using step 2.1. Naturality of , together with its tensor and unit compatibility from [L2], moves across the coevaluation and evaluation; the remaining composite is the zig-zag identity for the dual pair . Hence . The mirrored calculation uses the zig-zag identity for and gives . Thus every component is an isomorphism, so is a natural isomorphism.
Depends on
Used by
Nothing in the library uses this result yet.
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, Exercise 2.10.15 (standard reference, not scraped)