Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Colored signed twist surgery, circumcision, and paired-handle cancellation

Statement

Let C be a complex modular spherical ribbon fusion category. Put D2=∑idi2, choose D≠0, let p±=∑iθi±1di2, κ=p+/D, and Ω=∑idii. Write bX:1→X⊗X∗ and eX:X∗⊗X→1 for left duality, rX=eX∗(jX⊗1) for right evaluation, and bXR=(1⊗jX−1)bX∗ for right coevaluation. For a:X⊗Z→Y⊗Z define

ptr⁡Z(a)=(1Y⊗rZ)(a⊗1Z∗)(1X⊗bZ),MX,Z=cZ,XcX,Z.

Then p+p−=D2, and the following are identities of complete morphisms, valid with arbitrary exterior tensor factors and coupons:

K±(X):=∑idiθi±1ptr⁡i(MX,i±1)=p±θX∓1.

The zero-framed meridian operator EX=∑idiptr⁡i(MX,i) equals D2PX, where PX is the projection onto the full unit-isotypic summand. For a∈End⁡(i∗⊗j) define

Rij(a)=(ri⊗1j⊗1j∗)(1i⊗a⊗1j∗)(1i⊗1i∗⊗bj).

The paired-handle/coupon contraction is

Rij(Ei∗⊗j)=δijD2di1i⊗i∗.

Thus the normalized graph evaluation D−m−1κ−σ(B)F is unchanged under a signed generalized Fenn–Rourke twist-surgery move or circumcision adding a framed knot and its small zero-framed meridian. These are local algebraic identities; a complete presentation/move theorem is a separate topological assertion. No positivity, unitary conjugation, or anomaly cancellation is assumed.

Facts & Assumptions

Given: The category and duality conventions in the Statement; the finite colored coupon composites appearing below.

[F1]

All di and D are nonzero, di∗=di, s2=D2C, and ptr⁡i(Mj,i)=(sji/dj)1j for simple j (Simple ribbon fusion dimensions are nonzero, The modular Hopf-link matrix squares to D² times duality, Balancing and the Hopf-link character identity).

[F2]

Balancing, naturality, the hexagons, spherical cyclic trace and both duality snakes are the stated ribbon-category axioms and trace identities (Modular ribbon fusion category and Hopf-link data, Rigid object and rigid monoidal category, Basic properties of the categorical trace).

[F3]

The full multicolored coupon evaluator assigns the elementary composites and is invariant under colored graph isotopy (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation). The complete Gauss/Kirby data are supplied by Modular Gauss sums, the Kirby color, and its slide identity; the local composite/signature calculations below are also explicit.

[A1]

Countable choice is carried through the framed-tangle evaluation supplier (The Axiom of Countable Choice (ACω)); all decompositions and bases used here are finite.

Proof

Given: The data in the Statement.

1.1F1F2givenalgebra

Choose actual finite simple inclusions uk,a:k→X and projections vk,a:X→k from a direct sum, with vk,aul,b=δklδab1k and ∑k,auk,avk,a=1X. Inserting these two identities on either side of any coupon f:X→Y gives its complete expansion f=∑k,a,buk,bY(vYk,bfuk,aX)vXk,a. Off-diagonal simple terms vanish by Schur's lemma; every remaining middle term is a scalar. Thus this expansion is independent of basis and respects composition/tensor products. Since tr⁡k(vk,auk,b)=dkδab, trace-dual projections are vk,a/dk, and the trace-dual resolution is 1X=∑k,adkuk,a(vk,a/dk). Reversing an edge applies the dual functor and reverses the composite, preserving the identity.

1.2F1F2givenalgebra

Trace multiplicativity and Frobenius reciprocity give didj=∑kNijkdk and ∑idiNijk=dkdj. Summing the balancing expression sij=(θiθj)−1∑kNijkθkdk therefore gives ∑iθidisij=p+θj−1dj. Multiply by sj∗,k and sum over j. The identity ∑jsijsj∗,k=D2δik gives p+∑jθj−1djsj∗,k=D2θkdk. At k=0, reindexing j by j∗ yields p+p−=D2. Consequently p±≠0 and κ−1=p−/D.

2.1F1F2step 1.1algebra

For the unit label, put xa=u0,a, ya=v0,a. Then yaxb=δab and PX=∑axaya is the unit-isotypic projector. It is the identity on Hom⁡(1,X) and on the opposite dual pairing, because all nonunit components of a map from or to the simple unit vanish. The bending map f:k→X↦(f⊗1)bk has inverse z↦(1X⊗ek)(z⊗1k) by the two snakes. Closing a bent pair f,g gives tr⁡k(gf), so the same dk factors of step 1.1 apply after bending.

2.2F1F2step 1.1step 1.2algebra

The displayed partial trace satisfies ptr⁡Z((f⊗1)a(g⊗1))=fptr⁡Z(a)g by interchange. Naturality of both braidings consequently makes each K+(X) natural in X. On simple j, step 1.2 gives K+(j)=p+θj−11j. Inserting the full direct-sum resolution gives K+(X)=∑j,auj,aK+(j)vj,a=p+θX−1 for every object. For the negative version, balancing gives Mj,i−1=(θj⊗θi)θj⊗i−1, hence tr⁡jK−(j)=∑i,kdiθi−1θjθiNjikθk−1dk=θjdjp−. Divide by dj and use the same naturality/resolution to obtain K−(X)=p−θX.

3.1F2F3A1step 1.2step 2.2algebra

For arbitrary coupons a:A→X and b:X→B, step 2.2 says bθX±1K±(X)a=p±ba. Take X to be the tensor product of every oriented strand through the local surgery annulus, using duals for reversed strands. Repeated hexagons expand MX,i into the full encircling strand word; repeated balancing expands θX into all individual twists and pairwise crossings in its full bunch twist. This explicitly identifies the complete signed twist-surgery composite even if exterior coupons join different members of the bunch. If its eliminated framing is ϵ=±1 and linking vector is ℓ, its matrix B=[ϵℓtℓA] is congruent to [ϵ]⊕(A−ϵℓℓt) by replacing each remaining vector z with z−ϵℓzu. Thus m decreases by1 and signature byϵ. Its graph scalar is pϵ, and D−1κ−ϵpϵ=1, proving the normalized signed-move equality with its exact framing/signature factors.

3.2F1F2step 1.1step 2.1algebra

The same naturality makes EX natural. On simple j its scalar is dj−1∑idisji=D2δj0 by s2=D2C. Inserting step 1.1 proves EX=D2PX on every object, not just a simple strand. Thus D−2yEXx=yx for any x:1→X, y:X→1, with arbitrary coupon networks defining x,y.

4.1F1F2step 3.2algebra

Rigidity gives Hom⁡(1,i∗⊗j)≅Hom⁡(i,j), zero unless i=j. When i=j its generator is biR, and eibiR=di by sphericality. Hence Pi∗⊗j=δijbiRei/di. Insert this into Rij(Ei∗⊗j). The right snake (ri⊗1i)(1i⊗biR)=1i retracts its first pair, and the left snake (ei⊗1i∗)(1i∗⊗bi)=1i∗ retracts the remaining pair. The resulting full morphism is δij(D2/di)1i⊗i∗. Tensoring g such disjoint pieces gives zero unless the entire color tuples agree and gives D2g/∏rdir times the identity otherwise, with every multiplicity-space coupon retained.

5.1F2F3A1step 3.1step 3.2step 4.1algebra∎

For circumcision introduce a framed knot K and a small zero-framed meridian U meeting only K. In the finite Ω sum, U acts on the simple K-color j by D2δj0. The surviving coefficient is d0=1, and the unit-colored knot, with all its framing and crossings, evaluates as the empty graph. Thus the full arbitrary-coupon exterior evaluation is multiplied by exactly D2. If K has framing f and links the old surgery link by ℓ, the new matrix is B′=[Aℓ0ℓtf1010]. Subtracting ℓz times the new meridian vector from each old vector gives B′≅A⊕[f110]. The last block has determinant−1 and signature0. Two new components contribute D−2 and cancel D2, with no signature or weight change. This proves the complete stated local identities, while leaving the genuine relative move-completeness theorem separate.

Depends on

Used by

Dependency tree · two levels

36 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