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 reduced Khovanov homology of a trefoil has rank three

Statement

Let D be the oriented closure of the two-strand braid σ13, with both strands directed downward and the positive generator drawn with its southwest-to-northeast strand over its northwest-to-southeast strand. Mark a point away from the three crossings, use the A-smoothing (zero-resolution) as the through pairing, and use the B-smoothing (one-resolution) as the cap-cup pairing. The normalized reduced Khovanov cohomology of D over F2 has total rank 3. The normalized cohomological and quantum grading shifts do not change this total rank.

Facts & Assumptions

Given: The three-crossing two-strand braid closure, a basepoint, and its reduced cube over F2.

[F1]

The based reduced state space removes the marked-circle factor, and a split of that circle maps its surviving label 1 to X on the unmarked output. The supplier proof verifies that the marked action commutes with every edge map, so the quotient is a cochain complex (Reduced Khovanov cohomology of a based link over F2).

[F2]

The circle algebra has X2=0, multiplication m, and comultiplication Δ(1)=1⊗X+X⊗1, Δ(X)=X⊗X (Khovanov Frobenius algebra and cube of resolutions).

[F3]

The signed Khovanov differential squares to zero, and the finite diagram procedure outputs a finite cochain complex (The Khovanov cube differential squares to zero, The Khovanov diagram procedure terminates and returns a finite cochain complex).

[F4]

The diagram procedure enumerates all smoothing states and assigns the merge or split edge map at each crossing change (Khovanov chain complex from a diagram).

Proof

1.1F1F4givenconstruct

Let r be the number of one-resolutions. The all-through closure has two circles; for r≥1, the first cap-cup gives one circle and each additional cap-cup contributes one closed circle. Thus the eight state circle counts in lexicographic order are 2,1,1,2,1,2,2,3. Removing the marked circle gives reduced state dimensions 2,1,1,2,1,2,2,4, so the cube cochain dimensions are 2,3,6,4.

2.1F1F2F4step 1.1constructalgebra

Order states within each cohomological degree lexicographically and order free circle factors by their first encounter in a fixed diagram scan, with 1 before X. The quotient by the marked-circle action in [F1], the Frobenius maps in [F2], and the edge procedure in [F4] give d0=(101010), d1=(000110000101000011), and d2=(000000101000001010010101). In d0 each merge sends 1↦1 and X↦0. In d1 each target gets two marked-circle splits 1↦X. For d2, on target basis (1⊗1,1⊗X,X⊗1,X⊗X) the three source-state maps are 011:(1↦1⊗X, X↦X⊗X), 101:(1↦1⊗X+X⊗1, X↦X⊗X), and 110:(1↦X⊗1, X↦X⊗X). These are exactly the marked quotient split maps and the ordinary Frobenius split map, in the stated basis order.

3.1F1F3step 1.1step 2.1algebra∎

The matrix d0 has rank 1. In d1, the first two columns are independent and their sum is the third, so rank⁡d1=2. The last matrix has three independent nonzero rows, so rank⁡d2=3. By [F1] the quotient is a cochain complex, and [F3] gives its finite support; hence its cohomology dimensions are 2−1=1, 3−1−2=0, 6−2−3=1, and 4−3=1. The total rank is therefore 3, and grading shifts preserve total dimension.

Depends on

Used by

Dependency tree · two levels

8 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