Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

All-label unitary Ising normal data and ribbon coherence

Statement

Put G=Z/2={0,1}, with 0=1, 1=η, and a third simple D. Use ab=a+b, aD=Da=D, and DD=0⊕1, with summands ordered (0,1) and every nonzero elementary fusion multiplicity equal to one. Let d=2, κ∈{−1,1}, τ=κ/d, χ(a,b)=(−1)ab, u(0)=1, u(1)=i, and choose β of modulus one with β2=τ(1+i). 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 1, except FDηDη=FηDηD=−1, and FDDDD=κ2(111−1). Rows are right-tree channels (f,1,1) and columns left-tree channels (e,1,1) in the inverse-precomposition convention. Unit blocks are identities and impossible channels have the unique empty matrix. The associator permutes the DD summand by addition of a group input when needed; its complete formula and pentagon are proved below.

The object braiding is ca,b=χ(a,b), ca,D=cD,a=u(a), and cD,Dg=β/u(g). The pullback R symbols are their inverses, in the specified canonical vertices. Both hexagons hold in every channel. The normalized self-duality has coev⁡D=d iDD0, ev⁡D=κd pDD0, FS sign κ, positive pivotal dimension d, and twist θD=κ/β; η has dimension and FS sign one and twist −1. The canonical left-dual tensorator is κ on both DD channels and one on all other channels; its double-dual tensorator is one on all ten admissible channels. Relative to those duals jD=κ, j0=jη=1, and ja⊗b=νa,b(ja⊗jb) holds channel by channel. For explicit phase specializations write s=eπi/8. 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 κ,τ,χ,u,β, and the typed F/R conventions stated above. Every construction is finite and uses no choice principle.

[F1]

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).

[F2]

Elementary multiplicity spaces are Vabc=Hom⁡(a⊗b,c); 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).

[F3]

The R convention is the pullback f↦f∘ca,b−1; 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

technique · construct the finite skeletal category, check every associativity and braiding channel, and compute its dual and pivotal tensorators
1.1F1F2F3givenconstructalgebra

Let G=Z/2={0,1}, with 0=1, 1=η, and a third simple D. Set ab=a+b for a,b∈G, aD=Da=D, and DD=0⊕1. Objects are multiplicity triples m=(m0,m1,mD)∈N03, representing the canonical sums 0⊕m0⊕1⊕m1⊕D⊕mD; arbitrary reorderings are not additional objects. Set Hom⁡(m,n)=⨁c∈{0,1,D}Mat⁡nc×mc(C), with block composition, matrix-adjoint dagger, and maximum block operator norm. An isomorphism forces mc=nc for every c, so this category is skeletal. Direct sum adds triples and (m⊗n)c=∑a,bmanbNabc. In each output block order the contributing coordinates (a,r,b,t) lexicographically using 0<1<D; tensor on morphisms has entries fa[r′,r]gb[t′,t] on the matching (a,b,c) blocks and zero elsewhere. This is a dagger-preserving bifunctor by the matrix product identities. Order DD as (0,1) and use the canonical coordinate inclusions iabc and retractions pabc=(iabc)†. Every nonzero elementary multiplicity has coordinate μ=1; 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.

2.1step 1.1algebra

Put d=2, χ(a,b)=(−1)ab, κ∈{−1,1} and τ=κ/d. Take identity unit constraints. For a,b,c∈G, define the entire associator by αa,b,c=αa,b,D=αD,a,b=1, αa,D,b=χ(a,b), αD,a,D∣z=χ(a,z) for z∈G, and αD,D,D[f,e]=τχ(e,f) for e,f∈G. The maps αa,D,D and αD,D,a have coefficient one on the equal simple output, after relabelling the DD summand by addition of a. This specifies the direct-sum permutations as well as their scalars. For fixed total z, the target row is (f,μbcf=1,μafz=1) and the source column is (e,μabe=1,μecz=1); a coefficient exists only when all four fusion multiplicities are one.

3.1step 2.1algebra

In the ordered channels (0,1) the unique two-dimensional block is FDDDD=κd(111−1). Every other admissible block is 1×1 and equals +1, except FDηDη=FηDηD=−1. Unit-input blocks are identities, and an impossible fixed-total space has the unique 0×0 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.

4.1step 3.1algebra

Write Azabc[f,e] for those associator coefficients, and set them to zero on inadmissible channels. Start at (((ab)ec)ft)z and end at (a(b(ct)g)h)z. The root/root route and the left/root/right route around the pentagon give, respectively, the two sides of Azect[g,f]Azabg[h,e]=∑uAfabc[u,e]Azaut[h,f]Ahbct[g,u]. 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 D in this indexed equation, rather than using a classification theorem.

5.1step 4.1algebra

With zero D inputs both pentagon routes have coefficient one. With one D input, the four placements reduce in order to the following equalities: (D,a,b,c)1=1(a,D,b,c)χ(a,b+c)=χ(a,b)χ(a,c)(a,b,D,c)χ(a+b,c)=χ(a,c)χ(b,c)(a,b,c,D)1=1. They hold for all free group labels by bicharacter multiplicativity.

6.1step 5.1algebra

For two D inputs the six placements reduce to (D,D,a,b)1=1(D,a,D,b)χ(a,x+b)=χ(a,x)χ(a,b)(D,a,b,D)χ(a,z)χ(b,z)=χ(a+b,z)(a,D,D,b)1=1(a,D,b,D)χ(b,a+y)=χ(a,b)χ(b,y)(a,b,D,D)1=1. Here x is the preceding DD output, and z or a+y is the total group output; admissibility forces these labels in the indexed equation. There is exactly one admissible term in its sum over u. All six identities follow from symmetry and multiplicativity of χ.

7.1step 6.1algebra

With three D inputs, let a be the group input and x,y the initial and final corresponding two-D output labels. The four placements give (D,D,D,a)τχ(x,a)χ(x,y)=τχ(x,a+y)(D,D,a,D)τχ(x,y)=τχ(x+a,y)χ(a,y)(D,a,D,D)τχ(x,y)=χ(a,x)τχ(x,a+y)(a,D,D,D)τχ(x,y)χ(a,y)=τχ(x+a,y). The middle associator forces each shifted label x+a or y+a. Multiplicativity, symmetry and χ2=1 prove every entry for all free channel labels.

8.1step 7.1algebra

With four D inputs, let x be the initial DD channel, y the final DD channel and z∈G the total. The short route has coefficient δy,x+z. The long route has coefficient τ2∑u∈Gχ(x,u)χ(u,z)χ(u,y)=τ2∑u(−1)u(x+y+z)=2τ2δy,x+z=δy,x+z, since 2τ2=1. 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.

9.1step 8.1algebra

Set u(0)=1, u(1)=i and choose a unit-modulus β with β2=τ(1+i). Define all object braiding coefficients by ca,b=χ(a,b) for a,b∈G, ca,D=cD,a=u(a), and cD,Dg=v(g)=β/u(g) for g∈G. 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 ca,b=χ(a,b), u(a+b)=u(a)u(b)χ(a,b), u(a)v(a+b)=χ(a,b)v(b), u(a)2=χ(a,a), and τ∑c∈Gχ(a+b,c)u(c)=χ(a,b)v(a)v(b).

10.1step 9.1algebra

For completeness, the all-group hexagon is bicharacter multiplicativity; the placements abD and aDb give ca,b=χ(a,b); Dab gives the quadratic equation for u; DDa and DaD give the transport equation for v; aDD gives u(a)2=χ(a,a); and DDD gives the final equation of step 9.1 entry by entry. In that last case the full matrix equality is Adiag⁡(u)A=diag⁡(v)Adiag⁡(v) with A=τ(χ(a,b))a,b; cancelling one τ and combining the character factors gives the displayed sum. The other hexagon reverses these placements and replaces χ by χ−1, so it gives the same five equations because χ=χ−1 and both mixed braidings are u. This accounts for all eight typed summand patterns of each hexagon.

11.1step 10.1algebra

The only nontrivial quadratic case is u(1+1)=1=i2(−1), and the nontrivial transport cases are iv(1)=v(0) and iv(0)=−v(1). For the last equation of step 9.1 the four pairs (a,b) give (0,0)τ(1+i)=β2(1,0),(0,1)τ(1−i)=−iβ2(1,1)τ(1+i)=−(−iβ)2=β2. Each follows from β2=τ(1+i). Thus both hexagons hold in every channel; none of the braiding data has been inferred solely from a two-channel braid relation.

12.1step 11.1algebra

Let s=eπi/8. At κ=1, β+=s, inverse pullback gives the complete table R0aa=Ra0a=1, Rηη0=−1, RηDD=RDηD=−i, RDD0=s−1=e−πi/8 and RDDη=is−1=e3πi/8. At κ=−1, β−=−s−3, the unit/group/mixed entries are identical, while RDD0=−s3 and RDDη=s−1. Every displayed elementary multiplicity index is one, and a nonexistent channel is empty. These are pullback matrices of f↦f∘ca,b−1, rather than object coefficients with only selected phases inverted.

13.1step 12.1algebra

For a group simple a, take coev⁡a=iaa0 and ev⁡a=paa0. For D, take coev⁡D=d iDD0 and ev⁡D=κd pDD0. The D snake scalar is κd(FDDDD)0,0=κdτ=1, and reflection proves the other snake; group snakes have scalar one. Thus every object is rigid and the normalized FS sign of D is κ. Choose right coevaluation κd iDD0 and right evaluation d pDD0 for D; both positive left/right dimensions are d, although ev⁡Dcoev⁡D=κd. The dimension and FS of η are one. On a finite sum, the candidate left/right trace is ∑adaTr⁡(Ma), where d0=dη=1 and dD=d; we verify its pivotal compatibility explicitly below.

14.1step 13.1algebra

Let Ec=iabcpabc. Inserting the normalized a cup, rotating by αa,a,b, applying Ec, rotating back and using the positive a cap gives ptr⁡a(Ec)=da∣Abaab[c,0]∣21b=(dc/db)1b. Closing b similarly gives ptr⁡b(Ec)=db∣Aaabb[0,c]∣21a=(dc/da)1a. The entire nonunit calculation is (a,b;c)ptr⁡aptr⁡b(η,η;0)11(η,D;D)1d(D,η;D)d1(D,D;0)1/d1/d(D,D;η)1/d1/d. The first three rows use scalar F entries of modulus one; the last two use ∣τ∣2=1/2 and d/2=1/d. Unit rows are identity traces. In particular all FS signs occur twice and cancel.

15.1step 14.1algebra

Relative to these left duals the standard-conjugate comparison is ja=(coev⁡a†⊗1a∗∗)α−1(1a⊗coev⁡a∗), with typed dual comparisons and unitors inserted. It equals one on a group simple and dτ=κ on D. 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 dadb=∑cNabcdc and those same units prove tensor multiplicativity of the trace. Thus the left/right closures both equal ∑adaTr⁡(Ma); this is the trace produced by the dualities, rather than an independently assigned dimension function. The following typed tensorator calculation verifies monoidality of j without assuming a canonical positive pivot.

16.1step 15.1algebra

Choose the left dual of a direct sum by its orthogonal simple summands. Its contravariant tensorator qa,b:b∗⊗a∗⟶(a⊗b)∗ is uniquely characterized by ev⁡a⊗b(qa,b⊗1a⊗b)=Ea,b, where Ea,b is folded evaluation: reassociate (b∗⊗a∗)⊗(a⊗b) to b∗⊗((a∗⊗a)⊗b), evaluate the middle a pair and then the outer b pair. Uniqueness follows from the two snakes. This fixes all types before taking its channel scalars.

17.1step 16.1algebra

Put ka=1 for a∈G and kD=κ. On a canonical c summand, evaluation of both sides of step 16.1 after the c cup gives qa,bc=kakbkcdadbdcA0bac[b,c]Abaab[c,0]. Indeed the first rotation takes ((ba)c(ab)c)0 to b(a(ab)c) with coefficient A0bac[b,c]; the inverse right rotation makes the inner aa channel vacuum with coefficient Abaab[c,0]. The two evaluations contribute kadakbdb, the initial c cup contributes dc, and its comparison cap/cup has scalar kcdc. Their quotient is the stated formula, derived entirely from the specified dualities and F data.

18.1step 17.1algebra

The complete channel computation is (a,b;c)qa,bcνa,bcjcjajb(0,0;0)1111(0,η;η)1111(η,0;η)1111(0,D;D)11κκ(D,0;D)11κκ(η,η;0)1111(η,D;D)11κκ(D,η;D)11κκ(D,D;0)κ111(D,D;η)κ111. For either DD row the two F factors of step 17.1 are 1,τ, and the dimension factor is d, so q=dτ=κ. In mixed rows both F factors, the dimension quotient, and kakb/kc are one; unit/group rows are immediate. All entries are real unit scalars.

19.1step 18.1algebra

The typed double-dual tensorator is νa,b:a∗∗⊗b∗∗⟶(a⊗b)∗∗ with νa,b=(qa,b∗)−1qb∗,a∗. On a c summand its coefficient is qb,ac/qa,bc=1, as recorded in step 18.1. The equality of that table's last columns therefore proves ja⊗b=νa,b(ja⊗jb) 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.

20.1step 19.1algebra∎

The positive pivotal curl on D is fixed by partial trace: θD=(v(0)+v(1))/d=β(1−i)/d=κ/β, since β2=κ(1+i)/d. The group twists are θ0=1 and θη=−1. Balancing holds in every channel: group-group crossings square to one; mixed crossings square to −1=θD/(θηθD); and on DD one has v(g)2=θg/θD2 because u(g)2=χ(g,g)=θg. All labels are self-dual and scalar twist equals its dual, so the ribbon condition holds. In particular the negative-sign parameters β−=−s−3 give θD=−1/β−=s3, while the positive-sign parameters β+=s give θD=1/β+=s−1; in both cases θη=−1. 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