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.

Khovanov-Rozansky braid homology is an oriented link invariant up to shift

Statement

Assume the Axiom of Choice The Axiom of Choice. Let D1 and D2 be braid diagrams (clockwise-oriented, with admissible markings) whose closures are ambient-isotopic oriented links in S3 (Oriented links in the three-sphere and ambient isotopy). Then there exists a trigrading shift (j0,k0,l0)∈Z×Z2, depending only on the two diagrams and the sequence of Markov moves between them, such that Hk,lj(D1)≅Hk+k0,l+l0j+j0(D2) for all j,k,l. Thus "the trigraded cohomology of a braid diagram" is an invariant of the oriented link L=D1^, well defined up to an overall trigrading shift.

The shift is not absolute: the type IA stabilization contributes the shift {1,1}[1] and the type IB stabilization contributes none, so the total shift is the product of the shifts attached to the stabilization/destabilization moves in the chosen Markov sequence; no normalization of the grading is asserted here.

Caveats: the Axiom of Choice is used only through Markov's theorem for braid closures (Markov's theorem); the shift is not canonical without fixing conventions, and the source itself only claims invariance up to an overall shift.

Facts & Assumptions

Given: two braid diagrams D1,D2 whose closures are ambient-isotopic oriented links, with the Markov moves of Markov conjugation and stabilization moves available.

[F1]

Markov's closed-braid equivalence theorem: two braid closures are ambient-isotopic oriented links if and only if the braids are related by a finite sequence of Markov moves (a) conjugation, (b) braid-group transformations, (c) stabilization/destabilization; the theorem assumes the Axiom of Choice (Markov's theorem for braid closures).

[F2]

Conjugation of braid words leaves C(D) unchanged up to isomorphism with no shift (Invariance under braid conjugation).

[F3]

The braid-like Reidemeister IIa move (which covers inverse cancellations) and the braid-like III move with coherent orientations leave C(D) unchanged up to isomorphism with no shift (Invariance under the braid-like Reidemeister IIa move, Invariance under the braid-like Reidemeister III move).

[F4]

The two oriented stabilizations/destabilizations give C(D1)≅ΠC(D2){1,1}[1] for type IA and C(D1)≅C(D2) for type IB (Oriented kink shifts for braid diagrams).

[F5]

Changing the marks of a diagram changes C(D) by a chain homotopy equivalence with no grading shift, compatibly with the crossing differentials (Markings do not change the Khovanov-Rozansky complex).

[F6]

Each crossing complex is a two-term complex of local matrix factorizations; tensor products use the usual parity sign for the factorization differential and the cohomological sign for the crossing-complex differential. Local potentials add (Bigraded matrix factorizations with a potential, The positive and negative Khovanov-Rozansky crossing complexes).

Proof

technique · reduction to the three Markov moves and composition of the explicit isomorphisms along a Markov sequence
1.1F6algebra

Distant crossings commute. When ∣i−j∣>1, the two crossings involve disjoint pairs of strands. Give their incident edges separate variables and keep all other straight-edge factors fixed. Their local crossing complexes are therefore external tensor factors over their respective polynomial variable blocks, extended to the common commutative coefficient ring. For factors of outer cochain degrees c,d and inner parities ϵ,η, the map x⊗y↦(−1)cd+ϵηy⊗x is the signed tensor flip. The two standard tensor sign rules of [F6] show separately that it commutes with the outer and inner differentials; it preserves all internal degrees and the sum of the potentials, and its square is the identity. Reattach the unchanged factors and rename each edge variable to the same geometric edge on the other side. This gives a no-shift isomorphism for distant crossing commutation, for either sign of each crossing.

2.1F1F2F3F4F5step 1.1

Each Markov move acts by an isomorphism with a computable shift. Since the closures of D1 and D2 are ambient-isotopic, [F1] provides a finite sequence of Markov moves connecting them; it suffices to show that each move induces an isomorphism of complexes in K(hmfw) with an explicit shift. Move (a), conjugation αβ↔βα, has no shift by [F2]. For move (b), far commutations are the no-shift signed flips of step 1.1, inverse cancellations σiσi−1 and σi−1σi are the braid-like IIa move and the braid relation σiσi+1σi↔σi+1σiσi+1 is the braid-like III move, both with no shift by [F3]; the marking changes required to realize the moves are no-shift chain homotopy equivalences by [F5]. For move (c), the type IA stabilization/destabilization contributes inner parity reversal Π in addition to the shift {1,1}[1], and the type IB one contributes neither by [F4].

3.1F1F4step 2.1

Composing along the Markov sequence. Choose a Markov sequence from D1 to D2, and for each move choose the isomorphism supplied by step 2.1; composing the chain maps gives an isomorphism C(D1)≃ΠνC(D2){−k0,−l0}[j0] for the product of the shifts of the moves in the sequence, where ν counts the type IA moves modulo 2, because composing bigrading and cohomological shifts adds their exponents and Π2=1. The total shift (j0,k0,l0) depends only on the two diagrams and the chosen sequence, and the composed maps are a chain homotopy equivalence after this shift; the conventions Hj(C[n])=Hj+n(C) and (M{u,v})k,l=Mk−u,l−v give the stated target index shifts (j0,k0,l0); taking termwise cohomology, summing its two inner parity components, and then taking outer cohomology forgets Πν and gives Hk,lj(D1)≅Hk+k0,l+l0j+j0(D2) for all j,k,l.

4.1F1step 2.1step 3.1∎

Choice and conclusion. The only step that uses the Axiom of Choice is the invocation of Markov's theorem [F1], which is the passage from an ambient isotopy of the closures to a finite sequence of Markov moves; steps 1.1 and 2.1 are explicit constructions and use no choice. The source's Proposition 2 supplies the underlying invariance of C under the braid moves and the shift bookkeeping of the stabilizations, and Theorem 1 of the source is the resulting statement. Since the type IA and IB moves have different shifts, the total shift depends on the chosen Markov sequence and no absolute normalization is claimed.

Depends on

Used by

Dependency tree · two levels

43 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