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.
Duals are unique up to a unique compatible isomorphism
Statement
If and are two left duals of the same object , then there is a unique isomorphism compatible with both evaluation and coevaluation:
The corresponding statement for right duals is also true.
Facts & Assumptions
Given: Two left duals and of .
Each pair satisfies the left-dual zig-zag identities (Left dual and right dual object, The zig-zag identities).
Proof
Define by the composite and define by the same formula with the subscripts interchanged.
Postcomposing the definition of with and precomposing it with , then using the zig-zag identities from [L1], yields the two compatibility equations in the statement. The same calculation with gives the analogous equations for .
The composite is the unique morphism compatible with and , and the identity morphism has that same compatibility by [L1]. Expanding one copy of and one copy of and then straightening with the zig-zag identities shows that ; similarly . Thus is an isomorphism with inverse .
If is any other morphism satisfying the two compatibility equations, insert into the formula of step 1.1 and use those compatibilities to collapse the same zig-zag composites; the result is . Hence the compatible isomorphism is unique. The right-dual statement is the mirror argument.
Depends on
Used by
Dependency tree · two levels
3 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, Proposition 2.10.5 (standard reference, not scraped)
- Michael Muger, Tensor Categories: A Selective Guided Tour, Section 1.5 (standard reference, not scraped)