Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
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 Khovanov-Rozansky factorization of the unknot

Example

Take the closed planar graph consisting of a single circle with one mark, labelled x, and one oriented arc from the mark to itself. Its Khovanov-Rozansky complex (the factorization of The factorization of a marked MOY graph) is Q[a,x]→aQ[a,x]{−1,1}→0Q[a,x]; the potential is 0 because the graph is closed, and the differential squares to zero. Its cohomology is H(Γ)≅Q[x]{−1,1}: the a-multiplication is injective on the first term and has cokernel Q[x]{−1,1} on the second, so all cohomology sits in one degree and a acts trivially. Consequently the Euler characteristic of the one-strand unknot diagram is ⟨D⟩=t−1/(q−1−q)=α1−q−2,α=−t−1q−1, in the integer grading of The Khovanov-Rozansky complex and trigraded braid homology.

Caveat: this is the factorization attached to the one-mark circle; it is a rank-one-in-each-parity representative over Q[a,x], of infinite rank over the closed graph's ground ring Q[a], and it is the base normalization of the categorification theorem, not an absolute normalization of the trigrading (Khovanov-Rozansky II, printed p. 4).

Facts & Assumptions

Given: the closed graph Γ consisting of one circle with one mark labelled x and the arc from the mark to itself, so that the two endpoint labels of the arc coincide.

[F1]

An arc with endpoint labels x1,x2 has factorization (a,x1−x2)=Q[a,x1,x2]→aQ[a,x1,x2]{−1,1}→x1−x2Q[a,x1,x2] with potential a(x1−x2); a closed graph has potential 0 and its factorization is a 2-periodic complex whose cohomology is written H(Γ) (The factorization of a marked MOY graph).

[F2]

The Euler characteristic of a closed braid diagram is ⟨D⟩=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) in the integer grading (The Khovanov-Rozansky complex and trigraded braid homology).

Verification

technique · direct computation of the two-term complex and of its cohomology
1.1F1algebra

The factorization. The circle carries one mark and one arc whose two endpoint labels are both x, so the arc factors of [F1] specialize to (a,x−x)=(a,0): the differentials are multiplication by a and by 0, the middle term carries the shift {−1,1}, and the square of the differential is 0⋅a=0, which is the potential a(x−x) of the closed graph. Hence the complex is exactly Q[a,x]→aQ[a,x]{−1,1}→0Q[a,x].

1.2F1algebra

Cohomology. In odd inner-factorization parity the cohomology is ker⁡(0 ⁣:Q[a,x]{−1,1}→Q[a,x])/im⁡(a ⁣:Q[a,x]→Q[a,x]{−1,1})=Q[a,x]{−1,1}/aQ[a,x]{−1,1}≅Q[x]{−1,1}, since Q[a,x]/aQ[a,x]≅Q[x] and multiplication by a is injective on Q[a,x]. In even inner-factorization parity the cohomology is ker⁡(a)/im⁡(0)=0 because multiplication by the nonzerodivisor a is injective. So H(Γ)≅Q[x]{−1,1}, all of it in odd inner parity and outer cochain degree 0, and a acts as zero on it.

2.1F1F2step 1.2algebra∎

Euler characteristic. The graded pieces of H(Γ) have (k,l)=(−1,1+2m) for m≥0, each of dimension 1 over Q, all in cohomological degree 0; substituting into the Euler characteristic of [F2] gives ⟨D⟩=∑m≥0t−1q1+2m=t−1q/(1−q2). Since q−1−q=(1−q2)/q, this is t−1/(q−1−q); and with α=−t−1q−1 one has α/(1−q−2)=−t−1q−1⋅q2/(q2−1)=t−1q/(1−q2), the same value. This is the unknot normalization used as the base case of the categorification theorem, and it is read off the displayed representative, finite free over Q[a,x] and infinite free over Q[a].

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