Alphabeta Math
LemmaStatement: 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 invariant changes sign under mirror image

Statement

Assume the Axiom of Countable Choice.

Let K† be the reverse mirror of an oriented knot K. Then

s(K†)=−s(K).

Facts & Assumptions

Given: A finite regular diagram D of K.

[F1]

The normalized Lee cube has state quantum degree ∣v∣+n+−2n−+∑deg⁡q(a) and the deformation differential preserves or raises this grading (Lee-deformed Khovanov complex and filtration).

[F2]

For a knot, the two extremal Lee filtration levels differ by 2, with s=smax⁡−1=smin⁡+1 (Lee homology of a knot has two generators, Rasmussen’s s-invariant).

[F3]

The reverse mirror is obtained by the fixed orientation-reversing reflection followed by reversal of the knot orientation (Reverse mirror of an oriented knot).

[A1]

ACω is the axiom branch inherited from diagram independence of Lee filtration levels (The Axiom of Countable Choice (ACω), Rasmussen’s s-invariant).

Proof

Given: ACω, the two-dimensional Lee homology of K, and its reverse mirror.

1.1F1F3givenconstructalgebra

On AL=Q[X]/(X2−1) use ⟨u,v⟩=ϵL(uv), whose matrix in the basis 1,X is (0110). Thus 1,X are dual labels of opposite quantum degrees. The displayed Frobenius maps give ⟨m(a,b),c⟩=⟨a⊗b,Δ(c)⟩ on the eight basis triples, and the analogous split identity follows by transposition. Number the crossings identically on D and its mirror. For a mirror vertex w, its corresponding original vertex is v=1−w. The local smoothing chart interchanges A and B under reflection, so their resolved circles agree. On the dual complex put (C∨)i=Hom⁡Q(C−i,Q) and d∨=(d)∗; this convention squares to zero directly. For the mirror edge changing coordinate j, the original reversed edge has sign (−1)∑k<jvk, while its mirror sign is (−1)∑k<jwk=(−1)j−1(−1)∑k<jvk. Multiply the tensor-pairing identification on mirror vertex w by σ(w)=(−1)∑j(j−1)wj. Since σ(w+ej)/σ(w)=(−1)j−1, this makes every edge commute with the transposed original edge. It is therefore an actual cochain isomorphism, including cube signs. With n=n++n−, complementation gives i′=−i and state shift ∣w∣+n+′−2n−′=−∣v∣−n++2n−, the negative original shift. Dual tensor labels have opposite label degrees as well, giving q′=−q. Reversing the knot orientation leaves crossing signs and resolutions unchanged, so the same isomorphism applies to K†.

2.1A1F1F2step 1.1constructalgebra∎

For a finite filtered cochain complex C, the just-described dual quantum filtration is FpC∨=Ann⁡(F1−pC) in complementary cohomological degrees. Evaluation induces a perfect pairing H(C∨)×H(C)→Q: cocycles are exactly the functionals vanishing on boundaries, and coboundaries are exactly those vanishing on cycles, by finite elimination. Its induced homology filtration is exactly the annihilator filtration. Indeed one direction follows by evaluating representatives. Conversely a homology functional vanishing on classes represented by cycles in F1−pC defines a functional on the sum of the cycle space and F1−pC, using its given values on cycles and zero on the latter subspace. The intersection condition makes this well-defined. Extend it across a finite vector-space complement; it is a cocycle because it vanishes on boundaries and represents the required dual class in Fp. Thus the finite homology graded quotients occur in opposite degrees under duality. Applied to the two Lee lines, smax⁡(K†)=−smin⁡(K) and smin⁡(K†)=−smax⁡(K). By [A1] and [F2], smax⁡(K)=s(K)+1 and smin⁡(K)=s(K)−1, so s(K†)=smax⁡(K†)−1=−s(K). This finite basis argument adds no choice assumption.

Depends on

Used by

Dependency tree · two levels

18 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