Alphabeta Math
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.

7 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Braided and Symmetric Monoidal Categories - Examples

1 · Prerequisites

2 · Summary

These examples keep the two coherence regimes concrete. Cartesian products and supervector spaces show what a symmetry looks like in practice, while the braid category shows why braided coherence is weaker and why different underlying braids can survive as genuinely different canonical maps.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The swap map on sets is the cartesian braiding

Example

In Set with cartesian product, the braiding on X×Y is the swap map

τX,Y(x,y)=(y,x).

Facts & Assumptions

Given: The category of sets with cartesian product.

[L1]

The cartesian swap braiding is a symmetry in every category with finite products (The cartesian swap braiding is a symmetry).

Verification

technique · direct
1.1

The category Set has finite products, namely cartesian products of sets.

givenalgebra
2.1

Therefore [L1] applies with C=Set, and the resulting braiding is exactly the swap map (x,y)(y,x).

L1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The braid group on three strands and its quotient to S_3

Example

The three-strand braid group has presentation

B3=σ1,σ2σ1σ2σ1=σ2σ1σ2,

and the quotient map to S3 sends σ1 to (12) and σ2 to (23).

Facts & Assumptions

Given: The Artin presentation of braid groups and the standard quotient to the symmetric group.

[L1]

The Artin presentation defines Bn (The braid group by Artin presentation).

[L2]

The map σi(i i+1) extends to a surjection BnSn (The braid group surjects onto the symmetric group).

Verification

technique · direct
1.1

Specializing [L1] to n=3 leaves two generators and only one braid relation, because there is no pair i,j with ij>1 among {1,2}. This gives the displayed presentation of B3.

L1givenalgebra
2.1

Specializing [L2] to n=3 gives the quotient map B3S3 with σ1(12) and σ2(23).

L2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

The hexagon checked for cartesian products

Example

For cartesian products, both routes around the first braiding hexagon send (x,y,z) to (y,z,x).

Facts & Assumptions

Given: A category with finite products and its cartesian swap braiding.

[L1]

The cartesian swap maps form a braiding (The cartesian swap braiding is a symmetry).

Verification

technique · direct
1.1

Write the source of the first hexagon as X×(Y×Z) and evaluate the left-hand route on (x,y,z). The inner swap sends (x,(y,z)) to ((y,z),x) after the evident rebracketing.

givenL1algebra
2.1

Evaluate the right-hand route: first swap x past y, then swap x past z. The result is again (y,z,x) after the same rebracketing identifications.

step 1.1algebra
3.1

Since the two routes agree on every triple (x,y,z), the first hexagon commutes in this cartesian case. The second hexagon is checked by the same coordinate calculation with the factors regrouped as ((x,y),z).

L1step 1.1step 2.1
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Supervector spaces with the sign braiding

Example

Let SVect be the category of Z/2-graded vector spaces. For homogeneous vectors v,w, define

cV,W(vw)=(1)vwwv.

This is a symmetric braiding.

Facts & Assumptions

Given: Z/2-graded vector spaces and homogeneous vectors of degrees v,w{0,1}.

[L1]

A symmetric monoidal category is a braided monoidal category with involutive braiding (Symmetric monoidal category).

Verification

technique · direct
1.1

The displayed map is natural and invertible: applying it twice multiplies a pure tensor by (1)vw(1)wv=(1)2vw=1, so cW,VcV,W=1VW.

givenL1algebra
2.1

On a triple tensor uvw, each route around a braiding hexagon contributes the sign (1)uv+uw=(1)u(v+w), because moving u past vw is the same as moving it past v and then past w. Thus both hexagons commute.

step 1.1algebra
3.1

By [L1], these two checks show that SVect carries a symmetric braiding, namely the sign braiding.

L1step 1.1step 2.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

The two-strand braiding in the braid category has infinite order

Example

In the braid category, the braiding on the object 11=2 has infinite order.

Facts & Assumptions

Given: The braid category and the computation of B2.

[L1]

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

[L2]

The group B2 is infinite cyclic, generated by σ1 (The two-strand braid group is infinite cyclic).

Verification

technique · direct
1.1

By [L1], the braiding on 2 is the element σ1.

L1given
2.1

By [L2], all nonzero powers of σ1 are distinct from the identity. Hence the braiding on 2 has infinite order.

L2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

Two canonical maps with different underlying braids do not agree

Example

In the braid category, the two canonical endomorphisms of 111 represented by σ1σ2 and σ2σ1 are different.

Facts & Assumptions

Given: Braided coherence and the braid category.

[L1]

Two canonical braided composites agree in every braided monoidal category exactly when their underlying braids agree (Two canonical braided composites agree exactly when their underlying braids agree).

[L2]

The braid category realizes the braid group on three strands as the endomorphisms of the object 3=111 (The braid category).

Verification

technique · direct
1.1

The two displayed composites have underlying braids σ1σ2 and σ2σ1 in B3.

givenL2algebra
2.1

These braids are not equal: their images in S3 are (123) and (132), which are distinct permutations.

step 1.1algebra
3.1

Therefore [L1] implies that the two canonical composites do not agree. In particular, they are distinct endomorphisms of the object 3 in the braid category from [L2].

L1L2step 2.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

Commutative monoid objects in sets are ordinary commutative monoids

Example

A commutative monoid object in (Set,×) is exactly an ordinary commutative monoid.

Facts & Assumptions

Given: Sets with cartesian product.

[L1]

Monoid objects in a cartesian monoidal category are ordinary monoids on the underlying sets (Monoid objects in a cartesian category are internal monoids; in Set they are ordinary monoids).

[L2]

In a symmetric monoidal category, monoid objects inherit a symmetric tensor product, so commutativity is expressed by invariance under the symmetry (Monoid objects in a symmetric monoidal category form a symmetric monoidal category).

Verification

technique · direct
1.1

By [L1], a monoid object in (Set,×) is a set M with a multiplication map m:M×MM and a unit element satisfying the usual associative and unital equations.

L1given
2.1

The symmetry on Set is the swap map (a,b)(b,a), so the categorical commutativity condition says m(a,b)=m(b,a) for all a,bM. By [L2], that is exactly the ordinary commutativity law.

L2step 1.1algebra

Sources