Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Invariance under the braid-like Reidemeister IIa move

Statement

Let D1,D2 be the two oriented diagrams of the braid-like Reidemeister IIa move of Khovanov-Rozansky II, Figure 15 (the move available inside braid diagrams), with potential w=a(x1+x2−x3−x4). Then C(D1)≅C(D2) in K(hmfw); in particular there is no grading shift, and the trigraded cohomology of a braid diagram is unchanged by an IIa move. The same holds for the mirror-image move with the orientations reversed and w replaced by its negative.

Caveat: only the braid-like IIa move is claimed. The IIb move is neither used nor claimed on this page; the source states (printed p. 9) that it did not prove IIb invariance and does not need it for braid closures.

Facts & Assumptions

Given: the two diagrams D1,D2 of Figure 15, the four resolutions Γ00,Γ10,Γ01,Γ11 of D1 with Γ01 the resolution of D2, their Koszul matrices over R=Q[a,x1,x2,x3,x4,x5,x6], and the maps f1 ⁣:C(Γ00)→C(Γ10), f2 ⁣:C(Γ10)→C(Γ11) of the resolution cube.

[F1]

C(D) is the tensor product of the crossing complexes and arc factors; it is an object of K(hmfw) with w=a(x1+x2−x3−x4) for the diagrams of Figure 15, and C(D2)≅C(Γ01) (The Khovanov-Rozansky complex and trigraded braid homology).

[F2]

The morphisms χ0,χ1 of the crossing complexes are the flip morphisms in the Koszul forms of the resolutions; the differential of a resolution cube is a sum of such morphisms, and the element Id⊗ψ(y) acts by the identity on the first term and by multiplication by y on the middle term (The wide-edge morphisms chi-zero and chi-one).

[F3]

Elementary row operations are isomorphisms of factorizations; a row (0,y−μ) with y internal may be deleted with y↦μ substituted in all remaining rows, yielding a chain homotopy equivalent factorization over the smaller ring (Koszul row operations and variable exclusion preserve homotopy type).

Proof

technique · direct computation in Koszul form; the resolution cube is reduced by row operations and two variable exclusions until the two factors of the differential become split isomorphisms
1.1F1algebra

The splitting criterion. The four resolution corners form a complex with C(Γ00) in degree −1, C(Γ10)⊕C(Γ01) in degree 0 and C(Γ11) in degree 1, with the shifts supplied by the crossing cones. Suppose f1 identifies C(Γ00) with a summand I of C(Γ10)=I⊕M, and f2∣M:M→C(Γ11) is invertible. Elementary changes of coordinates first cancel the block C(Γ00)→I and then the block M→C(Γ11). For an invertible block φ, subtracting its other row and column entries using φ−1 makes the differential block diagonal; the surviving block is the Schur complement. The equation d2=0 makes adjacent components to the canceled pair zero in these coordinates, so its identity pair is contractible. Here the sole final term is C(Γ01) in degree 0, and it has zero differential; off-diagonal cube maps introduce no further term. Thus the two invertible blocks suffice to prove C(D1)≃C(Γ01)=C(D2).

1.2F1F2F3algebra

Koszul form of the diagram and its first reduction. In the standard Koszul bases the three factorizations have four rows: C(Γ00) has rows (a,x1+x2−x5−x6), (0,x2−x6), (a,x5+x6−x3−x4), (0,(x6−x4)(x3−x6)); C(Γ10) has the same rows with second row (0,(x2−x6)(x5−x2)); C(Γ11) has the same rows as C(Γ10) with last row (0,x6−x4); the maps are f1=Id⊗ψ′(x5−x2)⊗Id⊗Id and f2=Id⊗Id⊗Id⊗ψ(x3−x6). Apply the row operation [13]1 to all three matrices simultaneously: the first rows become (a,x1+x2−x3−x4) and the third rows (0,x5+x6−x3−x4) in all three; the common third rows can be deleted and the internal variable x5 excluded by x5↦x3+x4−x6. The diagram becomes the tensor product of the row (a,x1+x2−x3−x4) with the diagram of two-row matrices [x2−x6 , (x6−x4)(x3−x6)]→g1[(x2−x6)(x3+x4−x6−x2) , (x6−x4)(x3−x6)]→g2[(x2−x6)(x3+x4−x6−x2) , x6−x4] over R′[x6], R′=Q[a,x1,x2,x3,x4], where g1=ψ′(x3+x4−x6−x2)⊗Id and g2=Id⊗ψ(x3−x6); each step is an isomorphism or a chain homotopy equivalence by [F2].

2.1F2F3step 1.1step 1.2algebra

Quadratic polynomial division. Put v=x6, Q(v)=(v−x4)(x3−v) and S=R′[v]. Its leading coefficient is the unit −1, so polynomial division gives an R′-module decomposition S=QS⊕(R′1⊕R′v). In the zero-first-entry Koszul row (0,Q), multiplication by Q maps the odd copy of S isomorphically to QS in the even copy. Cancel these pairs over R′; the surviving even copy is S/(Q), free over R′ on 1,v. In tensoring this row with another zero-first-entry row (0,f), the same cancellation gives the surviving differential induced by f on S/(Q): the quotient map commutes with multiplication by f, and the invertible Q block removes all its complementary components by the elementary Schur-complement calculation of step 1.1. Apply this simultaneously to the first two factorizations and their coefficient maps. The third bottom row (0,v−x4) reduces by the linear exclusion lemma [F3] to evaluation v=x4. The reduced diagram thus has first differential multiplication by x2−v on R′1⊕R′v, second differential multiplication by (x2−x4)(x3−x2) on that same rank-two module, and third differential multiplication by this last element on R′. Its vertical maps are 1 and x3+x4−v−x2 on the respective components of g1, and evaluation v=x4 on both components of g2. The quadratic reduction is polynomial division, rather than an application of the linear exclusion clause.

3.1F1step 1.1step 2.1

Splitting the reduced diagram. In the reduced diagram the first factorization has a contractible summand R′→1R′(x2−x6), whose removal leaves the rank-one row R′(x6+x2−x3−x4)→(x2−x4)(x2−x3)R′; the middle factorization is the direct sum of the two factorizations R′→(x2−x4)(x3−x2)R′ and R′(x6+x2−x3−x4)→(x2−x4)(x3−x2)R′(x6+x2−x3−x4), isomorphic to the first up to a grading shift; and the third factorization is the rank-one row over R′ with differential (x2−x4)(x3−x2). The map g1 takes the reduced first factorization isomorphically onto the second summand of the middle factorization, and g2 restricts to an isomorphism from the first summand of the middle factorization onto the third factorization; thus f1 is an isomorphism onto a direct summand and f2 restricts to an isomorphism from a complement, as required by step 1.1, so C(D1) is isomorphic in K(hmfw) to the direct sum of two contractible complexes and C(Γ01)≅C(D2). Every map in the computation is homogeneous of bidegree (0,0) between the shifted rows, so no grading shift occurs.

4.1F1F2step 3.1∎

Conclusion and mirror image. Steps 1.2-3.1 verify the splitting criterion of step 1.1 for the pair of Figure 15, giving C(D1)≅C(D2) in K(hmfw) with no shift of the trigrading, hence an isomorphism of trigraded cohomology for the two braid-like IIa diagrams. The mirror-image move is the same computation with the signs of all potentials reversed and the roles of the two sides exchanged, which leaves the conclusion unchanged; both diagrams have potential w in Figure 15 and potential −w after all orientations are reversed, and no step of the argument uses the Axiom of Choice.

Depends on

Used by

Dependency tree · two levels

8 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