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.

Markings do not change the Khovanov-Rozansky complex

Statement

Let D be a marked tangle diagram and let D′ be obtained from D by adding or removing marks, subject to the standing convention of The Khovanov-Rozansky complex and trigraded braid homology (at least one mark on every internal edge and every circle; any number on boundary edges and external edges). Then C(D′) is chain homotopy equivalent to C(D) in K(hmfw) with the same potential; moreover the equivalences are compatible with the crossing differentials: for the two local diagrams Γ10,Γ11 and Γ20,Γ21 of the source's Figure 11 the two-term complexes 0→C(Γi1)→χ1C(Γi0)→0, i=1,2, are chain homotopy equivalent.

Consequently, for closed braid diagrams the trigraded cohomology H(D) is an invariant of the underlying unmarked diagram as a graded isomorphism class: different marking choices give isomorphic trigraded vector spaces, with no grading shift.

Caveat: the theorem is a statement about C(D) as an object of K(hmfw); it does not assert literal equality of the complexes.

Facts & Assumptions

Given: a marked tangle diagram D and the diagrams Γ1,Γ2 of Figure 10 and Γ10,Γ11,Γ20,Γ21 of Figure 11, together with their Koszul matrices.

[F1]

A mark on an arc or a wide edge contributes a label appearing in the rows of the Koszul matrix of C(Γ); adding or removing a mark changes the label pattern locally, and the potential wΓ is unchanged when a label occurring at two edge-ends with opposite signs is removed (The Khovanov-Rozansky complex and trigraded braid homology, The factorization of a marked MOY graph).

[F2]

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

Proof

technique · local Koszul computations for the two mark-removal configurations of Figures 10-11
1.1F1F2algebra

Removing a mark: the top configuration of Figure 10. The Koszul matrix of C(Γ1) has rows (a,x1+x5−x3−x4), (0,x1x5−x3x4) and (a,x2−x5). Apply the row operation [13]1 to the first and third rows: they become (a,x1+x5−x3−x4+x2−x5)=(a,x1+x2−x3−x4) and (a−a,x2−x5)=(0,x2−x5), while the quadratic row is unchanged; the operation is an isomorphism of factorizations by [F2]. The bottom row (0,x2−x5) has coefficient −1 on x5, a unit; x5 may still occur in the quadratic row, to which the ensuing substitution must also be applied; it is internal because w=a(x1+x2−x3−x4) does not involve x5. By the variable-exclusion clause of [F2] the row may be deleted and x5 replaced by x2 in every remaining row, leaving rows (a,x1+x2−x3−x4) and (0,x1x2−x3x4), which is the Koszul matrix of C(Γ2). Hence C(Γ1)≅C(Γ2) in hmfw, with the same potential by [F1]; the other local pairs of Figure 10 are the symmetric cases with the roles of the rows exchanged.

2.1F1F2step 1.1algebra

Compatibility with the crossing differential. The first complex of formula (10), written in Koszul form, has common first and third rows (a,x1+x5−x3−x4) and (a,x2−x5), with second row (0,(x5−x3)(x4−x5)) in the source and (0,x5−x3) in the target, with differential Id⊗ψ(x4−x5)⊗Id. Applying the row operation [13]1 to both matrices simultaneously gives an isomorphic complex whose matrices have first row (a,x1+x2−x3−x4), second row unchanged and third row (0,x2−x5); the differential is the identity on this third row. Substituting the internal variable x=x2−x5, both matrices have identical bottom rows (0,x) on which the differential acts by the identity, so the variable-exclusion clause of [F2] deletes that row and sets x5=x2, reducing the ground ring to R=Q[a,x1,x2,x3,x4] and leaving the complex (a,x1+x2−x3−x4)⊗(0,(x2−x3)(x4−x2))→ψ(x4−x2)(a,x1+x2−x3−x4)⊗(0,x2−x3), which is precisely the second complex of formula (10). The two complexes are therefore chain homotopy equivalent. The reverse crossing map ψ′(x4−x5) is likewise the identity on the first and third exterior factors, so the same row change and substitution give ψ′(x4−x2). This proves compatibility for both crossing signs. The second pair of Figure 11 is obtained by exchanging the exterior edge labels; that relabelling carries each of these row operations, substitutions and maps to the corresponding formulas, proving the equivalence for i=2.

3.1F1F2step 1.1step 2.1∎

Conclusion. Every change of marking decomposes into the local moves of Figure 10, each of which changes C by an isomorphism or a chain homotopy equivalence as in step 1.1, and step 2.1 shows that these local equivalences can be chosen compatibly with the crossing differentials χ1, so the two-term complexes of Figure 11 are chain homotopy equivalent. Composing the local equivalences along any finite sequence of marking changes gives a chain homotopy equivalence C(D′)≃C(D) in K(hmfw) with the same potential, all three gradings being preserved because every operation is a homogeneous change of basis or a substitution by a linear form of bidegree (0,2); passing to cohomology gives an isomorphism H(D′)≅H(D) with no shift. No Axiom of Choice is used.

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