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.

The braid category is the free strict braided monoidal category on one generator

Statement

Let C be a strict braided monoidal category and let X be an object of C. Then there is a unique strict braided monoidal functor

FX:BC

from the braid category B such that FX(1)=X. Thus B is the free strict braided monoidal category on one generator.

Facts & Assumptions

Given: A strict braided monoidal category C and an object XC.

[L1]

A braided monoidal functor is determined by its action on objects and by compatibility with the braidings and tensor products (Braided monoidal functor).

[L2]

The braid category has objects the natural numbers and endomorphism groups Bn, with tensor product given by addition and juxtaposition (The braid category).

[L3]

In a strict braided monoidal category, the local braidings satisfy the Yang-Baxter equation (In a strict braided monoidal category the braiding satisfies the Yang-Baxter equation).

[L4]

A map of generators satisfying the relators extends uniquely from a presented group (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1

Define FX(n):=Xn on objects, with FX(0):=1. For each generator σiBn, define FX(σi) to be the morphism 1X(i1)cX,X1X(ni1):XnXn, where the braiding acts only on the ith and (i+1)st tensor factors.

givenL2construct
2.1

By [L3], the neighboring generators from step 1.1 satisfy the braid relation. Local braidings on disjoint tensor factors commute because in a strict monoidal category they act on separate coordinates. Therefore the Artin relations of Bn hold, and [L4] extends the assignment of step 1.1 uniquely to a homomorphism BnAut(Xn) for every n.

L3L4step 1.1algebra
3.1

The family from step 2.1 defines a functor BC because morphisms exist only between equal objects in B, and group multiplication in each Bn is respected by the constructed homomorphism. By construction FX(m+n)=FX(m)FX(n) on objects, the tensor of braids is sent to juxtaposition of local braidings, and the standard braiding βm,n of B is sent to the corresponding block braiding in C. Hence FX is strict braided monoidal.

L1L2step 1.1step 2.1algebra
4.1

Any strict braided monoidal functor BC sending 1 to X must send n=1n to Xn and each generator σi to the local braiding on the ith and (i+1)st factors. Since the σi generate every Bn, such a functor must equal FX. Therefore FX is unique.

L1L2step 3.1algebra

Depends on

Used by

Dependency tree · two levels

17 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