Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Khovanov chain complex from a diagram

Definition

Input: a nonempty finite regular oriented link diagram D and a total order c1<⋯<cn on its crossing set. A diagram object is supplied as mathematical input; this procedure does not parse a serialized string.

Output: the normalized bigraded Khovanov cochain module Ci,j(D) and its candidate differential d:Ci,j(D)→Ci+1,j(D), constructed by the following finite instructions.

  1. Enumerate every state v:C(D)→{0,1} once. Form the crossingless resolution by using the A-smoothing at v(c)=0 and the B-smoothing at v(c)=1.
  2. For each state, create one tensor factor of the integral Frobenius algebra for each resolution circle and place the resulting tensor product in cohomological degree ∣v∣−n− and quantum degree ∣v∣+n+−2n−+∑deg⁡(a) for its circle labels a.
  3. For each state and each crossing cj with v(cj)=0, create the edge to v+ej. Apply multiplication if that smoothing change merges two circles, comultiplication if it splits one circle, the identity on other tensor factors, and the sign (−1)∑i<jv(ci). Sum the edge maps out of every state to obtain d.
  4. Return the finite direct sum of the state modules with these degrees and maps. The square-zero property is the separate local lemma named by justified_by.

Depends on

Used by

Dependency tree · two levels

6 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