Alphabeta Math
LemmaStatement: 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 braid conjugation

Statement

Let α,β be braid words on n strands and let Dαβ, Dβα be the corresponding closed braid diagrams with any admissible markings. Then C(Dαβ)≅C(Dβα) in K(hmf0), with no grading shift; hence the trigraded cohomology is unchanged, H(Dαβ)≅H(Dβα).

Caveat: the statement is about the two closed braid diagrams of conjugate braid words, not about a homotopy between arbitrary complexes; the isomorphism is constructed, not merely asserted. The two braid words represent the same link by Markov move (a) of Markov conjugation and stabilization moves.

Facts & Assumptions

Given: braid words α,β on n strands, the two closed braid diagrams Dαβ and Dβα with admissible markings, and their complexes C(Dαβ), C(Dβα).

[F1]

C(D) is the tensor product of the crossing complexes and the arc factors over the shared polynomial ring, with the totalized differential of bidegree (0,0) and Koszul signs; it is an object of K(hmfw), and for a closed braid diagram w=0 (The Khovanov-Rozansky complex and trigraded braid homology).

[F2]

Changing the marks of a tangle 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).

[F3]

Markov move (a) relates the closed braid diagrams of αβ and βα: the two closures are the same diagram, with the closure arcs attached at different points (Markov conjugation and stabilization moves).

Proof

technique · construction of the isomorphism by sliding the closure seam and applying the tensor-permutation and marking-independence isomorphisms
1.1F1F3

The two diagrams differ by a cyclic reordering of the tensor factors. Cutting the closed braid of [F3] at an angular cut away from all crossings unfolds it to a braid word; cutting at the meridian that separates the block α from the block β gives the word αβ, and cutting one block further along the annulus gives βα. Changing that cut is a cyclic reading of the same annular diagram: no crossing is created or destroyed, and the arc and crossing factors of C(D) are the same local data in both diagrams, only read in the cyclic order recorded by the two words. The closures of αβ and βα are therefore the same marked diagram up to the cyclic reordering of the blocks α and β, and both are closed, so the potential vanishes by [F1].

2.1F1F2step 1.1

The reordering is an isomorphism of complexes. A cyclic reordering of the tensor factors of a finite tensor product of complexes is realized by the symmetry and associativity isomorphisms of the monoidal structure, which are isomorphisms of factorizations and intertwine the total differentials: the differential is a sum of local maps, one for each tensor factor, and the permutation isomorphism conjugates each summand to the corresponding summand in the reordered product, the Koszul signs being exactly the ones built into the symmetric monoidal structure. Hence a cyclic permutation of the tensor factors of C(D) induces an isomorphism of complexes over the same polynomial ring, preserving the cohomological and the two bigrading degrees; combinations of such permutations generate every reordering of the blocks, and reassociation of adjacent factors uses the associativity isomorphism. The change of the mark labels along the moved seam is an isomorphism or chain homotopy equivalence by [F2]. Composing these isomorphisms gives a chain homotopy equivalence C(Dαβ)≃C(Dβα), hence the asserted isomorphism in K(hmf0).

3.1F1step 2.1∎

Conclusion. The isomorphism of step 2.1 has bidegree (0,0) and preserves the cohomological degree, so it induces an isomorphism H(Dαβ)≅H(Dβα) of trigraded vector spaces with no shift; since both diagrams are closed, the potential is zero throughout and no shift arises from crossing normalization because the same crossings occur in both words. This is the conjugation invariance used in Markov's theorem, and no step uses the Axiom of Choice.

Depends on

Used by

Dependency tree · two levels

11 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