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.

The complete Kirby-color band-slide identity with open colored graph coupons

Statement

Let C be a complex finite semisimple spherical ribbon category with simple unit and finite simple-label set I, with every di≠0. Put Ω=∑idii and use the multicolored arbitrary-coupon evaluator of Multicolored ribbon graphs with arbitrary coupons have a unique evaluation. The entire graph evaluation is unchanged under a framed band slide of one Ω-colored surgery component over another. It is also unchanged under sliding an open strand of any fixed color, or a strand of an arbitrary coupon-bearing colored graph, over an Ω-colored surgery component, keeping every original color and coupon morphism fixed. All exterior crossings, open boundary factors and coupons are included, not merely a meridian scalar or closed trace. Orientations may be reversed with dual labels; no positivity or unitarity is assumed.

Here is the exact algebraic contract. Let B=⨁ii∗⊗i with inclusions ιi. Define ιX,Δ,ε,m by the finite formulas in the proof, and put Λ=∑idiιibiR. Then

m(1B⊗Λ)=Λε,Γ=(1B⊗m)(Δ⊗1B),Γ(1B⊗Λ)=1B⊗Λ,Γ(Λ⊗Λ)=Λ⊗Λ.

For a fixed object Y the lifted open-strand operator, retaining its entire first tensor factor, is

Γ^Y=(1Y∗⊗Y⊗m)(1Y∗⊗Y⊗ιY⊗1B)(1Y∗⊗bY⊗1Y⊗1B),

and it satisfies Γ^Y(1Y∗⊗Y⊗Λ)=1Y∗⊗Y⊗Λ. Its exterior requires dinaturality only in the surgery-component variable; there is no naturality assumption on an arbitrary family of graph coupons indexed by Y. This lemma has no Gauss-sum, Fenn–Rourke, surgery normalization or topological move-completeness premise.

Facts & Assumptions

Given: The category and colored framed graph composites of the Statement, with left duals bX:1→X⊗X∗, eX:X∗⊗X→1, and ribbon-induced right duals bXR:1→X∗⊗X, rX:X⊗X∗→1.

[F1]

The full multicolored coupon evaluator preserves the naturality, hexagon, dual-mate and full-twist identities and all framed graph isotopies (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).

[F2]

Finite semisimplicity gives actual simple inclusions/projections, scalar simple endomorphisms and finite-dimensional Hom spaces; simple dimensions are nonzero (Fusion and multifusion categories, Simple ribbon fusion dimensions are nonzero).

[F3]

Spherical trace is cyclic, additive and compatible with staged partial trace; both duality snakes and tensor-dual comparisons hold (Basic properties of the categorical trace, In a spherical category the left and right traces agree, Rigid object and rigid monoidal category, Twist and ribbon structure, Braiding).

[A1]

Countable choice is inherited only through [F1] (The Axiom of Countable Choice (ACω)). All decompositions and new sums are finite.

Proof

Given: The data in the Statement.

1.1F1F2F3givenconstruct

For each X choose actual ui,a:i→X, vi,a:X→i with vi,auj,b=δijδab1i and ∑i,aui,avi,a=1X. Define ιX=∑i,aιi(ui,a∗⊗vi,a):X∗⊗X→B. Changing a multiplicity-space basis multiplies the two entries by inverse matrices, leaving this sum unchanged. For f:X→Y, expand its scalar simple blocks vYfuX in the two decompositions. This gives the exact dinaturality equation ιY(1Y∗⊗f)=ιX(f∗⊗1X). If another family tX:X∗⊗X→Z obeys that equation, its finite decomposition is tX=∑i,ati(ui,a∗⊗vi,a). Thus the unique map t:B→Z with tιi=ti satisfies tιX=tX. This proves the coend property explicitly, including uniqueness, without an existence or Fubini theorem.

2.1F1F2F3step 1.1algebra

Define the required structural maps by ΔιX=(ιX⊗ιX)(1X∗⊗bX⊗1X), ειX=eX, and m(ιX⊗ιY)=ιY⊗X(1X∗⊗cX,Y∗⊗Y). The last target uses (Y⊗X)∗=X∗⊗Y∗, or its canonical dual comparison. These formulas define maps first on the finitely many simple summands. Dinaturality, braiding naturality and the explicit dual-mate identities in [F1] show that their stated words hold for arbitrary X,Y, proving well-definedness under every choice of decomposition. Substituting the first two words gives (1B⊗ε)ΔιX=(ιX⊗eX)(1X∗⊗bX⊗1X)=ιX by a snake; the opposite snake gives (ε⊗1B)Δ=1B too. No other Hopf algebra axiom is needed.

2.2F2F3step 1.1algebra

Fix simple j,k and decompose each i⊗j using uk,a:k→i⊗j and vk,a:i⊗j→k, with vk,buk,a=δab1k. Set Fi,a=(vk,a⊗1j∗)(1i⊗bj):i→k⊗j∗ and Gi,a=(1i⊗rj)(uk,a⊗1j∗):k⊗j∗→i. Their inverses as adjunction correspondences insert ej or bjR and retract a snake, so the F and G families span the respective simple multiplicity spaces. Define ptr⁡j(a)=(1i⊗rj)(a⊗1j∗)(1i⊗bj) on a∈End⁡(i⊗j). The displayed words give Gi,bFi,a=ptr⁡j(uk,bvk,a). Closing in stages and then cyclically gives tr⁡i(Gi,bFi,a)=tr⁡i⊗j(uk,bvk,a)=tr⁡k(vk,auk,b)=δabdk. Since i is simple, Gi,bFi,a=δab(dk/di)1i; compositions with different simple labels vanish. Consequently the actual complete trace-dual resolution on k⊗j∗ is ∑i,adiFi,aGi,a=dk1k⊗j∗. This includes every fusion multiplicity and uses no positivity.

2.3F1F2step 1.1construct

For the two-Ω slide, cut its participating components near the attaching band and place those endpoint pairs adjacently below the remaining graph. Evaluating that exterior with variable cut colors gives TX,Y:X∗⊗X⊗Y∗⊗Y⊗U→V, retaining arbitrary other boundary factors and coupons. It is dinatural in the two surgery variables: a morphism inserted on their paths passes crossings by [F1]'s naturality, twists by twist naturality and bends by its explicit inverse mate formulas; no coupon lies on a surgery component itself. Define Φ:B⊗B⊗U→V by its simple restrictions Φ(ιi⊗ιj⊗1U)=Ti,j. step 1.1's finite decomposition proves TX,Y=Φ(ιX⊗ιY⊗1U) for all X,Y. This is the full exterior factorization, including arbitrary external coupons, not a claim that those coupons are natural as functions of their own graph colors.

3.1F1F3step 2.2algebra

For a∈End⁡(k⊗j∗) define the literal composite Tkj(a)=(1k∗⊗1k⊗ej)(1k∗⊗a⊗1j)(bkR⊗1j∗⊗1j):j∗⊗j→k∗⊗k. It sends the identity to bkRej. Substituting F,G gives Tkj(Fi,aGi,a)=(uk,a∗⊗vk,a)(1j∗⊗biR⊗1j). To check every bend, first expand F: its bj and the final ej retract by the j∗ snake, leaving vk,a on i⊗j. In the other half use (1k∗⊗uk,a)bkR=(uk,a∗⊗1i⊗j)bi⊗jR, the dual-mate coevaluation identity. Expand bi⊗jR=(1j∗⊗biR⊗1j)bjR; the rj in G retracts the outer right snake. The remaining word is exactly the stated u∗,biR,v composite, with domain j∗⊗j and target k∗⊗k. Applying T to step 2.2's resolution thus proves the complete morphism identity ∑i,adi(uk,a∗⊗vk,a)(1j∗⊗biR⊗1j)=dkbkRej.

4.1F1F3step 1.1step 2.1step 3.1algebra

Put Λ=∑idiιibiR. Braiding naturality at biR says cj,i∗⊗i(1j⊗biR)=biR⊗1j. Hence the multiplication word gives m(ιj⊗Λ)=∑idiιi⊗j(1j∗⊗biR⊗1j). Expand ιi⊗j using step 1.1 and apply step 3.1 separately for each output k. The result is ∑kdkιkbkRej=Λej. The ιj are all summand inclusions, so this is the full identity m(1B⊗Λ)=Λε. step 2.1 consequently gives Γ(1B⊗Λ)=(1B⊗Λε)Δ=1B⊗Λ, and precomposing with Λ gives Γ(Λ⊗Λ)=Λ⊗Λ. This is a full-channel calculation and does not use a simple-meridian projector, modular inversion, Gauss sums or surgery normalization.

5.1F1F3step 4.1algebra

Inserting Λ at a component cut is exactly the finite formal coloring Ω: biR closes its two oriented cut endpoints and its coefficient is di. Reversing that component's orientation replaces i by i∗; dual-mate compatibility of j, ribbon twist duality, and sphericality di=di∗ give the same evaluated graph after reindexing the sum. Thus no independent antipode or integral theorem is needed for orientation reversal. Moving a pair of Λ cuts past each other also does not change their value, since naturality gives cB,B(Λ⊗Λ)=Λ⊗Λ from c1,1=1.

5.2F1step 2.1step 4.1step 2.3construct

The complete endpoint word created by the framed band sum on those two cuts is (ιX⊗ιY⊗X)(1X∗⊗1X⊗1X∗⊗cX,Y∗⊗Y)(1X∗⊗bX⊗1X⊗1Y∗⊗1Y), exactly Γ(ιX⊗ιY). To read it geometrically, follow the rectangle of the attaching band: the slid strand turns around one end, making bX and its X∗ return; its new parallel follows the stationary strand in its specified framing; at the other end X passes the ordered pair Y∗,Y, giving cX,Y∗⊗Y with its hexagon expansion. The two parallels have cable color Y⊗X and reversed dual cable X∗⊗Y∗. The new parallel follows the entire stationary component outside the little band ball: applying the same exterior Φ to ιY⊗X accounts for that whole cable. Every exterior crossing cables by the hexagons and every exterior twist by balancing. Thus no false assertion that the global band sum is supported in the attaching-band ball is made. Its full evaluation is Φ(Γ(Λ⊗Λ)⊗1U), equal to Φ(Λ⊗Λ⊗1U) by step 4.1. The rectangle's framing is retained: any twist in it or in the stationary parallel is read on both sides by the same cable twist word, never discarded by an unframed move.

5.3F1F2F3step 1.1step 2.1step 4.1algebra

For an open strand keep its fixed color Y and its entire factor Y∗⊗Y, rather than imposing coend dinaturality in a coupon-dependent graph variable. The displayed operator Γ^Y first sends Y∗⊗Y to (Y∗⊗Y)⊗(Y∗⊗Y) by 1Y∗⊗bY⊗1Y, then sends only the second pair through ιY before multiplication with the surgery variable. step 4.1 implies m(ιY⊗Λ)=ΛeY, by step 1.1's finite decomposition if Y is not simple. Substitution into this exact lifted word gives Γ^Y(1Y∗⊗Y⊗Λ)=(1Y∗⊗Y⊗ΛeY)(1Y∗⊗bY⊗1Y)=1Y∗⊗Y⊗Λ by the left snake. For simple j the same identity also follows by applying the actual projection B→j∗⊗j to Γ(ιj⊗Λ)=ιj⊗Λ. Hence it is an identity on the complete open-color factor, not only after a categorical trace.

6.1F1F2step 1.1step 5.2step 5.3construct

Fix the actual colored graph and its coupons, and cut only a short interior segment of the strand to be slid. After bending that segment the exterior has type (Y∗⊗Y)⊗B⊗U→V. Its factorization through B uses dinaturality only along the Ω surgery component, exactly as in step 2.3; the first object Y and every graph coupon remain fixed. The band reading of step 5.2 now uses Γ^Y on that fixed first factor, so step 5.3 equates its before/after composites with the entire fixed exterior. To make the finite-cut method fully explicit, write 1Y=∑j,auj,avj,a and insert that resolution on the short segment before bending. On each term absorb the actual uj,a,vj,a into its two adjacent exterior graph portions. Its local segment is now the fixed simple j and step 5.3 applies to that term with those very coupons held constant. Summing restores exactly the original graph; basis independence is the matrix identity ∑uv=1Y. No family of arbitrary coupons indexed by variable X is moved through a universal dinaturality argument.

7.1F1F3step 5.1step 5.2step 5.3step 6.1algebra

The bending used in step 6.1 is injective on the relevant open-graph Hom space: for f:A⊗Y→C, its mate is (f⊗1Y∗)(1A⊗bY), with inverse (1C⊗eY)(−⊗1Y); their composites are the two snakes. Other incident orientations use bYR,rY with their inverse mates. Thus equality of the bent expressions proves equality of the original open-strand morphisms before any closure. If the segment is part of a more complicated coupon-bearing graph, all portions outside its short cut, including junction coupons, are precisely the fixed exterior of step 6.1, so the same equality proves their slide as well. Opposite slide directions read the equality backwards; other orientations and either ordering of the two participating components use step 5.1's explicit dual reindexing and cut interchange. This covers all framed colored-strand and Ω-component cases in the Statement.

8.1F1F2F3A1step 4.1step 5.1step 5.2step 5.3step 6.1step 7.1algebra∎

All calculations are identities of finite categorical composites, and hence survive arbitrary exterior pre/post-composition and tensor factors. No D, Gauss sum, normalized surgery invariant or topological presentation theorem was used. In a surgery application a band slide preserves the component count and changes the linking matrix by B↦PtBP, with P the integral elementary basis change adding the stationary attaching vector to the slid one, so signature is preserved even when singular; that observation adds no assumption to the ribbon identity just proved. Countable choice enters only through [F1]; every fusion basis, cut expansion and coend component sum is finite. The complete local ribbon claims are therefore proved independently of all later Gauss/FR/TQFT consumers.

Depends on

Used by

Dependency tree · two levels

31 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