Abelian Chern--Simons theory Created 2026-09-24 Updated 2026-11-05
An Abelian Chern--Simons theory describes topological gauge fields in two spatial dimensions and time. In units , its bulk action can be written
where are compact Abelian gauge field one-forms, is the wedge product of differential forms, and the K-matrix is symmetric, integral and invertible. This supplies a long-distance description of gapped Abelian quantum Hall states. [ref]
A quasiparticle labeled by an integer vector couples to the corresponding combination of gauge fields. The full encircling phase of charges is
Thus global particle paths can carry measurable braiding information even though the pure bulk action has no metric-dependent local wave term. Boundaries require their own treatment; the bulk formula alone does not specify every allowed boundary condition.
Anyon monodromy 2026-10-25
The full double braiding of two anyons. The anyon balancing identity gives in a permitted anyon fusion channel. Unlike a single anyon R-matrix entry, this scalar is invariant under an anyon vertex gauge transformation.
Bimonoid 2026-10-06
An object that is both a monoid object and a comonoid in a braided monoidal category, with preserving multiplication and unit. The product on its tensor square uses the ambient braiding.
Braid category 2026-10-06
The braided monoidal category with objects , endomorphism groups , no arrows between unequal objects, tensor given by juxtaposition, and block-crossing braiding. Its tensor is strict.
Braided monoidal category 2026-10-06
A monoidal category with natural invertible braidings satisfying the two hexagon axioms. The equation is an additional symmetric condition, not a braided axiom.
Braided monoidal functor 2026-10-06
A monoidal functor between braided monoidal categories compatible with their braidings: .
Cobraided bialgebra 2026-10-14
A bialgebra equipped with a coquasitriangular structure, namely a convolution-invertible scalar form satisfying , and , with unit normalization. The induced right-comodule braiding is .
Free braided monoidal category on one object Created 2026-10-06 Updated 2026-10-25
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.
FRT bialgebra Created 2026-10-14 Updated 2026-11-05
Given an invertible braiding on , the universal bialgebra coacting on for which is a comodule map is generated by the matrix coefficients . Its comultiplication is . Colinearity gives quadratic relations. Writing 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 , the hexagon identities for braiding for braiding express double exchange of with any charge as the successive double exchanges of and with . Both are identities. Naturality restricts the resulting identity to every simple anyon fusion summand of , proving that is transparent.
The compatibility equations between braiding and the associator in a braided monoidal category. Omitting the associators from the notation, they read and . Thus exchanging a composite with another object is the sequence of exchanges of its factors.
K-matrix Created 2026-09-24 Updated 2026-11-05
The K-matrix is the symmetric integer matrix multiplying the coupled Abelian gauge fields in an Abelian Chern--Simons theory. For invertible , the anyon lattice of an Abelian Chern--Simons theory is
Adding to a charge vector changes it by a local particle. Its full braiding with any integer charge changes by , leaving the phase unchanged.
For example, has two classes, represented by . Encircling two copies of class gives ; fusing them gives class . This illustrates how an integer coupling produces fractional anyon statistics.
An integer unimodular matrix changes the basis as
Because is also integral, it maps charge classes bijectively and preserves . It changes the coordinates of the theory rather than its braiding data. If electromagnetic coupling is specified by a charge vector , that vector must be transformed consistently as . [ref]
Lagrangian subgroup of Abelian anyons Created 2026-09-24 Updated 2026-11-05
For a bosonic Abelian anyon theory, a Lagrangian subgroup of Abelian anyons is a subgroup of types of anyons closed under anyon fusion, with trivial topological spin for every member and trivial mutual braiding among members. Every anyon outside the subgroup must braid nontrivially with at least one member; pairwise compatibility alone is insufficient.
These conditions describe a maximal condensable collection for an appropriate fully gapped boundary. In the toric code, the vacuum together with the electric anyon gives one choice, and the vacuum together with the magnetic anyon gives another. Electric and magnetic anyons cannot both belong to the same collection because their mutual braiding is nontrivial. Additional physical context, including a nonchiral bulk and any imposed symmetry, matters when using this data to construct a boundary.[ref]
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 for braiding and for anyon monodromy. Transparency says for every . The hexagon identities for braiding express braiding a composite past as successive braidings of its two factors past . If are both transparent anyons, move around and then around ; both full moves are identities, hence
This is the fusion closure of transparent anyons at the level of the composite object.
For completeness, let and be an inclusion and projection for an allowed anyon fusion summand, with . Naturality of braiding gives
Thus
The 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 :
Here ribbon duality gives and . Consequently
Their topological spins are those of bosons or fermions. This does not imply : 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 , a bifunctor , a monoidal unit object , and natural isomorphisms
The associator and unitors satisfy the pentagon identity for a monoidal category
and the triangle identity for a monoidal category
Composition is written from right to left. Naturality of these isomorphisms is part of the definition.
A symmetric monoidal category additionally has a natural braiding with , satisfying the two hexagon identities. Written as composites from the same source to the same target, these are
The unit compatibility is and .
For two distinct choices of symmetry, take super vector spaces over , with degree-preserving linear maps, the usual graded tensor product, its usual associator, and the unit concentrated in degree zero. On vectors of degrees , define
Both are natural in degree-preserving maps and are involutive. For the second, the hexagons follow from and 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 . 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 , , . For a formal expression , let be its number of leaves, counting both object letters and unit symbols, and define
Order the pairs 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 . 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 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 commutes with the outer reduction by naturality of the associator or unitor. The genuine overlaps are exactly the following cases.
For , associating first at the root or first in its left subtree gives the two sides of the pentagon; their completions to commute.
For , the competing associator and inner left unitor have a commuting completion because
For , the analogous completion is exactly the triangle identity. For , the associator and the outer right unitor have a commuting completion because
The two displayed unit identities are the permitted unit identities derived from the monoidal pentagon and triangle.
The final overlap is , where both unitors apply. They agree as a consequence of the same identities. Naturality of at the map , followed by cancellation of , gives
Therefore left-unit compatibility and the triangle give
The functor is naturally isomorphic to the identity via , and is consequently faithful. Thus , 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 in the decreasing pair measure has a unique normalization arrow. Two normalization paths from start with arrows and . The local completion gives directed paths , with . Append any normalization of . By the induction hypothesis the tails of the original paths are and . Their composites from are equal. If is already normal, its only directed normalization is the identity. This proves the induction.
Write for the resulting unique normalization. For every directed structural generator , including a generator in an arbitrary tensor context, uniqueness gives . Since all structural generators are invertible, the corresponding equation holds for their inverses as well. Any structural composite consequently satisfies
Its 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 equipped with a convolution-invertible bilinear form satisfying the following identities, in Sweedler notation:
Convolution invertibility means there is with , and likewise with interchanged. This is a coquasitriangular structure. On right comodules it induces the braiding
The 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 satisfying the braid equation on , begin with the free associative algebra over a field on matrix coefficients , with and . Impose precisely the coefficients of
This quotient is the FRT bialgebra, or Faddeev-Reshetikhin-Takhtajan construction. The relations form a coideal because composing two coactions that preserve again preserves ; 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 , take , , , . Thus and . The coefficient relations, after cancellation of , are
These are exactly the defining relations of 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 , and conversely. The matrix comultiplication and counit are the same, so the isomorphism is also one of bialgebras.
Here is the requested check of directly from . Apply colinearity to and compare the coefficient of . On the left, , giving . On the right, the corresponding term of is , and . Hence , 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 is
Consequently the scalar form on generators is the following table, with row the first argument and column the second:
For example, the extra component of is . The other off-diagonal component gives .
For arbitrary elements of the FRT bialgebra, extend this table by bilinearity, the unit rule , and
These are an explicit recursive algorithm for any two words in the generators, so the table determines the entire cobraiding. The braid equation for 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 , where flips the tensor factors: its coefficients are . Equivalently, in the flipped coefficient formula use , not alone. This gives , , , and all other generator values zero. This specifies the coquasitriangular structure completely, not just its values on degree-one elements.
Let 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 , the monoidal unit object , and a binary monoidal tensor product. Thus and 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 .
The braid category has objects the nonnegative integers, with
where is the braid group on strands and 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 . The associators and unitors are identities, so it is a strict monoidal category.
Choose the positive crossing convention once and for all. Its braiding is the block braid moving the first strands over the next strands while retaining the order within each block. In particular . The usual braid group relations express the naturality and hexagon laws for these block braids. The generating functor selects .
The distinction is parenthesized tensor expressions versus strand counts: the first construction keeps the structural isomorphisms visible, while has strict tensor arithmetic. These descriptions give the two requested free constructions without needing to establish their universal properties.