Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Lee cobordism maps give the genus filtration bound

Statement

Assume the Axiom of Countable Choice. Let S⊂S3×[0,1] be a connected compact oriented smoothly properly embedded surface of genus g, with product collars and oriented boundary (−K0×{0})⊔(K1×{1}) for oriented knots K0,K1 in the standard three-sphere. A finite movie for S is a finite ordered sequence of regular-level link diagrams whose changes are planar isotopies, oriented Reidemeister moves, births, saddles or deaths. Such a movie defines a map on rational Lee homology that preserves the induced decreasing filtration with degree χ(S)=−2g. The map is an isomorphism; consequently

∣s(K1)−s(K0)∣≤2g.

Facts & Assumptions

Given: ACω, a connected smoothly properly embedded oriented knot cobordism in S3×[0,1] with product collars, and finite regular diagrams at its boundary.

[F2]

A birth uses ηL(1)=1, a death uses ϵL(1)=0,ϵL(X)=1, and a saddle uses mL or ΔL (Lee-deformed Khovanov complex and filtration).

[F3]

Each oriented Reidemeister move induces a filtered chain homotopy equivalence of degree zero on Lee homology (Lee filtered homology is an oriented link invariant).

[F4]

The two canonical orientation classes form a basis of knot Lee homology (Lee homology of a knot has two generators).

[F5]

For a c-component link the 2c canonical orientation classes form a basis, with labels fixed by the checkerboard convention (Lee filtration, spectral sequence, and orientation classes).

[A1]

ACω is the axiom used by the adapted-Morse and finite diagram/movie inputs (The Axiom of Countable Choice (ACω)).

[F6]

Every compact smooth collared oriented link cobordism admits a finite generic movie representing its actual embedded trace, relative to smaller end collars, under countable choice (Smooth link cobordisms admit finite generic movies).

Proof

Given: The hypotheses of the Statement.

1.1A1F6givenconstruct

Under [A1], [F6] supplies a finite movie of the actual collared surface, with fixed regular endpoint diagrams and only planar isotopies, Reidemeister events, births, saddles and deaths. It represents the same oriented embedded surface up to ambient isotopy relative to smaller collars, so it has the same connectedness, genus and Euler characteristic. No assertion that all movies give the same homology map is needed here; choose one supplied movie and its reverse.

1.2F2F3F5algebraconstruct

For every Reidemeister disk choose a marked point on each link component outside that disk, carried through the move. On the Lee cube let Xp multiply the circle containing the point by X. Each Xp is a chain map: m(Xu,v)=Xm(u,v)=m(u,Xv) and Δ(Xu)=(X⊗1)Δ(u)=(1⊗X)Δ(u), verified on u,v=1,X. The local Reidemeister maps commute with these operators. Indeed the retractions used in [F3] consist of saddles, dots, factor relabelings, and inverses of scalar identity pivots; the displayed identities show that each constituent commutes with every exterior Xp, so their composites and homotopies do too. In the canonical basis a=1+X, b=X−1, one has Xa=a, Xb=−b. The checkerboard convention for the canonical labels is unchanged outside the disk. At one fixed mark on each component its sign determines the orientation of that component; consequently the 2c orientation classes are distinct simultaneous eigenlines of the exterior marked actions. A Reidemeister homology isomorphism intertwining those actions must carry each eigenline to the line with the same signs, and cannot kill it. Thus it carries each orientation class to a nonzero multiple of the class with the induced orientation. This argument covers every orientation and exterior connectivity of RIII without an omitted case census.

2.1F2F4step 1.2algebraconstruct

In the basis a,b the Morse maps are ηL(1)=12(a−b), mL(aa)=2a, mL(bb)=−2b, mL(ab)=mL(ba)=0, ΔL(a)=aa, ΔL(b)=bb, and ϵL(a)=ϵL(b)=1. The local label compatibility is explicit: in an empty band disk put its two attaching segments parallel. The middle strip has a single checkerboard color. The black-right rule of [F5] then assigns equal labels exactly when the segment arrows are opposite, and different labels exactly when they agree; inspect the two possible strip colors, which exchange both labels. An orientation extends across an oriented band exactly in the opposite-arrow case. The exterior checkerboard colors remain fixed, so the surviving equal label is the canonical label after the saddle. This includes segments on the same circle, nested circles or disjoint circles. Track orientations of each partial surface: components meeting the incoming knot have their forced orientation, while each other component has its two possible orientations. A birth creates precisely the two possibilities with nonzero coefficients. A split or a band within one surface component extends its orientation uniquely and multiplies its coefficient by a nonzero scalar. A band joining distinct components retains precisely the compatible choices and kills the others: each orientation of the joined component restricts to a unique compatible pair, so no two retained terms cancel. For a death the disappearing boundary circle belongs to a surface component with another boundary, unless that component becomes closed. A closed component of a partial surface cannot later join another component, and would be a closed component of S; connectedness and its incoming boundary exclude this. Thus distinct permitted orientations remain distinct on the surviving boundary after a death, and ϵL(a)=ϵL(b)=1 preserves their nonzero coefficients. Step 1.2 treats the Reidemeister events. At the final level every component meets the incoming boundary because S is connected. Hence exactly one permitted orientation extends either incoming orientation, and its coefficient is nonzero. The two input classes map to nonzero multiples of the two output classes.

2.2F2F3step 1.1algebra

Assign to a planar isotopy the relabeling of state circles, to a Reidemeister move the filtered map of [F3], and to a Morse event the cube map induced by the corresponding Lee Frobenius operation in [F2]. These are actual cochain maps: the move disk misses the crossings, and its unsigned operation commutes with every cube saddle by associativity, coassociativity and the Frobenius/unit/counit identities proved for [F2]; the crossing set and its cube signs remain fixed. The map for a birth is ηL(1)=1, whose new circle label has quantum degree +1. The death map sends only the X term to 1, raising quantum degree by +1. Each degree-preserving term of a saddle has quantum degree −1, while each Lee deformation term raises that saddle degree by 4; hence a saddle map has filtration degree −1. If the movie has b births, s saddles and d deaths, composition has filtered degree b−s+d=χ(S). For a connected genus-g surface with two boundary components, χ(S)=2−2g−2=−2g.

3.1A1F3F4F6step 2.2step 2.1algebra∎

Step 2.1 and [F4] show that the movie map is an isomorphism between two-dimensional Lee homology groups. Its forward and reverse maps both have filtered degree −2g by step 2.2. Applying the forward map to a nonzero class of level smax⁡(K0) gives smax⁡(K1)≥smax⁡(K0)−2g; applying the reverse map to a class of level smax⁡(K1) gives smax⁡(K0)≥smax⁡(K1)−2g. Since s=smax⁡−1, these inequalities give ∣s(K1)−s(K0)∣≤2g. The same argument applies to every supplied finite movie, and step 1.1 supplies one for every surface in the Statement. Thus all asserted conclusions follow.

Depends on

Used by

Dependency tree · two levels

48 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