Alphabeta Math
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.

✓ 8 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Noninvertible Symmetries and Anyonic Chains

1 · Prerequisites

2 · Summary

An anyonic path space is a fixed-boundary Hom space in a finite semisimple fusion category. Its basis records every intermediate simple label and every vertex multiplicity index; a local channel operator is obtained by changing to a tree where the selected neighboring pair fuses first, projecting to that channel, and changing back. Under unitary hypotheses these are orthogonal projections. For a self-dual simple with a one-dimensional vacuum channel, the cap/cup normalization carries its Frobenius–Schur sign into the Temperley–Lieb loop parameter.

The finite Fibonacci pivotal construction verifies its twist channel by channel, computes the monoidal double-dual comparison, and evaluates both traces to obtain the canonical positive dimensions 1,ϕ.

The page distinguishes tensor-invertible objects, units of the Grothendieck fusion ring, and invertible linear operators. It makes no general physical symmetry claim: any Hamiltonian or symmetry operator requires a specified representation and model. The full Ising construction supplies every admissible F/R block and proves both coherence identities, the positive pivot and its precise FS/chirality conventions. The periodic representation keeps both sectors, evaluates every local projector and line map, and distinguishes the resulting doubled representation from the single-chain translated map.

Reading prerequisites

The planned reading route includes temperley-lieb-jones-wenzl-traces-and-quotients and hopf-hecke-and-quantum-symmetry-interfaces. The first is the source of the root-of-unity quotient route; the second contributes only the rational spin-chain R-matrix interface and is not a logical supplier for the categorical Ising/Fibonacci F/R data authored here.

Path spaces and local operators

The fixed-boundary space is Hom⁡C(c,(((b⊗a)⊗a)⋯⊗a)). A path is a sequence of simple labels from b to c, with a separate basis index at each split-space vertex. This space is generally not a tensor product of local sites. The path-basis lemma proves its dimension and completeness; the unitary theorem supplies the Hilbert-space interpretation only under the stated dagger and orthogonality hypotheses.

Each local channel projection uses a typed associator F-move, and the Mac Lane coherence result identifies composites for the same rebracketing. The three reusable Ising results supply the complete category independently of the earlier sector example: All-label unitary Ising normal data and ribbon coherence, The exact ell-four Ising gauge and parity chirality conversion, and Periodic Ising paths, two sectors, and the full line representation. The root comparison uses the ell-four signed TL/ribbon quotient with an explicit parity conversion; it does not identify different FS conventions by a vertex gauge.

Noninvertibility distinctions

In the Fibonacci fusion ring, [τ]2=[1]+[τ] implies [τ]([τ]−[1])=[1]. The inverse has a negative coefficient and therefore is not the class of an object, since an object in a finite semisimple category is a finite direct sum of simple objects with nonnegative multiplicities. The B page also gives an explicit finite path-space projector and an invertible identity operator, keeping operator invertibility as a separate question.

Companion: noninvertible-symmetries-and-anyonic-chains-examples.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Fixed-boundary anyonic fusion-path space

Definition

Let C be a fusion category over C, so it is finite semisimple, rigid, monoidal, and has simple unit Fusion and multifusion categories. Let a,b,c be simple objects and let n≥0. Fix one representative of each simple isomorphism class for the internal path labels; the external objects a,b,c need not equal their representatives. Set T0=b and recursively fix the left-associated parenthesization Tj+1:=Tj⊗a. The fixed-boundary anyonic path space is

Ha,n;b,c:=Hom⁡C(c,Tn).

For simple labels x,y, define the split multiplicity space Wx,ay:=Hom⁡C(y,x⊗a). For n≥1, a fusion path is a sequence of simple labels x0=b,x1,…,xn=c, with x1,…,xn−1 drawn from the fixed representative set, together with, for every 1≤j≤n, one basis index μj in a chosen basis Bxj−1,axj of Wxj−1,axj. The basis index is retained even when distinct indices have the same adjacent labels. Fusion rules are the nonnegative integers Nxay in [x][a]=∑yNxay[y] Fusion rules.

For n=0, there is no path if b≇c. If b≅c, fix an isomorphism uc,b:c→b and take it as the single empty-path vector (use ub,b=id⁡b when the objects coincide). In the unitary setting choose this isomorphism unitary.

For n≥1, if ij∈Bxj−1,axj is the selected inclusion xj→xj−1⊗a, define the path composite by γ0:=id⁡b and γj:=(γj−1⊗id⁡a)∘ij:xj→Tj. For xn=c, γn is a vector in Ha,n;b,c. The next lemma proves these composites form a basis and computes the dimension. No Hilbert-space or physical Hamiltonian structure is part of this definition.

Split-tree convention

For three sites the diagram records the split direction c→b⊗a⊗a⊗a and the recursively parenthesized tree. Each vertex also carries its basis index μj; the picture omits no mathematical datum used in the definition.

c=x3x2x1b=x0a¹1a¹2a¹3

Each internal label xj is simple, and each μj ranges over a basis of the displayed split Hom space. A periodic closed chain is obtained by summing the fixed-boundary spaces over representative boundary labels b=c; its path labels satisfy the cyclic boundary condition.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Tensor-invertible objects, fusion-ring units, and invertible operators

Definition

Let C be a fusion category with unit 1. Its Grothendieck fusion ring K0(C) is the free abelian group on simple isomorphism classes, with multiplication induced by tensor product and coefficients given by the fusion rules of Fusion rules.

  • An object X is tensor-invertible if there is an object Y with X⊗Y≅1 and Y⊗X≅1.
  • A class [X] is a fusion-ring unit if it has a two-sided multiplicative inverse in K0(C); that inverse may have negative integer coefficients in the simple-object basis.
  • A linear operator is invertible only relative to a specified vector space H and operator T:H→H: it must have a two-sided inverse S:H→H with ST=TS=IH.

These definitions concern different objects: categorical tensor product, a ring with virtual classes, and a chosen representation on a vector space.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Fusion paths give a basis of the fixed-boundary path space

Statement

Let C be a complex fusion category, let a,b,c be simple objects, and fix a basis Bx,ay of every finite-dimensional split space Wx,ay=Hom⁡C(y,x⊗a). Use the fixed representative set for internal labels and the chosen empty-path isomorphism of Fixed-boundary anyonic fusion-path space, retaining arbitrary simple external objects a,b,c. For n≥1, every admissible path x0=b,…,xn=c and every tuple of vertex indices μj∈Bxj−1,axj gives a composite map of Fixed-boundary anyonic fusion-path space, and these maps form a basis of Ha,n;b,c. Consequently,

dim⁡Ha,n;b,c=∑x0=b, xn=cx1,…,xn−1 simple representatives∏j=1nNxj−1axj.

At n=0, separately, there is one empty path with vector uc,b when b≅c and no path otherwise; the displayed sum is for n≥1.

Facts & Assumptions

Given: A complex fusion category C, simple objects a,b,c, n≥0, and the vertex bases in the Statement.

[F1]

Fixed-boundary anyonic fusion-path space: T0=b, Tj+1=Tj⊗a, Ha,n;b,c=Hom⁡(c,Tn), and a path composite is built from inclusions ij:xj→xj−1⊗a.

[F2]

Fusion and multifusion categories: every object of a fusion category is a finite direct sum of simple objects, and tensor product is bilinear and exact on morphisms.

[F3]

Fusion rules: Nxyz is the multiplicity of simple z in x⊗y and equals dim⁡CHom⁡(x⊗y,z).

[F4]

Absolutely simple objects: for simple z, End⁡(z)=Cid⁡z; Hom spaces between nonisomorphic simple objects are zero.

Proof

Given: The category, boundary charges, site charge, and split-space bases above.

1.1F1F2F4givenbase

For n=0, T0=b and [F4] gives Hom⁡(c,b)=0 when c≇b. If c≅b, composition with the chosen isomorphism uc,b:c→b identifies End⁡(c)=Cid⁡c with Hom⁡(c,b), so the latter has basis uc,b. This is exactly the typed empty-path convention of [F1]. For n=1, the path vectors are directly the chosen basis Bb,ac of Hom⁡(c,b⊗a), since the starting map is id⁡b. This separately proves the positive-length base case without requiring the bases for isomorphic but unequal external objects to coincide.

1.2F1F4givenih

Fix n≥1 and assume for every simple endpoint x that the length-n path composites form a basis of Hom⁡(x,Tn).

2.1F2F3F4step 1.2ihconstructalgebra

By finite semisimplicity, the induction hypothesis decomposes Tn≅⨁x,γx, with one summand for each length-n path γ ending at x. Here x ranges once over the fixed simple representatives, even when the external endpoints are different isomorphic objects. For each such x, finite semisimplicity gives x⊗a≅⨁yy⊕Nxay. Applying Hom⁡(y,−), all nonisomorphic simple summands vanish and each of the Nxay copies of y contributes End⁡(y)=Cid⁡y by [F4]. Hence dim⁡Wx,ay=Nxay and the specified inclusion basis has exactly that many vectors.

3.1F1F2F3F4step 1.2step 2.1ihinduction

Choose retractions px,γ:Tn→x dual to the path inclusions γ:x→Tn in step 2.1. They exist by taking any semisimple decomposition and changing its inclusion basis to the given basis for each simple x; the inverse basis matrix changes its retractions. Thus ∑x,γγpx,γ=id⁡Tn and px,γγ′ is the appropriate Kronecker identity. Tensoring gives a direct-sum decomposition of Tn⊗a with inclusions γ⊗id⁡a and retractions px,γ⊗id⁡a. Applying Hom⁡(c,−) therefore gives the isomorphism ⨁x,γHom⁡(c,x⊗a)→Hom⁡(c,Tn+1) sending (hx,γ) to ∑x,γ(γ⊗id⁡a)hx,γ. Its inverse applies each displayed retraction. Inserting the specified basis Bx,ac in each summand gives exactly the length-(n+1) path composites of [F1], so they form a basis, including when the external c differs from its representative.

4.1F1F2F3step 3.1inductiondischarge-induction: step 1.1algebra∎

For n≥1, step 3.1 shows that each admissible path contributes one basis vector for every tuple of vertex indices, hence contributes ∏j=1ndim⁡Wxj−1,axj=∏j=1nNxj−1axj vectors. Summing over the finitely many internal simple labels gives the displayed dimension; every sum is finite because the category has finitely many simple isomorphism classes and n is finite. Step 1.1 gives the separate n=0 count. Induction completes the basis proof and count.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Unitary fusion paths form an orthonormal Hilbert basis

Statement

Let C be a unitary fusion category, and use orthonormal bases in each split space Wx,ay=Hom⁡(y,x⊗a), equivalently the adjoints of orthonormal bases of Vxay=Hom⁡(x⊗a,y). Give Ha,n;b,c=Hom⁡(c,Tn) the Hom-space inner product linear in the first variable, determined by g†f=⟨f,g⟩id⁡c. For n=0 use the unitary empty-path isomorphism specified in Fixed-boundary anyonic fusion-path space. Then the path composites of Fixed-boundary anyonic fusion-path space are an orthonormal basis of Ha,n;b,c.

Facts & Assumptions

Given: A unitary fusion category, simple labels a,b,c, fixed n≥0, and orthonormal vertex bases.

[F1]

Fixed-boundary anyonic fusion-path space: Ha,n;b,c=Hom⁡(c,Tn) and every path composite is formed from the inclusions ij:xj→xj−1⊗a by tensoring with identities and composition.

[F2]

Unitary fusion category: dagger is conjugate-linear and reverses composition; v†v is positive and is zero only for v=0; tensor product preserves daggers; finite semisimple decompositions may be chosen orthogonally; associators and unitors are unitary.

[F3]

Fusion multiplicity space and Fusion multiplicity spaces are finite-dimensional inner-product spaces: for simple output y, the pairing on Vxay=Hom⁡(x⊗a,y) is positive definite and the chosen vertex maps are orthonormal.

[F4]

Fusion paths give a basis of the fixed-boundary path space: the path composites are already a basis of Ha,n;b,c.

Proof

Given: The unitary category, the path space, and the vertex bases described above.

1.1F1F2F3givenbase

For n=0, T0=b. If b≇c, simplicity gives Hom⁡(c,b)=0 and there are no paths. If b≅c, the only empty-path vector is the chosen unitary isomorphism uc,b:c→b, and uc,b†uc,b=id⁡c shows it has norm one. Such a choice exists: for any isomorphism v:c→b, [F3] gives End⁡(c)=Cid⁡c, so v†v=λid⁡c. Positivity in [F2] gives λ≥0, and v†v=0 would imply v=0 by [F2]; hence λ>0. The rescaled map uc,b=λ−1/2v satisfies uc,b†uc,b=id⁡c. Since it is invertible, uc,b†=uc,b−1, so it is unitary. Thus the length-zero path family is orthonormal. For n=1, the path family is the given orthonormal split vertex basis Bb,ac itself, so the positive-length base case holds independently of the empty-path choice.

1.2F1F2givenih

Fix n≥1 and assume that all length-n path composites, for every simple endpoint, are orthonormal in their Hom spaces.

1.3F2F3algebra

If fμ:x⊗a→y are the chosen orthonormal vertex maps, their adjoints iμ=fμ†:y→x⊗a satisfy iμ†iν=fμfν†=δμνid⁡y by [F3]. Distinct simple outputs are orthogonal, and the orthogonal semisimple decomposition has projections iμiμ† summing to the identity.

2.1F1F2step 1.2step 1.3ihinduction

Tensoring the orthonormal length-n path inclusions by id⁡a preserves their adjoint products because (f⊗id⁡a)†=f†⊗id⁡a by [F2]. Composing with the isometric inclusions of step 1.3 therefore gives orthonormal path inclusions at length n+1. Induction from step 1.1 proves orthonormality for every finite n.

3.1F4step 1.1step 2.1inductiondischarge-induction: step 1.1∎

By induction, every path composite is orthonormal. The basis lemma [F4] says the same finite family spans Ha,n;b,c; if there are no admissible paths, that space is zero and the empty family is its basis. Thus the path composites are an orthonormal basis for each n, completing induction from step 1.1.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Frobenius–Schur sign in a normalized anyonic vacuum channel

Definition

Let C be a unitary spherical fusion category over C, with pivotal structure and spherical dimension as in Pivotal structure, Spherical structure, and The dimension of an object relative to a pivotal structure. Let a be a self-dual simple object with Naa1=1. Choose a unit vector v:1→a⊗a spanning the one-dimensional vacuum split space and let da>0 be its positive spherical dimension.

A normalized vacuum-channel self-duality datum is a supplied pair of maps coev⁡:1→a⊗a and ev⁡:a⊗a→1 of the form

coev⁡=da v,ev⁡=κada v†,

where κa∈{+1,−1} and the two duality zig-zag identities hold after the self-duality identification, using the left-dual convention of Left dual and right dual object. We call κa the Frobenius–Schur sign in this normalized cup/cap convention. It is not a braiding or R-symbol phase.

This item records supplied normalized duality data; it does not assert that every self-dual simple object admits the displayed gauge or prove a trace, ribbon, or category-equivalence theorem. An example must supply the datum or compute the sign from coherent normalized F-data; fusion rules alone do not specify it.

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Local anyonic channel projector

Definition

Fix a fusion-path space with repeated simple site charge a, a position i with two adjacent a-labels, and a simple output s of a⊗a, chosen from the fixed internal representative set of Fixed-boundary anyonic fusion-path space. Choose bases in the split spaces Hom⁡(z,x⊗y) at every vertex of the trees used below, retaining the fixed path vertex bases on the fixed tree. In the tree basis where this adjacent pair is fused first, let Πs be the projection onto the direct summand with pair output s, acting as the identity on every multiplicity index inside that channel and as zero on all other pair outputs. Let Ai:Tfixed→Tpair be a typed composite of associators and their inverses carrying the fixed path tree to this pair-first tree, without permuting the ordered inputs (including the boundary charge). In the split-tree bases of Hom⁡(c,T), let Fi be the matrix of h↦Ai∘h, with target coordinates as rows and source coordinates as columns. The proof below constructs these bases and proves invertibility in any complex fusion category. Define the local channel projector in the fixed path basis by

Pi,s:=Fi−1ΠsFi.

This is an idempotent for any fusion category because Fi is invertible. In a unitary fusion category with orthonormal tree bases, Fi is unitary and Pi,s is an orthogonal projection. The channel projection includes every multiplicity coordinate; the definition has no multiplicity-free restriction. The split Hom convention here is Hom⁡(c,T), as in Fixed-boundary anyonic fusion-path space. In the unitary case with adjoint vertex bases, each local left-to-right split recoupling matrix is the entrywise conjugate of the QC25 inverse-precomposition F matrix, as proved below; they agree for the displayed real Fibonacci and Ising blocks.

Facts & Assumptions

Given: The complex fusion category, simple external objects, internal representative labels, finite trees, vertex bases, and channel projection in the Definition. Unitarity is assumed only for the unitary clauses.

[F1]

Fusion and multifusion categories: every object is a finite direct sum of simple objects, and tensor product is bilinear.

[F2]

Absolutely simple objects: simple endomorphisms are scalar, and Hom spaces between distinct simple representatives vanish.

[F3]

Monoidal category: the associator is an isomorphism; tensor product is a bifunctor.

[F4]

Unitary fusion category: in the unitary case orthogonal decompositions exist, tensor product preserves dagger, and associators are unitary. The split path inner product is specified in Unitary fusion paths form an orthonormal Hilbert basis.

[F5]

F-symbol as a recoupling matrix: in the unitary fusion Hom convention the local associator matrix satisfies fj∘α−1=∑kFkjgk.

Proof

Given: The Definition's split-tree coordinate data, with no dagger or positivity assumed in steps 1.1–2.1.

1.1F1F2givenconstructalgebra

A semisimple decomposition of an object X has inclusions iz,μ:z→X and retractions pz,μ:X→z, with pz,μiz,ν=δμνid⁡z, zero cross-composites for distinct representatives, and ∑z,μiz,μpz,μ=id⁡X. By [F2], its inclusions for each z form a basis of Hom⁡(z,X). Any other basis is obtained by an invertible column change; multiplying the retractions by the inverse matrix retains both identities. Thus any specified split basis can be the inclusion basis of such a decomposition. A simple leaf itself has the one-term decomposition with identity inclusion, even when it is an external object different from its representative.

2.1F1F2F3step 1.1constructalgebra

Build up a finite binary tree from its leaves. Suppose its child objects TL,TR have decompositions with inclusion bases (ix,μ) and (jy,ν) as in step 1.1. Tensoring their decompositions gives inclusions ix,μ⊗jy,ν of x⊗y into TL⊗TR, with tensor retractions whose composites and sum satisfy the same identities by bifunctoriality. Therefore, for any simple output z, composition gives the isomorphism ⨁x,y,μ,νHom⁡(z,x⊗y)→Hom⁡(z,TL⊗TR); its inverse applies those tensor retractions. Inserting the specified vertex basis in each summand produces exactly all split-tree composites for output z, and proves they are a basis. For a nonroot subtree take z once over the internal representative set and apply step 1.1 to obtain its decomposition. At the root use the actual external output c and its specified vertex bases directly. This finite recursion proves the basis assertion for arbitrary external simple objects, without requiring arbitrary endpoint bases to be transported copies of representative bases. Every internal simple label and every multiplicity index is retained.

3.1F3step 2.1givenalgebra

Postcomposition by Ai is linear and invertible, with inverse postcomposition by Ai−1. Step 2.1 supplies bases on both sides, hence its matrix Fi is invertible. The pair-first basis is partitioned by the pair output s, retaining every coordinate within that channel, so Πs2=Πs. Consequently Pi,s2=Fi−1Πs2Fi=Pi,s, proving the general algebraic assertion without unitarity.

4.1F2F4step 1.1step 2.1step 3.1algebra

In the unitary case choose orthonormal split vertex bases. Start step 1.1 with an orthogonal decomposition; any orthonormal change of its inclusion basis is unitary and retains pz,μ=iz,μ†. Tensor compatibility and composition make the decompositions in step 2.1 orthogonal. Thus its tree inclusions are orthonormal for g†h=⟨h,g⟩id⁡c. For unitary Ai one has (Aig)†(Aih)=g†Ai†Aih=g†h. Its matrix Fi is therefore unitary. The coordinate projection Πs is self-adjoint in the orthonormal pair-first basis, so Pi,s=Fi†ΠsFi is self-adjoint as well as idempotent.

5.1F4F5step 3.1step 4.1algebra∎

To compare Hom conventions, take daggers in [F5]. Unitarity of the associator gives α∘fj†=∑kFkj‾gk†. The maps fj†,gk† are exactly the corresponding adjoint split-tree bases. Hence the split postcomposition matrix for this local move is F‾, while the QC25 fusion Hom matrix is F. This proves the claimed convention conversion and completes the well-definedness and unitary assertions, including zero-dimensional spaces with their unique empty coordinate maps.

Coordinate convention

The coordinate convention is illustrated below: vectors move from the fixed tree to the pair-first tree by Fi, the channel projection acts there, and Fi−1 returns to the fixed tree. The curved arrow denotes the defined composite, not an additional morphism.

H¯xedHpairHpairH¯xedFiPi;s¦sF¡1i
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The vacuum F-coefficient records the Frobenius–Schur sign

Statement

Let a and (v,ev⁡,coev⁡,da,κa) be as in Frobenius–Schur sign in a normalized anyonic vacuum channel. In the multiplicity-free vacuum-normalized gauge of F-symbol as a recoupling matrix,

(Faaaa)1,1=κada,δa:=1((Faaaa)−1)1,1=κada.

Facts & Assumptions

Given: A unitary spherical fusion category, a self-dual simple a, the normalized duality datum, and the F-symbol convention.

[F1]

Frobenius–Schur sign in a normalized anyonic vacuum channel: v†v=id⁡1, coev⁡=dav, and ev⁡=κadav†, with κa=±1.

[F2]

F-symbol as a recoupling matrix: in orthonormal tree bases, the coefficient Ff,e is defined by Le∘α−1=∑fFf,eRf; rows index the right-tree channel and columns the left-tree channel.

[F3]

Unitary fusion category and F-symbol unitarity: the chosen trivalent basis maps are orthonormal and the associator F-matrix is unitary.

[F4]

Absolutely simple objects: every simple object has endomorphism space Cid⁡, so the overlap and zig-zag scalars are well-defined.

[F5]

Fusion and multifusion categories: C is finite semisimple with simple tensor unit; a is simple by the hypotheses.

Proof

Given: The normalized cap/cup maps, the chosen vacuum-channel bases, and the typed associator between ((a⊗a)⊗a) and a⊗(a⊗a).

1.1F1F3given

Let L1 be the left-tree basis map obtained by applying v† to the first pair and then the unit unitor, and let R1 be the right-tree basis map obtained by applying v† to the last pair and then the other unit unitor. Both have norm one because v†v=id⁡1 and the unit constraints are unitary.

2.1F2F3F4F5step 1.1algebra

By the F-symbol definition, L1∘α−1=∑f(Faaaa)f,1Rf. Composing on the right with R1† kills every f≠1 by orthogonality, so (L1∘α−1)R1†=(Faaaa)1,1id⁡a. In the chosen basis maps this left side is (v†⊗id⁡a)α−1(id⁡a⊗v), with unitors inserted at the two ends.

3.1F1F2F4F5step 2.1algebra

The first duality zig-zag is (ev⁡⊗id⁡a)α−1(id⁡a⊗coev⁡)=id⁡a. Substituting [F1] gives κada(v†⊗id⁡a)α−1(id⁡a⊗v)=id⁡a. Step 2.1 therefore yields (Faaaa)1,1=1/(κada)=κa/da, since κa2=1.

4.1F3step 3.1algebra∎

The entry in step 3.1 is real. Unitarity [F3] gives ((Faaaa)−1)1,1=(Faaaa)1,1‾=κa/da. Its reciprocal is δa=κada, proving the normalization with the actual FS sign.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The explicit Fibonacci model has a positive spherical pivotal structure

Statement

In the explicit skeletal Fibonacci category of Fibonacci fusion data and chiral convention, take the chosen left duals 1∨=1 and τ∨=τ, with unit cup and cap for 1 and

hτ=ϕ w:1→τ⊗τ,eτ=ϕ w†:τ⊗τ→1,

where w is its isometric vacuum inclusion and ϕ=(1+5)/2. Extend these duals by the diagonal cup and cap on each finite direct sum. With the resulting double-dual identification, jA=id⁡A:A→A∨∨ is a pivotal structure. For every A=1⊕m1⊕τ⊕mτ and every endomorphism f=f1⊕fτ,

Tr⁡L(jAf)=Tr⁡R(fjA−1)=Tr⁡(f1)+ϕTr⁡(fτ).

Thus j is spherical, with positive simple dimensions d1=1, dτ=ϕ. It is the unique pivotal structure for these chosen duals, so the positive spherical structure here is canonical without invoking a general existence theorem for unitary fusion categories. In the supplied pullback-R convention put x=e−4πi/5 and y=e3πi/5. The corresponding ribbon twist is θ1=1, θτ=x; these are inverse to the source's opposite object-braiding orientation.

Facts & Assumptions

Given: The explicit finite direct-sum category, its coherent unitary F/R blocks and chosen simple cup/cap maps from the Fibonacci model.

[F1]

Fibonacci fusion data and chiral convention supplies the actual coherent braided unitary category, u=ϕ−1, v=ϕ−1/2, F−1=F=(uvv−u), x=y2, object-braiding eigenvalues x−1,y−1, and both simple duality snakes with scalar ϕu=1.

[F2]

A braided rigid category has a Drinfeld morphism supplies the natural isomorphism uA:A→A∨∨ given by a right cup, inverse reassociation, braiding the first pair, and its cap; its double-dual tensor comparison dA,B satisfies dA,B(uA⊗uB)=uA⊗BcB,AcA,B.

[F3]

Twist and ribbon structure gives the twist tensor law and dual compatibility; A twist on a braided rigid category is the same thing as a pivotal structure of Drinfeld type proves that uθ is a pivotal structure exactly when θ is a twist. Pivotal means monoidal natural, as in Pivotal structure.

[F4]

The dual of a morphism defines dual maps as evaluation mates. The categorical trace of a morphism into the double dual defines the two typed closures; The dimension of an object relative to a pivotal structure defines dim⁡j(A)=Tr⁡L(jA), and Spherical structure requires dim⁡j(A)=dim⁡j(A∨).

Proof

technique · exhaust the simple braiding channels, compute the Drinfeld comparison in the vacuum F coordinate, and evaluate both traces on all finite matrix blocks
1.1F1F4givenconstructalgebra

For a finite direct sum A=⨁s,ps, let Is,p:s→A be its fixed copy inclusions. Set A∨=A and hA=∑s,p(Is,p⊗Is,p)hs, eA=hA†, where h1=e1=id⁡1. Each cross-copy term in a snake vanishes, and each diagonal term is the simple snake from [F1], so these are duality maps on every finite sum. In the evaluation mate identity, the coefficient for copies p,q of simple s is ds(fs)pq on one side and ds(fs∨)qp on the other, where d1=1 and dτ=ϕ denote the cup/cap normalization constants at this stage. Thus fs∨=fsT, without complex conjugation, by uniqueness of mates. The double dual is therefore literally the identity on objects and morphisms. This alone does not yet establish its tensor comparison. The empty sum uses the unique zero maps and satisfies the same identities.

2.1F1F3step 1.1constructalgebra

Define θA to be the identity on every unit copy and xid⁡τ on every τ copy. These central scalar blocks are natural for arbitrary morphism matrices. Of the four ordered simple pairs, the three containing a unit satisfy the twist law by the strict unit gauge. On τ⊗τ=1⊕τ its two channel equations are x2(x−1)2=1,x2(y−1)2=x, the latter because x=y2. Tensoring copy inclusions and then inserting the simple channel inclusions exhausts every finite direct sum, so these equations prove the twist law on all objects, including zero. Also θ1=1. Duality is block transpose by step 1.1, so θA∨=θA∨; hence this twist is ribbon.

2.2F1F2step 1.1algebra

In [F2]'s typed formula for uτ, the map id⁡τ⊗hτ starts in the right tree τ⊗(τ⊗τ), with its last pair in the vacuum channel. Apply α−1 to reach (τ⊗τ)⊗τ, then cτ,τ⊗id⁡τ, and finally eτ⊗id⁡τ. Let R1=id⁡τ⊗w be the right-vacuum inclusion, and let L1=w⊗id⁡τ,Lτ be the orthonormal left-tree inclusions. The object block is F−1=F, so α−1R1=uL1+vLτ. The middle braiding gives ux−1L1+vy−1Lτ. The final cap is on this same first pair: L1†L1=1 and L1†Lτ=0. With e0=(1,0)T, the complete two-channel compression is therefore uτ=ϕe0Tdiag⁡(x−1,y−1)Fe0id⁡τ=ϕ(ux−1+0⋅vy−1)id⁡τ=x−1id⁡τ,u1=id⁡1. Naturality at all copy inclusions gives precisely these scalar blocks on every finite sum. No dagger conjugation of x or extra F move is inserted.

3.1F1F2F3step 1.1step 2.1step 2.2algebra

By steps 2.1–2.2 and [F3], j=uθ is a monoidal natural isomorphism, and its blocks are all identity. To check the tensor comparison explicitly, the three unit-input cases in [F2]'s relation give da,b=1. In the two ττ channels that relation gives dτ,τ∣1=1⋅x−2x−2=1,dτ,τ∣τ=x−1y−2x−2=xy−2=1. Thus the four ordered simple pairs, including both nonunit root channels, have identity comparison. Naturality at all tensor products of copy inclusions extends this to every finite sum; the unit comparison is identity in the strict unit gauge. This proves the required pivotal monoidality rather than merely objectwise double-dual isomorphisms.

4.1F1F4step 1.1step 3.1algebra

Since A∨=A and jA=1, the left closure is eA(f⊗1)hA and the right closure is eA(1⊗f)hA. Orthogonal copy inclusions kill all off-diagonal terms; the diagonal term for a copy of s is ds(fs)pp on either side. Summing proves both displayed trace formulas. In particular dim⁡j(A)=m1+ϕmτ=dim⁡j(A∨), so [F4] makes j spherical with simple dimensions 1,ϕ>0. For f=g†g, the formula is a sum of these positive weights times squared absolute matrix entries, and vanishes only for g=0. The zero object has trace and dimension zero.

5.1F1F3step 3.1step 4.1algebra∎

If j′ is another pivotal structure, γ=j−1j′ is a monoidal natural automorphism of the identity. Naturality at copy inclusions makes it scalar 1 on unit copies and t≠0 on τ copies. Monoidality on the unit and τ summands of τ⊗τ gives respectively t2=1 and t2=t. Hence t=1, and all components of γ are identity. This proves uniqueness and the asserted canonical positive spherical structure, with every trace and ribbon convention already established.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The Fibonacci ring class is a unit but its simple object is not tensor-invertible

Statement

In the coherent Fibonacci category Fibonacci fusion data and chiral convention, with simple objects 1,τ and τ⊗τ≅1⊕τ, the fusion-ring class [τ] is a unit but the object τ is not tensor-invertible in the sense of Tensor-invertible objects, fusion-ring units, and invertible operators.

Facts & Assumptions

Given: The complex finite semisimple Fibonacci category and its simple fusion rule.

[F1]

Fibonacci fusion data and chiral convention: the simple labels are 1,τ and τ⊗τ=1⊕τ.

[F2]

Fusion rules: simple-object multiplicities are nonnegative integers and form the basis coefficients in K0(C).

[F3]

Tensor-invertible objects, fusion-ring units, and invertible operators: tensor-invertibility requires an object right inverse; an object has a finite semisimple decomposition with nonnegative multiplicities.

Proof

Given: The Fibonacci fusion rule and the definitions in [F2]–[F3].

1.1F1F2algebra

In K0(C), [F1] gives [τ]2=[1]+[τ]. Hence [τ]([τ]−[1])=[1] and ([τ]−[1])[τ]=[1] by the same polynomial calculation. Thus [τ] is a fusion-ring unit, with inverse the virtual class [τ]−[1].

2.1F1F2F3step 1.1algebra∎

If an object Y were a right tensor inverse, [F3] would give [Y]=m[1]+n[τ] for some integers m,n≥0. Then [τ][Y]=n[1]+(m+n)[τ]. Equality with [1] would force n=1 and m+n=0, impossible for m,n≥0. Therefore τ has no right tensor inverse and cannot be tensor-invertible.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Canonical F-move paths give the same channel operator

Statement

For fixed ordered tensor inputs and fixed source and target parenthesizations, any two sequences of canonical associator F-moves between them induce the same coordinate map. Consequently, conjugating a fixed pair-channel projection by either sequence gives the same operator on the fusion-path space.

Facts & Assumptions

Given: A monoidal category, a fixed ordered list of simple input charges, two parenthesizations, and the fusion-tree bases.

[F1]

The proof in Local anyonic channel projector supplies split-tree bases in any complex fusion category and invertible coordinate matrices of h↦A∘h. More generally, in any monoidal category where the Hom spaces and fixed bases in the Given data are available, this same postcomposition rule defines the coordinate map without a semisimplicity or unitarity hypothesis; all intermediate basis indices are retained.

[F2]

Mac Lane coherence in canonical-map form: any two canonical morphisms between fixed parenthesized words on the same ordered inputs are equal.

[F3]

Local anyonic channel projector: a local channel projector is conjugation of the channel projection by the chosen F-move composite.

Proof

Given: The typed parenthesizations, associators, and channel projection in the Statement.

1.1F1construct

For a canonical associator map A:T→T′, [F1] defines the split Hom map A∗:h↦A∘h. If B:T′→T′′, then B∗(A∗(h))=(B∘A)∘h. Thus each finite F-move sequence is the matrix of postcomposition by its canonical composite, including tensor products with identities and inverse associators. This argument applies in any monoidal category with the fixed coordinate spaces and bases posited in the Given data.

2.1F1F2step 1.1algebra

The two sequences in the Statement have the same source and target parenthesized words, so their canonical morphisms are equal by [F2]. Coordinates of equal morphisms in the fixed fusion-tree bases are equal; hence the two matrix composites agree.

3.1F3step 2.1algebra∎

Conjugating the same channel projection by equal coordinate maps gives equal operators, since matrix multiplication preserves equality and the maps are invertible. This is exactly the definition in [F3].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Local channel projections are orthogonal idempotents

Statement

Let b,c,a1,…,an be simple objects of a unitary fusion category, with n≥2, and let Tfixed be a fixed parenthesization of b⊗a1⊗⋯⊗an. Equip H=Hom⁡(c,Tfixed) with the split Hom inner product g†h=⟨h,g⟩id⁡c and choose orthonormal split vertex bases in the trees below. Fix 1≤i<n. Let Ai:Tfixed→Tpair be a composite of associators and inverses to a tree fusing ai,ai+1 first, without permuting inputs. Let Fi be the matrix of h↦Ai∘h, with target rows and source columns, and let Πs project onto all pair-first coordinates of simple pair output s, retaining every multiplicity index. Define Pi,s:=Fi−1ΠsFi, extending the repeated-charge construction of Local anyonic channel projector to these arbitrary simple site charges. Then (Pi,s)s is pairwise orthogonal, self-adjoint, and idempotent, and its sum over all simple outputs of ai⊗ai+1 is the identity on H.

Facts & Assumptions

Given: The unitary fusion category, finite ordered simple inputs, split Hom space, orthonormal vertex bases, and adjacent pair specified in the Statement.

[F1]

Local anyonic channel projector defines the repeated-charge case by Pi,s=Fi−1ΠsFi, with Fi the split-tree postcomposition matrix and Πs retaining all coordinates of pair output s. The Statement explicitly uses this same construction for arbitrary simple site charges.

[F2]

Unitary fusion category: the associator is unitary and tensor product preserves daggers.

Proof

Given: The category, pair, tree bases, and operators specified in the Statement.

1.1F1F2givenalgebra

Orthogonal simple summand inclusions satisfy vμ†vν=δμνid⁡ and ∑μvμvμ†=id⁡, with zero cross-composites for distinct simple labels. Tensoring and composing these identities up a finite tree proves that its split composites form an orthonormal basis, for the arbitrary simple inputs in the Statement. Each associator and its inverse is unitary, so Ai is unitary and (Aig)†(Aih)=g†h; hence Fi−1=Fi†. In the pair-first basis the coordinates are partitioned by pair output. Thus Πs†=Πs, Πs2=Πs, ΠsΠt=0 for s≠t, and ∑sΠs=I, including every multiplicity coordinate. The same identities hold on a zero-dimensional block with its unique empty maps.

2.1F1step 1.1algebra∎

By step 1.1, Pi,s=Fi†ΠsFi, so Pi,s†=Pi,s and Pi,s2=Fi†Πs2Fi=Pi,s. For s≠t, Pi,sPi,t=Fi†ΠsΠtFi=0, and ∑sPi,s=Fi†IFi=I. When all site charges coincide this is exactly [F1]'s family.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Vacuum-channel anyonic projectors satisfy Temperley–Lieb relations

Statement

Let a be a self-dual simple site charge with one-dimensional vacuum fusion a⊗a→1, and supply the normalized pivotal cup/cap datum of Frobenius–Schur sign in a normalized anyonic vacuum channel. On a repeated-a path space let Pi:=Pi,1 and set Ui:=δaPi, where δa=κada is the signed loop parameter of The vacuum F-coefficient records the Frobenius–Schur sign. Then, for all applicable interior indices,

Ui2=δaUi,UiUi+1Ui=Ui,UiUj=UjUi(∣i−j∣>1).

The sign κa is retained; replacing it by +1 is justified only in examples whose self-duality datum has that sign.

For the diagram convention, each box Ui has a cup at the top and a cap at the bottom on strands i,i+1; multiplication stacks diagrams from top to bottom, and a closed circle evaluates to δa. In the left picture the upper box's cup and the lower box's cap remain on the outside, while the upper cap and lower cup form one closed circle. Thus the picture records Ui2=δaUi; the proof below verifies this and the adjacent and distant relations algebraically, without relying on the drawing.

=±a

Facts & Assumptions

Given: A unitary spherical fusion category, identical simple site charge a, the specified self-duality datum, and a path length large enough for the displayed indices.

[F1]

Local anyonic channel projector: Pi is the conjugate of the vacuum-channel projection by the typed local F-move.

[F2]

Local channel projections are orthogonal idempotents: each Pi is an orthogonal projection.

[F3]

The vacuum F-coefficient records the Frobenius–Schur sign: the normalized vacuum overlap is (Faaaa)1,1=κa/da, so its squared modulus is da−2 and δa2=da2.

[F4]

Canonical F-move paths give the same channel operator: computations in any canonical parenthesization give the same local operators.

Proof

Given: The unitary category, the vacuum channel, and the operators in the Statement.

1.1F1F2F3givenalgebra

Restrict three adjacent a sites to total charge a. The subspace where the first pair fuses to 1 is one-dimensional, since Naa1=1 and 1⊗a≅a. The same holds for the subspace where the last pair fuses to 1. In the two orthonormal tree bases their unit vectors have overlap (Faaaa)1,1. The product of rank-one projections onto unit vectors e,f is PePfPe=∣⟨e,f⟩∣2Pe, so [F3] gives PiPi+1Pi=da−2Pi on this total-a block. Outside total a, both vacuum-pair projections vanish because the remaining site is a; hence the identity holds on the full three-site space and, after tensoring with spectator identities, on the path space.

2.1F2F3step 1.1algebra

By [F2], Pi2=Pi, so Ui2=δa2Pi=δaUi. The adjacent relation follows from step 1.1: UiUi+1Ui=δa3da−2Pi=δaPi=Ui, since δa2=da2.

3.1F1F4step 2.1algebra∎

If ∣i−j∣>1, choose a parenthesization grouping the two disjoint adjacent pairs as separate tensor factors, retaining the intervening and outer factors. In that parenthesization their maps have the form A⊗1 and 1⊗B on those factors; bifunctoriality gives (A⊗1)(1⊗B)=A⊗B=(1⊗B)(A⊗1). Tensoring with the other identities and transporting back to the fixed parenthesization preserves this equality by [F4]. Thus all displayed Temperley–Lieb relations hold.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The exact ell-four Ising gauge and parity chirality conversion

Statement

Set q=eπi/4, s=eπi/8 and d=2. The specified rank-one tilting negligible quotient is ribbon-equivalent to the normal-data category of All-label unitary Ising normal data and ribbon coherence at κ=−1, β−=−s−3, with labels p0=1, p1=D, p2=η. The full explicit normalized trivalent gauge is given in the proof using its negative-loop cup w, cap b, and p2=1+wb/d. It gives FDDDD=−2−1/2(111−1), FS sign −1, positive dimension 2, and θD=s3.

Multiplying the associator by ω(x,y,z)=(−1)∣x∣∣y∣∣z∣ and the braiding by (−i)∣x∣∣y∣, with D odd and group objects even, gives the distinct κ=+1, β+=s category. Flip the D evaluation and keep its coevaluation. Its complete pullback R data are RDD0=s−1, RDDη=is−1, RηDD=RDηD=−i, Rηη0=−1, and unit entries one. Its twist is θD=s−1 in the actual pullback orientation. This is an associator/braiding conversion, not a vertex gauge equivalence or an unmodified positive-loop pivotal TL equivalence. Reversing its braiding and twist is a further explicitly different chirality operation.

Facts & Assumptions

Given: The specified ell-four root category with its actual negative FS and positive pivotal convention, and the complete normal-data supplier. All computations use the explicit retained quotient, not the unreduced tensor-module kernel.

[F1]

All-label unitary Ising normal data and ribbon coherence constructs the complete two-sign normal F/R category, its full coherence, positive pivot, FS and twists, with no sector example as a premise.

[F2]

The rank-one tilting quotient matches the Temperley-Lieb ribbon convention gives the exact negative-loop, parity-pivotal ribbon comparison and complete centralizer identification with the full root tilting quotient.

[F3]

The corrected finite rank-one R series gives the full tilting ribbon structure gives the actual full-weight cup/cap, negative FS, positive-K pivot, finite R and channel twists, including even roots.

[F4]

The JW recursion, partial trace and annihilation are Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure; complete retained path units and the exact boundary quotient are Root fusion paths have nonzero pairings and The root negligible quotient is semisimple with truncated fusion.

[F5]

The typed F and inverse-pullback R conventions are F-symbol as a recoupling matrix and R-symbol as a channel exchange map.

Proof

technique · fix every trivalent phase in the root quotient, compute its contraction table, and apply the explicit parity cocycle and braiding correction
1.1F2F3givenalgebra

Put d=2, q=eπi/4 and s=eπi/8. In the specified root quotient the labels p0,p1,p2 are 1,D,η. The fundamental FS sign is −1, positive pivotal dimension is d, twists are θD=s3, θη=−1, and object crossing eigenvalues are cDD0=−s−3=e5πi/8 and cDDη=s.

2.1F1F5step 1.1algebra

The local definition of R is pullback f↦f∘ca,b−1. Consequently the displayed positive-Hadamard Ising sector phases correspond to object eigenvalues eπi/8,e−3πi/8 and FS sign +1. Neither FS nor an equal-input braiding eigenvalue changes under a vertex gauge. These are therefore distinct categories, and the inverse-pullback orientation will force target twist e−πi/8, not an implicitly imported physical twist eπi/8.

3.1F4step 2.1algebra

Work in the root's negative-loop realization, with cup w, cap b, both snakes and bw=−d. Set P=p2=I+wb/d, represent D by one strand and η by the two-strand summand P, and put W2=(I⊗w⊗I)w, B2=b(I⊗b⊗I). Choose all unit vertices as identities and the nonunit inclusions/retractions as iDD0=w/d,pDD0=−b/d,iDDη=P,pDDη=P,iηDD=−d(P⊗I)(I⊗w),pηDD=d(I⊗b)(P⊗I),iDηD=−d(I⊗P)(w⊗I),pDηD=d(b⊗I)(I⊗P),iηη0=−(P⊗P)W2,pηη0=−B2(P⊗P). The last minus sign is part of the gauge: omitting it would change four scalar F blocks. The positive unitary dagger has w†=−b; it is not the ordinary Hilbert adjoint of matrices in the quantum weight basis.

4.1F4step 3.1algebra

The snakes, P2=P, Pw=bP=0 and d2=2 prove these are isometric splittings. For example, for A=(P⊗I)(I⊗w) one has A†=−(I⊗b)(P⊗I) and A†A=1/d, so −dA is isometric; reflection proves the other mixed case. The nested two-strand cup/cap contraction with P inserted is one, proving the ηη normalization. The channel projections sum to identity in the negligible quotient: DD is vacuum plus P, ηD and Dη are simple D after killing p3, and ηη is the unit. In the constructed three-simple category the second-pair vacuum coefficient on the first-pair η part of its DDD fusion space is 1/2, so the corresponding U2=dPvac sandwich is 1/d and p3=(P⊗I)−d(P⊗I)U2(P⊗I)=0. This concerns the quotient, not the nonzero unreduced weight-module projector.

5.1F1F4step 4.1algebra

Every F entry is the same explicit contraction (pafz)(1a⊗pbcf)(iabe⊗1c)iecz=Fzabc[f,e]1z, where 1η=P, 1D=I, 10=1 and every elementary multiplicity coordinate equals one. With the gauge of step 3.1 the full nonunit table is (a,b,c)zFzabc(η,η,η)η1(η,η,D)D1(η,D,η)D−1(D,η,η)D1(η,D,D)0,η1,1(D,η,D)0,η1,−1(D,D,η)0,η1,1(D,D,D)Dd−1(−1−1−11). Unit blocks are identities and impossible channels are empty. Thus every coefficient, rather than only a selected sector, has a specified matrix product and basis.

6.1F1F4step 5.1algebra

Expand P=1+wb/d in those contractions. Each inner cup-cap contributes −d or is removed by a snake; turnbacks into P vanish. In the two-dimensional block the left/right vacuum overlap is −1/d, the fixed negative mixed inclusions make both off-diagonal overlaps −1/d, and normalization/orthogonality gives the final overlap +1/d. In scalar blocks expanding a P next to a mixed vertex either removes its turnback term or leaves its complementary 1/d term. With the chosen minus on iηη0, the table entries for (η,η,D) and (D,η,η), each of total D, are +1; the total-1 channels of (η,D,D) and (D,D,η) are also +1. The remaining nontrivial scalar signs are exactly FDηDη=FηDηD=−1. This proves step 5.1's full table and matches the normal category at κ=−1. An independent exact-matrix evaluation uses q=(1+i)/2, w=(0,1,−q−1,0)t and b=(0,−q,1,0) in the same contractions, extracting the scalar on the highest retained vector; it corroborates all 33 admissible F blocks, rather than supplying a missing argument.

7.1F1F2F4step 6.1algebra

The category identification also follows directly from the tensor functor generated by cup d iDD0 and cap −d pDD0 in the negative-sign normal category. They satisfy both snakes and loop −d, so define a functor from negative-loop TL; p2 maps to η and p3 maps to zero by step 4.1. The complete retained path matrix units give full faithfulness on every tensor power and rectangular Hom block: both sides have the same A3 paths, scalar corners 0,D,η, and nonzero normalized splits, and these generate all objects. The positive pivotal structures agree in dimension and the actual negative FS convention. The explicit maps of step 3.1 fix its vertex gauge, so this is a category equivalence rather than merely a fusion-ring identification. The matching braiding in the next step makes it a ribbon equivalence.

8.1F1F3step 7.1algebra

At κ=−1, take β−=−s−3. Then β−2=−(1+i)/d and v(1)=−iβ−=s. The negative-loop source crossing sI+s−1e agrees with both actual root DD eigenvalues. Since D generates and the hexagons build every block crossing, the full root braiding is the normal table: cηη0=−1 and cηDD=cDηD=i, together with those two DD entries and unit entries one. Contractions of the explicit block crossings with step 3.1's vertices give the same ten channels. The full normal-data supplier proves the positive pivot and curl θD=−1/β−=s3, so step 7.1's equivalence preserves the specified ribbon structure.

9.1F1step 8.1algebra

Declare D odd and the group objects even. Change the associator by ω(x,y,z)=(−1)xyz on parities and the braiding by ζxy with ζ=−i. The cocycle equation is the equality modulo two of bcd+a(b+c)d+abc and (a+b)cd+ab(c+d). It changes only the DDD associator, hence flips τ. The abelian hexagon correction uses ζ2=−1: an all-odd triple contributes the two crossing factors ζ2 and the compensating associator sign −1; all other parity placements contribute one. Equivalently the complete normal F/R table proves these changed hexagons entrywise. This is a parity associator change, not a vertex gauge.

10.1F1step 9.1algebra

Keep the D coevaluation and flip its evaluation. The changed odd-triple associator flips its snake sign too, so both snakes remain identities and κ changes from −1 to +1 while the positive pivotal dimension remains d. The mixed braidings stay i and β+=(−i)β−=s. The positive curl changes by the same factor: θD+=(−i)θD−=s−1. The normal supplier's explicit dual and double-dual tensorators verify this positive pivotal convention globally; it has not been chosen merely from the square of a braiding phase.

11.1F5step 10.1algebra∎

The resulting full pullback table is RDD0=s−1=e−πi/8, RDDη=is−1=e3πi/8, RηDD=RDηD=−i, Rηη0=−1, and unit entries one. Its DDD block is the positive Hadamard and its FS sign is +1, so it matches the stated inverse-pullback sector convention in the full coherent category. The root and changed categories retain their different associators, FS and braid phases. If object braiding phases e−πi/8,e3πi/8 and twist eπi/8 are instead desired, one must additionally reverse this braiding and invert its twist. That is a further explicit chirality operation, not the orientation of the local inverse-pullback definition. This proves all root-gauge and conversion assertions.

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.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Periodic Ising paths, two sectors, and the full line representation

Statement

Use either coherent κ category of All-label unitary Ising normal data and ribbon coherence, with reference charge D and representative set Irr⁡(C)={1,η,D}. For L≥1 define the periodic carrier

HL:=⨁b∈Irr⁡(C)HD,L;b,b,

using the fixed-boundary path spaces of Fixed-boundary anyonic fusion-path space and the orthogonal Hilbert direct-sum inner product. The union of their fusion-path bases, supplied as orthonormal bases by Unitary fusion paths form an orthonormal Hilbert basis, is the cyclic path basis: a path in the b summand has x1=b, xL+1=x1, and retains every elementary fusion index. Odd L gives the zero space. For L=2N, N≥1, this complete orthonormal carrier is H⊕Hˉ, each sector of dimension 2N, with the explicit bit identifications in the proof. These identifications intertwine every vacuum pair projector, including wraparound: P2j−1∣H=(1+Xj)/2,P2j∣H=(1+ZjZj+1)/2, P2j−1∣Hˉ=(1+ZjZj+1)/2,P2j∣Hˉ=(1+Xj+1)/2. All bit indices are modulo N. For N=1 the bond is the identity; no three-distinct-site cyclic TL assertion is made for this length-two identification.

Let C∣b1⋯bN⟩=∣b2⋯bNb1⟩, Q=∏jXj, and Kc,b=2−N/2(−1)∑jcj(bj−1+bj). The one-step periodic path shift and the annular line maps defined by the full cyclic F contraction satisfy T=(0CI0),Yη=diag⁡(Q,Q),YD=κN(0K†K0). They obey TPiT−1=Pi−1, YD2=I+Yη, Yη2=I, YηYD=YDYη=YD, and each line map commutes with every represented Pi and with T. In contrast the specified normalized single-chain map obeys (K/2)2=(I+Q)C−1/2. The proof supplies all wrapping, kernel, rank, Hamiltonian, and intertwining assertions on the full two-sector space, without a total-flux or global-spin-parity projection.

Facts & Assumptions

Given: Either coherent normal-data category, its representative labels and orthonormal fusion vertices, reference charge D, and a length L≥1. All arithmetic in a binary exponent is modulo two.

[F1]

All-label unitary Ising normal data and ribbon coherence supplies every admissible Ising F block, both FS signs, orthonormal summand vertices, unitarity and full pentagon/hexagon coherence.

[F2]

Fixed-boundary anyonic fusion-path space identifies each summand of HL with the typed fixed-boundary Hom space and retains each vertex index.

[F3]

Unitary fusion paths form an orthonormal Hilbert basis makes the path basis of each summand orthonormal; their finite direct sum is the carrier's orthonormal cyclic path basis.

[F4]

The F coordinate convention retains every intermediate channel and multiplicity coordinate (F-symbol as a recoupling matrix, Definition; Fusion multiplicity space, Definition).

[F5]

Tensor product preserves dagger and orthogonal simple decompositions may be chosen isometrically (Unitary fusion category, Definition).

Proof

technique · evaluate every local and cyclic F contraction in both periodic sectors, then prove the resulting finite Fourier identities for arbitrary length
1.1F1F2F3F4F5givenconstructalgebra

By [F2], the carrier HL is the direct sum of the Hom spaces HD,L;b,b, and by [F3] the path composites in each summand form an orthonormal basis. A basis vector in the b summand is exactly a cyclic path with x1=b, xL+1=x1, and all vertex indices retained; conversely every cyclic path belongs to exactly one such summand. Since the Ising fusion rules are D⊗D=1⊕η and D⊗g=D for g∈G={1,η}, the labels alternate between D and G. Thus the cyclic path space is zero for odd L. For L=2N, N≥1, it is the orthogonal sum H⊕Hˉ, with H given by x2j−1=D, x2j=bj∈G and Hˉ by x2j−1=bj∈G, x2j=D. The N bits are independent even across the wrap edge, giving dimension 2N in each sector. The maps ΦH,ΦHˉ send the paths to the standard orthonormal basis ∣b1⋯bN⟩, with inverse obtained by inserting the fixed D labels. This includes both sectors without a total-flux or global-spin-parity projection; at N=1 there are four states.

2.1step 1.1algebra

Define Pi to project the two reference edges from xi to xi+2 to vacuum, changing only the intermediate label xi+1. Its local F matrix is Fxi+2xiDD, with source channel xi+1 and target DD output. Thus its index differs from a convention naming the intermediate link by one. If both neighbors are D, the F matrix is κ times Hadamard and F−1Π0F=(I+X)/2 on the intermediate bit. If they are group labels g,h, the intermediate label is forced to be D and the DD output is g+h, so the vacuum projector is δg,h. The overall κ cancels, so both coherent sign conventions give the same projectors.

3.1step 2.1algebra

With bit indices modulo N, the complete sector images are ΦHP2j−1ΦH−1=(I+Xj)/2, ΦHP2jΦH−1=(I+ZjZj+1)/2, ΦHˉP2j−1ΦHˉ−1=(I+ZjZj+1)/2, and ΦHˉP2jΦHˉ−1=(I+Xj+1)/2. This includes the wraparound edge. At N=1 the bond is (I+Z12)/2=I and the field is (I+X1)/2. No three-distinct-site cyclic TL relation is asserted for that length-two identification; the ordinary interior theorem keeps its own applicable-index hypothesis.

4.1step 3.1algebra

Define the path shift by (Tx)i=xi+1 cyclically and let C∣b1⋯bN⟩=∣b2⋯bNb1⟩. On H→Hˉ the bit coordinates are unchanged, and on Hˉ→H they shift by C. Therefore, in the order H⊕Hˉ, ΦTΦ−1=(0CI0), T2=diag⁡(C,C) and T2N=I. It is unitary. Since CXjC−1=Xj−1 and the same relabelling holds for Z, substituting all four formulas of step 3.1 proves TPiT−1=Pi−1 at every cyclic index, including i=1 and i=2N. Thus the basis identifications intertwine the specified operators, not merely their dimensions.

5.1step 4.1algebra

The represented operator ∑i(1−2Pi) is two copies of −∑j(Xj+ZjZj+1). Unequal odd/even couplings give −g∑jXj−h∑jZjZj+1 on H, and −g∑jZjZj+1−h∑jXj on Hˉ. Only g=h is invariant under one-step T, while both are invariant under T2. These Hamiltonian statements follow from the specified projector representation, rather than from fusion rules alone.

6.1step 5.1algebra

Define the annular line action by its full cyclic contraction (Ya)x′,x=∏i=12NFxi+1′axiD[xi+1,xi′] when each xi′ occurs in axi, and set it to zero otherwise. The row and column include all elementary multiplicity indices, each one here. This is the associator moving (axi)D to a(xiD) around the circle, so the formula specifies the wrap contraction. The unit line gives I. For a=η every admissible output flips all group bits and fixes D, and each local F factor is one. Hence Yη=diag⁡(Q,Q) with Q=∏jXj.

7.1step 6.1algebra

For a=D, an input H bit string b maps to an output Hˉ bit string c. The odd local factors are (κ/d)(−1)bjcj, while the even factors are (−1)bjcj+1. Their product is κNKc,b, where Kc,b=2−N/2(−1)∑jcj(bj−1+bj). On the reverse sector the cyclic contraction is κNK†. All exponents are modulo two and b0=bN. Thus YD=κN(0K†K0). This derives the kernel and its normalization from all-label F data, including every wrap factor.

8.1step 7.1algebra

Orthogonality of finite binary characters gives (K†K)c,b=(KK†)c,b=2−N∑y(−1)∑jyj((bj+cj)+(bj−1+cj−1))=δc,b+δc,b+1, where 1 is the all-ones bit string. Indeed the character is trivial exactly when b+c is constant around the cycle. Consequently K†K=KK†=I+Q. Also KQ=QK=K, because complementing all bits in either string changes the exponent by an even integer. This is an exact character-sum proof for every N, not a finite-size inference.

9.1step 8.1algebra

Substitution in the two-sector matrices proves YD2=I+Yη, Yη2=I, and YηYD=YDYη=YD. Each K has rank 2N−1, so YD has rank 2N on the full 2N+1-dimensional space and is noninvertible. At N=1, K is 2−1/2 times the all-ones matrix, so these identities and ranks still hold without deleting either sector.

10.1step 9.1algebra

Flipping input bit bj changes the kernel phase by cj+cj+1, and flipping output bit cj+1 changes it by bj+bj+1. Therefore KXj=ZjZj+1K and KZjZj+1=Xj+1K for all periodic j. Their adjoints prove the reverse-sector equations. Comparison with all four projector formulas of step 3.1 gives [YD,Pi]=[Yη,Pi]=0 for every i, hence commutation with every Hamiltonian of step 5.1. In particular the same line intertwines the two opposite-coupling spin Hamiltonians. This is the actual local operator intertwining, including wraparound.

11.1step 10.1algebra

Transposing the kernel interchanges ∑jcj(bj−1+bj) with ∑jcj(bj+bj+1), which is exactly a cyclic shift of its input or output. Thus K†=CK=KC. Substitution into the full block formulas for YD and T proves their commutation; Q also commutes with C, so Yη commutes with T. These are statements on the doubled path space with the explicitly defined translation.

12.1step 11.1algebra∎

On one bit-chain space the same identities instead give K2=(I+Q)C−1 and (K/2)2=((I+Q)/2)C−1. The latter normalized map has spin-lattice translation TIsing=C−1 in this orientation. Its translated square differs from the doubled-space fusion square and its domain has half as many states. Thus both the full two-sector fusion algebra and the specified translated single-chain algebra have been proved, together with all local projectors, line maps, wrapping, ranks, Hamiltonian consequences and intertwining assertions.

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.

5 · Examples, counterexamples and false statements

None yet.

Sources