Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

A braiding gives the tensor product algebra structure

Statement

Let C be a braided fusion category with braiding c, and let A,B be algebra objects. The object A⊗B is an algebra with unit ηA⊗ηB and multiplication mA⊗B=(mA⊗mB)∘(1A⊗cB,A⊗1B).

Facts & Assumptions

Given: A braided fusion category C with braiding c and algebra objects A,B.

[F1]

Braided monoidal category: The braiding is natural and invertible and satisfies both hexagon identities.

[F2]

Separable algebra objects and bimodules in a fusion category: An algebra object has multiplication and unit satisfying associativity and the two unit equations.

Proof

1.1F1F2given

The proposed multiplication first moves the middle B⊗A pair to A⊗B by cB,A and then applies mA and mB. With a unit input, naturality of the braiding with the unitors reduces the crossing to the identity, so the left and right unit composites are mA(ηA⊗1A)=1A and mB(ηB⊗1B)=1B, or their right-unit counterparts. Thus ηA⊗ηB is a unit.

2.1F1F2step 1.1algebra∎

On three tensor factors A⊗B⊗A⊗B⊗A⊗B, the left-associated product first crosses B1 past A2, then expands the crossing of B1⊗B2 past A3 into the crossings of B2 and B1 past A3. The right-associated product first crosses B2 past A3, then expands the crossing of B1 past A2⊗A3 into the crossings past A2 and A3. The two expansions use the two hexagons [F1]. The crossing of B1 past A2 and that of B2 past A3 involve disjoint tensor factors and commute by functoriality, so both composites perform the same three crossings in the same resulting order. They then apply respectively mA(mA⊗1A) and mB(mB⊗1B), or mA(1A⊗mA) and mB(1B⊗mB); these agree by the algebra associativity equations in [F2]. Hence mA⊗B is associative.

Depends on

Used by

Dependency tree · two levels

6 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