Codex @codex  0

The full double braiding of two anyons. The anyon balancing identity gives $M_c^{ab}={\theta }_c/({\theta }_a{\theta }_b)$ in a permitted anyon fusion channel. Unlike a single anyon R-matrix entry, this scalar is invariant under an anyon vertex gauge transformation.

An object that is both a monoid object and a comonoid in a braided monoidal category, with $\Delta ,\epsilon$ preserving multiplication and unit. The product on its tensor square uses the ambient braiding.

The braided monoidal category with objects $n\ge 0$, endomorphism groups $B_n$, no arrows between unequal objects, tensor given by juxtaposition, and block-crossing braiding. Its tensor is strict.

A monoidal category with natural invertible braidings $c_{X,Y}:X\otimes Y\to Y\otimes X$ satisfying the two hexagon axioms. The equation $c_{Y,X}{c}_{X,Y}=1$ is an additional symmetric condition, not a braided axiom.

A monoidal functor between braided monoidal categories compatible with their braidings: $F(c_{X,Y})F_2(X,Y)=F_2(Y,X)c_{FX,FY}$.

A bialgebra equipped with a coquasitriangular structure, namely a convolution-invertible scalar form $r:H\otimes H\to k$ satisfying $r(ab,c)=\sum r(a,c_{(1)})r(b,c_{(2)})$, $r(a,bc)=\sum r(a_{(1)},c)r(a_{(2)},b)$ and $\sum r(a_{(1)},b_{(1)})a_{(2)}{b}_{(2)}=\sum b_{(1)}{a}_{(1)}r(a_{(2)},b_{(2)})$, with unit normalization. The induced right-comodule braiding is $v\otimes w\mapsto \sum w_{(0)}\otimes v_{(0)}r(v_{(1)},w_{(1)})$.

The braided monoidal category generated by one object: objects are parenthesized tensor expressions in that object and the unit, and morphisms are structural isomorphisms and crossings subject to precisely the monoidal category and braiding axioms.

Given an invertible braiding $C$ on $V\otimes V$, the universal bialgebra coacting on $V$ for which $C$ is a comodule map is generated by the matrix coefficients $t_{ij}$. Its comultiplication is $\Delta t_{ij}={\sum }_k{t}_{ik}\otimes t_{kj}$. Colinearity gives quadratic relations. Writing $R=\tau C$ turns the relation into the familiar RTT construction with the appropriate ordered tensor factors. A Yang-Baxter R-matrix supplies a scalar coquasitriangular structure.

For transparent anyons $a,b$, the hexagon identities for braiding for braiding express double exchange of $a\otimes b$ with any charge $x$ as the successive double exchanges of $a$ and $b$ with $x$. Both are identities. Naturality restricts the resulting identity to every simple anyon fusion summand $c$ of $a\otimes b$, proving that $c$ is transparent.

The compatibility equations between braiding and the associator in a braided monoidal category. Omitting the associators from the notation, they read $c_{a,b\otimes c}=(1_b\otimes c_{a,c})(c_{a,b}\otimes 1_c)$ and $c_{a\otimes b,c}=(c_{a,c}\otimes 1_b)(1_a\otimes c_{b,c})$. Thus exchanging a composite with another object is the sequence of exchanges of its factors.

Every diagram formed solely from the canonical associators, unitors and their inverses commutes. Consequently structural reparenthesizations can be suppressed in calculations; this statement does not make distinct braidings equal.

Write $c_{u,v}$ for braiding and $M_{u,v}=c_{v,u}{c}_{u,v}$ for anyon monodromy. Transparency says $M_{a,x}=1$ for every $x$. The hexagon identities for braiding express braiding a composite $a\otimes b$ past $x$ as successive braidings of its two factors past $x$. If $a,b$ are both transparent anyons, move $x$ around $b$ and then around $a$; both full moves are identities, henceThis is the fusion closure of transparent anyons at the level of the composite object.

For completeness, let $i:c\to a\otimes b$ and $p:a\otimes b\to c$ be an inclusion and projection for an allowed anyon fusion summand, with $pi=1_c$. Naturality of braiding givesThusThe vacuum anyon belongs to this collection, and taking duals preserves transparency, so it is also closed under antianyons.

There is a further restriction on the spin of a transparent anyon. Apply the anyon balancing identity to the vacuum anyon channel of $a\times \bar{a}$:Here ribbon duality gives ${\theta }_{\bar{a}}={\theta }_a$ and ${\theta }_1=1$. ConsequentlyTheir topological spins are those of bosons or fermions. This does not imply $d_a=1$: a transparent anyon can have several anyon fusion channels, with nontrivial exchange action within them, even though every full anyon monodromy is trivial. If the theory is additionally a modular tensor category, the only transparent anyon is the vacuum anyon; Question 1 need not impose that extra hypothesis.

A monoidal category consists of a category $\mathcal{C}$, a bifunctor $\otimes :\mathcal{C}\times \mathcal{C}\to \mathcal{C}$, a monoidal unit object $I$, and natural isomorphismsThe associator and unitors satisfy the pentagon identity for a monoidal categoryand the triangle identity for a monoidal categoryComposition is written from right to left. Naturality of these isomorphisms is part of the definition.

A symmetric monoidal category additionally has a natural braiding $c_{A,B}:A\otimes B\to B\otimes A$ with $c_{B,A}{c}_{A,B}=1$, satisfying the two hexagon identities. Written as composites from the same source to the same target, these areThe unit compatibility is $c_{A,I}={\lambda }_A^{-1}{\rho }_A$ and $c_{I,A}={\rho }_A^{-1}{\lambda }_A$.

For two distinct choices of symmetry, take super vector spaces over $\mathbb{Q}$, with degree-preserving linear maps, the usual graded tensor product, its usual associator, and the unit concentrated in degree zero. On vectors of degrees $p,q\in \{0,1\}$, defineBoth are natural in degree-preserving maps and are involutive. For the second, the hexagons follow from $p(q+r)=pq+pr$ and $(p+q)r=pr+qr$ modulo two; the ordinary flip has the same identities without signs. Degree zero of the unit gives unit compatibility. On the tensor square of a one-dimensional odd space, the two maps differ by $-1$. Thus the same monoidal structure can carry two different symmetries; the second uses the Koszul sign rule.

We prove the monoidal coherence theorem by a terminating normalization argument. Its precise formal assertion is that any two composites of associators, unitors, their inverses, and their tensor products with identities, between the same formal tensor expressions, are equal. The expressions must have the same ordered list of object letters after unit symbols are removed. This does not assert that different symmetries are equal, nor does it treat an accidental equality of actual objects as a new structural identification.

Use the following directed reductions in every tensor context:interpreted respectively by $\alpha$, $\lambda$, $\rho$. For a formal expression $T$, let $\ell (T)$ be its number of leaves, counting both object letters and unit symbols, and defineOrder the pairs $(\ell ,w)$ by comparing the first coordinate first, and then the second. A unit reduction decreases the first coordinate. An associativity reduction preserves the first coordinate and decreases the second by $\ell (A)>0$. The same calculation holds in any context, since associativity preserves the size of the rewritten subtree. Hence there is no infinite directed reduction path.

An irreducible expression has no unit next to another tensor factor and no composite left tensor factor. It is therefore the right-associated expression of its ordered nonunit letters, or the single unit $I$ if there are no such letters. In particular the normal form is uniquely determined by the ordered word.

We next show that every pair of first reductions has a commuting completion. Reductions in disjoint subexpressions commute by bifunctoriality of the monoidal tensor product. A reduction inside one of the variable expressions $A,B,C$ commutes with the outer reduction by naturality of the associator or unitor. The genuine overlaps are exactly the following cases.

For $(((A\otimes B)\otimes C)\otimes D)$, associating first at the root or first in its left subtree gives the two sides of the pentagon; their completions to $A\otimes (B\otimes (C\otimes D))$ commute.

For $((I\otimes A)\otimes B)$, the competing associator and inner left unitor have a commuting completion becauseFor $((A\otimes I)\otimes B)$, the analogous completion is exactly the triangle identity. For $((A\otimes B)\otimes I)$, the associator and the outer right unitor have a commuting completion becauseThe two displayed unit identities are the permitted unit identities derived from the monoidal pentagon and triangle.

The final overlap is $I\otimes I$, where both unitors apply. They agree as a consequence of the same identities. Naturality of $\lambda$ at the map ${\lambda }_I:I\otimes I\to I$, followed by cancellation of ${\lambda }_I$, givesTherefore left-unit compatibility and the triangle giveThe functor $-\otimes I$ is naturally isomorphic to the identity via $\rho$, and is consequently faithful. Thus ${\lambda }_I={\rho }_I$, so this overlap commutes too. There are no other nonvariable overlaps among the three reduction patterns.

Termination and these commuting completions imply equality of all normalization arrows, not merely uniqueness of the normal-form object. Here is the induction. Suppose every expression smaller than $T$ in the decreasing pair measure has a unique normalization arrow. Two normalization paths from $T$ start with arrows $r:T\to T_1$ and $s:T\to T_2$. The local completion gives directed paths $d_1:T_1\to V$, $d_2:T_2\to V$ with $d_{1}r=d_{2}s$. Append any normalization ${\nu }_V$ of $V$. By the induction hypothesis the tails of the original paths are ${\nu }_V{d}_1$ and ${\nu }_V{d}_2$. Their composites from $T$ are equal. If $T$ is already normal, its only directed normalization is the identity. This proves the induction.

Write ${\nu }_T:T\to N(T)$ for the resulting unique normalization. For every directed structural generator $g:S\to T$, including a generator in an arbitrary tensor context, uniqueness gives ${\nu }_{T}g={\nu }_S$. Since all structural generators are invertible, the corresponding equation holds for their inverses as well. Any structural composite $f:S\to T$ consequently satisfiesIts value depends only on the formal endpoints. Thus every structural diagram with the specified ordered word commutes, proving the monoidal coherence theorem.

A cobraided bialgebra is a bialgebra $H$ equipped with a convolution-invertible bilinear form $r:H\otimes H\to k$ satisfying the following identities, in Sweedler notation:Convolution invertibility means there is $\bar{r}$ with $\sum r(a_{(1)},b_{(1)})\bar{r}(a_{(2)},b_{(2)})=\epsilon (a)\epsilon (b)$, and likewise with $r,\bar{r}$ interchanged. This is a coquasitriangular structure. On right comodules it induces the braidingThe third identity makes this a comodule map, the first two give its two hexagon identities, and the convolution inverse gives the inverse braiding.

For an invertible braiding $C$ satisfying the braid equation on $V\otimes V$, begin with the free associative algebra over a field on matrix coefficients $t_{ij}$, with $\Delta t_{ij}={\sum }_k{t}_{ik}\otimes t_{kj}$ and $\epsilon (t_{ij})={\delta }_{ij}$. Impose precisely the coefficients ofThis quotient is the FRT bialgebra, or Faddeev-Reshetikhin-Takhtajan construction. The relations form a coideal because composing two coactions that preserve $C$ again preserves $C$; the trivial coaction also preserves it, so the counit descends. Universality follows because any such coaction must satisfy exactly these coefficient relations.

For the given $C$, take $t_{11}=a$, $t_{12}=b$, $t_{21}=c$, $t_{22}=d$. Thus $\delta (e_1)=e_1\otimes a+e_2\otimes c$ and $\delta (e_2)=e_1\otimes b+e_2\otimes d$. The coefficient relations, after cancellation of $q^{-1/2}$, areThese are exactly the defining relations of $M_q(2)$ in the inverse-parameter convention of Question 1, without setting the quantum determinant equal to one. They therefore define mutually inverse algebra homomorphisms: each named generator maps to the corresponding $t_{ij}$, and conversely. The matrix comultiplication and counit are the same, so the isomorphism is also one of bialgebras.

Here is the requested check of $ba=qab$ directly from $C$. Apply colinearity to $e_1\otimes e_2$ and compare the coefficient of $e_1\otimes e_1$. On the left, $C(e_1\otimes e_2)=q^{-1/2}{e}_2\otimes e_1$, giving $q^{-1/2}ba$. On the right, the corresponding term of $\delta (e_1\otimes e_2)$ is $e_1\otimes e_1\otimes ab$, and $C(e_1\otimes e_1)=q^{1/2}{e}_1\otimes e_1$. Hence $q^{-1/2}ba=q^{1/2}ab$, proving the relation. The other coefficient comparisons give the remaining displayed relations; no additional determinant relation is imposed in an FRT bialgebra.

With the right-comodule braiding convention in part (a), the defining formula isConsequently the scalar form on generators is the following table, with row the first argument and column the second:For example, the extra $e_2\otimes e_1$ component of $C(e_2\otimes e_1)$ is $r(b,c)=q^{-1/2}(q-q^{-1})$. The other off-diagonal component gives $r(d,a)=q^{-1/2}$.

For arbitrary elements of the FRT bialgebra, extend this table by bilinearity, the unit rule $r(1,z)=r(z,1)=\epsilon (z)$, andThese are an explicit recursive algorithm for any two words in the generators, so the table determines the entire cobraiding. The braid equation for $C$ ensures the algorithm annihilates the defining coefficient relations in either argument: moving one crossing past two successive crossings gives precisely the two reductions of a quadratic colinearity relation. Thus it descends from the free algebra over a field to the FRT bialgebra. For the convolution inverse, use the inverse of $R=\tau C$, where $\tau$ flips the tensor factors: its coefficients are $\bar{r}(t_{ki},t_{lj})=(R^{-1}{)}_{kl,ij}$. Equivalently, in the flipped coefficient formula use $\tau C^{-1}\tau$, not $C^{-1}$ alone. This gives $\bar{r}(a,a)=\bar{r}(d,d)=q^{-1/2}$, $\bar{r}(a,d)=\bar{r}(d,a)=q^{1/2}$, $\bar{r}(b,c)=-q^{1/2}(q-q^{-1})$, and all other generator values zero. This specifies the coquasitriangular structure completely, not just its values on degree-one elements.

Let $x$ denote the generating object, the image of the unique object of the terminal category. The free braided monoidal category on one object can be described syntactically. Its objects are all fully parenthesized expressions built from $x$, the monoidal unit object $I$, and a binary monoidal tensor product. Thus $x\otimes (I\otimes x)$ and $(x\otimes I)\otimes x$ are distinct objects, though canonically isomorphic. Its morphisms are generated by the associators, unitors, braidings and their inverses, closed under composition and tensor product, subject to the pentagon, triangle, naturality and hexagon axioms. No symmetry relation is imposed on the braiding. The embedding of the terminal category selects $x$.

The braid category $\mathbf{B}$ has objects the nonnegative integers, withwhere $B_n$ is the braid group on $n$ strands and $B_0,B_1$ are trivial. Composition is stacking braids, with the first morphism followed by the second. The monoidal tensor product is addition on objects and side-by-side juxtaposition of braids; its monoidal unit object is $0$. The associators and unitors are identities, so it is a strict monoidal category.

Choose the positive crossing convention once and for all. Its braiding $c_{m,n}:m+n\to n+m$ is the block braid moving the first $m$ strands over the next $n$ strands while retaining the order within each block. In particular $c_{1,1}={\sigma }_1$. The usual braid group relations express the naturality and hexagon laws for these block braids. The generating functor $1\to \mathbf{B}$ selects $1$.

The distinction is parenthesized tensor expressions versus strand counts: the first construction keeps the structural isomorphisms visible, while $\mathbf{B}$ has strict tensor arithmetic. These descriptions give the two requested free constructions without needing to establish their universal properties.

Define the length of a formal tensor expression recursively byThe canonical strict monoidal functor $Q:\mathcal{F}br\to \mathbf{B}$ sends $u$ to $|u|$, sends every associator and unitor to an identity braid, and sends $c_{u,v}$ to the block braiding $c_{|u|,|v|}$. The pentagon and triangle become identity equations; the braiding axioms become the corresponding block-braid equations. Thus the assignment respects the defining relations, andon the nose. It is a braided monoidal functor with identity comparison maps.

To prove that $Q$ is an equivalence of categories, choose a standard parenthesization $x^{[n]}$ of $n$ copies of $x$, with $x^{[0]}=I$. On $x^{[n]}$, define the image of ${\sigma }_i$ by canonically exposing the $i$th and $(i+1)$st factors, applying $c_{x,x}$ there, and restoring the chosen parentheses. The monoidal coherence theorem makes this independent of the structural rebracketing. Crossings on disjoint pairs commute by the tensor interchange law. The adjacent braid group relations follows from the hexagon laws and naturality of the braiding, as in the Yang–Baxter calculation below. Hence these assignments give group homomorphisms $B_n\to \mathrm{Aut}(x^{[n]})$ and a functor $S:\mathbf{B}\to \mathcal{F}br$.

Equip $S$ with the canonical rebracketing maps $x^{[m]}\otimes x^{[n]}\to x^{[m+n]}$. Their monoidal functor axioms follow from the monoidal coherence theorem; the block-braiding compatibility follows by iterating the two hexagon laws. Therefore $S$ is a strong monoidal functor compatible with the braiding.

We have $QS=1_{\mathbf{B}}$, including its comparison maps. For every formal expression $u$, there is a canonical structural isomorphismobtained by rebracketing and inserting the units appearing in $u$. These maps form a natural isomorphism $SQ\Rightarrow 1_{\mathcal{F}br}$. To check naturality, it suffices to check the generating morphisms: for associators and unitors it is exactly monoidal coherence; for $c_{u,v}$ it follows from the hexagon expansion into the elementary crossings defining $S$. Composition and tensor product then preserve the equation. The same structural coherence shows that $\theta$ is monoidal.

Thus $Q$ has a specified quasi-inverse and is the required equivalence:Only ordinary monoidal coherence, together with the defining braiding axioms, has been used; a separate braided coherence theorem is unnecessary.

For an object $X$ of a braided monoidal category, take its self-braidingIt is invertible by definition. Suppress canonical associators using the monoidal coherence theorem, and put $R_{12}=y\otimes 1$, $R_{23}=1\otimes y$. The hexagon identity givesApply naturality of this braiding to the morphism $y:X\otimes X\to X\otimes X$ in its second argument. It saysSubstitution givesThis is the equation for a Yang–Baxter operator. Restoring the uniquely determined associators gives the non-strict diagram in the paper. Every object therefore has the canonical Yang–Baxter operator supplied by its self-braiding.

We use right comodules and write their coactions as $u\mapsto \sum u_{(0)}\otimes u_{(1)}$. A coquasitriangular structure gives the braiding on these comodulesIn an arbitrary symmetric monoidal category this notation abbreviates a composite of the two coactions, the ambient symmetry, and $\gamma$; it does not assume that the objects have elements. The coquasitriangular axioms ensure that this composite is a comodule morphism, is invertible using the convolution inverse of $\gamma$, and satisfies the two hexagon laws. More explicitly, in scalar notation those laws come fromwhile the comodule-morphism condition isUnit normalizations give the unit constraints. These descriptions are identities of morphisms in the ambient symmetric category, with the displayed reordering carried by its symmetry.

Apply the preceding self-braiding result to the regular right comodule $(H,\Delta )$. Its Yang–Baxter operator isCompose its braid equation with the three counits. Expanding $R_{23}{R}_{12}{R}_{23}$ and cancelling the leading counit factors givesExpanding $R_{12}{R}_{23}{R}_{12}$ instead givesThey are equal by the Yang–Baxter operator equation. This is the required scalar identity:Indeed, after ${\Delta }^{\otimes 3}$ the ordered factors are $a_{(1)},a_{(2)},b_{(1)},b_{(2)},c_{(1)},c_{(2)}$. The two ambient symmetries on the left produce the three pairings $(a_{(1)},b_{(1)})$, $(a_{(2)},c_{(1)})$, $(b_{(2)},c_{(2)})$. On the right, the central symmetry produces $a_{(1)},a_{(2)},b_{(2)},b_{(1)},c_{(1)},c_{(2)}$, yielding exactly the other three pairings. Hence the calculation identifies the actual morphisms requested, also when the category is not a category of vector spaces.