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.

Reduced Khovanov homology over F2 is independent of the chosen link component

Statement

Let D be a finite regular diagram of an oriented link and let p,q be any two points of D away from crossings, possibly on different link components. Over F2, the reduced Khovanov cohomology groups defined using p and q are isomorphic as bigraded vector spaces. The isomorphism need not be canonical; no diagram-change invariance is asserted here.

Facts & Assumptions

Given: The finite Khovanov cube C(D;F2) and two basepoints p,q away from its crossings.

[F1]

The circle algebra and all edge maps are the Frobenius multiplication and comultiplication specified in Khovanov Frobenius algebra and cube of resolutions and Khovanov chain complex from a diagram.

[F3]

The based reduced complex is the quotient by im⁡Xp with the stated one-degree shift (Reduced Khovanov cohomology of a based link over F2).

Proof

1.1F1F2givenalgebra

On A=F2{1,X} define N(1)=0 and N(X)=1, and on a state tensor define N as the sum of this operation over its circle factors. For multiplication, direct evaluation on (1,1),(1,X),(X,1),(X,X) gives Nm=m(N⊗id+id⊗N). For comultiplication, evaluation at 1 gives (N⊗id+id⊗N)Δ(1)=0=ΔN(1), and evaluation at X gives (N⊗id+id⊗N)Δ(X)=1⊗X+X⊗1=ΔN(X). Thus N commutes with each saddle map and hence with d. Also N2=0: applying N twice to one circle gives zero, and every pair of distinct circles occurs twice, hence cancels over F2.

2.1F1step 1.1algebra

For a basepoint p, multiplication Xp is a chain map and Xp2=0. The local operators on the circle containing p satisfy NXp+XpN=id on that factor; terms of N on all other circles commute with Xp and occur twice in the sum, so the identity holds on every state tensor.

3.1step 1.1step 2.1algebra

Put P=XpN and Q=NXp. The identity in step 2.1 and Xp2=N2=0 imply P+Q=id, P2=P, Q2=Q, and PQ=QP=0. Both maps commute with d by step 1.1. Moreover im⁡P=im⁡Xp: one inclusion follows from P=XpN, and PXp=XpNXp=Xp gives the reverse inclusion. Hence the chain module splits as im⁡Xp⊕im⁡Q.

4.1F3step 3.1algebra

The quotient map identifies C/im⁡Xp with im⁡Q. The restriction Xp:im⁡Q→im⁡P is an isomorphism with inverse N, since NXp is the identity on im⁡Q and XpN is the identity on im⁡P. The map Xp lowers raw quantum degree by two, while [F3] lowers the quotient grading by one. Thus, for each cohomological degree i, if hi,j is the dimension of unreduced cohomology in raw degree j and ri,j(p) the dimension of reduced cohomology in reduced degree j, then hi,j=ri,j−1(p)+ri,j+1(p).

5.1F2step 4.1algebra∎

The diagram has finitely many cube generators, so the sequences j↦hi,j and j↦ri,j(p) have finite support. Rewrite step 4.1 as ri,k(p)=hi,k+1−ri,k+2(p). For each parity of k, start above the largest supported reduced degree, where the latter term is zero, and recurse downward by two; this uniquely determines all reduced dimensions from the unreduced dimensions. Therefore ri,j(p)=ri,j(q) in every bidegree. Finite-dimensional vector spaces with equal dimensions are isomorphic in each bidegree; only finitely many bidegrees occur, so these isomorphisms assemble without an infinite choice principle.

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