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

Khovanov homology is an oriented link invariant

Statement

Assume the Axiom of Countable Choice. For every nonempty oriented link L, the bigraded integral groups Khi,j(L):=Hi(C∗,j(D)), where D is any finite regular oriented diagram of L and C(D) is the normalized Khovanov cochain complex, are independent of the choice of D up to bigraded isomorphism.

Facts & Assumptions

Given: ACω, two finite regular diagrams of the same oriented link, and their normalized cochain complexes.

[F1]

ACω is the axiom that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F2]

Under ACω, diagrams of the same oriented link are connected by a finite sequence of planar isotopies and oriented Reidemeister I, II, and III moves (Reidemeister's theorem for oriented diagrams).

[F3]

Every planar isotopy and oriented Reidemeister I, II or III move induces a bigraded chain homotopy equivalence of the normalized complexes (Khovanov complexes are chain homotopy equivalent under Reidemeister moves).

[F4]

A bounded cochain complex has defined cohomology in each bidegree, and chain homotopy equivalent complexes induce isomorphic cohomology (The Khovanov diagram procedure terminates and returns a finite cochain complex, A chain homotopy equivalence).

Proof

1.1F1F2F3givenchoose

By [F1] and [F2], choose a finite sequence D=D0,D1,…,Dr=D′ whose successive diagrams differ by planar isotopy or one oriented Reidemeister move. By [F3], each pair has a bigraded chain homotopy equivalence, with chain maps in both directions and homotopies from their composites to the respective identities. The normalization in that supplier cancels the raw shifts, so these maps have bidegree (0,0).

2.1F3F4step 1.1algebra∎

A chain map takes cocycles to cocycles and coboundaries to coboundaries. If two chain maps differ by dh+hd, their values on a cocycle differ by a coboundary, so they induce the same cohomology map. Thus each equivalence in step 1.1 gives mutually inverse maps in every bidegree. Composing the finitely many induced isomorphisms identifies the cohomology of C(D) and C(D′). It follows that the groups Khi,j(L) are independent of the chosen diagram up to bigraded isomorphism. The empty sequence gives the identity, and no assertion of a canonical isomorphism for all move sequences is needed.

Depends on

Used by

Dependency tree · two levels

31 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