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 based link over F2

Definition

Let (D,p) be a finite regular oriented link diagram with a marked point p away from crossings, and let C(D;F2) be its normalized Khovanov cochain complex over F2 obtained from the algebra A=F2[X]/(X2) with deg⁡q(1)=1 and deg⁡q(X)=−1. On each resolution state, let Xp multiply by X on the circle containing p and act as the identity on the other circle factors. Define the reduced complex by C~(D,p)=C(D;F2)/im⁡Xp, with the surviving based-circle label 1 assigned reduced quantum degree 0 by the shift j~=j−1. Its cohomology is Kh~i,j~(D,p;F2). The basepoint may lie on any component; for a link, independence of the chosen component is a separate theorem.

Facts & Assumptions

Given: A finite regular oriented link diagram (D,p) and its normalized Khovanov cube over F2.

[F1]

The circle algebra is A=F2[X]/(X2), with multiplication m and comultiplication Δ(1)=1⊗X+X⊗1, Δ(X)=X⊗X (Khovanov Frobenius algebra and cube of resolutions).

[F2]

Every cube edge is the corresponding merge map m or split map Δ, tensored with identities on unaffected circles (Khovanov chain complex from a diagram).

[F3]

The signed Khovanov differential squares to zero over the integral algebra, and hence its reduction modulo two also squares to zero (The Khovanov cube differential squares to zero).

[F4]

Each diagram produces a finite normalized cochain complex (The Khovanov diagram procedure terminates and returns a finite cochain complex).

Proof

1.1F1F2givenalgebra

If an edge avoids the marked circle, its map acts as the identity on that factor and commutes with Xp. For a merge involving the marked circle, associativity gives m(Xa⊗b)=X m(a⊗b), with the marked factor placed on the appropriate input. For a split of that circle, the Frobenius identity gives Δ(Xa)=(X⊗id)Δ(a)=(id⊗X)Δ(a); for a=1 both sides equal X⊗X, and for a=X both sides vanish. Thus every edge map commutes with Xp, so im⁡Xp is a subcomplex.

2.1F1F3F4step 1.1∎

The quotient differential is well-defined by step 1.1 and squares to zero by [F3]. In each state the marked-circle factor has basis 1,X, and multiplication by X has image the one-dimensional span of X. The quotient therefore replaces that factor by F2{1}; the shift j−1 assigns the surviving label degree zero. This gives the stated reduced cochain complex and its cohomology.

Depends on

Used by

Dependency tree · two levels

9 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