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

The Khovanov to branched-cover Heegaard Floer spectral sequence

Statement

Assume AC and ACω. For every nonempty oriented link L⊂S3, there is a spectral sequence over F2 whose E2 page is the reduced Khovanov cohomology Kh~∗,∗(L‾;F2) of the mirror link and whose abutment is HF^(Σ(L);F2) with its image filtration. The page identification is an isomorphism of bigraded vector spaces; this statement does not claim a diagram-independent filtered quasi-isomorphism type for the chain-level spectral sequence.

Facts & Assumptions

Given: AC, ACω, and a nonempty oriented link L.

[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. Every component has a point away from the finite crossing set for the basepoint (Oriented links in the three-sphere and ambient isotopy, Existence of regular projections).

[F1]

The branched cover is well-defined up to oriented diffeomorphism (Existence and isotopy invariance of the double branched cover of a link).

[F2]

For a fixed diagram, the surgery construction has E2 equal to based reduced Khovanov cohomology and converges to the branched-cover Floer group (The Ozsváth–Szabó spectral sequence for a fixed link diagram).

[F3]

Over ACω, the reduced Khovanov group is independent of the chosen diagram and marked component up to bigraded isomorphism (Reduced Khovanov homology over F2 is an oriented link invariant).

[A1]

AC is used by the link-complement and covering-space construction; ACω is separately used by the Reidemeister-move and generic Floer analytic branches (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

1.1F0F1F2A1givenchoose

By [F0], choose an ambient-isotopic representative L′ with a finite regular diagram D and a point on its mirror away from crossings. Apply [F2] to D; this gives a spectral sequence with E2 equal to the based reduced Khovanov group of the mirror diagram and abutment HF^(Σ(L′);F2). By [F1], HF^(Σ(L′);F2)≅HF^(Σ(L);F2).

2.1F1F2F3step 1.1

Apply [F3] to identify that page, up to bigraded isomorphism, with Kh~(L‾;F2) independently of the selected diagram and component. The convergence in [F2] and target invariance in [F1] give the stated invariant endpoints, with no diagram-independent filtered chain claim.

3.1F2F3step 1.1step 2.1∎

The two deductions above are exactly the stated endpoint construction relative to [F2] and [F3]. They preserve the fixed-diagram scope of the filtered construction and use only the invariant isomorphism classes of its endpoints. Thus the formal assembly is complete relative to these two exact supplier interfaces.

External-input boundary

The fixed-diagram supplier uses the explicitly labelled external Ozsváth–Szabó surgery and unlink-map inputs, with exact locators and reading limits recorded in those suppliers and the run source receipt. The reduced link-invariance supplier supplies the independent based-link passage. This proof assembles those results; it does not reconstruct their imported parts or claim a diagram-independent filtered chain type. AC for the branched cover and ACω for the analytic/Reidemeister branches remain the separate assumptions of the Statement.

Depends on

Used by

Dependency tree · two levels

39 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