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 graded Euler characteristics have the Jones normalization

Statement

Let D be a nonempty finite regular oriented diagram of a link with n+ positive crossings, n− negative crossings, writhe w=n+−n−, and n=n++n−. For each resolution state v, let k(v) be its number of circles and let Dv use the A-smoothing at coordinates 0 and B-smoothing at coordinates 1. Put δ=−A2−A−2 and define the normalized bracket fD(A):=(−A3)−w∑v:C(D)→{0,1}An−2∣v∣δk(v)−1. For the unreduced cohomology, define χq(Kh(D))=∑i,j(−1)irank⁡ZKhi,j(D)qj. If D is a finite regular oriented diagram of a knot with a basepoint p away from all crossings, define its reduced rank Euler characteristic using the reduced quantum grading j~ by χ~q(D,p)=∑i,j~(−1)irank⁡ZKh~i,j~(D,p)qj~. Under q=−A−2 and t=q2=A−4, χq(Kh(D))=(q+q−1)fD(A),χ~q(D,p)=fD(A). Thus the unreduced unknot factor is q+q−1 and the reduced unknot factor is 1.

Facts & Assumptions

Given: A nonempty finite oriented link diagram D, its ordered Khovanov state cube, and, when D is a based knot diagram, its reduced cochain complex.

[F1]

The Kauffman state sum is ⟨D⟩=∑vAn−2∣v∣(−A2−A−2)k(v)−1, with each state using the prescribed A/B smoothing chart (Kauffman bracket smoothing and loop value).

[F2]

The writhe is the sum of crossing signs, so w=n+−n− (Oriented crossing signs, diagram writhe, and blackboard framing).

[F3]

A state with circle labels 1,X has cohomological degree i=∣v∣−n− and quantum degree j=∣v∣+n+−2n−+∑deg⁡(a); deg⁡(1)=1, deg⁡(X)=−1, and edge maps preserve j (Khovanov Frobenius algebra and cube of resolutions).

[F4]

The reduced state module kills the based-circle X label and subtracts one from the original quantum degree, so the surviving based label 1 contributes degree zero (Reduced Khovanov cohomology of a knot).

[F5]

The Khovanov procedure returns a bounded bigraded cochain complex with finite-rank free state groups (The Khovanov diagram procedure terminates and returns a finite cochain complex).

Proof

1.1F5givenalgebra

Fix a quantum degree and tensor the finite free complex with Q. For an integer matrix d, the kernel after tensoring is (ker⁡d)⊗Q: if d(a/r)=0 with a integral and r≠0, then d(a)=0 because the target is torsion-free. The image after tensoring is im⁡(d)⊗Q by clearing denominators, so rationalized homology is Hi(C)⊗Q and has dimension rank⁡ZHi(C). Rank-nullity in this bounded rational complex gives dim⁡Ci=dim⁡Hi+dim⁡im⁡di+dim⁡im⁡di−1; alternating over i cancels the image dimensions. The same argument applies to the reduced complex, whose terms are finite-rank free.

2.1F1F2F3F4step 1.1algebra

On a state v, summing q∑deg⁡(a) over its k(v) independent labels gives (q+q−1)k(v), so the unreduced chain Euler sum is ∑v(−1)∣v∣−n−q∣v∣+n+−2n−(q+q−1)k(v). With q=−A−2, one has q+q−1=δ and, term by term, (−1)∣v∣−n−q∣v∣+n+−2n−A−(n−2∣v∣)=(−A3)−w. The state contribution is consequently (q+q−1)(−A3)−wAn−2∣v∣δk(v)−1. For the reduced cube, the based label contributes degree zero by [F4], leaving (q+q−1)k(v)−1 in place of (q+q−1)k(v), so its state contribution is (−A3)−wAn−2∣v∣δk(v)−1.

3.1step 1.1step 2.1algebra∎

Summing the state contributions in step 2.1 gives the two displayed formulas for the chain Euler sums. Step 1.1 identifies those sums with the Euler characteristics of integral cohomology. When D is the crossingless unknot, n+=n−=0 and k=1, so the unreduced value is q+q−1 and the reduced value is 1.

Depends on

Used by

Dependency tree · two levels

17 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