Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01
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.

Braided coherence fails in the symmetric form

Statement

There exists a braided monoidal category in which the canonical endomorphisms

1, cX,X2, cX,X4,

of XX are pairwise distinct. Consequently the symmetric slogan "every diagram built from associators and braidings commutes" is false for braided monoidal categories.

Facts & Assumptions

Given: The braid category B.

[L1]

In the braid category, the braiding on 11=2 is the generator σ1B2 (The braid category).

[L2]

The group B2 is infinite cyclic, so its distinct powers of σ1 are distinct morphisms (The two-strand braid group is infinite cyclic).

Proof

technique · direct
1.1

Take X:=1 in the braid category. By [L1], the canonical braiding on XX is σ1, so its even powers are the endomorphisms σ12m of the object 2.

givenL1algebra
2.1

By [L2], the elements 1,σ12,σ14, are pairwise distinct in B2. Therefore the canonical endomorphisms 1,cX,X2,cX,X4, are pairwise distinct in this braided monoidal category.

L2step 1.1algebra
3.1

If every formal diagram built from associators and braidings commuted in every braided monoidal category, then the morphisms in step 2.1 would all agree. They do not, so the symmetric-form coherence slogan fails in the braided setting.

step 2.1contradiction

Depends on

Used by

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