Alphabeta Math
CorollaryStatement: 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.

Rasmussen's invariant for positive knots

Statement

Assume the Axiom of Countable Choice. Let K be an oriented knot admitting a finite regular diagram D with n positive crossings and no negative crossings, and let k be the number of circles in its oriented resolution. Then Rasmussen’s invariant satisfies

s(K)=n−k+1.

Facts & Assumptions

Given: ACω and a positive diagram D of the knot K.

[F1]

The canonical orientation class is a basis vector in Lee homology, and its filtration level is smin⁡(K) (Lee homology of a knot has two generators, Lee filtration, spectral sequence, and orientation classes).

[F2]

Rasmussen's convention is s(K)=smin⁡(K)+1 (Rasmussen’s s-invariant).

[F3]

In the normalized Lee complex, a state with ∣v∣ one-resolutions and labels 1,X has quantum degree ∣v∣+n+−2n−+∑deg⁡q(a) (Lee-deformed Khovanov complex and filtration).

[A1]

ACω is inherited through the diagram-independent definition of s (The Axiom of Countable Choice (ACω), Rasmussen’s s-invariant).

[A2]

Positive crossings have positive determinant of the ordered over/under tangents (Oriented crossing signs, diagram writhe, and blackboard framing). In the source chart the over-strand joins southwest to northeast, the A-smoothing pairs left endpoints and right endpoints, and the B-smoothing pairs top endpoints and bottom endpoints (Kauffman bracket smoothing and loop value). The cube uses A at 0 and B at 1 (Khovanov Frobenius algebra and cube of resolutions).

Proof

Given: The positive diagram has n+=n, n−=0 and k circles in its oriented resolution.

1.1A2algebra

In the positively oriented source chart of [A2], take the over-tangent to be (1,1). Positivity forces the under-tangent to be (−1,1) rather than (1,−1), since their determinants with the over-tangent are 2 and −2. The incoming endpoints are therefore southwest and southeast, and the outgoing endpoints northeast and northwest. The orientation-preserving smoothing pairs southwest with northwest and southeast with northeast: exactly the A-smoothing. Reversing both strand arrows gives the other positive orientation case and retains those same pairs. Thus every positive oriented smoothing is the 0-resolution.

2.1F1F3step 1.1algebra

By step 1.1, every oriented smoothing is the 0-resolution, so the canonical cycle lies in cohomological degree 0. There is no chain group in degree −1, hence this cycle is not altered by adding a boundary. Expanding each of its k circle labels a=1+X or b=X−1 in the homogeneous basis, the unique term of least quantum degree is obtained by choosing X on every circle; its coefficient is 1 or −1. Its quantum degree is the state shift n plus k labels of degree −1, namely n−k. Therefore its induced filtration level is smin⁡(K)=n−k.

3.1A1F2step 2.1algebra∎

The formula [F2] for s is diagram-independent under the ACω branch [A1]. Substitution of the value from step 2.1 gives s(K)=n−k+1. If n=0, the positive diagram is the crossingless unknot, whose oriented resolution has k=1, so the same calculation gives s=0. The state expansion itself is finite and choice-free.

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