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

The Khovanov cube differential squares to zero

Statement

Let D be a finite regular oriented link diagram, order its crossings as c1<⋯<cn, and form the direct sum of state modules A⊗k(v) over all functions v:C(D)→{0,1}. Here A=Z[X]/(X2), each crossing is changed from its A-smoothing at 0 to its B-smoothing at 1, and the edge map is the multiplication m for a merge or comultiplication Δ for a split, multiplied by (−1)∑i<jv(ci) on the edge at cj. Then the sum d of all edge maps satisfies d2=0.

Facts & Assumptions

Given: The finite ordered crossing set, the state modules and edge maps in the Lemma.

[F1]

The multiplication and comultiplication on A obey associativity, coassociativity, commutativity, cocommutativity, and the Frobenius identities (m⊗id)(id⊗Δ)=Δm=(id⊗m)(Δ⊗id) (Khovanov Frobenius algebra and cube of resolutions).

[F2]

The differential is the sum of the signed edge maps, and the sign on the edge changing coordinate j is (−1)∑i<jv(ci) (Khovanov chain complex from a diagram).

Proof

1.1F1givenalgebra

Fix a state v and two distinct coordinates i<j with v(ci)=v(cj)=0. The two length-two paths from v to v+ei+ej induce equal unsigned maps: saddles on disjoint circles commute as tensor maps; when the two saddles meet one component, the three possible merge/split patterns give respectively associativity, coassociativity, or one of the two equal Frobenius composites in [F1]. These are all possibilities because each edge changes one smoothing by one saddle.

2.1F2step 1.1algebra∎

The sign on the path that changes i then j has exponent ∑r<iv(cr)+∑r<jv(cr)+1, while the path that changes j then i has exponent ∑r<jv(cr)+∑r<iv(cr). Their signs are opposite, so the two equal unsigned composites from step 1.1 cancel in the sum defining the component of d2 from v to v+ei+ej. If there are fewer than two crossings, no length-two paths occur and d2 is the empty sum; otherwise every term of d2 lies in exactly one such pair. Hence d2=0.

Depends on

Used by

Cited to discharge well-definedness by Khovanov chain complex from a diagram.

Dependency tree · two levels

5 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