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.
Mac Lane coherence in canonical-map form
Statement
Let and be parenthesised tensor words on the same ordered letters . Then there exists a unique canonical natural isomorphism . Equivalently, any two canonical morphisms from to are equal.
Facts & Assumptions
Given: Parenthesised tensor words and on the same ordered letters.
Canonical morphisms are built from identities, associators, unitors, inverses, tensoring with identities, and composition (Canonical morphisms between parenthesised tensor words).
Every monoidal category is monoidally equivalent to a strict one (Mac Lane strictification).
A monoidal category equivalent to a strict one satisfies uniqueness of canonical morphisms between fixed source and target (A monoidal category equivalent to a strict one satisfies coherence).
Proof
For a consecutive block , let , , and, for , let . We claim that every parenthesised tensor word whose ordered letters are exactly this block admits a canonical natural isomorphism .
The claim is proved recursively. For a word containing no letters, repeated unitors give a canonical map to ; for a one-letter word, repeated unitors give a canonical map to that actual letter . For , suppose contains the first letters and contains the next letters . Recursion gives and . Their tensor is canonical, and repeated associators and unitors give a canonical isomorphism . The composite is , and every step uses only the generators allowed in [L1].
For the given words and , define . This is a canonical natural isomorphism.
By [L2], the ambient monoidal category is equivalent to a strict one, so [L3] applies. Hence any two canonical morphisms from to are equal. Since step 3.1 produced one such morphism, it is the unique canonical natural isomorphism .
Depends on
Used by
- A canonical map between two bracketings of a five-fold product Example
- The two routes around the pentagon are equal Example
- The coherence theorem's exact scope Remark
- The historical route to coherence and the route authored here Remark
- The word category is the free monoidal category on one generator Theorem
- Unbracketed tensor strings are well defined after coherence Theorem
Dependency tree · two levels
13 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
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.2, Corollary (standard reference, not scraped)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Theorem 2.9.2 (standard reference, not scraped)