Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

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.

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