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

Reduced Khovanov cohomology of a knot

Definition

Let (D,p) be a finite regular oriented diagram of a knot with a basepoint p away from the crossings, and let C(D) be its normalized integral Khovanov cochain complex. At each resolution state, let Xp act by multiplication by X on the tensor factor for the circle containing p, and by the identity on every other circle factor. The basepoint action is the direct sum of these statewise maps. Define the reduced cochain complex by C~(D,p):=C(D)/im⁡(Xp), with the same cohomological grading and with reduced quantum degree j~=j−1 for the class represented by a state whose basepoint circle is labelled 1. Its cohomology is the reduced integral Khovanov cohomology Kh~i,j~(D,p). The unknot is normalized so that its reduced group lies in bidegree (0,0).

Equivalently, cut the based knot at p to a one-interval tangle. Put M=Z in quantum degree 0 with X⋅1=0. A resolution with k closed circles and the distinguished interval is assigned A⊗k⊗M. An edge that merges a circle into the interval uses mM(1⊗1)=1 and mM(X⊗1)=0; an edge that splits the interval uses ΔM(1)=X⊗1, where the circle factor is written first and the interval factor second. Edges not meeting the interval use m or Δ. This based tangle cube is the quotient complex above, with the stated quantum shift.

Facts & Assumptions

Given: A based knot diagram (D,p) and the normalized integral Khovanov cochain complex defined in Khovanov chain complex from a diagram.

[F1]

On a resolution circle, X2=0, Δ(1)=1⊗X+X⊗1, and Δ(X)=X⊗X; multiplication is the product in Z[X]/(X2) (Khovanov Frobenius algebra and cube of resolutions).

[F2]

The differential is the signed sum of edge maps, each equal to multiplication or comultiplication on the factors meeting that edge and the identity on all other factors (Khovanov chain complex from a diagram).

[F3]

The signed cube differential squares to zero, so these state modules form a cochain complex (The Khovanov cube differential squares to zero).

Proof

1.1F1F2givenalgebra

If an edge does not meet the basepoint circle, its map is the identity on the basepoint factor and hence commutes with Xp. If the edge merges the basepoint circle with another circle, associativity gives m(Xa⊗b)=X m(a⊗b). If it splits the basepoint circle, the Frobenius identity gives Δ(Xa)=(X⊗1)Δ(a)=(1⊗X)Δ(a); on a=1,X these are respectively X⊗X and 0 on all three sides. Thus every edge map commutes with Xp, so im⁡(Xp) is a subcomplex.

2.1F1F2F3step 1.1algebra

By [F3], the unreduced differential already squares to zero, and by step 1.1 it preserves im⁡(Xp); thus the induced quotient differential also squares to zero. In each state the based factor is A=Z{1,X}, and Xp has image Z{X}. Therefore the quotient factor is Z{1}, with raw quantum degree +1; subtracting one gives reduced degree 0.

3.1F1F2step 2.1constructalgebra∎

After cutting the based circle, every state has one distinguished interval factor M. The quotient identification sends the surviving based label 1 to 1∈M. For a merge into that interval, m(1⊗1)=1 and m(X⊗1)=0 in the quotient, exactly the displayed mM; for a split, Δ(1)=1⊗X+X⊗1 and the term with X on the distinguished interval is zero in M, leaving X⊗1, exactly ΔM(1). Edges away from the interval retain m and Δ. Hence this statewise identification commutes with every edge and gives the stated based tangle cube isomorphism.

Depends on

Used by

Dependency tree · two levels

8 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