Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Matrix Factorizations and Khovanov–Rozansky Link Homology — Examples

1 · Prerequisites

2 · Summary

These four entries make the construction of the companion page concrete. The first writes out the positive crossing complex with its two resolutions, the presentation matrices P0,P1,Q0,Q1 and the two matrices defining χ0, and displays the negative crossing side by side with its {0,−2} normalization, using the corrected χ1-cone. The second computes the factorization of the one-mark circle, obtains H(Γ)≅Q[x]{−1,1} and reads off the unknot Euler characteristic t−1/(q−1−q). The third iterates the construction for a two-crossing closed braid, exhibits the four resolutions and verifies that the total potential of a closed diagram vanishes. The fourth is a scope illustration: it tabulates the moves actually used in the invariance proof — IIa, coherent-orientation III, conjugation, the oriented stabilizations and Markov's theorem — and records why the oriented IIb move is neither used nor claimed.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

A positive crossing factorization complex

Example

Write out the positive crossing complex of The positive and negative Khovanov-Rozansky crossing complexes: with the two resolutions Γ0 (two arcs with labels x1,x4 and x2,x3) and Γ1 (one wide edge with the same four labels) and the maps χ0,χ1 of The wide-edge morphisms chi-zero and chi-one, the positive crossing contributes 0→C(Γ0){0,2}→χ0C(Γ1)→0 with C(Γ1) in cohomological degree 0, the differential having bidegree (0,0) on the shifted terms.

Both resolutions carry the potential a(x1+x2−x3−x4). In the standard product bases the four presentation matrices are P0=(ax3−x2ax1−x4),P1=(x1−x4x2−x3−aa), Q0=(ax3x4−x1x20x1+x2−x3−x4),Q1=(x1+x2−x3−x4x1x2−x3x40a), the term shifts are C0(Γ0)=R⊕R{−2,2}, C1(Γ0)=R{−1,1}⊕R{−1,1}, C0(Γ1)=R⊕R{−2,4}, C1(Γ1)=R{−1,1}⊕R{−1,3}, and the two components of χ0 are U00=(x4−x2001),U01=(x4−x2−11). The negative crossing complex is the analogous two-term complex of χ1 with the {0,−2} shift of The positive and negative Khovanov-Rozansky crossing complexes; written side by side with the positive one, the shift asymmetry is visible: the positive complex shifts the source by {0,2} and nothing else, while the negative complex applies the overall shift {0,−2} to both terms.

Caveat: the source's arXiv prose misprints the negative crossing in terms of χ0; this example uses the corrected χ1 complex of The positive and negative Khovanov-Rozansky crossing complexes (Khovanov-Rozansky II, Figure 6 and formula (6); published formula (13)).

Facts & Assumptions

Given: the ring R=Q[a,x1,x2,x3,x4], the two resolutions Γ0 (two arcs) and Γ1 (one wide edge), their presentation matrices P0,P1,Q0,Q1 with the displayed shifts, and the morphism matrices U00,U01 of χ0.

[F1]

C(Γ0) is the tensor product of the arc rows (a,x1−x4) and (a,x2−x3), C(Γ1) is the tensor product of the rows (a,x1+x2−x3−x4) and (0,x1x2−x3x4), and both have potential w=a(x1+x2−x3−x4) (The factorization of a marked MOY graph).

[F2]

χ0 is a morphism of factorizations of bidegree (0,2); χ1 is a morphism of bidegree (0,0); the positive crossing complex is the cone of χ0 with the source shifted by {0,2}, and the negative crossing complex is the cone of χ1 with the overall shift {0,−2} (The wide-edge morphisms chi-zero and chi-one, The positive and negative Khovanov-Rozansky crossing complexes).

Verification

technique · direct transcription with the two matrix verifications that make each presentation a factorization of potential $w$
1.1F1algebra

The products are factorizations. Multiplying out over R gives P1P0=(a(x1+x2−x3−x4)00a(x1+x2−x3−x4))=w⋅I2 and Q1Q0=(w00w)=w⋅I2, because the off-diagonal entries (x1−x4)(x3−x2)+(x2−x3)(x1−x4) and (x1+x2−x3−x4)(x3x4−x1x2)+(x1x2−x3x4)(x1+x2−x3−x4) vanish; hence both presentations are factorizations with potential w, in accordance with [F1].

1.2F2algebra

The morphism and its bidegree. The matrix products Q0U00=U01P0 and Q1U01=U00P1 of the definition of χ0 show that the displayed U matrices commute with the differentials, and the entries x4,−x2 and the shifts R{−1,1}→R{−1,3}, R{−2,2}→R{−2,4} combine to bidegree (0,2); on the source shifted by {0,2} the differential has bidegree (0,0).

2.1F1F2step 1.2∎

The two complexes side by side. The positive complex has terms C(Γ0){0,2} in degree −1 and C(Γ1) in degree 0 with differential χ0, and the negative complex has terms C(Γ1){0,−2} in degree 0 and C(Γ0){0,−2} in degree 1 with differential χ1; in both cases the differential is a morphism of factorizations of bidegree (0,0) on the shifted terms by step 1.2 and [F2], so each displayed two-term complex is a complex of objects of hmfw. The shift asymmetry is exactly the one recorded in The positive and negative Khovanov-Rozansky crossing complexes: {0,2} on the positive source versus the overall {0,−2} normalization on the negative complex.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

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].

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

A two-crossing closed braid factorization complex

Example

For a braid diagram D with two crossings, C(D) is the iteration of two crossing complexes and the intermediate arc factors; for instance D=σ1σ2 on three strands has C(D)=Cp1⊗Cp2⊗Cc over the shared polynomial ring, with one arc factor Cc for each arc of the diagram. Verify that the total potential is a∑pϵpxp over the boundary points before closure and that for the closed braid diagram (empty boundary) the total potential is 0, so each outer term of C(D) is a genuine two-periodic complex of bigraded Q[a]-modules; exhibit the four resolutions of the two crossings, each a tensor product of the two local crossing resolutions and all unchanged arc factorizations, and record the induced differentials and their bidegrees. The trigraded cohomology H(D) is then computed from the induced differential on the termwise cohomology CH(D).

Caveat: the displayed total complex is a representative in K(hmf0) up to contractible summands; no invariance statement is made in this example (that is the link-invariance theorem proved later on this page).

Facts & Assumptions

Given: the closed braid diagram D of σ1σ2 on three strands with its two crossings p1,p2, the intermediate and external arcs, at least one mark on every internal edge, and the labels x1,…,xm at the marks and boundary points.

[F1]

C(D) is the tensor product of the crossing complexes Cp and the arc factors Cc over the polynomial ring generated by a and all labels; its outer crossing differential has Koszul signs and bidegree (0,0) and squares to zero, while its inner factorization differential has square the sum of the local potentials (The Khovanov-Rozansky complex and trigraded braid homology).

[F2]

The crossing complex Cp is the two-term complex 0→C(Γ0){0,2}→χ0C(Γ1)→0 for a positive crossing and 0→C(Γ1){0,−2}→χ1C(Γ0){0,−2}→0 for a negative crossing, both terms being factorizations with the potential of the four adjacent labels (The positive and negative Khovanov-Rozansky crossing complexes).

Verification

technique · bookkeeping with the tensor product of two crossing complexes, the potential of a closed diagram, and the resulting differential on the four resolutions
1.1F1F2algebra

The four resolutions and all signed edges. Write Cab=C(Γab) for the resolution with choices a,b∈{0,1} at the two positive crossings, including all unchanged arc factors. The outer terms are C−2=C00{0,4},C−1=C10{0,2}⊕C01{0,2},C0=C11, and zero otherwise. In this summand order the outer differentials are ∂−2=(χ0⊗1,−1⊗χ0),∂−1=(1⊗χ0,χ0⊗1). The minus sign comes from the first source factor having cochain degree −1. Each edge has internal bidegree (0,0) after the indicated shifts and raises outer degree by 1. The edge maps commute before the signs, since they act on different tensor factors, so ∂−1∂−2=0. All four terms retain their inner two-periodic factorization differentials, with the same total potential.

2.1F1step 1.1

The potential. Before closure, the boundary points of the braid diagram carry labels; every internal label occurs in exactly two local factors with opposite signs, so the sum of the local potentials is a∑pϵpxp over the boundary points, and the square of the inner factorization differential is that element; the outer crossing differential still squares to zero by step 1.1. After closing the braid the closure arcs identify the boundary points in pairs with opposite orientations, so each boundary label occurs once with sign +1 and once with sign −1; the total potential is 0 and every outer term of C(D) is a genuine two-periodic complex of bigraded Q[a]-modules.

3.1F1F2step 1.1step 2.1∎

The induced differential and the cohomology. For each term Cj(D) the termwise cohomology CHj(D) is computed after removing the contractible summands, and ∂ commutes with the internal differentials, so it descends to maps ∂ ⁣:CHj(D)→CHj+1(D); the four resolutions contribute the four summands of CH(D) and the induced maps are the sums of the four edge maps of the cube with Koszul signs. The resulting cohomology H(D) is the trigraded cohomology of the diagram, and the trigradings of the four summands are inherited from the terms; no invariance statement is made here, and the representative is taken up to contractible summands in K(hmf0).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

Why the Khovanov-Rozansky II invariance proof stays in the braid-diagram calculus

Example

Assume AC (The Axiom of Choice) for the sourced Markov comparison of ambient-isotopic closures. Tabulate the moves actually used in the invariance proof of Khovanov-Rozansky braid homology is an oriented link invariant up to shift:

(i) the braid-like Reidemeister IIa move and far commutations; (ii) the braid-like Reidemeister III move with coherent orientations; (iii) conjugation of braid words; (iv) the two oriented stabilizations/destabilizations via the type IA and IB kink computations; (v) Markov's equivalence theorem Markov's theorem for braid closures.

The oriented Reidemeister IIb move is not in the list, and Khovanov-Rozansky II, printed p. 9 states explicitly that the authors did not prove IIb invariance and restricted to braid diagrams to avoid it; for closed braids the IIb move is never needed, because Markov's theorem accounts for all isotopies of the closures. This example illustrates proof scope only; it makes no claim that the complex fails to be invariant under IIb, and it does not claim IIb invariance. Caveat: the type IA and IB pictures must be the source's oriented pictures, since the stabilizations carry different shifts.

Facts & Assumptions

Given: AC, the invariance theorem's proof, its list of Markov moves, and the source's statement of the IIb obstruction.

[F1]

The braid-homology invariance theorem reduces the proof to the three Markov moves and obtains the invariance from the IIa move, the coherent-orientation III move, conjugation, the two oriented kink computations and Markov's theorem; the Axiom of Choice enters only through Markov's theorem (Khovanov-Rozansky braid homology is an oriented link invariant up to shift).

[F2]

Markov's theorem for braid closures: two closed braids are ambient-isotopic oriented links if and only if the braids are related by conjugation and stabilization/destabilization moves; in particular no Reidemeister move outside the braid-diagram calculus is needed for the comparison of closures (Markov's theorem for braid closures).

[F3]

AC is the choice-function principle, assumed for the Markov theorem used here (The Axiom of Choice).

Verification

technique · comparison of the proof's move list with the source's stated scope; no new mathematics
1.1F1F2

The moves used, with their roles. In the proof of [F1] far commutations σiσj↔σjσi are the signed tensor flips of disjoint crossing factors, the braid-like IIa move covers inverse cancellations σiσi−1, σi−1σi; the coherent-orientation III move covers the braid relation; conjugation covers the change of cyclic order; the kink computations cover the two oriented stabilizations/destabilizations with their shifts {1,1}[1] and none; and marking changes are absorbed by the marking-independence theorem. These are the source's Markov moves (a)-(c), with marking independence supplying the auxiliary marking changes. The separate six defining properties of F include a skein relation and an unknot normalization, so they are not a move list.

1.2F1F2F3

Why IIb is absent and why this is not a gap. The source restricts the construction to braid diagrams because the oriented IIb move lies outside the braid-diagram calculus and its invariance is not proved there. By [F2], an ambient isotopy between two braid closures can be replaced by a finite Markov sequence, so IIb is never invoked in the invariance argument; conversely the example claims no invariance under IIb and no failure of it, only that the proof's scope is the braid-diagram calculus. The only choice-theoretic input is Markov's theorem inside [F1], as recorded there.

2.1F1F2step 1.1∎

Conclusion. The tabulation of step 1.1 is complete: every move used in the invariance proof is one of far commutation, braid-like IIa cancellation, coherent-orientation III, conjugation, the two oriented stabilizations, or a marking change composed along a Markov sequence, and the IIb move is neither used nor claimed. This is a scope illustration, not a counterexample or a failure statement.

Sources