Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Reduced Khovanov ranks of the unknot and the three-crossing two-braid

Example

For the crossingless based unknot diagram, the reduced integral cohomology is Z in cohomological degree 0. For the based closure of the three-crossing negative two-strand braid, with the basepoint on a closure arc and cohomological degree i=∣v∣−3, the reduced integral cohomology is Z in degrees −3,−2,0 and zero in degree −1. In particular, these two specified diagrams have total reduced ranks 1 and 3, respectively.

The braid diagram below shows the closure convention: the two outer arcs join corresponding top and bottom endpoints, the braid strands are oriented downward, the two closure arcs are traversed from bottom to top, the three crossings are negative, and the dot marks the basepoint. The top-to-bottom braid word is σ1−3, with σ1−1 drawn as the left incoming strand passing over the right incoming strand.

p

The crossing convention in this drawing is explanatory only; the verification computes the resolution cube and does not infer any differential or homology from the picture.

Facts & Assumptions

Given: The crossingless based unknot and the based closure diagram of σ1−3 described above.

[F1]

The unreduced circle algebra is A=Z[X]/(X2) with basis 1,X, multiplication m, and comultiplication Δ(1)=1⊗X+X⊗1, Δ(X)=X⊗X; its edge maps carry the ordered-cube signs (−1)∑i<jvi (Khovanov Frobenius algebra and cube of resolutions, Definition).

[F2]

For a diagram with n− negative crossings, a state v lies in cohomological degree ∣v∣−n−, and an edge from v to v+ej uses m for a merge and Δ for a split, with that cube sign (Khovanov chain complex from a diagram, Definition).

[F3]

In the reduced quotient the based circle factor is M=Z{1} with X⋅1=0; an unbased circle retains the factor A (Reduced Khovanov cohomology of a knot, Definition).

[F4]

The signed cube maps form a cochain complex (The Khovanov cube differential squares to zero, Statement).

Verification

1.1F2F3givenalgebra

The crossingless diagram has one based circle, hence its reduced state module is M=Z{1} in degree 0 by [F2]–[F3]. There are no crossings and therefore no differential, so its cohomology is Z in degree 0.

1.2F1F2F3givenalgebra

First compute the auxiliary positive two-strand closure, whose A-smoothing is the identity tangle and whose B-smoothing is the cap-cup tangle. This is only an auxiliary raw cube; it does not change the specified negative diagram. With zero, one, two, or three cap-cup smoothings, the closure has respectively two, one, two, or three circles: composing cap-cups creates one additional internal circle each time after the first. Thus its four raw cochain degrees 0,1,2,3 have modules M⊗A, M3, (M⊗A)3, and M⊗A⊗A, of ranks 2,3,6,4.

1.3F1F2F3givenalgebra

Label the three two-circle states in crossing order and identify the two unbased factors in the all-B state from left to right. The last differential is (a,b,c)⟼a⊗X−Δ(b)+X⊗c. Here the first and third edges split the based circle, while the middle edge splits the unbased circle; the signs are the cube signs from [F2]. Its image is exactly the subgroup generated by 1⊗X, X⊗1, and X⊗X, and its kernel consists of triples with equal coefficients of 1 and with coefficients of X satisfying aX−bX+cX=0.

2.1F1F2F3step 1.2algebra

Order crossings from top to bottom. The first differential sends 1⊗1 to (1,1,1) and 1⊗X to zero, so its image is the diagonal copy of Z and its kernel is Z{1⊗X}. After suppressing the common based factor M, the next differential is the signed incidence matrix (−110−1010−11) with each integer entry multiplying the label X, because each edge splits the based circle and the reduced split sends 1 to 1⊗X. Its image has rank two and its kernel is the diagonal copy of Z.

3.1F4step 1.2step 2.1step 1.3algebra

These auxiliary raw differentials have ranks 1,2,3. Their images are primitive subgroups of their target free groups: the first image has a coordinate 1, the incidence matrix in step 2.1 has a 2 by 2 minor 1, and the last image is the coordinate span of 1⊗X,X⊗1,X⊗X. In each case elementary integral row and column elimination therefore gives only unit nonzero diagonal entries. Hence all auxiliary homology groups are free. The kernel/image calculations in steps 2.1 and 1.3 give raw cohomology Z in degrees 0,2,3 and zero in degree 1.

3.2F1F2F3step 1.2step 2.1step 1.3constructalgebra

Now return to the specified negative diagram. At each crossing its A-smoothing is cap-cup and its B-smoothing is through, so the state v has exactly the same circles as the auxiliary positive state w=1−v. Put the perfect integral pairing ⟨a,b⟩=ϵ(ab) on each unbased circle, with matrix (0110), and pair the based module M with itself by ⟨1,1⟩=1. Multiplication and comultiplication are adjoints for these pairings, directly on 1,X; the reduced merge and split are adjoints too, since mM(1⊗1)=1, mM(X⊗1)=0 and ΔM(1)=X⊗1. Use the same actual circle order on the two complementary states. For an edge in coordinate j, the old transposed sign is (−1)j−1−∑k<jvk whereas the negative cube requires (−1)∑k<jvk. Multiplying vertex v by J(v)=(−1)∑j(j−1)vj corrects this ratio: across that edge its ratio is (−1)j−1. Thus the negative raw cube is integrally isomorphic to the degree-reversed transpose of the auxiliary cube, with this explicit diagonal sign correction. No spatial reflection or change to the given negative crossing is used.

4.1F2F4step 1.1step 3.1step 3.2algebra∎

The reversed transpose has ranks 4,6,3,2 in raw degrees 0,1,2,3, and differential ranks 3,2,1. Transposition preserves the unit diagonal entries proved in step 3.1, as do the unimodular pairings and J in step 3.2. Each image is therefore primitive; its quotient in the kernel is torsion-free because it is a subgroup of the free quotient of the whole target. Rank-nullity now gives free homology of ranks 1,1,0,1 in raw degrees 0,1,2,3. The negative diagram has three negative crossings, so the normalization i=∣v∣−3 gives Z exactly in degrees −3,−2,0, with zero in degree −1. Together with step 1.1 this proves all stated ranks for the actual two diagrams.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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