Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 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.

Omitting Khovanov normalization breaks Reidemeister I and the Jones Euler characteristic

Statement refuted

For every nonempty finite regular oriented diagram D, form the integral Khovanov state cube but omit the cohomological shift −n− and quantum shift n+−2n−. The false claim is that the resulting raw cohomology groups are invariant under oriented Reidemeister moves and that their graded rank Euler characteristic equals the Jones polynomial with the usual unreduced unknot factor q+q−1, under q=−A−2 and t=q2=A−4.

Facts & Assumptions

Given: The crossingless unknot, its positive and negative one-crossing curls, and the raw cube with both normalization shifts omitted.

[F1]

The algebra A has basis 1,X in quantum degrees 1,−1, and the edge operations are m and Δ with the displayed values (Khovanov Frobenius algebra and cube of resolutions).

[F2]

In the declared smoothing chart, the positive one-crossing curl has a two-circle 0-resolution and one-circle 1-resolution joined by m; the negative curl has one-circle 0-resolution and a two-circle 1-resolution joined by Δ (Kauffman bracket smoothing and loop value, Oriented crossing signs, diagram writhe, and blackboard framing, Khovanov chain complex from a diagram).

[F3]

A crossingless one-circle diagram has a unique state with no differential (Khovanov chain complex from a diagram).

[F4]

Each oriented type-I curl is realized by an ambient isotopy, so the curled diagram and the crossingless diagram represent the same oriented unknot (Oriented Reidemeister moves, Each oriented Reidemeister move is realized by an ambient isotopy).

[F5]

The signed cube differential squares to zero, and the raw cube is a bounded complex of finite-rank free abelian groups (The Khovanov cube differential squares to zero, The Khovanov diagram procedure terminates and returns a finite cochain complex).

Counterexample

1.1F1F3givenalgebra

The raw zero-crossing complex of U is A in cohomological degree 0 with zero differential by [F3]. Its generators 1,X have quantum degrees 1,−1 by [F1], so its chain Euler polynomial is q+q−1.

1.2F1F2algebra

In the positive curl, the 0-state contributes (q+q−1)2 and the 1-state contributes −q(q+q−1), because the state coordinate raises quantum degree by one and homological degree by one. Hence χqraw(U+)=(q+q−1)2−q(q+q−1)=1+q−2=q−1(q+q−1). In the negative curl, the 0-state contributes q+q−1 and the 1-state contributes −q(q+q−1)2. Hence χqraw(U−)=(q+q−1)−q(q+q−1)2=−q3−q=−q2(q+q−1). These computations use only the state modules and gradings before the writhe normalization.

2.1F4F5step 1.1step 1.2algebra∎

For each quantum degree, tensor the bounded finite-rank free complex with Q. Clearing denominators shows that kernels and images localize to the kernels and images of the rationalized maps; applying the same argument to a kernel modulo the preceding image identifies rationalized cohomology with integral cohomology tensored with Q. Its dimension is therefore the integral rank of cohomology. In the bounded rational complex, rank-nullity gives dim⁡Ci=dim⁡Hi+dim⁡im⁡di+dim⁡im⁡di−1; alternating over i cancels the image terms. Thus the raw cohomology Euler polynomials equal the chain Euler polynomials in steps 1.1–1.2. The distinct Laurent polynomials q+q−1, q−1(q+q−1), and −q2(q+q−1) come from diagrams of the same unknot by [F4]. The raw groups are consequently not invariant, and the raw unknot factor is not the claimed q+q−1.

Depends on

Used by

Nothing in the library uses this result yet.

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