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

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

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

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

RT handlebody pairings and surgery gluing

Statement

Assume full AC and its inherited countable-choice consequences. For the state spaces of RT state spaces from a modular category, composition is a perfect pairing

Hom⁡(1,X)×Hom⁡(X,1)⟶C,(v,w)⟼wv.

The categorical trace of 1i⊗i∗ is di2, and tr⁡(1H)=∑idi2=D2 for H=⨁ii⊗i∗. Distinguish that trace from the actual standard-cap geometric Gram form on a connected genus-g surface:

Qt(yj,xi)=δijDg−1d(i)−1yixi,Nt∣i=Qt−1∣i=D1−gd(i)1.

Here i is the full handle-color tuple, d(i)=∏rdir, and the inverse is in composition-dual coordinates. For disconnected surfaces take tensor products and empty value C.

For every compact parametrized colored ribbon bordism, capping against all testing states, taking the surgery-color sum with closed normalization D−m−b0(M)κ−σ(B), and applying Nout defines a unique linear map Zα(M). It is independent of the marked surgery presentation, all auxiliary coupon bases and their complete identity resolutions. It retains the prescribed boundary caps, parametrizations, colors and actual coupon morphisms. These maps satisfy the cylinder, ball, empty and disjoint-union laws, and the actual stacked-presentation law of RT capped operators: geometric Gram factors and exact signature gluing. The identification of its signature defect with the Maslov correction is a separate supplier.

Facts & Assumptions

Given: A complex modular ribbon fusion category and fixed marked reference caps, with meridian Lagrangians α.

[F2]

Marked relative surgery presentations and complete moves for three-dimensional ribbon bordisms proves existence and complete marked decorated comparison by O1/O2/O3, exterior ribbon isotopy and open strands over the actual surgery longitudes, for arbitrary fundamental groups and the specified output map.

[F3]

Multicolored ribbon graphs with arbitrary coupons have a unique evaluation gives the full colored framed coupon evaluator. The complete Kirby-color band-slide identity with open colored graph coupons proves the full Kirby-color band slide and fixed open-strand/coupon identity, including the lifted Y∗⊗Y identity before taking its mate.

[F4]

Modular Gauss sums, the Kirby color, and its slide identity gives p±=Dκ±1, p+p−=D2 and the blow-up factors. Colored signed twist surgery, circumcision, and paired-handle cancellation gives signed Fenn–Rourke reduction, arbitrary-knot zero-meridian circumcision with factor D2, and the full Rij(Ei∗⊗j)=δij(D2/di)1 identity.

[F5]

RT capped operators: geometric Gram factors and exact signature gluing proves the exact Q,N, block projection for disconnected boundaries, raw testing-functional map, cylinders/balls/empty/tensor laws and actual stacked-graph formula, without assuming presentation completeness.

[A1]

Full AC is inherited from [F2]'s geometric and duality suppliers; countable choice is inherited from [F3]'s tangle evaluator (The Axiom of Choice, The Axiom of Countable Choice (ACω)). All Hom decompositions and sums here are finite.

Proof

1.1F1givenalgebra

Decompose X as 1⊕r⊕⨁i≠0i⊕ri using [F1]. The unit-copy inclusions xa and projections ya satisfy yaxb=δab and identify the two Hom spaces with Cr and its full dual. Every other simple summand contributes zero. Thus composition is perfect, including r=0. Trace additivity, multiplicativity and di∗=di give tr⁡(1i⊗i∗)=di2 and tr⁡(1H)=D2. This is a categorical closed trace; it does not identify a geometric opposite-cap pairing with that trace.

2.1F2F3F5step 1.1construct

By [F2] choose an actual presentation of each connected component with its fixed boundary handlebodies and testing coupons. The finite evaluation [F3] is linear in each coupon. Perfectness from step 1.1 therefore determines a unique raw operator from its testing functional. The tensor-Hom inclusions and unit-channel projections of [F5] retain exactly the tensor product of connected state spaces at a disconnected boundary. The calculation of [F5] gives Q,N as displayed: its full meridian identity kills unmatched handle tuples and contributes D2g/d(i) on a matched tuple; its cylinder has g zero-framed surgery annuli, hence multiplying by D−g−1 gives Q. All D,di are nonzero. Applying the inverse N produces the unique normalized map and not merely a scalar class of maps.

3.1F2F3F4step 2.1algebra

Test two presentations against the same arbitrary incoming and outgoing coupons. By [F2], their specified marked identification is a finite sequence of the actual moves listed there. An O1 move adds m↦m+1, σ↦σ+ϵ and evaluation factor pϵ=Dκϵ, so its normalized multiplier is D−1κ−ϵpϵ=1. O2 changes the linking matrix by an integral unimodular band congruence, hence keeps signature and m; its complete coupon-bearing evaluation is unchanged by [F3]. For O3 the added Kf,U0 block has linking form [f110] after separating its two core directions from the old form by completing squares. That block has determinant −1 and signature zero; the count increases by two. The full circumcision identity [F4] multiplies evaluation by D2, canceling D−2. This identity applies to the arbitrary knot and to every exterior color/coupon in the actual support. Exterior isotopy is [F3]; an open strand over a surgery longitude is precisely its lifted open-strand/coupon identity after bending the fixed strand and applying the actual exterior coupons. It is not an assumption that arbitrary coupon families are dinatural. Thus every allowed move preserves every tested normalized functional.

4.1F1F2F3step 1.1step 3.1algebra

[F2] retains the complete output identification, all collar ribbons and fixed caps, so the comparison in step 3.1 applies to these exact testing states, with no unnoticed boundary mapping class. It follows by perfectness that the operators agree. Changing a computational coupon basis replaces xa by ∑bxbAba and ya by ∑b(A−1)abyb; the complete finite identity resolution ∑axaya is unchanged. Object simple-summand resolutions are unchanged by the same matrix calculation. Actual coupon morphisms remain fixed. Therefore all auxiliary decompositions used in the computation give the same map. This establishes existence, uniqueness and the asserted full presentation independence.

5.1F5step 2.1step 4.1algebra

Apply [F5] to a cylinder and to the two empty-graph balls: the cylinder word D2g/d(i) multiplied by D−2gd(i) is the identity on every multiplicity block, the outgoing ball is 1∈C, the incoming ball is multiplication by D−1, and their glued sphere is τ(S3)=D−1. Empty bordism gives 1 and disjoint union tensors all factors. These are now laws of the well-defined operators, since step 4.1 allows their local models as presentations of any such bordism.

6.1F5A1step 4.1step 5.1algebra∎

Likewise choose the actual stacked presentations in [F5] for arbitrary composable bordisms. Their cap-annulus, disconnected-family projectors and all N factors prove Zα(M2M1)=κσ(B1)+σ(B2)−σ(Bcomp)Zα(M2)Zα(M1). Replacing any of these presentations preserves both sides by step 4.1; thus this is a law for the constructed maps. [F5] includes disconnected incidence components, empty surfaces and singular linking matrices, so no connectedness, positivity or nonsingularity restriction is introduced. This proves every stated assertion while leaving only the separately specified signature-to-Maslov identification to its actual supplier.

Depends on

Used by

Dependency tree · two levels

53 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