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.
All-label unitary Ising normal data and ribbon coherence
Statement
Put , with , , and a third simple . Use , , and , with summands ordered and every nonzero elementary fusion multiplicity equal to one. Let , , , , , , and choose of modulus one with . There is a unitary skeletal spherical ribbon fusion category with canonical orthonormal summand vertices and the following complete normal data. All admissible one-dimensional F blocks are , except , and Rows are right-tree channels and columns left-tree channels in the inverse-precomposition convention. Unit blocks are identities and impossible channels have the unique empty matrix. The associator permutes the summand by addition of a group input when needed; its complete formula and pentagon are proved below.
The object braiding is , , and . The pullback R symbols are their inverses, in the specified canonical vertices. Both hexagons hold in every channel. The normalized self-duality has , , FS sign , positive pivotal dimension , and twist ; has dimension and FS sign one and twist . The canonical left-dual tensorator is on both channels and one on all other channels; its double-dual tensorator is one on all ten admissible channels. Relative to those duals , , and holds channel by channel. For explicit phase specializations write . These assertions construct the full category; they do not assume a sector example as a supplier.
Facts & Assumptions
Given: The skeletal fusion rule, canonical summand vertices, the parameters , and the typed F/R conventions stated above. Every construction is finite and uses no choice principle.
A unitary fusion category has dagger-preserving tensor product and unitary associators and unitors; its orthogonal simple summand inclusions satisfy the isometry and completeness identities (Unitary fusion category, Definition).
Elementary multiplicity spaces are ; the F-symbol is the inverse-precomposition coordinate matrix with target-tree rows, source-tree columns, and all multiplicity indices retained (Fusion multiplicity space, Definition; F-symbol as a recoupling matrix, Definition).
The R convention is the pullback ; the braiding, pivotal and ribbon definitions fix the hexagons, monoidality and dual-compatible twist conditions (R-symbol as a channel exchange map, Definition; Braiding, Definition; Pivotal structure, Definition; Twist and ribbon structure, Definition).
Proof
Let , with , , and a third simple . Set for , , and . Objects are multiplicity triples , representing the canonical sums ; arbitrary reorderings are not additional objects. Set , with block composition, matrix-adjoint dagger, and maximum block operator norm. An isomorphism forces for every , so this category is skeletal. Direct sum adds triples and . In each output block order the contributing coordinates lexicographically using ; tensor on morphisms has entries on the matching blocks and zero elsewhere. This is a dagger-preserving bifunctor by the matrix product identities. Order as and use the canonical coordinate inclusions and retractions . Every nonzero elementary multiplicity has coordinate ; impossible channels have multiplicity zero. Extend all subsequent simple-input maps over these coordinates by direct sums. This fixes the skeletal carrier and bases before any coefficient is calculated.
Put , , and . Take identity unit constraints. For , define the entire associator by , , for , and for . The maps and have coefficient one on the equal simple output, after relabelling the summand by addition of . This specifies the direct-sum permutations as well as their scalars. For fixed total , the target row is and the source column is ; a coefficient exists only when all four fusion multiplicities are one.
In the ordered channels the unique two-dimensional block is . Every other admissible block is and equals , except . Unit-input blocks are identities, and an impossible fixed-total space has the unique matrix. These real matrices and the summand permutations are orthogonal, so their inverse-transposes give exactly the same coefficients. Hence the object associators of step 2.1 are also the F coefficients in the library's inverse-precomposition convention, with no suppressed transpose, inverse, channel, or multiplicity coordinate.
Write for those associator coefficients, and set them to zero on inadmissible channels. Start at and end at . The root/root route and the left/root/right route around the pentagon give, respectively, the two sides of . This follows by applying each rotation to the indicated subtrees, retaining every spectator output and multiplicity coordinate. We verify all sixteen placements of group objects and in this indexed equation, rather than using a classification theorem.
With zero inputs both pentagon routes have coefficient one. With one input, the four placements reduce in order to the following equalities: . They hold for all free group labels by bicharacter multiplicativity.
For two inputs the six placements reduce to . Here is the preceding output, and or is the total group output; admissibility forces these labels in the indexed equation. There is exactly one admissible term in its sum over . All six identities follow from symmetry and multiplicativity of .
With three inputs, let be the group input and the initial and final corresponding two- output labels. The four placements give . The middle associator forces each shifted label or . Multiplicativity, symmetry and prove every entry for all free channel labels.
With four inputs, let be the initial channel, the final channel and the total. The short route has coefficient . The long route has coefficient , since . The four placement calculations exhaust all sixteen placements, every free group/channel label, and every pentagon entry; a nonexistent fusion path gives an empty equality. Every unit-input coefficient agrees with the identity unitor, so the triangle holds. The orthogonal F matrices and ordinary block dagger now give a unitary monoidal category.
Set , and choose a unit-modulus with . Define all object braiding coefficients by for , , and for . This covers every channel, including units, and all entries have modulus one. Expanding the two hexagons in the normal summand bases reduces their independent equations to , , , , and .
For completeness, the all-group hexagon is bicharacter multiplicativity; the placements and give ; gives the quadratic equation for ; and give the transport equation for ; gives ; and gives the final equation of step 9.1 entry by entry. In that last case the full matrix equality is with ; cancelling one and combining the character factors gives the displayed sum. The other hexagon reverses these placements and replaces by , so it gives the same five equations because and both mixed braidings are . This accounts for all eight typed summand patterns of each hexagon.
The only nontrivial quadratic case is , and the nontrivial transport cases are and . For the last equation of step 9.1 the four pairs give . Each follows from . Thus both hexagons hold in every channel; none of the braiding data has been inferred solely from a two-channel braid relation.
Let . At , , inverse pullback gives the complete table , , , and . At , , the unit/group/mixed entries are identical, while and . Every displayed elementary multiplicity index is one, and a nonexistent channel is empty. These are pullback matrices of , rather than object coefficients with only selected phases inverted.
For a group simple , take and . For , take and . The snake scalar is , and reflection proves the other snake; group snakes have scalar one. Thus every object is rigid and the normalized FS sign of is . Choose right coevaluation and right evaluation for ; both positive left/right dimensions are , although . The dimension and FS of are one. On a finite sum, the candidate left/right trace is , where and ; we verify its pivotal compatibility explicitly below.
Let . Inserting the normalized cup, rotating by , applying , rotating back and using the positive cap gives . Closing similarly gives . The entire nonunit calculation is . The first three rows use scalar F entries of modulus one; the last two use and . Unit rows are identity traces. In particular all FS signs occur twice and cancel.
Relative to these left duals the standard-conjugate comparison is , with typed dual comparisons and unitors inserted. It equals one on a group simple and on . Direct sums use their orthogonal summand inclusions. Iterating the last-vertex calculation of step 14.1 on fusion-path matrix units gives zero off the diagonal and the endpoint dimension on the diagonal; the pentagon makes it tree-independent. These units span every Hom block, and the weighted matrix pairing is nondegenerate. The fusion-dimension equations and those same units prove tensor multiplicativity of the trace. Thus the left/right closures both equal ; this is the trace produced by the dualities, rather than an independently assigned dimension function. The following typed tensorator calculation verifies monoidality of without assuming a canonical positive pivot.
Choose the left dual of a direct sum by its orthogonal simple summands. Its contravariant tensorator is uniquely characterized by , where is folded evaluation: reassociate to , evaluate the middle pair and then the outer pair. Uniqueness follows from the two snakes. This fixes all types before taking its channel scalars.
Put for and . On a canonical summand, evaluation of both sides of step 16.1 after the cup gives . Indeed the first rotation takes to with coefficient ; the inverse right rotation makes the inner channel vacuum with coefficient . The two evaluations contribute , the initial cup contributes , and its comparison cap/cup has scalar . Their quotient is the stated formula, derived entirely from the specified dualities and F data.
The complete channel computation is . For either row the two F factors of step 17.1 are , and the dimension factor is , so . In mixed rows both F factors, the dimension quotient, and are one; unit/group rows are immediate. All entries are real unit scalars.
The typed double-dual tensorator is with . On a summand its coefficient is , as recorded in step 18.1. The equality of that table's last columns therefore proves on all ten admissible channels. Scalar simple components give naturality, chosen sum duals give additivity, and pairwise monoidality extends to arbitrary products by coherence of the canonical dual tensorator. Together with steps 13.1–15.1 this gives a positive spherical pivotal structure with the asserted FS signs and trace.
The positive pivotal curl on is fixed by partial trace: , since . The group twists are and . Balancing holds in every channel: group-group crossings square to one; mixed crossings square to ; and on one has because . All labels are self-dual and scalar twist equals its dual, so the ribbon condition holds. In particular the negative-sign parameters give , while the positive-sign parameters give ; in both cases . This proves all normal-data, coherence, duality, pivotal, FS and ribbon claims.
Remarks
The full source reading and exact finite checks are recorded in the isolated Ising receipt. Siehler gives the full hexagon reduction but cites Tambara–Yamagami for the monoidal classification; the complete pentagon is proved locally here. Penneys leaves Ising F extraction as an exercise. The physical R vocabulary in Nayak is not substituted for the library's inverse-pullback convention. Finite scripts corroborate the proofs and do not assert a readiness or audit stamp.
Depends on
Used by
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jacob Siehler, Braided Near-Group Categories (standard reference, not scraped)
- David Penneys, Unitary Fusion Categories (standard reference, not scraped)
- Chetan Nayak et al., Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)
- Shu-Heng Shao, What’s Done Cannot Be Undone (standard reference, not scraped)