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

Rasmussen's s-invariant bounds smooth four-ball genus

Statement

Assume the Axiom of Countable Choice. For every smooth oriented knot K in the standard oriented three-sphere,

∣s(K)∣≤2g4sm(K),

where g4sm(K) is the minimum genus of a connected compact orientable smooth properly embedded surface in the standard four-ball with oriented boundary K.

Facts & Assumptions

Given: ACω, a knot K, and its smooth slice genus.

[F1]

The smooth slice genus is the minimum genus of a connected smooth orientable proper surface bounded by K (Smooth and topological slice genus).

[F2]

Rasmussen's convention is s(K)=smax⁡(K)−1 (Rasmussen’s s-invariant).

[A1]

ACω is used by the smooth slice-genus minimum and finite movie branches (The Axiom of Countable Choice (ACω)).

[F3]

A connected genus-g smooth cobordism between knots admits a filtered Lee homology isomorphism of degree −2g (Lee cobordism maps give the genus filtration bound).

[F4]

Every connected smooth properly embedded genus-g surface in the standard four-ball can be punctured after supported interior ambient modifications so that the removed region is a concentric round ball meeting it in a flat disk. The remaining literal round shell has a collared genus-g knot-to-unknot cobordism and Euler characteristic −2g (Puncturing a smooth four-ball surface gives a genus-preserving knot cobordism).

Proof

Given: The hypotheses of the Statement.

1.1F2algebra

For the standard crossingless unknot diagram, the Lee complex is the one-term vector space AL=Q[X]/(X2−1) with basis 1,X in quantum degrees 1,−1 and zero differential. Its induced filtration levels are therefore smax⁡(U)=1 and smin⁡(U)=−1, so [F2] gives s(U)=0.

1.2A1F1F4givenconstruct

Let F⊂B4 be any connected smooth orientable proper spanning surface of genus g with boundary K. Apply [F4] under the countable-choice hypothesis [A1]. It moves and flattens a small interior surface disk by ambient diffeomorphisms fixed on a sufficiently small restriction of the supplied outer collar, then removes an actual concentric round ball. The remaining round shell is explicitly S3×I, with unchanged boundary knot K, an inner standard unknot and product collars. Its surface is connected of the same genus g and has Euler characteristic −2g; reverse its direction if needed. This uses neither a slice-only Statement for a positive-genus surface nor a claim about arbitrary embedded four-ball complements.

2.1F2F3step 1.1step 1.2algebra

Apply the Lee cobordism construction to this surface and to its reverse. By [F3], each map is a filtered isomorphism of degree −2g. Choose a nonzero class of maximal level in VK; its image is nonzero in VU and has level at least smax⁡(K)−2g, which is at most smax⁡(U)=1. Hence smax⁡(K)≤1+2g and s(K)≤2g. Apply the reverse map to a nonzero class of maximal level in VU: its nonzero image in VK has level at least 1−2g, so smax⁡(K)≥1−2g and s(K)≥−2g.

3.1A1F1F3step 1.2step 2.1algebra∎

Under [A1], [F1] supplies a nonempty set of smooth spanning-surface genera with a least element. Minimize g over F in step 1.2. Step 2.1 then gives the asserted inequality. This gives the inequality in the Statement.

Depends on

Used by

Dependency tree · two levels

26 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