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.

Reduced Khovanov homology over F2 is an oriented link invariant

Statement

Assume ACω. For every nonempty oriented link L⊂S3, the bigraded F2 vector spaces Kh~i,j(L;F2) obtained by reducing the normalized Khovanov complex at a point on any chosen component are independent, up to noncanonical bigraded isomorphism, of the diagram and the chosen component. No filtered structure from a Floer construction is part of this invariance statement.

Facts & Assumptions

Given: ACω, two finite regular diagrams of the same nonempty oriented link, and a basepoint on a component of each diagram.

[F0]

Every nonempty oriented link in S3 has a finite regular diagram: move it off ∞ using the link definition's ambient-isotopy convention, then choose a regular projection direction. Since the crossing set is finite, each component has points away from crossings at which it can be based (Oriented links in the three-sphere and ambient isotopy, Existence of regular projections).

[F1]

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

[F2]

For every oriented link Reidemeister move with an unchanged exterior mark, the actual normalized integral maps and inverse homotopies commute with the marked actions and descend to bigraded equivalences of the quotient complexes; reducing the same identities modulo two proves the corresponding based-link equivalences over F2 (Based-link reduced Khovanov equivalences for every local Reidemeister move).

[F3]

For a fixed diagram, the reduced F2 cohomology is independent of which link component carries the basepoint (Reduced Khovanov homology over F2 is independent of the chosen link component).

[F4]

The based reduction is the quotient by the image of the basepoint action (Reduced Khovanov cohomology of a based link over F2).

Proof

1.1F0F1givenchooseconstruct

By [F0], the based reduced groups in the Statement are defined for diagrams of every nonempty oriented link. For any two such diagrams D,D′, [F1] gives a finite sequence D=D0,D1,…,Dr=D′ of planar isotopies and oriented Reidemeister moves. For a Reidemeister step choose a marked point on an unchanged exterior arc and carry it to the corresponding arc on the other diagram. Such an arc exists: the move models contain a continuing strand meeting the boundary of their disk, and a closed regular link diagram continues that strand outside the disk. For a planar isotopy choose any mark and carry it by the isotopy. There are finitely many steps and every diagram is nonempty, so these are finite point choices, adding no choice hypothesis beyond [F1]. These auxiliary marks need not all lie on a single tracked component.

2.1F2F3F4step 1.1constructalgebra

At the start of a step, [F3] identifies the current reduced group with the reduction at its chosen auxiliary mark, even if that mark lies on another component. For a Reidemeister move, [F2] then gives a bigraded cochain homotopy equivalence between the reductions at the two unchanged exterior marks. Its integral maps and contractions commute with the marked action before quotienting, and their explicit equations remain true over F2. For a planar isotopy the relabeling of circles preserves that marked factor and every normalized degree. Thus each step supplies a bigraded cohomology isomorphism, followed if necessary by another fixed-diagram change of mark using [F3].

3.1F1F2F3step 1.1step 2.1algebra∎

Compose these finitely many isomorphisms, using [F3] at the first and last diagram to reach the originally selected marks. This proves independence of the diagram and chosen component. For an empty move sequence only [F3] is needed. Each vector space has finite support in its bigrading, so finite choices of its isomorphisms assemble the asserted noncanonical bigraded isomorphism. The proof uses neither a canonical identification of different move sequences nor a relative movie theorem for multi-component cut tangles. ACω is used only in [F1]; the local tensor equations and fixed-diagram mark changes are finite and choice-free.

Depends on

Used by

Dependency tree · two levels

37 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