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.
Two formally distinct words can become the same object
Counterexample
Let be the one-object category with object and endomorphism monoid , where and . Define the tensor on objects by and on morphisms by the same monoid multiplication. Then is a strict monoidal category in which the formal words and evaluate to the same object .
Facts & Assumptions
Given: The one-object strict monoidal category just described.
In a strict monoidal category, the associator and unitors are identities, so and evaluate to the same object on the nose (Strict monoidal category).
The slogan "every diagram commutes" fails because formally different vertices can coincide and then a noncanonical endomorphism may be inserted (Why 'every diagram commutes' is false as stated).
Verification
By [L1], the two formal vertices and both evaluate to the single object of .
Consider the square all of whose vertices are , whose top edge is , and whose other three edges are . The clockwise composite is , while the counterclockwise composite is , so the square does not commute because .
This realizes the mechanism described in [L2]: formally distinct words can collapse to one object, and a noncanonical endomorphism then breaks the blanket slogan. Hence the slogan is false.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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 (standard reference, not scraped)