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

Unitary Fusion Spaces, F/R Symbols, and Anyon Models

1 · Prerequisites

2 · Summary

This page builds multiplicity-aware fusion spaces in a unitary fusion category, defines F and pullback R coordinates, and proves their unitarity and the pentagon and hexagon equations with every intermediate charge and multiplicity index. It also records gauge covariance, modular nondegeneracy, topological spin, framed ribbon evaluation, and the distinction between algebraic braid or Hecke relations and positive unitary structure. The Fibonacci carrier verifies one complete chiral model; the Ising carrier is limited to its stated three-anyon sector.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Unitary fusion category

Definition

Let C be a fusion category over C in the sense of Fusion and multifusion categories. A dagger structure assigns to every morphism f:X→Y a morphism f†:Y→X, conjugate-linearly, with (g∘f)†=f†∘g† and (f†)†=f. A unitary fusion category is such a fusion category equipped with this dagger so that every morphism space is a finite-dimensional normed space, composition is submultiplicative, ∥f†∥=∥f∥, and ∥f†f∥=∥f∥2. Thus each End⁡C(X) is a finite-dimensional C∗-algebra. Positive endomorphisms are the elements of its usual C∗-positive cone (equivalently u†u for an endomorphism u); in particular, if c is simple and End⁡(c)=Cid⁡c, then λid⁡c is positive exactly when λ≥0. For any morphism f:X→Y, f†f is positive in End⁡(X); also require f†f=0 to imply f=0. Semisimple direct-sum decompositions can be chosen orthogonally: their inclusions ij satisfy ij†ik=0 for j≠k, ij†ij=id⁡, and ∑jijij†=id⁡. Tensor product preserves daggers: (f⊗g)†=f†⊗g†. Its associator and unit constraints are unitary, meaning α†=α−1, λ†=λ−1, and ρ†=ρ−1.

The underlying fusion category is rigid, so its evaluation and coevaluation morphisms satisfy the duality zig-zag identities. Those morphisms are not required to be unitary isomorphisms. A braiding is additional structure; when it is specified as a unitary braiding, each component satisfies cX,Y†=cX,Y−1. Positivity and unitarity are extra structure, not consequences of the fusion rules or of the braid relations alone.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Fusion multiplicity space

Definition

Let a,b,c be simple objects of a unitary fusion category C (Unitary fusion category). The fusion multiplicity is

Nabc:=dim⁡CHom⁡C(a⊗b,c),

and the corresponding fusion multiplicity space is

Vabc:=Hom⁡C(a⊗b,c).

Since c is absolutely simple (Absolutely simple objects), each f,g∈Vabc has a unique scalar ⟨f,g⟩ satisfying f∘g†=⟨f,g⟩id⁡c. This fixes the inner-product convention to be linear in the first variable. The next local theorem proves that this pairing is positive definite. No multiplicity-free assumption is made: Nabc may be any nonnegative integer.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Unitary ribbon data

Definition

A unitary ribbon fusion category is a unitary fusion category with a unitary braiding and a ribbon structure in the sense of Twist and ribbon structure. Thus the twist θ is a natural automorphism of the identity satisfying the balancing identity and the dual-compatibility condition of that root definition, and each component is unitary: θX†=θX−1. A ribbon structure is additional data; it is not supplied by fusion rules or by a braid-group representation alone.

Remarks

The twist is unitary under these hypotheses. Let s be simple, choose its left dual s∨, and let η:1→s⊗s∨ be the coevaluation. A nonzero endomorphism of s has zero kernel and image s, so it is an isomorphism and End⁡(s) is a division algebra. Local finiteness makes it finite-dimensional over C. For any a∈End⁡(s), finite-dimensionality gives a nonzero polynomial p with p(a)=0. Factor p over C; since a division algebra has no zero divisors, one linear factor must vanish, so End⁡(s)=Cid⁡s. Write θs=λid⁡s. The ribbon duality condition and linearity of dualization give θs∨=λid⁡s∨. Naturality, θ1=id⁡1, and balancing give η=θs⊗s∨∘η=λ2 cs∨,s∘cs,s∨∘η. The double braiding is unitary, so it preserves the norm of η. The zig-zag identity gives η≠0; hence the equality implies ∥η∥=∣λ∣2∥η∥ and ∣λ∣=1. Thus θs is unitary for every simple s. For any object, decompose it as a finite orthogonal sum of simples; naturality makes its twist block diagonal with these unitary components, so θX†θX=id⁡X.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Modular nondegeneracy

Definition

Let C be a unitary ribbon fusion category. An object x is transparent if for every simple object y the double braiding

cy,x∘cx,y:x⊗y⟶x⊗y

is the identity. By naturality and additivity, the double braiding on a finite direct sum is block diagonal with the double braidings on its simple summands; therefore an object is transparent exactly when each simple summand is transparent. Finite direct sums include the empty sum, so the zero object is transparent. The category is modular, or nondegenerate, when its transparent simple objects consist only of the tensor unit, equivalently when its transparent objects are exactly the finite direct sums of the tensor unit. This condition is additional to the existence of fusion spaces and a unitary braid action.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Topological spin

Definition

For a simple charge a in a unitary ribbon fusion category, the twist component is an endomorphism θa∈End⁡(a). Since End⁡(a)=Cid⁡a, there is a unique scalar ϑa∈C such that

θa=ϑaid⁡a.

The scalar ϑa is the topological spin of a. Unitarity of the twist gives ∣ϑa∣2id⁡a=θa†θa=id⁡a; since id⁡a≠0, ∣ϑa∣=1.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fusion multiplicity spaces are finite-dimensional inner-product spaces

Statement

Let a,b,c be simple objects in a unitary fusion category. The pairing on Vabc=Hom⁡(a⊗b,c) defined by f∘g†=⟨f,g⟩id⁡c is a finite-dimensional positive-definite Hermitian inner product, linear in the first variable and conjugate-linear in the second.

Facts & Assumptions

Given: a unitary fusion category C and simple objects a,b,c.

[F1]

Unitary fusion category: morphism adjoints are conjugate-linear, reverse composition, and are involutive; each f†f is C∗-positive; a positive scalar endomorphism of a simple object is a nonnegative real multiple of its identity; f†f=0 implies f=0; and morphism spaces are finite-dimensional.

[F2]

Absolutely simple objects: for a simple charge c in this complex fusion category, End⁡(c)=Cid⁡c and id⁡c≠0.

[F3]

Fusion multiplicity space: Vabc=Hom⁡(a⊗b,c) and ⟨f,g⟩ is defined by f∘g†=⟨f,g⟩id⁡c.

Proof

Given: C,a,b,c as above.

1.1F1F2F3given

The category is finite and semisimple, so Vabc is a finite-dimensional complex vector space by [F1]. By [F2], every f∘g†∈End⁡(c) is a unique scalar multiple of the nonzero identity; hence the scalar pairing in [F3] exists and is unique.

1.2F1F2F3algebra

For scalars λ,μ∈C and f,h,g∈Vabc, linearity of composition gives (λf+μh)g†=λfg†+μhg†, while conjugate-linearity of dagger gives f(λg+μh)†=λˉfg†+μˉfh†. Taking the unique scalar coefficients from [F2] proves linearity in the first argument and conjugate-linearity in the second. Taking daggers of fg†=⟨f,g⟩id⁡c gives gf†=⟨f,g⟩‾id⁡c, so ⟨g,f⟩=⟨f,g⟩‾.

1.3F1F2F3algebra

For each f∈Vabc, ff†=(f†)†∘f† is positive in End⁡(c) by [F1], so its scalar coefficient ⟨f,f⟩ is real and nonnegative. If ⟨f,f⟩=0, then (f†)†∘f†=0; the nondegeneracy clause of [F1], applied to the morphism f†, gives f†=0 and then f=0. Thus ⟨f,f⟩>0 whenever f≠0.

2.1step 1.1step 1.2step 1.3∎

The pairing is finite-dimensional by step 1.1, sesquilinear and Hermitian by step 1.2, and positive definite by step 1.3. If Vabc=0, scalar uniqueness in step 1.1 still holds and positive definiteness is vacuous because there are no nonzero vectors. These are exactly the inner-product axioms, with the stated linear-first convention.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Multiplicity-aware fusion-tree basis

Definition

Let C be a unitary fusion category and fix a set Irr⁡(C) of representatives for the simple isomorphism classes, with the tensor unit 1 itself representing its class. Throughout this definition, the ordered input charges a1,…,an, total charge d, and all internal edge charges are labels in Irr⁡(C). Also fix a parenthesized binary fusion tree. At each internal vertex with incoming charges x,y and outgoing charge z, choose one vector from an orthonormal basis of Vxyz. An admissible labeling assigns a representative charge to each internal edge so that each chosen vertex basis is nonempty; a separate multiplicity-basis index is retained at every vertex. Compose the vertex morphisms, inserting the associators required by the chosen tree, to obtain a morphism from the parenthesized input tensor to d. These composite morphisms are the fusion-tree vectors. The family is called a fusion-tree basis when it is an orthonormal basis of the fixed-input, fixed-total fusion space. For the empty input list the tensor is 1 and its empty tree vector is id⁡1 when d=1; for one input a1, the only tree vector is id⁡a1 when d=a1. The next local lemma proves the basis property for every finite input list and includes the dimension recursion (Fusion-tree basis and dimension recursion ↗).

Tree convention

The left-associated three-input tree has leaves a,b,c in that order, internal charge e after fusing a,b, and output d after fusing e,c:

abced

The drawing records only the parenthesization and edge labels. The basis vector is the composite morphism specified above; no proof depends on the diagram.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Fusion-basis gauge change

Definition

A fusion-basis gauge change chooses, for every triple of simple charges a,b,c, a unitary matrix Gabc changing the orthonormal basis of Vabc. The convention is that the new basis columns are the old basis columns multiplied by Gabc. On a recoupling block this gives

F′=GR−1FGL,

where GL and GR are the direct sums of tensor products of the vertex changes on the source and target trees. On an exchange block it gives

R′=(Gbac)−1RGabc.

The matrices change with the bases; the underlying categorical maps do not.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

R-symbol as a channel exchange map

Definition

Let a,b,c be simple objects in a unitary braided fusion category, with braiding ca,b:a⊗b→b⊗a as in Braiding. The typed channel-exchange map on Vabc=Hom⁡(a⊗b,c) is the pullback

Rabc(f):=f∘ca,b−1∈Vbac.

Choose orthonormal bases in the two multiplicity spaces. The matrix of Rabc in these bases is the R-symbol Rabc. This pullback convention fixes the orientation of the coordinate exchange; reversing the braiding orientation replaces it by the inverse convention. If the spaces are zero-dimensional, the braiding isomorphism identifies both with 0 and the R-symbol is the unique empty 0×0 matrix.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Fusion-tree basis and dimension recursion

Statement

Let C be a unitary fusion category, let Irr⁡(C) be the representative set fixed in Multiplicity-aware fusion-tree basis, and take a1,…,an,d∈Irr⁡(C). Fix any parenthesized binary tree T on the ordered input list. The fusion-tree vectors of Multiplicity-aware fusion-tree basis form an orthonormal basis of Hom⁡(T,d). For n≥2, their number is

mT(d)=∑ℓ admissible, with every internal label in Irr⁡(C)  ∏v internalNℓ(vL) ℓ(vR)ℓ(v),

where the sum runs over charge labelings only (the product counts the vertex multiplicity indices), the leaves carry the inputs, the root carries d, and each internal edge is labeled by a representative simple charge. For the empty tree, m0(d)=1 if d=1 and 0 otherwise; for one input, m1(d)=1 if a1=d and 0 otherwise. The left-associated tree on n≥2 inputs satisfies

mn(d)=∑emn−1(e)Neand(n≥2).

Facts & Assumptions

Given: a unitary fusion category C, a finite ordered list of input representatives ai∈Irr⁡(C), a total-charge representative d∈Irr⁡(C), and a parenthesized binary tree T.

[F1]

Fusion and multifusion categories: a fusion category is finite semisimple and rigid; every object is a finite direct sum of simple objects, and tensor product is bilinear.

[F2]

Unitary fusion category: the dagger is compatible with tensor product, and semisimple direct sums can be chosen orthogonally with isometric inclusions whose orthogonal projections sum to the identity.

[F3]

Multiplicity-aware fusion-tree basis: a fusion-tree vector is obtained by composing vertex multiplicity-basis morphisms along the chosen tree, retaining each internal charge and vertex basis index.

[F4]

Fusion multiplicity spaces are finite-dimensional inner-product spaces: every vertex multiplicity space has a finite-dimensional positive-definite Hermitian inner product with its chosen orthonormal bases.

[F5]

Absolutely simple objects: each simple charge x has End⁡(x)=Cid⁡x.

[F6]

Simple object: a simple object is nonzero and has no proper nonzero subobject.

[F7]

Fusion multiplicity space: the number of basis vectors at a vertex with inputs x,y and output z is Nxyz.

Proof

Given: the category, inputs, output, and tree described above.

1.1F1F3F5F6givenbase

For the empty input list, the tensor is 1. If a nonzero map 1→d exists, its kernel is zero and its image is the nonzero subobject d, so it is an isomorphism by simplicity [F6]. Since all charge labels are fixed representatives, this occurs exactly when d=1; then Hom⁡(1,d)=Cid⁡1 by [F5], and the identity is the empty tree vector. Thus the empty tree has one basis vector precisely for d=1, giving m0(d). For one input a1, the same kernel/image argument shows Hom⁡(a1,d)=0 unless a1=d. In that case End⁡(a1)=Cid⁡a1 by [F5], and the identity is the unique tree vector. This gives m1(d).

1.2F1F2F3F4F5F6F7constructih

Proceed by induction on the number of leaves. Write a nontrivial tree as T=TL⊗TR, with left and right input sublists. By induction, for each simple representative output e the left-tree vectors te,λ form an orthonormal basis of Hom⁡(TL,e). Put ie,λ:=te,λ†:e→TL. If e=e′, then ie,λ†ie,λ′=δλ,λ′id⁡e by [F4]; if e≠e′, the same composite is zero because a nonzero map between nonisomorphic simple objects is an isomorphism [F1, F6]. Thus these inclusions are orthogonal. Choose a finite semisimple decomposition of TL into simple representatives by [F1], and choose this decomposition orthogonally by [F2], so its inclusions are orthogonal and its adjoint projections sum to id⁡TL. For each simple representative e, its adjoint projections form an orthonormal family in Hom⁡(TL,e). Semisimplicity decomposes this Hom space as the direct sum of Hom⁡(f,e) over the simple representative summands f of TL; only f=e contributes, and that space has dimension one by [F5]. Thus the projections form a basis. Changing that basis to te,λ multiplies the inclusion columns by a unitary matrix, which preserves orthogonality and the sum-of-projections identity. The same argument applies to TR. Tensoring the child inclusions preserves these relations by [F2]. For each pair of child outputs e,f, choose an orthogonal finite semisimple decomposition of e⊗f into simple representatives, as permitted by [F1] and [F2]; the number of copies of d is Nefd by [F1] and [F7]. Composing the child inclusions with an orthonormal basis of each Vefd gives orthogonal isometric inclusions of d into T. Summing these range projections over all simple outputs gives id⁡T, because the child decompositions and each decomposition of e⊗f do. The fixed-d subfamily sums to the d-isotypic projection Pd. Every map f:T→d vanishes on all other simple-output summands by [F5] and [F6], so f=fPd. Taking adjoints of the fixed-d inclusions therefore gives a complete orthonormal basis of Hom⁡(T,d), exactly the fusion-tree vectors of [F3].

2.1F1F3F4step 1.2algebra

For each pair of representative child outputs e,f, the construction in step 1.2 contributes mTL(e)mTR(f)Nefd tree vectors. Summing over all representative e,f yields the recurrence mT(d)=∑e,fmTL(e)mTR(f)Nefd. Repeated expansion of this finite recurrence chooses one representative label at each internal edge and one basis index at each vertex, so it equals the displayed sum of products over all admissible labelings.

3.1F1F4F5F6step 1.1step 2.1step 1.2discharge-induction: step 1.2∎

For the left-associated tree, the right subtree at the last vertex is the single input an. Its only nonzero simple output is an, with multiplicity one by [F5] and [F6]. Substituting this into the recurrence of step 2.1 gives mn(d)=∑emn−1(e)Neand for n≥2, with the empty and one-input values already established in step 1.1. Every sum is finite because the set of simple charges and each multiplicity space are finite.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

R-symbol unitarity

Statement

In a unitary braided fusion category, every R-symbol matrix in orthonormal multiplicity bases is unitary.

Facts & Assumptions

Given: a unitary braided fusion category and simple charges a,b,c.

[F1]

Unitary fusion category: the braiding is a unitary isomorphism, so ca,b†=ca,b−1.

[F2]

R-symbol as a channel exchange map: the channel map is Rabc(f)=f∘ca,b−1 from Vabc to Vbac.

[F3]

Fusion multiplicity spaces are finite-dimensional inner-product spaces: on either multiplicity space, ⟨f,g⟩id⁡c=f∘g†.

Proof

1.1F1F2construct

The map Rabc is invertible: its inverse sends g∈Vbac to g∘ca,b. Indeed, composing either way cancels ca,b−1 with ca,b by [F2].

1.2F1F2F3algebra

For f,g∈Vabc, the inner product of their images is (f∘ca,b−1)∘(g∘ca,b−1)†=f∘ca,b−1∘ca,b∘g†=f∘g†. The middle equality uses (g∘c−1)†=c∘g† from [F1] and contravariance of dagger. Thus [F3] shows that Rabc preserves the inner product.

2.1F1F2step 1.1step 1.2∎

In the orthonormal bases used to define Rabc, step 1.2 gives (Rabc)†Rabc=I, and step 1.1 gives invertibility. Therefore Rabc is unitary; when both spaces have dimension zero this is the empty identity matrix.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

F-symbol as a recoupling matrix

Definition

Let a,b,c,d be simple charges in a unitary fusion category, and put PL=((a⊗b)⊗c) and PR=a⊗(b⊗c). The local fusion-tree basis result Fusion-tree basis and dimension recursion identifies

HL:=⨁eVabe⊗VecdwithHom⁡(PL,d),

and

HR:=⨁fVbcf⊗VafdwithHom⁡(PR,d),

by the corresponding tree compositions. These direct sums carry the orthonormal left- and right-tree bases. If μ:a⊗b→e and ν:e⊗c→d are vertex basis maps, write Le,μ,ν:=ν∘(μ⊗id⁡c):PL→d. If ρ:b⊗c→f and σ:a⊗f→d are vertex basis maps, write Rf,ρ,σ:=σ∘(id⁡a⊗ρ):PR→d. Let αa,b,c:PL→PR be the associator. Define the F-symbol matrix Fdabc by

Le,μ,ν∘αa,b,c−1=∑f,ρ,σFdabc[(f,ρ,σ),(e,μ,ν)]Rf,ρ,σ.

Rows index target-tree labels and multiplicity indices; columns index source-tree labels and multiplicity indices. The sums retain every fusion channel and every multiplicity coordinate. If the fixed-total fusion space is zero-dimensional, the F-symbol is the unique empty 0×0 matrix.

Associator convention

The object-level associator is drawn below. The F matrix records its induced change of coordinates on the Hom spaces by the inverse-precomposition rule in the Definition; the diagram is only a convention aid.

((a¬b)¬c)a¬(b¬c)®a;b;c
TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

F-symbol unitarity

Statement

Every F-symbol matrix in orthonormal fusion-tree bases of a unitary fusion category is unitary.

Facts & Assumptions

Given: a unitary fusion category and simple charges a,b,c,d.

[F1]

F-symbol as a recoupling matrix: the F-symbol matrix is the coordinate matrix of f↦f∘αa,b,c−1 from the left-tree Hom basis to the right-tree Hom basis.

[F2]

Unitary fusion category: the dagger is conjugate-linear and reverses composition, and the associator is unitary, αa,b,c†=αa,b,c−1.

[F3]

Fusion multiplicity spaces are finite-dimensional inner-product spaces: for simple x,y,z, the vertex space Vxyz has the positive Hermitian pairing ⟨f,g⟩id⁡z=f∘g†, linear in the first variable.

[F4]

Fusion-tree basis and dimension recursion: both tree families in [F1] are orthonormal bases of their fixed-input, fixed-total fusion spaces.

Proof

1.1F2F3F4algebra

For either tree domain X, let (uj) be its complete tree basis from [F4]. Composing the orthonormal vertex identities of [F3] along the tree, as in [F4], gives uj∘uk†=δjkid⁡d. Consequently, for f=∑jfjuj and g=∑jgjuj, conjugate-linearity of the dagger gives f∘g†=(∑jfjgj‾)id⁡d. Thus the coordinate inner product satisfies ⟨f,g⟩id⁡d=f∘g† on both tree Hom spaces, although X need not be simple.

2.1F1F2step 1.1algebra

Let T(f)=f∘αa,b,c−1. For maps f,g in the left-tree Hom space, step 1.1 and unitarity of α give ⟨T(f),T(g)⟩id⁡d=(f∘α−1)∘(g∘α−1)†=f∘α−1∘α∘g†=⟨f,g⟩id⁡d. Since d is a nonzero simple object, its identity is nonzero, so T preserves inner products.

3.1F1F4step 2.1algebra∎

The associator is an isomorphism, so T is bijective. By [F1], its coordinate matrix in the orthonormal bases of [F4] is Fdabc. A bijective inner-product-preserving linear map has a matrix F satisfying F†F=FF†=I in orthonormal bases; if the space is zero, F is the empty identity matrix. Hence this F-symbol is unitary.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Hexagon in F/R coordinates

Statement

Let C be a unitary braided fusion category with associator α and braiding c. For all objects X,Y,Z, its two hexagons are

αY,Z,X∘cX,Y⊗Z∘αX,Y,Z=(id⁡Y⊗cX,Z)∘αY,X,Z∘(cX,Y⊗id⁡Z),

αZ,X,Y−1∘cX⊗Y,Z∘αX,Y,Z−1=(cX,Z⊗id⁡Y)∘αX,Z,Y−1∘(id⁡X⊗cY,Z).

For simple input charges and a fixed simple total charge, the two route matrices in each equation are equal in fusion-tree coordinates. Each entry is the sum over all intermediate simple charges and multiplicity indices of the products of the corresponding F- and R-block entries.

Facts & Assumptions

Given: a braided fusion category, simple input charges, a simple total charge, and the orthonormal fusion-tree bases.

[F1]

Braiding: the braiding is a natural isomorphism and satisfies the two hexagon equations displayed in the Statement.

[F2]

F-symbol as a recoupling matrix: each associator change between tree bases is represented by the corresponding F block, with all multiplicity indices.

[F3]

R-symbol as a channel exchange map: each braiding exchange on a channel is represented by the corresponding typed R block.

[F4]

Fusion-tree basis and dimension recursion: each intermediate tree space has a complete basis indexed by all admissible simple labels and vertex multiplicity indices.

Proof

1.1F2F3F4construct

On a fixed fusion-tree basis, the matrix of each associator factor is the appropriate F block by [F2], and the matrix of each channel exchange is the appropriate R block by [F3]. An identity factor preserves all untouched labels and multiplicity indices. If a braiding input is a tensor product rather than a simple charge, decompose it into its finite simple summands; its matrix is the resulting finite block matrix, with the summand and multiplicity indices kept. Thus every factor in either hexagon composite has a specified finite matrix.

2.1F1F2F3F4step 1.1algebra

For the first hexagon, let M1,M2,M3 be the matrices of αX,Y,Z, cX,Y⊗Z, and αY,Z,X in order along its left route, and let N1,N2,N3 be those of cX,Y⊗id⁡Z, αY,X,Z, and id⁡Y⊗cX,Z along its right route. For fixed endpoint indices x,z, the entries are respectively ∑u,v(M3)z,v(M2)v,u(M1)u,x and ∑u′,v′(N3)z,v′(N2)v′,u′(N1)u′,x. Every intermediate index is the full tuple of simple charges and vertex multiplicity indices for that tree. The two structural maps are equal by the first hexagon [F1], so their coordinate entries and these finite sums are equal.

2.2F1F2F3F4step 1.1algebra

For the second hexagon, let P1,P2,P3 be the matrices of αX,Y,Z−1, cX⊗Y,Z, and αZ,X,Y−1 along its left route; let Q1,Q2,Q3 be those of id⁡X⊗cY,Z, αX,Z,Y−1, and cX,Z⊗id⁡Y along its right route. The entries at fixed endpoints are ∑u,v(P3)z,v(P2)v,u(P1)u,x and ∑u′,v′(Q3)z,v′(Q2)v′,u′(Q1)u′,x. The indices again range over every simple intermediate charge and multiplicity coordinate. The second root hexagon [F1] makes the structural maps equal, so the two finite sums agree.

3.1step 2.1step 2.2∎

The two matrix equalities in steps 2.1 and 2.2 are the coordinate forms of the first and second hexagons, respectively, and each includes all admissible intermediate labels and multiplicities.

Hexagon diagrams

The first diagram shows the two routes from (X⊗Y)⊗Z to Y⊗(Z⊗X); the second shows the routes from X⊗(Y⊗Z) to (Z⊗X)⊗Y. The arrow labels are exactly the maps in the two displayed equations. They illustrate the equations; the proof above uses the typed composites and their matrix coefficients.

diagram failed to render:
((X\otimes Y)\otimes Z)
  \arrow[r,"\alpha_{X,Y,Z}"]
  \arrow[d,"c_{X,Y}\otimes\operatorname{id}_Z"']
& X\otimes(Y\otimes Z)
  \arrow[r,"c_{X,Y\otimes Z}"]
& (Y\otimes Z)\otimes X
  \arrow[d,"\alpha_{Y,Z,X}"] \\
(Y\otimes X)\otimes Z
  \arrow[r,"\alpha_{Y,X,Z}"']
& Y\otimes(X\otimes Z)
  \arrow[r,"\operatorname{id}_Y\otimes c_{X,Z}"']
& Y\otimes(Z\otimes X)
diagram failed to render:
X\otimes(Y\otimes Z)
  \arrow[r,"\operatorname{id}_X\otimes c_{Y,Z}"]
  \arrow[d,"\alpha_{X,Y,Z}^{-1}"']
& X\otimes(Z\otimes Y)
  \arrow[r,"\alpha_{X,Z,Y}^{-1}"]
& (X\otimes Z)\otimes Y
  \arrow[d,"c_{X,Z}\otimes\operatorname{id}_Y"] \\
(X\otimes Y)\otimes Z
  \arrow[r,"c_{X\otimes Y,Z}"']
& Z\otimes(X\otimes Y)
  \arrow[r,"\alpha_{Z,X,Y}^{-1}"']
& (Z\otimes X)\otimes Y
TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Pentagon in fusion-tree coordinates

Statement

Let a,b,c,d be four simple input charges and t a simple total charge. The root associator identity

αa,b,c⊗d∘αa⊗b,c,d=(id⁡a⊗αb,c,d)∘αa,b⊗c,d∘(αa,b,c⊗id⁡d)

has equal matrices along its two routes in the fusion-tree bases. If A1,A2,A3 are the three successive matrices on the right and A4,A5 the two successive matrices on the left, then

A3A2A1=A5A4.

Each matrix coefficient sums over every intermediate simple charge and every multiplicity-basis index.

Facts & Assumptions

Given: a unitary fusion category, simple objects a,b,c,d, and a simple total charge t.

[F1]

Monoidal category: the associator satisfies the pentagon equation displayed in the Statement for all objects, including tensor products that are not simple.

[F2]

F-symbol as a recoupling matrix: an associator move between two fusion-tree bases has matrix F, with the row/column convention and all vertex multiplicity indices specified there.

[F3]

Fusion-tree basis and dimension recursion: each parenthesized tree basis is a complete orthonormal basis indexed by all admissible internal charges and vertex multiplicity indices.

Proof

1.1F1F2F3construct

Fix the source and target parenthesized tensor products in the pentagon. For each intermediate parenthesization, decompose every tensor product into simple summands and choose the tree basis of [F3]. Each associator in [F1] acts on these coordinates by the appropriate direct sum of F blocks from [F2], with identity factors on vertices it does not change. Thus the two sides of [F1] have coordinate matrices A3A2A1 and A5A4, respectively.

2.1F1F2F3step 1.1algebra

For fixed endpoint basis indices x and z, let u,v range over the complete composite indices of the two intermediate trees on the three-move route, and let w range over the complete composite indices of the intermediate tree on the two-move route. Matrix multiplication gives ∑u,v(A3)z,v(A2)v,u(A1)u,x=∑w(A5)z,w(A4)w,x. Here each composite index consists of every simple internal charge together with every multiplicity-basis index at its vertices. Equality follows because the morphisms in [F1] are equal and [F3] supplies bases of the same Hom space; coordinates in a basis are unique.

3.1F3step 2.1∎

The endpoint indices x,z were arbitrary, so all entries of the two route matrices agree, proving A3A2A1=A5A4 with all intermediate charge and multiplicity sums included. All sums are finite by finite semisimplicity.

Pentagon diagram

The vertices are the five parenthesizations of a⊗b⊗c⊗d; each arrow is the indicated associator. The diagram encodes exactly the two composites stated and proved above; the proof uses the equations and coordinate expansion, not the drawing.

diagram failed to render:
((a\otimes b)\otimes c)\otimes d
  \arrow[r,"\alpha_{a\otimes b,c,d}"]
  \arrow[d,"\alpha_{a,b,c}\otimes\operatorname{id}_d"']
& (a\otimes b)\otimes(c\otimes d)
  \arrow[r,"\alpha_{a,b,c\otimes d}"]
& a\otimes(b\otimes(c\otimes d)) \\
(a\otimes(b\otimes c))\otimes d
  \arrow[r,"\alpha_{a,b\otimes c,d}"']
& a\otimes((b\otimes c)\otimes d)
  \arrow[ru,"\operatorname{id}_a\otimes\alpha_{b,c,d}"']
&
TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Algebraic braid relations do not imply unitarity

Statement refuted

The claim refuted is that an algebraic Yang–Baxter or Hecke relation by itself guarantees that the resulting braid-group representation is unitary for some positive-definite inner product.

Facts & Assumptions

Given: the monoidal category of finite-dimensional complex vector spaces with its usual tensor product, X=C, R=2id⁡X⊗X, and the three-strand braid group B3.

[F1]

Yang–Baxter operators on an object: a Yang–Baxter operator is an invertible map R:X⊗X→X⊗X satisfying the cubic braid equation on X⊗3.

[F2]

A Yang–Baxter operator gives braid-group representations: such an operator gives a homomorphism ρn:Bn→Aut⁡(X⊗n) with ρn(σi)=Ri.

[F3]

The braid group by Artin presentation: B3 has generators σ1,σ2 and relation σ1σ2σ1=σ2σ1σ2.

[F4]

The generic type-A Hecke algebra: in the root normalization the specialized Hecke relation is (Ti−v)(Ti+1)=0.

[F5]

Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary operator on a finite-dimensional complex inner-product space is an invertible linear isometry, hence preserves the induced norm.

[F6]

Real and complex inner-product spaces and their induced length: the inner product is linear in the first variable, conjugate-linear in the second, and positive definite; these axioms give the scalar norm calculation used below.

Counterexample

1.1givenF1algebra

The map R=2id⁡X⊗X is invertible. In the C-linear strictification used by [F1], the transported map is 2id⁡ on X′⊗X′. Hence both local operators on X′⊗3 are 2id⁡, and each side of the Yang–Baxter equation is 8id⁡. Thus [F1] applies without identifying the tensor power with the original object C.

2.1F2F3F4step 1.1algebra

By [F2] and [F3], σ1 and σ2 act by 2I and their braid relator holds, since both sides are 8I. At the root Hecke parameter v=2, the valid specialization Z[v±1]→C sends each Ti to 2 and satisfies the root quadratic equation (2−2)(2+1)=0. Thus the scalar action also satisfies the Hecke quadratic relation in the stated normalization.

3.1F5F6givenalgebra∎

For any positive-definite inner product and any nonzero z∈C, [F6] and nonnegativity of the norm give ∥2z∥=2∥z∥≠∥z∥. By [F5], the generator 2I is not unitary for any such inner product. Therefore these algebraic braid and Hecke relations do not force unitarity.

Remarks

This example uses the repository's v-normalization (Ti−v)(Ti+1)=0. It does not rule out unitary representations at other parameters or after a positive dagger structure has been separately specified. The compact-group averaging lemma Averaging a Hermitian form unitarizes a finite-dimensional compact-group representation does not apply to the discrete infinite group B3; the exponent-sum map Exponent sum and writhe of a braid maps it onto Z.

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Fibonacci fusion data and chiral convention

Example

Take the skeletal complex-linear category whose simple labels are 1,τ and whose objects are finite direct sums of them, including the empty direct sum 0. For objects A=⨁ss⊕ms and B=⨁ss⊕ns, set Hom⁡(A,B)=⨁sMat⁡ns×ms(C); composition is block-matrix multiplication, dagger is conjugate transpose, and the norm is the maximum of the operator norms of its blocks. Thus direct sums are orthogonal. Define tensor product on simple labels by the fusion rules 1⊗a=a⊗1=a and τ⊗τ=1⊕τ, and extend it distributively to direct sums. For each allowed simple fusion channel c⊂a⊗b, let iabc:c→a⊗b be the standard unit-vector isometric inclusion. Since the multiplicity space is Vabc=Hom⁡(a⊗b,c), its orthonormal basis vector is the adjoint projection (iabc)†:a⊗b→c; retain iabc itself for the coevaluation construction below. On simple-label blocks, tensor a pair of morphism matrices by their Kronecker product on multiplicity coordinates and by the identity on each simple fusion channel; extend over direct sums. This defines a bifunctor compatible with dagger. Use the strict unit gauge: every F or R coordinate involving 1 is the identity. Put

ϕ=1+52,u=ϕ−1,v=ϕ−1/2.

The only nontrivial associator blocks are

F1τττ=[1],Fττττ=(uvv−u),

in the intermediate-channel order (1,τ). In the pullback R convention of R-symbol as a channel exchange map, the exchange blocks are

R1ττ=x=e−4πi/5,Rτττ=y=e3πi/5.

Because these are pullback symbols, define the object-level braiding cτ,τ on the 1 and τ summands by x−1 and y−1, respectively. Every braiding with a unit input is the strict identity. These fixed chiral data define the Fibonacci unitary braided fusion category in this gauge; the verification checks every nontrivial pentagon and hexagon sector.

Facts & Assumptions

Given: the simple labels, fusion rules, strict unit gauge, and F/R blocks in the Example.

[F1]

Unitary fusion category: the dagger is conjugate-linear, tensor-compatible, and the associator and unit constraints must be unitary.

[F2]

Fusion multiplicity space: the multiplicity at a vertex is Nabc=dim⁡Vabc.

[F3]

Fusion-tree basis and dimension recursion: fusion-space dimensions are the finite sums/products of the vertex multiplicities over admissible internal labels.

[F4]

F-symbol as a recoupling matrix: F is the matrix between left and right fusion-tree bases induced by the associator.

[F5]

R-symbol as a channel exchange map: R is the channel-exchange matrix induced by the braiding in the specified pullback convention.

[F6]

Monoidal category: associators satisfy the pentagon axiom and the unitors satisfy the triangle axiom.

[F7]

Braiding: a braiding is a natural isomorphism satisfying both hexagon identities.

Verification

Given: the fusion, F, and R data in the Example; prove that they define a unitary braided fusion category.

1.1F1F4F5givenalgebra

The positive real choices give u2+u=1, v2=u and u2+v2=1, so the real symmetric block F satisfies F†F=F2=I. All scalar unit-gauge blocks are unitary. The phases x,y have modulus one and x=y2 exactly. To fix the root and sign without a numerical cosine approximation, y5=−1 and y≠−1 give y4−y3+y2−y+1=0. Dividing by y2 shows that z=y+y−1 satisfies z2−z−1=0. Since z=2cos⁡(3π/5)<0, it is (1−5)/2=−u. Thus y2+uy+1=0, with this chosen root, not its conjugate. The object-level braiding has eigenvalues x−1,y−1, so inverse-precomposition gives exactly the stated pullback eigenvalues x,y.

1.2F2F3givenalgebra

Formal fusion-tree labels can be counted before assuming coherence: for a fixed binary tree, enumerate each vertex's allowed outgoing simple label by the displayed fusion rules, and keep its unique channel coordinate. The recursion is mn+1(1)=mn(τ) and mn+1(τ)=mn(1)+mn(τ), with m1(1)=0,m1(τ)=1. Hence m3(1)=1,m3(τ)=2 and m4(1)=2,m4(τ)=3. These are direct-sum coordinate counts; once the category axioms are checked, they are exactly the orthonormal tree counts of [F3]. Zero-dimensional blocks are the unique empty maps.

2.1F4F6step 1.1step 1.2algebra

Pentagon types and unit cases. For four ordered inputs a,b,c,d, name the five trees T0=(((ab)c)d), T1=((a(bc))d), T2=(a((bc)d)), T3=(a(b(cd))), T4=((ab)(cd)). Their two nonroot edge-label coordinates are respectively (ab,abc), (bc,abc), (bc,bcd), (cd,bcd) and (ab,cd), ordered lexicographically with 1<τ. Let A1:T0→T1, A2:T1→T2, A3:T2→T3, A4:T0→T4 and A5:T4→T3 denote the inverse-precomposition matrices of the corresponding associators. Thus the typed pentagon is A3A2A1=A5A4. If an input is the unit, deleting it canonically identifies the endpoint tree-coordinate spaces. Every local move with that unit is identity; each route then contains the same associator on the remaining three inputs, or only identities if fewer than three nonunit inputs remain. Thus every unit-input case holds, including empty blocks. For four τ inputs with total 1, the bases of T0,T1,T2,T3 are (1,τ),(τ,τ), and that of T4 is (1,1),(τ,τ). Fixing the unchanged subtree in each move gives A1=A3=F and A2=A4=A5=I: the latter blocks use either a unit input or the scalar F1τττ=1. Therefore the two routes are F2=I and I.

2.2F2F3F5F7step 1.1step 1.2algebra

Hexagon unit and total-unit cases. In either hexagon, an input unit gives the canonical unit identification for its exchanges and every associator involving it. Deleting that strand reduces the two routes to the same exchange of the other two inputs. For three τ inputs and total 1, the only intermediate charge in either tree is τ, by step 1.2, so the associator is [1]. Exchanging τ with the fused pair has coordinate x, whereas the two successive simple exchanges have product y2. Both typed root hexagons therefore say x=y2, proved in step 1.1.

2.3F1F2F4step 1.1algebra

The unit object is self-dual. The 1 summand of τ⊗τ gives an isometric inclusion i:1→τ⊗τ; set coev⁡=ϕ i and ev⁡=ϕ i†. In either zig-zag composite for τ, the only intermediate channel is 1, so its scalar is ϕϕ Fττττ[1,1]=ϕu=1. The opposite zig-zag uses F−1=F from step 1.1 and has the same coefficient. Hence τ is self-dual; duality extends to finite direct sums, so the category is rigid.

3.1F3F4F6step 1.1step 2.1algebra

All total-τ pentagon entries. In the tree order of step 2.1, each of the five bases is (1,τ),(τ,1),(τ,τ). The moves A1,A3 fix the total of their three-leaf subtree, and mix precisely coordinates one and three; their other coordinate is the scalar total-unit block. The moves A2,A4 fix the pair subtree and mix precisely coordinates two and three. For A5, the fixed cd label is τ in source coordinates one and three; these map to target coordinates two and three by the columns of F. Source coordinate two has cd=1 and maps to target coordinate one with coefficient one. Consequently A1=A3=(u0v010v0−u),A2=A4=(1000uv0v−u),A5=(010u0vv0−u). Exact multiplication using u2+u=1 and v2=u gives A3A2A1=(0uvuu−uvv−uvu2)=A5A4. This exhibits every one of the nine entries, with their source and target bases fixed. Together with step 2.1 it covers both possible totals for every simple-input pentagon.

3.2F1F4F5F7step 1.1step 1.2step 2.2algebra

Both total-τ hexagons, with their types. In the intermediate-pair order (1,τ) put D=diag⁡(x,y) and E=diag⁡(1,y). Here D is a simple pair exchange in the tree where that pair is fused first; E exchanges one τ with the composite pair, whose summands are 1,τ, in the respective source and target composite-channel bases. It is not a braiding on two simple objects. The functor Φ(h)(f)=f∘h−1 satisfies Φ(kh)=Φ(k)Φ(h), so it preserves the displayed order of the typed root composites. For the first root hexagon [F7], the route through associator, composite exchange, associator has matrix FEF; the route through simple exchange, associator, simple exchange has matrix DFD. For the second root hexagon the inverse associators also have matrix F−1=F, giving the same two matrices. Thus both root equations are FEF=DFD, equivalently B2D=EF and DB2=FE, where B2=FDF. Expanding B2 gives entries u2x+uy, uv(x−y), uv(x−y), ux+u2y. The four entries of B2D=EF require exactly x(u2x+uy)=u,ux(x−y)=y,uy(x−y)=1,y(ux+u2y)=−uy. The last entry contains no extra factor u. From step 1.1, y3=u(1−y) and y4=y+u. Therefore the four left sides are respectively u(uy4+y3)=u(u2+u)=u, u(y4−y3)=u(1+u)y=y, u(y3−y2)=u(1+u)=1, and uy(y2+uy)=−uy. This proves all four entries. Transposing gives DB2=FE, since D,B2,E,F are symmetric. Together with step 2.2, all simple-input hexagon sectors hold exactly.

4.1F1F2F4F6F7step 1.1step 2.1step 3.1step 2.2step 3.2step 2.3∎

The matrix Hom spaces and fusion rules give a finite semisimple complex category with simple unit, orthogonal direct sums and the stated C∗ norms. The distributive tensor action on multiplicity matrices is a dagger-compatible bifunctor. On simple inputs choose the associator whose induced inverse-precomposition matrix is the specified F; this is well defined because its object-level block is (F−1)T=F in the only nonscalar case. Choose the object-level braiding eigenvalues x−1,y−1 as specified. Extend both maps by direct sums and identities on copy coordinates. This makes them natural for arbitrary block matrices, not just for scalar maps of simple objects. A pentagon or hexagon on arbitrary direct sums decomposes into the finite simple-input blocks already proved in steps 2.1–3.2; zero summands give empty blocks. The triangle is the identity in the strict unit gauge. Step 1.1 proves unitarity and step 2.3 proves rigidity. Hence these data define the claimed unitary braided fusion category on every finite direct sum. The finite block exhaustion is the full coherence proof; no numerical approximation, unproved category realization or choice principle is used.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

Ising fusion data and chiral convention

Example

Use simple labels 1,ψ,σ with unit fusion and σ⊗σ=1⊕ψ, σ⊗ψ=ψ⊗σ=σ, and ψ⊗ψ=1. In the three-σ, total-σ fusion space, the intermediate-channel basis is (1,ψ). In the pullback R convention of R-symbol as a channel exchange map, fix

Fσσσσ=2−1/2(111−1),R1σσ=e−iπ/8,Rψσσ=e3iπ/8.

These are sector data only. This item makes no claim about an all-label Ising F/R table or global Ising ribbon coherence.

The phases above use the pullback convention in R-symbol as a channel exchange map. In a convention recording the eigenvalues of the object-level braiding itself, the eigenvalues are the inverses of the displayed phases. This convention note does not extend the sector data to any other Ising fusion space.

Facts & Assumptions

Given: the fusion rules and three-σ, total-σ matrices in the Example.

[F1]

Fusion multiplicity space: Nabc is the dimension of Vabc=Hom⁡(a⊗b,c).

[F2]

F-symbol as a recoupling matrix: F is the coordinate matrix between the two orthonormal tree bases.

[F3]

R-symbol as a channel exchange map: R is the channel-exchange matrix in the stated pullback convention.

[F4]

Unitary fusion category: unitarity means preservation of the positive inner products on fusion spaces.

Verification

1.1F1givenalgebra

The three-σ, total-σ space has one left-tree basis vector with intermediate charge 1 and one with intermediate charge ψ: each channel in σ⊗σ=1⊕ψ fuses with the remaining σ to σ. Thus this sector is two-dimensional, with the basis stated in the Example.

1.2F2F4givenalgebra

Let H=2−1/2(111−1). It is real and symmetric, and direct multiplication gives H†H=H2=I2. Hence the displayed F matrix is unitary in the stated basis.

1.3F3F4givenalgebra

Both displayed R entries have modulus one, and their ratio is e3iπ/8/e−iπ/8=eiπ/2=i. Thus each channel exchange is unitary and the relative phase is exactly i.

2.1step 1.1step 1.2step 1.3∎

Steps 1.1–1.3 verify the dimension, recoupling matrix, and exchange phases only in this three-σ, total-σ sector. No all-label associator, pentagon, hexagon, modularity, or ribbon claim is made here.

Sources