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.

Gauge covariance of fusion-space braid actions

Statement

Let C be a unitary braided fusion category. A finite list of simple charges and total charge determines a fusion space in each parenthesization. For a crossing word with underlying object map bβ:PL→PL′, define its action on the corresponding Hom spaces by f↦f∘bβ−1, from Hom⁡(PL,d) to Hom⁡(PL′,d). Let Uβ be its matrix in chosen fusion-tree bases. If each multiplicity basis is changed by the unitary gauge matrices of Fusion-basis gauge change, and GL,GL′ are the induced source and target tree-basis unitaries, then

Uβ′=GL′−1UβGL.

In particular, when n≥2 and all n strand charges are the same simple object a, the adjacent exchanges act on the same fixed-total fusion space V=Hom⁡(a⊗n,d), satisfy the Artin relations, and define a unitary representation ρ:Bn→U(V), where U(V) is the group of invertible linear maps preserving the inner product on V. If V=0, this is the unique action on the zero-dimensional space. In that case ρ′(β)=GL−1ρ(β)GL for every braid β. Thus basis-dependent matrix entries change, while the braid action up to unitary equivalence and consistently transformed expectation values do not.

Facts & Assumptions

Given: a unitary braided fusion category, finite simple-charge lists, a fixed simple total charge, and unitary multiplicity-basis changes.

[F1]

Monoidal category: tensor product is a bifunctor, and the associator satisfies the pentagon axiom.

[F2]

Braiding: each cX,Y is a natural isomorphism and satisfies both hexagon identities.

[F3]

Pentagon in fusion-tree coordinates and Hexagon in F/R coordinates: the associator and braiding coherence identities hold in the full fusion-tree matrices, including all multiplicities.

[F4]

Fusion-basis gauge change and Multiplicity-aware fusion-tree basis: local basis changes are unitary, and the induced tree-basis change is the direct sum of the corresponding tensor products at the vertices.

[F5]

The braid group by Artin presentation and Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group: the generators and Artin relations present Bn, and generator maps satisfying those relators extend uniquely to a group homomorphism.

[F6]

Unitary fusion category, F-symbol unitarity, and R-symbol unitarity: the braiding and every F/R change of orthonormal fusion basis are unitary maps.

[F7]

Mac Lane coherence in canonical-map form: any two canonical rebracketing maps between the same parenthesized tensor words on the same ordered factors are equal.

Proof

1.1F1F2F3F7givenalgebra

For three consecutive charges A,B,C, naturality of the braiding in its first variable, applied to cA,B:A⊗B→B⊗A, gives cB⊗A,C∘(cA,B⊗id⁡C)=(id⁡C⊗cA,B)∘cA⊗B,C. This is an equality from ((A⊗B)⊗C) to C⊗(B⊗A). Reassociating the target by αC,B,A−1 and expanding each cX⊗Y,Z by the second hexagon in [F2] gives the two adjacent Artin composites L=(cB,C⊗id⁡A)∘αB,C,A−1∘(id⁡B⊗cA,C)∘αB,A,C∘(cA,B⊗id⁡C),R=αC,B,A−1∘(id⁡C⊗cA,B)∘αC,A,B∘(cA,C⊗id⁡B)∘αA,C,B−1∘(id⁡A⊗cB,C)∘αA,B,C. The cancelled factor is αC,B,A−1∘αC,B,A=id⁡; the remaining factors are exactly the displayed L and R. Hence the adjacent braid relation holds as a typed equality of maps. Coherence [F7] identifies the canonical rebracketings of these three factors when they sit inside a longer tree; [F3] records the resulting equality in every fusion-tree block.

1.2F1F7algebra

If two crossings involve disjoint adjacent pairs, reparenthesize the ordered factors as WL⊗(A⊗B)⊗M⊗(C⊗D)⊗WR, where WL,WR collect the outer factors and M is the (possibly empty) intervening tensor product. Let g:A⊗B→B⊗A and h:C⊗D→D⊗C be the two crossings. Suppressing only the canonical parentheses, bifunctoriality gives the typed identity (id⁡B⊗A⊗id⁡M⊗h)∘(g⊗id⁡M⊗id⁡C⊗D)=g⊗id⁡M⊗h=(g⊗id⁡M⊗id⁡D⊗C)∘(id⁡A⊗B⊗id⁡M⊗h). Tensoring with the outer identities gives the same equality on the full word. Coherence [F7] transports it back to the chosen tree, so distant braid generators commute, including when one or more intervening factors are present.

2.1F5F6step 1.1step 1.2construct

For n identical charges a, reassociate each object-level crossing bi to act on factors i,i+1, and let its fusion-space operator be Bi(f)=f∘bi−1. The identity Bh∘g=Bh∘Bg follows by composition: Bh(Bg(f))=(f∘g−1)∘h−1=f∘(h∘g)−1. Consequently the object-level relators proved in steps 1.1–1.2 hold for the Bi as well. By [F5], the generator assignment extends uniquely to ρ:Bn→U(V). Reassociations are unitary by [F6], and the local exchange matrices are products of unitary F/R blocks from [F6]; hence each Bi and every braid word is unitary.

2.2F3F4step 1.1

In any parenthesized tree, let GT be the direct sum over admissible internal labels of the tensor products of the vertex gauge matrices. It is unitary because each factor is unitary and the tree basis is orthonormal by [F4]. The formulas in [F4] show that every F/R factor in a crossing matrix changes by inserting the inverse gauge at its target and the gauge at its source. Along a composite word, adjacent intermediate factors cancel, leaving Uβ′=GL′−1UβGL. This also holds for colored words whose source and target lists differ.

3.1F4step 2.2algebra∎

For identical charges, L′=L and the formula of step 2.2 is conjugation by the single unitary GL, so ρ′(β)=GL−1ρ(β)GL for every β∈Bn. If ψ′=GL−1ψ and M′=GL−1MGL, then ⟨ψ′,M′ψ′⟩=⟨GL−1ψ,GL−1Mψ⟩=⟨ψ,Mψ⟩ because GL is unitary. Hence all expectation values, including measurement probabilities represented this way, are unchanged.

Artin relation diagram

Both arrows are the explicit composites L and R from step 1.1, with each crossing using the braiding c and each reassociation using the named associator. The diagram records their common source and target; equality was proved from naturality and the hexagon identities above.

((A¬B)¬C)(C¬B)¬ALR

Depends on

Used by

Dependency tree · two levels

35 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