Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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 u and v be parenthesised tensor words on the same ordered letters x1,…,xn. Then there exists a unique canonical natural isomorphism Eu⇒Ev. Equivalently, any two canonical morphisms from u to v are equal.

Facts & Assumptions

Given: Parenthesised tensor words u and v on the same ordered letters.

[L1]

Canonical morphisms are built from identities, associators, unitors, inverses, tensoring with identities, and composition (Canonical morphisms between parenthesised tensor words).

[L2]

Every monoidal category is monoidally equivalent to a strict one (Mac Lane strictification).

[L3]

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

technique · direct
1.1givenconstruct

For a consecutive block xi,…,xi+m−1, let ri,0:=1, ri,1:=xi, and, for m≥1, let ri,m+1:=(ri,m⊗xi+m). We claim that every parenthesised tensor word w whose ordered letters are exactly this block admits a canonical natural isomorphism κw:Ew⇒Eri,m.

2.1L1step 1.1construct

The claim is proved recursively. For a word containing no letters, repeated unitors give a canonical map to ri,0=1; for a one-letter word, repeated unitors give a canonical map to that actual letter ri,1=xi. For w=(a⊗b), suppose a contains the first p letters xi,…,xi+p−1 and b contains the next q letters xi+p,…,xi+p+q−1. Recursion gives κa:Ea⇒Eri,p and κb:Eb⇒Eri+p,q. Their tensor is canonical, and repeated associators and unitors give a canonical isomorphism Eri,p⊗ri+p,q⇒Eri,p+q. The composite is κw, and every step uses only the generators allowed in [L1].

3.1step 2.1L1

For the given words u and v, define θu,v:=κv−1∘κu:Eu⇒Ev. This is a canonical natural isomorphism.

4.1L2L3step 3.1∎

By [L2], the ambient monoidal category is equivalent to a strict one, so [L3] applies. Hence any two canonical morphisms from u to v are equal. Since step 3.1 produced one such morphism, it is the unique canonical natural isomorphism Eu⇒Ev.

Depends on

Used by

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