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
- Abelian Categories
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Bruhat Decomposition and Flags over Finite Fields
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chains, Antichains, Sperner and Dilworth
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Duality and Rigidity in Monoidal Categories
- Exterior Powers, Orientation and Hodge Duality
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hereditary and Productive Behaviour of the Separation Axioms
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monoidal Categories and Monoidal Functors
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Oriented Links, Braid Closures, and Markov Equivalence
- Polynomial Rings, the Division Algorithm and Roots
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Principal Series Representations of GL N over a Finite Field
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Splitting Fields
- Strictification and Mac Lanes Coherence Theorem
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor and Fusion Categories
- Tensor Fields Exterior Algebra and Differential Forms
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Yang–Baxter Operators and Quantum Braid Representations
- Young Diagrams Tableaux and Permutation Modules
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
Unitary fusion category
Definition
Let be a fusion category over in the sense of Fusion and multifusion categories. A dagger structure assigns to every morphism a morphism , conjugate-linearly, with and . 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, , and . Thus each is a finite-dimensional -algebra. Positive endomorphisms are the elements of its usual -positive cone (equivalently for an endomorphism ); in particular, if is simple and , then is positive exactly when . For any morphism , is positive in ; also require to imply . Semisimple direct-sum decompositions can be chosen orthogonally: their inclusions satisfy for , , and . Tensor product preserves daggers: . Its associator and unit constraints are unitary, meaning , , and .
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 . Positivity and unitarity are extra structure, not consequences of the fusion rules or of the braid relations alone.
Fusion multiplicity space
Definition
Let be simple objects of a unitary fusion category (Unitary fusion category). The fusion multiplicity is
and the corresponding fusion multiplicity space is
Since is absolutely simple (Absolutely simple objects), each has a unique scalar satisfying . 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: may be any nonnegative integer.
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: . 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 be simple, choose its left dual , and let be the coevaluation. A nonzero endomorphism of has zero kernel and image , so it is an isomorphism and is a division algebra. Local finiteness makes it finite-dimensional over . For any , finite-dimensionality gives a nonzero polynomial with . Factor over ; since a division algebra has no zero divisors, one linear factor must vanish, so . Write . The ribbon duality condition and linearity of dualization give . Naturality, , and balancing give The double braiding is unitary, so it preserves the norm of . The zig-zag identity gives ; hence the equality implies and . Thus is unitary for every simple . For any object, decompose it as a finite orthogonal sum of simples; naturality makes its twist block diagonal with these unitary components, so .
Modular nondegeneracy
Definition
Let be a unitary ribbon fusion category. An object is transparent if for every simple object the double braiding
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.
Topological spin
Definition
For a simple charge in a unitary ribbon fusion category, the twist component is an endomorphism . Since , there is a unique scalar such that
The scalar is the topological spin of . Unitarity of the twist gives ; since , .
Fusion multiplicity spaces are finite-dimensional inner-product spaces
Statement
Let be simple objects in a unitary fusion category. The pairing on defined by 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 and simple objects .
Unitary fusion category: morphism adjoints are conjugate-linear, reverse composition, and are involutive; each is -positive; a positive scalar endomorphism of a simple object is a nonnegative real multiple of its identity; implies ; and morphism spaces are finite-dimensional.
Absolutely simple objects: for a simple charge in this complex fusion category, and .
Fusion multiplicity space: and is defined by .
Proof
Given: as above.
The category is finite and semisimple, so is a finite-dimensional complex vector space by [F1]. By [F2], every is a unique scalar multiple of the nonzero identity; hence the scalar pairing in [F3] exists and is unique.
For scalars and , linearity of composition gives , while conjugate-linearity of dagger gives . Taking the unique scalar coefficients from [F2] proves linearity in the first argument and conjugate-linearity in the second. Taking daggers of gives , so .
For each , is positive in by [F1], so its scalar coefficient is real and nonnegative. If , then ; the nondegeneracy clause of [F1], applied to the morphism , gives and then . Thus whenever .
The pairing is finite-dimensional by step 1.1, sesquilinear and Hermitian by step 1.2, and positive definite by step 1.3. If , 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.
Ribbon evaluation and framed anyon links
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let be a unitary ribbon fusion category, let be a simple color, and let and with . If their blackboard-framed, -colored closures are isotopic as framed oriented links, then their root ribbon evaluations satisfy . No modularity assumption is needed. Ordinary Markov stabilization is not a framed isotopy because it changes the framing.
Facts & Assumptions
Given: , a unitary ribbon fusion category , a simple object , and framed-isotopic blackboard closures of and .
The Axiom of Countable Choice (): asserts that every countable family of nonempty sets has a choice function.
Unitary ribbon data: the underlying category has a ribbon structure, so it is a ribbon category in the root sense.
The ribbon evaluation is an invariant of framed colored links: under , in any ribbon category, framed-isotopic blackboard closures of braids with the same color have equal root ribbon evaluations.
The ribbon evaluation of an -colored closed braid: for , is the left categorical trace of the pivotal comparison composed with the braid action; this is the root ribbon-evaluation notation.
Proof
By [F1], is a ribbon category with the same root duality, braiding, and twist structure required by [F2]. The color and the braids meet [F2]'s common-color and positive-strand hypotheses.
The assumed supplies [F2]'s choice hypothesis by [A1]. Since the blackboard-framed closures are framed-isotopic, [F2] gives ; by [F3] these are exactly the root ribbon evaluations named in the Statement. The same root theorem states that ordinary Markov stabilization changes framing, and it uses no modularity hypothesis.
Multiplicity-aware fusion-tree basis
Definition
Let be a unitary fusion category and fix a set of representatives for the simple isomorphism classes, with the tensor unit itself representing its class. Throughout this definition, the ordered input charges , total charge , and all internal edge charges are labels in . Also fix a parenthesized binary fusion tree. At each internal vertex with incoming charges and outgoing charge , choose one vector from an orthonormal basis of . 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 . 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 and its empty tree vector is when ; for one input , the only tree vector is when . 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 in that order, internal charge after fusing , and output after fusing :
The drawing records only the parenthesization and edge labels. The basis vector is the composite morphism specified above; no proof depends on the diagram.
Fusion-basis gauge change
Definition
A fusion-basis gauge change chooses, for every triple of simple charges , a unitary matrix changing the orthonormal basis of . The convention is that the new basis columns are the old basis columns multiplied by . On a recoupling block this gives
where and are the direct sums of tensor products of the vertex changes on the source and target trees. On an exchange block it gives
The matrices change with the bases; the underlying categorical maps do not.
R-symbol as a channel exchange map
Definition
Let be simple objects in a unitary braided fusion category, with braiding as in Braiding. The typed channel-exchange map on is the pullback
Choose orthonormal bases in the two multiplicity spaces. The matrix of in these bases is the R-symbol . 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 and the R-symbol is the unique empty matrix.
Fusion-tree basis and dimension recursion
Statement
Let be a unitary fusion category, let be the representative set fixed in Multiplicity-aware fusion-tree basis, and take . Fix any parenthesized binary tree on the ordered input list. The fusion-tree vectors of Multiplicity-aware fusion-tree basis form an orthonormal basis of . For , their number is
where the sum runs over charge labelings only (the product counts the vertex multiplicity indices), the leaves carry the inputs, the root carries , and each internal edge is labeled by a representative simple charge. For the empty tree, if and otherwise; for one input, if and otherwise. The left-associated tree on inputs satisfies
Facts & Assumptions
Given: a unitary fusion category , a finite ordered list of input representatives , a total-charge representative , and a parenthesized binary tree .
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.
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.
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.
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.
Absolutely simple objects: each simple charge has .
Simple object: a simple object is nonzero and has no proper nonzero subobject.
Fusion multiplicity space: the number of basis vectors at a vertex with inputs and output is .
Proof
Given: the category, inputs, output, and tree described above.
For the empty input list, the tensor is . If a nonzero map exists, its kernel is zero and its image is the nonzero subobject , so it is an isomorphism by simplicity [F6]. Since all charge labels are fixed representatives, this occurs exactly when ; then by [F5], and the identity is the empty tree vector. Thus the empty tree has one basis vector precisely for , giving . For one input , the same kernel/image argument shows unless . In that case by [F5], and the identity is the unique tree vector. This gives .
Proceed by induction on the number of leaves. Write a nontrivial tree as , with left and right input sublists. By induction, for each simple representative output the left-tree vectors form an orthonormal basis of . Put . If , then by [F4]; if , 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 into simple representatives by [F1], and choose this decomposition orthogonally by [F2], so its inclusions are orthogonal and its adjoint projections sum to . For each simple representative , its adjoint projections form an orthonormal family in . Semisimplicity decomposes this Hom space as the direct sum of over the simple representative summands of ; only contributes, and that space has dimension one by [F5]. Thus the projections form a basis. Changing that basis to multiplies the inclusion columns by a unitary matrix, which preserves orthogonality and the sum-of-projections identity. The same argument applies to . Tensoring the child inclusions preserves these relations by [F2]. For each pair of child outputs , choose an orthogonal finite semisimple decomposition of into simple representatives, as permitted by [F1] and [F2]; the number of copies of is by [F1] and [F7]. Composing the child inclusions with an orthonormal basis of each gives orthogonal isometric inclusions of into . Summing these range projections over all simple outputs gives , because the child decompositions and each decomposition of do. The fixed- subfamily sums to the -isotypic projection . Every map vanishes on all other simple-output summands by [F5] and [F6], so . Taking adjoints of the fixed- inclusions therefore gives a complete orthonormal basis of , exactly the fusion-tree vectors of [F3].
For each pair of representative child outputs , the construction in step 1.2 contributes tree vectors. Summing over all representative yields the recurrence . 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.
For the left-associated tree, the right subtree at the last vertex is the single input . Its only nonzero simple output is , with multiplicity one by [F5] and [F6]. Substituting this into the recurrence of step 2.1 gives for , 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.
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 .
Unitary fusion category: the braiding is a unitary isomorphism, so .
R-symbol as a channel exchange map: the channel map is from to .
Fusion multiplicity spaces are finite-dimensional inner-product spaces: on either multiplicity space, .
Proof
The map is invertible: its inverse sends to . Indeed, composing either way cancels with by [F2].
For , the inner product of their images is . The middle equality uses from [F1] and contravariance of dagger. Thus [F3] shows that preserves the inner product.
In the orthonormal bases used to define , step 1.2 gives , and step 1.1 gives invertibility. Therefore is unitary; when both spaces have dimension zero this is the empty identity matrix.
F-symbol as a recoupling matrix
Definition
Let be simple charges in a unitary fusion category, and put and . The local fusion-tree basis result Fusion-tree basis and dimension recursion identifies
and
by the corresponding tree compositions. These direct sums carry the orthonormal left- and right-tree bases. If and are vertex basis maps, write . If and are vertex basis maps, write . Let be the associator. Define the F-symbol matrix by
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 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.
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 .
F-symbol as a recoupling matrix: the F-symbol matrix is the coordinate matrix of from the left-tree Hom basis to the right-tree Hom basis.
Unitary fusion category: the dagger is conjugate-linear and reverses composition, and the associator is unitary, .
Fusion multiplicity spaces are finite-dimensional inner-product spaces: for simple , the vertex space has the positive Hermitian pairing , linear in the first variable.
Fusion-tree basis and dimension recursion: both tree families in [F1] are orthonormal bases of their fixed-input, fixed-total fusion spaces.
Proof
For either tree domain , let be its complete tree basis from [F4]. Composing the orthonormal vertex identities of [F3] along the tree, as in [F4], gives . Consequently, for and , conjugate-linearity of the dagger gives . Thus the coordinate inner product satisfies on both tree Hom spaces, although need not be simple.
Let . For maps in the left-tree Hom space, step 1.1 and unitarity of give . Since is a nonzero simple object, its identity is nonzero, so preserves inner products.
The associator is an isomorphism, so is bijective. By [F1], its coordinate matrix in the orthonormal bases of [F4] is . A bijective inner-product-preserving linear map has a matrix satisfying in orthonormal bases; if the space is zero, is the empty identity matrix. Hence this F-symbol is unitary.
Hexagon in F/R coordinates
Statement
Let be a unitary braided fusion category with associator and braiding . For all objects , its two hexagons are
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.
Braiding: the braiding is a natural isomorphism and satisfies the two hexagon equations displayed in the Statement.
F-symbol as a recoupling matrix: each associator change between tree bases is represented by the corresponding F block, with all multiplicity indices.
R-symbol as a channel exchange map: each braiding exchange on a channel is represented by the corresponding typed R block.
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
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.
For the first hexagon, let be the matrices of , , and in order along its left route, and let be those of , , and along its right route. For fixed endpoint indices , the entries are respectively and . 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.
For the second hexagon, let be the matrices of , , and along its left route; let be those of , , and along its right route. The entries at fixed endpoints are and . 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.
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 to ; the second shows the routes from to . 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 YPentagon in fusion-tree coordinates
Statement
Let be four simple input charges and a simple total charge. The root associator identity
has equal matrices along its two routes in the fusion-tree bases. If are the three successive matrices on the right and the two successive matrices on the left, then
Each matrix coefficient sums over every intermediate simple charge and every multiplicity-basis index.
Facts & Assumptions
Given: a unitary fusion category, simple objects , and a simple total charge .
Monoidal category: the associator satisfies the pentagon equation displayed in the Statement for all objects, including tensor products that are not simple.
F-symbol as a recoupling matrix: an associator move between two fusion-tree bases has matrix , with the row/column convention and all vertex multiplicity indices specified there.
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
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 and , respectively.
For fixed endpoint basis indices and , let range over the complete composite indices of the two intermediate trees on the three-move route, and let range over the complete composite indices of the intermediate tree on the two-move route. Matrix multiplication gives 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.
The endpoint indices were arbitrary, so all entries of the two route matrices agree, proving with all intermediate charge and multiplicity sums included. All sums are finite by finite semisimplicity.
Pentagon diagram
The vertices are the five parenthesizations of ; 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}"']
&Gauge covariance of fusion-space braid actions
Statement
Let 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 , define its action on the corresponding Hom spaces by , from to . Let 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 are the induced source and target tree-basis unitaries, then
In particular, when and all strand charges are the same simple object , the adjacent exchanges act on the same fixed-total fusion space , satisfy the Artin relations, and define a unitary representation , where is the group of invertible linear maps preserving the inner product on . If , this is the unique action on the zero-dimensional space. In that case 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.
Monoidal category: tensor product is a bifunctor, and the associator satisfies the pentagon axiom.
Braiding: each is a natural isomorphism and satisfies both hexagon identities.
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.
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.
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 , and generator maps satisfying those relators extend uniquely to a group homomorphism.
Unitary fusion category, F-symbol unitarity, and R-symbol unitarity: the braiding and every F/R change of orthonormal fusion basis are unitary maps.
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
For three consecutive charges , naturality of the braiding in its first variable, applied to , gives This is an equality from to . Reassociating the target by and expanding each by the second hexagon in [F2] gives the two adjacent Artin composites The cancelled factor is ; the remaining factors are exactly the displayed and . 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.
If two crossings involve disjoint adjacent pairs, reparenthesize the ordered factors as , where collect the outer factors and is the (possibly empty) intervening tensor product. Let and be the two crossings. Suppressing only the canonical parentheses, bifunctoriality gives the typed identity 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.
For identical charges , reassociate each object-level crossing to act on factors , and let its fusion-space operator be . The identity follows by composition: . Consequently the object-level relators proved in steps 1.1–1.2 hold for the as well. By [F5], the generator assignment extends uniquely to . Reassociations are unitary by [F6], and the local exchange matrices are products of unitary F/R blocks from [F6]; hence each and every braid word is unitary.
In any parenthesized tree, let 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 . This also holds for colored words whose source and target lists differ.
For identical charges, and the formula of step 2.2 is conjugation by the single unitary , so for every . If and , then because is unitary. Hence all expectation values, including measurement probabilities represented this way, are unchanged.
Artin relation diagram
Both arrows are the explicit composites and from step 1.1, with each crossing using the braiding 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.
5 · Examples, counterexamples and false statements
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, , , and the three-strand braid group .
Yang–Baxter operators on an object: a Yang–Baxter operator is an invertible map satisfying the cubic braid equation on .
A Yang–Baxter operator gives braid-group representations: such an operator gives a homomorphism with .
The braid group by Artin presentation: has generators and relation .
The generic type-A Hecke algebra: in the root normalization the specialized Hecke relation is .
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.
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
The map is invertible. In the -linear strictification used by [F1], the transported map is on . Hence both local operators on are , and each side of the Yang–Baxter equation is . Thus [F1] applies without identifying the tensor power with the original object .
By [F2] and [F3], and act by and their braid relator holds, since both sides are . At the root Hecke parameter , the valid specialization sends each to and satisfies the root quadratic equation . Thus the scalar action also satisfies the Hecke quadratic relation in the stated normalization.
For any positive-definite inner product and any nonzero , [F6] and nonnegativity of the norm give . By [F5], the generator 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 -normalization . 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 ; the exponent-sum map Exponent sum and writhe of a braid maps it onto .
Fibonacci fusion data and chiral convention
Example
Take the skeletal complex-linear category whose simple labels are and whose objects are finite direct sums of them, including the empty direct sum . For objects and , set ; 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 and , and extend it distributively to direct sums. For each allowed simple fusion channel , let be the standard unit-vector isometric inclusion. Since the multiplicity space is , its orthonormal basis vector is the adjoint projection ; retain 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 is the identity. Put
The only nontrivial associator blocks are
in the intermediate-channel order . In the pullback R convention of R-symbol as a channel exchange map, the exchange blocks are
Because these are pullback symbols, define the object-level braiding on the and summands by and , 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.
Unitary fusion category: the dagger is conjugate-linear, tensor-compatible, and the associator and unit constraints must be unitary.
Fusion multiplicity space: the multiplicity at a vertex is .
Fusion-tree basis and dimension recursion: fusion-space dimensions are the finite sums/products of the vertex multiplicities over admissible internal labels.
F-symbol as a recoupling matrix: F is the matrix between left and right fusion-tree bases induced by the associator.
R-symbol as a channel exchange map: R is the channel-exchange matrix induced by the braiding in the specified pullback convention.
Monoidal category: associators satisfy the pentagon axiom and the unitors satisfy the triangle axiom.
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.
The positive real choices give , and , so the real symmetric block satisfies . All scalar unit-gauge blocks are unitary. The phases have modulus one and exactly. To fix the root and sign without a numerical cosine approximation, and give . Dividing by shows that satisfies . Since , it is . Thus , with this chosen root, not its conjugate. The object-level braiding has eigenvalues , so inverse-precomposition gives exactly the stated pullback eigenvalues .
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 and , with . Hence and . 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.
Pentagon types and unit cases. For four ordered inputs , name the five trees , , , , . Their two nonroot edge-label coordinates are respectively , , , and , ordered lexicographically with . Let , , , and denote the inverse-precomposition matrices of the corresponding associators. Thus the typed pentagon is . 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 , the bases of are , and that of is . Fixing the unchanged subtree in each move gives and : the latter blocks use either a unit input or the scalar . Therefore the two routes are and .
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 , the only intermediate charge in either tree is , by step 1.2, so the associator is . Exchanging with the fused pair has coordinate , whereas the two successive simple exchanges have product . Both typed root hexagons therefore say , proved in step 1.1.
The unit object is self-dual. The summand of gives an isometric inclusion ; set and . In either zig-zag composite for , the only intermediate channel is , so its scalar is . The opposite zig-zag uses from step 1.1 and has the same coefficient. Hence is self-dual; duality extends to finite direct sums, so the category is rigid.
All total- pentagon entries. In the tree order of step 2.1, each of the five bases is . The moves 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 fix the pair subtree and mix precisely coordinates two and three. For , the fixed label is in source coordinates one and three; these map to target coordinates two and three by the columns of . Source coordinate two has and maps to target coordinate one with coefficient one. Consequently Exact multiplication using and gives 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.
Both total- hexagons, with their types. In the intermediate-pair order put and . Here is a simple pair exchange in the tree where that pair is fused first; exchanges one with the composite pair, whose summands are , in the respective source and target composite-channel bases. It is not a braiding on two simple objects. The functor satisfies , 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 ; the route through simple exchange, associator, simple exchange has matrix . For the second root hexagon the inverse associators also have matrix , giving the same two matrices. Thus both root equations are , equivalently and , where . Expanding gives entries , , , . The four entries of require exactly The last entry contains no extra factor . From step 1.1, and . Therefore the four left sides are respectively , , , and . This proves all four entries. Transposing gives , since are symmetric. Together with step 2.2, all simple-input hexagon sectors hold exactly.
The matrix Hom spaces and fusion rules give a finite semisimple complex category with simple unit, orthogonal direct sums and the stated 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 ; this is well defined because its object-level block is in the only nonscalar case. Choose the object-level braiding eigenvalues 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.
Ising fusion data and chiral convention
Example
Use simple labels with unit fusion and , , and . In the three-, total- fusion space, the intermediate-channel basis is . In the pullback R convention of R-symbol as a channel exchange map, fix
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.
Fusion multiplicity space: is the dimension of .
F-symbol as a recoupling matrix: is the coordinate matrix between the two orthonormal tree bases.
R-symbol as a channel exchange map: is the channel-exchange matrix in the stated pullback convention.
Unitary fusion category: unitarity means preservation of the positive inner products on fusion spaces.
Verification
The three-, total- space has one left-tree basis vector with intermediate charge and one with intermediate charge : each channel in fuses with the remaining to . Thus this sector is two-dimensional, with the basis stated in the Example.
Let . It is real and symmetric, and direct multiplication gives . Hence the displayed F matrix is unitary in the stated basis.
Both displayed R entries have modulus one, and their ratio is . Thus each channel exchange is unitary and the relative phase is exactly .
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.