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.

✓ 12 results · all verified · 2 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 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Matrix Factorizations and Khovanov–Rozansky Link Homology

1 · Prerequisites

2 · Summary

This page develops the matrix-factorization construction of Khovanov–Rozansky link homology. It fixes bigraded matrix factorizations with a potential w of the form a∑ϵixi, assembles the arc and wide-edge local factorizations into the factorization C(Γ) of a marked planar graph, and proves the Koszul row-operation and variable-exclusion lemmas that make those factorizations computable. The two wide-edge morphisms χ0,χ1 define the positive and negative crossing complexes, with the corrected χ1-cone recorded against the arXiv prose misprint, and their tensor product over the crossings and arcs gives the complex C(D) of a braid diagram and its trigraded cohomology H(D). The page then proves that markings are auxiliary, computes the oriented kink shifts {1,1}[1] and none on trigraded cohomology (retaining an additional inner parity reversal for IA at the factorization level), and establishes invariance under the braid-like Reidemeister IIa and III moves and under conjugation, concluding that H(D) is an invariant of the oriented link up to an overall trigrading shift, with the Axiom of Choice used only through Markov's theorem. The final items normalize the Euler characteristic to the HOMFLYPT polynomial and compare the construction with the Hecke–Markov normalization of the companion page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Bigraded matrix factorizations with a potential

Definition

Fix a finite set I, let S=Q[a,xi  :  i∈I] be the polynomial ring of The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution in a variable a and the variables xi, bigraded by

deg⁡a=(2,0),deg⁡xi=(0,2),

and for a bigraded S-module M and (n1,n2)∈Z2 write M{n1,n2} for the internal shift

M{n1,n2}(k,l)=M(k−n1,l−n2)

in the sense of the internal shift of Associative graded algebras, bimodules, and internal shifts (the two-parameter refinement of the one-parameter shift, applied to each bigrading separately).

Fix signs ϵi∈{1,−1} for i∈I and put w=a∑i∈Iϵixi, an element of S of bidegree (2,2). A bigraded matrix factorization with potential w is a pair M=(M0,M1,d) consisting of free bigraded S-modules M0,M1 (of arbitrary, possibly infinite, rank) together with S-linear maps

d ⁣:M0→M1,d ⁣:M1→M0

of bidegree (1,1) such that

d2=w⋅id,

i.e. d2(m)=wm for every m∈M0⊕M1. A morphism f ⁣:M→N is a pair of S-linear maps of bidegree (0,0) on the two components commuting with d; a homotopy between two morphisms is a pair of maps of bidegree (−1,−1) satisfying the usual homotopy formula. Write mfw for the category of factorizations with potential w and their bidegree-preserving morphisms, and hmfw for its homotopy category, in which the morphisms are the bidegree-preserving morphisms modulo null-homotopic ones. Explicitly, f−g=dNh+hdM, where h reverses inner parity. Internal shifts M{u,v} shift both modules and retain their inner parity. Write ΠM for the parity reversal: (ΠM)0=M1, (ΠM)1=M0, with the same differential. It preserves the potential, acts on morphisms by the same component maps, and satisfies Π2M=M. For w=0, the direct sum of the two parity cohomologies of ΠM is the same bigraded vector space as that of M; only their parity labels change.

Caveats. Unless w=0, d does not square to zero, so a factorization is not an ordinary complex. If I=∅ then S=Q[a] and a factorization with w=0 is a 2-periodic complex M0→dM1→dM0 of free bigraded Q[a]-modules; for w≠0 the only failure of the complex axioms is the identity d2=w⋅id. The sign vector (ϵi) and the bigrading are part of the data, and on this page the potential is always a times a linear form with coefficients in {1,−1}. The conventions (two-variable bigrading with deg⁡a=(2,0), deg⁡xi=(0,2); d of bidegree (1,1); homotopies of bidegree (−1,−1); morphisms commuting with d) follow Khovanov-Rozansky, Matrix factorizations and link homology II, section 1, formulas (1)-(2) and the lattice picture of its Figure 3; the ungraded definitions of a duplex and a free-module factorization are Definitions 1-2 in section 2 (printed pp. 13-14) of Khovanov-Rozansky, Matrix factorizations and link homology.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Arc and wide-edge Khovanov-Rozansky factorizations

Definition

In the setting of Bigraded matrix factorizations with a potential, and writing a two-term factorization (p,q) for S→pS{n1,n2}→qS as a Koszul row (the notation fixed for this construction in the sequel to this definition; the shifts n1,n2 are the shifts of the middle term):

(1) Oriented arc. To an oriented arc c oriented from the endpoint labelled x2 to the endpoint labelled x1 assign the two-term factorization Cc:=(a,  x1−x2)=[S→aS{−1,1}→x1−x2S] over S=Q[a,x1,x2], with potential w=a(x1−x2); the differentials are a and x1−x2, the middle term carries the bigrading shift {−1,1}, and both maps have bidegree (1,1). It is an object of hmfw: the square of the differential is (x1−x2)∘a=a(x1−x2)=w⋅id.

(2) Wide edge. To a wide edge t whose four adjacent edge labels are x1,x2 on its outgoing ends and x3,x4 on its incoming ends assign the tensor product, over S=Q[a,x1,x2,x3,x4], of the two Koszul rows (a,  x1+x2−x3−x4)=[S→aS{−1,1}→x1+x2−x3−x4S] and (0,  x1x2−x3x4)=[S→0S{−1,3}→x1x2−x3x4S], with potential w=a(x1+x2−x3−x4). For a two-fold tensor product of rows (a1,b1)⊗(a2,b2) the total differential satisfies d2=(a1b1+a2b2)⋅id with the Koszul sign convention for the totalization, so here d2=a(x1+x2−x3−x4)+0⋅(x1x2−x3x4)=w, and the middle terms are S{−1,1}⊕S{−1,3}. It is an object of hmfw.

Both assignments produce objects of hmfw with the stated potentials. Caveats: the potential of a wide edge is linear in the xi; the quadratic entry x1x2−x3x4 enters only through the row whose first differential is 0; and the shifts {−1,1} and {−1,3} are part of the definition and must be propagated exactly (Khovanov-Rozansky II, section 1, formulas (2)-(4)). Khovanov-Rozansky I, introduction printed pp. 6-8, gives the fixed-n analogue with potentials xin+1 and different row entries and shifts; it is not the source of these parameter-a formulas.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The factorization of a marked MOY graph

Definition

Let Γ be a finite planar graph in a disk whose edges are either oriented arcs between marks (including boundary points) or wide (thick) edges, each wide edge bounded by four oriented edge-ends, as in the Khovanov-Rozansky diagrams. Place finitely many marks, with at least one on every internal edge and every circle of Γ, place any finite number of marks (possibly none) on each boundary edge, and label all marks and boundary points by distinct variables x1,…,xr; the boundary points carry orientations ϵp∈{1,−1}. With Cc and Ct the arc and wide-edge factorizations of Arc and wide-edge Khovanov-Rozansky factorizations, define

C(Γ):=⨂cCc⊗⨂tCt,

the tensor product taken over S=Q[a,x1,…,xr] with all variables shared (the tensor product of the two-term factorizations of the local pieces, with the Koszul sign convention), and view C(Γ) as a factorization over the smaller polynomial ring R=Q[a,xp  :  p a boundary point]: the variables at internal marks are internal and are forgotten. Its potential is

wΓ=a∑pϵpxp.

The sum is over the boundary points: every internal label occurs at exactly two edge-ends with opposite signs, whose contributions +axi and −axi cancel, while a boundary label occurs at exactly one edge-end, and the local potentials of the arc and wide-edge factorizations add to wΓ.

If Γ is closed (no boundary points), then wΓ=0 and C(Γ) is a 2-periodic complex C0(Γ)→dC1(Γ)→dC0(Γ) of bigraded Q[a]-modules, whose cohomology is denoted H(Γ). Each term is a free bigraded Q[a]-module, generally of infinite rank. Contractible summands may be removed without changing its cohomology, but no finite-rank representative over Q[a] is asserted: already a one-mark circle has cohomology Q[x]{−1,1}. For a nonempty closed graph, the row reduction proved below shows that a acts trivially on H(Γ). For the empty graph the empty tensor product is Q[a] in even parity, and a need not act trivially. Caveats: C(Γ) has infinite rank as an R-module whenever internal marks are present; the marks are auxiliary data, and a marking change alters C(Γ) by a chain homotopy equivalence (proved later on this page); the potential vanishes exactly for closed graphs, which is why C(Γ) is a genuine complex in that case.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Koszul row operations and variable exclusion preserve homotopy type

Statement

Work over a polynomial ring R and write (a,b)=⨂i(ai,bi) for the Koszul factorization with rows R→aiR→biR, so that its total differential squares to ∑iaibi. The row operations are first statements about ungraded factorizations. In the bigraded setting of Bigraded matrix factorizations with a potential, require the entries, substitutions and basis changes to be homogeneous of the degrees determined by the row shifts; only such operations give bigrading-preserving maps. Then:

(1) Row operations. For λ∈R the replacement of two rows (ai,bi),(aj,bj) by (ai,bi+λbj),(aj−λai,bj), all other rows unchanged, is an isomorphism of factorizations (it is the change of basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩↦∣00⟩,∣01⟩,∣10⟩+λ∣01⟩,∣11⟩ on the tensor product of the two rows).

(2) Variable exclusion. Let R=R′[y], let w=∑iaibi∈R′ (so y is internal), and suppose one row of (a,b) has the form (0, y−μ) with μ∈R′. Let (a′,b′) be the Koszul factorization over R′ obtained by deleting that row and substituting y↦μ in all other rows, and let (a,b)′ be (a,b) restricted to R′ (an infinite-rank factorization). Then (a,b)′≃(a′,b′) in hmfw(R′): the R′-complex 0→R′[y]→yR′[y]→0 splits into the contractible complexes 0→R′yj→yR′yj+1→0 for j≥0 and the rank-one complex 0→R′→0.

(3) Graph factorizations. For a nonempty planar marked graph Γ with m1 arcs and m2 wide edges the Koszul matrix of C(Γ) has m1+m2 linear rows (a,z) (z linear in the xi) and m2 quadratic rows (0, xixj−xkxl); applying the row operations of (1) with λ=1 against the first linear row turns the first row into (a,∑pϵpxp) over the boundary points and all other linear rows into (0,z); if Γ is closed the first row becomes (a,0) and, after restricting scalars to Q and deleting that row with its odd parity and internal shift retained, the remaining rows are (0,z) for the other linear entries and (0,q) for all the quadratic entries. Their Koszul complex computes H(Γ), with the parity and internal shift contributed by the removed (a,0) row retained and the cyclic grading collapsed to a bigrading, and a acts trivially on H(Γ).

Caveats: (2) is a chain homotopy equivalence, not an isomorphism of factorizations over R; the substitution y↦μ must be applied to every remaining row simultaneously; the collapse in (3) loses the cyclic (homological) grading because the differential has nonzero bidegree. Source: Khovanov-Rozansky II, section 2, printed pp. 12-14, and the cyclic Koszul algebra of Khovanov-Rozansky I, section 2, printed pp. 13-17. Removing a here computes cohomology after restricting scalars; it does not give a free representative of that cohomology in hmf0(Q[a]).

Facts & Assumptions

Given: a polynomial ring R, a Koszul factorization (a,b)=⨂i(ai,bi) with potential w=∑iaibi, and a marked planar graph Γ with its factorization C(Γ).

[F1]

The category mfw has objects (M0,M1,d) with d of bidegree (1,1), d2=w⋅id, and morphisms of bidegree (0,0) commuting with d, and hmfw is its homotopy category, with homotopies of bidegree (−1,−1) (Bigraded matrix factorizations with a potential).

[F2]

C(Γ) is the tensor product over the shared polynomial ring of the arc rows (a,xi−xj) and the wide-edge rows (a,x1+x2−x3−x4) and (0,x1x2−x3x4), has potential wΓ=a∑pϵpxp over the boundary points, and internal labels occur with cancelling signs (The factorization of a marked MOY graph).

Proof

technique · direct; a change of basis, two explicit sequences of elementary row transformations, and the standard-form computation of the graph matrix
1.1F1algebra

Row operations. Model the Koszul factorization on the exterior algebra of a free module with basis ei, with differential d=∑iai(ei∧−)+∑ibiιi, where ιi is contraction by the dual basis. The exterior and contraction operators anticommute for distinct indices and satisfy ιi(ei∧−)+(ei∧−)ιi=1, giving d2=∑iaibi. The basis change ei↦ei+λej, ej↦ej induces an invertible exterior-algebra map. Expressing d in that basis gives exactly (ai,bi+λbj),(aj−λai,bj). This intertwines the differentials; in the graded case it preserves the grading precisely under the degree compatibility stated above.

1.2F1algebra

Polynomial remainders. Replace y by y+μ to reduce (0,y−μ) to (0,y). For every other row write ai=ai′+yAi and bi=bi′+yBi, where ai′,bi′∈R′ are the values at y=0 and Ai,Bi∈R′[y] are polynomial quotients; no linearity in y is assumed. Since the excluded row has product zero and w∈R′, subtraction of the value at zero yields y∑i(Aibi′+ai′Bi+yAiBi)=0. Multiplication by y is injective in R′[y], so ∑i(Aibi′+ai′Bi+yAiBi)=0.

2.1step 1.1step 1.2algebra

Exclusion of the row. Pair (ai,bi) with the distinguished row using step 1.1 with parameter −Bi. After doing this for every i, the rows become (ai,bi′) and (∑iaiBi,y). Swap the entries of the distinguished row, with the corresponding parity shift, and use the dual row operation (ai,bi′),(y,A)↦(ai−Aiy,bi′),(y,A+Aibi′). This dual operation is another exterior-basis change (or the previous operation after exchanging wedge and contraction), and preserves the product. The ordinary rows now equal (ai′,bi′), while the distinguished row equals (y,∑i(aiBi+Aibi′))=(y,0) by step 1.2. Undoing its entry swap cancels the parity shift and leaves (0,y). Thus the original factorization is isomorphic to (a′,b′)⊗(0,y) over R′[y].

2.2F2step 1.1

Standard form of graph factorizations. By [F2] the matrix of C(Γ) has the m1+m2 linear rows (a,z) contributed by the arcs and the first row of each wide edge, and the m2 quadratic rows (0,q) contributed by the second row of each wide edge; permute rows so the linear rows come first. Applying the operation of clause (1) to the first row and each further linear row p with λ=1 replaces the pair (a,z1),(a,zp) by (a,z1+zp),(0,zp), so afterwards the first row is (a,∑linear rowsz) and every other linear row is (0,z) with its original z. The internal labels occur twice with opposite signs and cancel in the sum, while each boundary label occurs once, so the first row is (a,∑pϵpxp); the quadratic rows are untouched.

3.1F1step 2.1

The splitting. Over R′ the row (0,y) presents the complex 0→R′[y]→yR′[y]→0, which is the direct sum of the two-term complexes 0→R′yj→yR′yj+1→0 for j≥0 and the rank-one complex 0→R′→0; for j≥0 the map y ⁣:R′yj→R′yj+1 is an isomorphism, so those summands are contractible and contribute nothing to the homotopy type. In a tensor product with (a′,b′) the contractible summands remain contractible, hence (a,b)′≃(a′,b′)⊗R′≃(a′,b′) in hmfw(R′), which proves clause (2); the equivalence forgets the variable y and is not an isomorphism of R-factorizations because C(Γ) has infinite rank over R′.

4.1F1F2step 2.2step 3.1algebra∎

Closed graphs. If Γ is closed, step 2.2 makes the first row (a,0) and every other row has first entry zero. The latter rows include both the remaining linear entries and every quadratic entry; write their tensor product as K. The first row is Q[a]→aQ[a]{−1,1}→0Q[a]. Its cohomology is the odd-parity copy of Q{−1,1}. More explicitly, as a complex over Q it is the direct sum of contractible pairs Qaj→aQaj+1{−1,1} and the remaining constant in odd parity. Since K has no a in its entries, tensoring this splitting with K leaves its specialization at a=0, with the first row's shift and odd parity retained. This is exactly the Koszul complex on all remaining linear and quadratic entries, with its cyclic grading folded into parity; multiplication by a is zero on the resulting cohomology.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The wide-edge morphisms chi-zero and chi-one

Definition

Let Γ0 be the diagram of two disjoint oriented arcs with labels x1,x4 and x2,x3 and Γ1 the diagram of one wide edge with the same four labels, over R=Q[a,x1,x2,x3,x4], and write C(Γi)=C0(Γi)→Pi/QiC1(Γi)→Pi/QiC0(Γi) in the standard product bases of Khovanov-Rozansky II: P0=(ax3−x2ax1−x4),P1=(x1−x4x2−x3−aa), Q0=(ax3x4−x1x20x1+x2−x3−x4),Q1=(x1+x2−x3−x4x1x2−x3x40a), with the term shifts 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}.

Define χ0 ⁣:C(Γ0)→C(Γ1) by the matrices U00=(x4−x2001),U01=(x4−x2−11), and χ1 ⁣:C(Γ1)→C(Γ0) by U10=(100x4−x2),U11=(1x21x4).

Then χ0 is a morphism of factorizations of bidegree (0,2) and χ1 is a morphism of bidegree (0,0); and in the equivalent Koszul forms (8), (9) of the source, obtained by the row operations [12]1 on C(Γ0) and [21]−x2 on C(Γ1), they become the flip morphisms χ0=Id⊗ψ′(x4−x2) and χ1=Id⊗ψ(x4−x2), where ψ(y) is the morphism (0,yz)→(0,z) and ψ′(y) its opposite. Consequently the composites χ1χ0 ⁣:C(Γ0)→C(Γ0) and χ0χ1 ⁣:C(Γ1)→C(Γ1) are nonzero endomorphisms of bidegree (0,2), and on the Koszul standard forms they act as multiplication by the element x4−x2∈R.

Caveats: the maps are not inverse to each other; all signs and shifts are fixed by the printed matrices (Khovanov-Rozansky II, formulas (5)-(6); the published version writes the same two maps with half-integer cohomological degrees in formulas (12)-(13)); the bases are homogeneous for the bigrading.

Facts & Assumptions

Given: the ring R=Q[a,x1,x2,x3,x4], the two diagrams Γ0,Γ1, their factorizations with the displayed matrices and shifts, and the four morphism matrices U00,U01,U10,U11.

[F1]

C(Γ0) is the tensor product of the arc rows (a,x1−x4) and (a,x2−x3) and C(Γ1) is the tensor product of the rows (a,x1+x2−x3−x4) and (0,x1x2−x3x4); the differential squares to w=a(x1+x2−x3−x4) in both cases, and each term carries the displayed bigrading shift (The factorization of a marked MOY graph).

[F2]

The elementary row operation [ij]λ replaces (ai,bi),(aj,bj) by (ai,bi+λbj),(aj−λai,bj), is an isomorphism of factorizations, and Koszul factorizations are written (a,b)=⨂i(ai,bi) with total differential of square ∑iaibi (Koszul row operations and variable exclusion preserve homotopy type).

Proof

technique · direct matrix computation in the displayed bases, followed by the two row operations of the source and the flip-morphism check
1.1F1algebra

The map χ0 commutes with the differentials. Multiplying the displayed matrices over the commutative ring R gives Q0U00=(a(x4−x2)x3x4−x1x20x1+x2−x3−x4)=U01P0 and Q1U01=((x4−x2)(x1−x4)(x4−x2)(x2−x3)−aa)=U00P1, as is checked entry by entry using xixj=xjxi; hence χ0 intertwines the two differentials and is a morphism of factorizations.

1.2F1algebra

The map χ1 commutes with the differentials. Likewise P0U10=(a(x3−x2)(x4−x2)a(x1−x4)(x4−x2))=U11Q0 and P1U11=(x1+x2−x3−x4x1x2−x3x40a(x4−x2))=U10Q1, so χ1 is a morphism of factorizations.

1.3F1algebra

Bidegrees. Every entry of the four matrices is homogeneous, and an entry of bidegree (p,q) in the i-th row and j-th column represents the map from the j-th summand of the source to the i-th summand of the target of total bidegree (p,q)+(target shift−source shift). Reading the shift tables: in U00 the scalar x4−x2 has bidegree (0,2) and maps the unshifted summand R to the unshifted summand R, while 1 has bidegree (0,0) and maps R{−2,2} to R{−2,4}, whose shift difference is (0,2); in U01 the entries x4,−x2 have bidegree (0,2) and the entries −1,1 map between the summands R{−1,1}, R{−1,3} whose shift difference is (0,2). So χ0 has bidegree (0,2). For χ1 the entries of U10 are 1 and x4−x2, which map the summands R, R{−2,4} to R, R{−2,2} with shift difference (0,−2) in the second column, compensated by the coefficient of bidegree (0,2), and U11 maps R{−1,1},R{−1,3} to R{−1,1} with the entries 1,x2,1,x4 contributing the compensating bidegrees; so χ1 has bidegree (0,0).

2.1F1F2step 1.1step 1.2algebra

The Koszul forms. By [F1] and [F2] the matrix of C(Γ0) has rows (a,x1−x4) and (a,x2−x3); the operation [12]1 replaces them by (a,x1+x2−x3−x4) and (0,x2−x3). The matrix of C(Γ1) has rows (a,z) and (0,q) with z=x1+x2−x3−x4 and q=x1x2−x3x4; the operation [21]−x2 on the ordered pair (0,q),(a,z) replaces them by (0,q−x2z) and (a,z). Expanding q−x2z=x1x2−x3x4−x2(x1+x2−x3−x4)=(x2−x3)(x4−x2) shows that the two standard forms are C(Γ0)≅(a,x1+x2−x3−x4)⊗(0,x2−x3),C(Γ1)≅(a,x1+x2−x3−x4)⊗(0,(x2−x3)(x4−x2)), with the same first row and with the second factors related by multiplication by x4−x2.

3.1F1step 1.1step 1.2step 2.1algebra∎

The flip morphisms and the composites. Put y=x4−x2 and let ψ(y) ⁣:(0,yz)→(0,z) be the morphism whose first-term component is the identity and whose middle component is multiplication by y; it commutes with the differentials because y⋅0=0⋅1 and 1⋅yz=z⋅y. Let ψ′(y) ⁣:(0,z)→(0,yz) be the morphism whose first-term component is multiplication by y and whose middle component is the identity; then 1⋅0=0⋅y and y⋅z=yz⋅1. Multiplying the matrices of the change of basis in step 2.1 against the standard product bases identifies the conjugates of χ0 and χ1 with Id⊗ψ′(y) and Id⊗ψ(y) respectively, as in Lemma 2 of the source. The composites satisfy ψ(y)ψ′(y)=y⋅id and ψ′(y)ψ(y)=y⋅id on both components, hence χ1χ0=Id⊗(y⋅id) and χ0χ1=Id⊗(y⋅id) on the Koszul standard forms. They are nonzero even modulo homotopy: specialize a=0, x1=x4, x3=x2. Both factorization differentials then vanish, while y=x4−x2 remains nonzero in Q[x2,x4]. A null-homotopy would specialize to y id=dH+Hd=0, a contradiction. Thus both composites are nonzero endomorphisms of bidegree (0,2) and act as multiplication by x4−x2∈R; in particular they are not the identity and the two maps are not inverse to each other.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The positive and negative Khovanov-Rozansky crossing complexes

Definition

With χ0 ⁣:C(Γ0)→C(Γ1) and χ1 ⁣:C(Γ1)→C(Γ0) as in The wide-edge morphisms chi-zero and chi-one, assign to a crossing p of a tangle diagram the following two-term complex of matrix factorizations, using the integer grading of arXiv:math/0505056v2, Figure 6.

Positive crossing. Cp=[0→C(Γ0){0,2}→χ0C(Γ1)→0], with C(Γ1) in cohomological degree 0 (so C(Γ0){0,2} sits in degree −1); the shift {0,2} makes the differential bidegree-preserving.

Negative crossing. Cp=[0→C(Γ1){0,−2}→χ1C(Γ0){0,−2}→0], with C(Γ1){0,−2} in cohomological degree 0 and C(Γ0){0,−2} in degree 1; the overall shift {0,−2} is the normalization required by the Reidemeister IIa move.

In both cases the differential is χ0 or χ1 and has bidegree (0,0) as a map of the shifted terms.

Recorded source conflict and regrading. The arXiv prose before Figure 6 incorrectly displays the negative crossing with χ0 in the opposite direction. Its Figure 6, the bidegrees of the matrices (5)-(6), and the negative-crossing Euler relation in section 7 agree with the χ1-cone above. The published version of record corrects the direction but also changes the grading: writing Cp,v2+ and Cp,v2− for the two complexes above, formulas (12)-(13) on printed p. 1393 give Cp,pub+=Cp,v2+{−12,−12}[−12],Cp,pub−=Cp,v2−{12,12}[12]. Here C[n]j=Cj+n; the displayed identifications specify term degrees and maps, with the usual compatible shift signs. Both published cones have outer degrees −12,12. Their respective term shifts are {−12,32},{−12,−12} for the positive cone and {12,−32} on both terms of the negative cone.

Caveat: no absolute normalization is claimed; the {0,−2} shift is fixed only by the source's IIa normalization.

Facts & Assumptions

Given: the four diagrams Γ0,Γ1 of a positive and a negative crossing, the morphisms χ0,χ1 with their matrix presentations, bidegrees and shifts, and the two displayed two-term complexes.

[F1]

χ0 ⁣:C(Γ0)→C(Γ1) is a morphism of factorizations of bidegree (0,2) and χ1 ⁣:C(Γ1)→C(Γ0) is a morphism of bidegree (0,0), all with respect to the displayed term shifts 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} (The wide-edge morphisms chi-zero and chi-one).

Proof

technique · direct verification of the complex and bidegree axioms, followed by the Euler-characteristic comparison that settles the recorded source conflict
1.1F1algebra

The positive complex is a complex of factorizations. In a two-term complex the composite of its two differentials is zero on one side because there is nothing to compose on the other, so the complex condition in hmfw is automatic; the term C(Γ0){0,2} lies in cohomological degree −1 and C(Γ1) in degree 0, and both terms are objects of hmfw with potential w=a(x1+x2−x3−x4) because the source and target of χ0 have that potential. The differential χ0 has bidegree (0,2) by [F1], and the shift {0,2} on its source subtracts (0,2) from the bidegree of the map of shifted terms, so the differential of Cp has bidegree (0,0) as required.

1.2F1algebra

The negative complex is a complex of factorizations. Likewise the two-term complex 0→C(Γ1){0,−2}→χ1C(Γ0){0,−2}→0 has zero composite on the one composable side, its terms are objects of hmfw, and χ1 has bidegree (0,0) by [F1]; the overall shift {0,−2} is applied to both terms, so it shifts the grading of both terms alike and leaves the differential bidegree-preserving. With C(Γ1){0,−2} in degree 0 and C(Γ0){0,−2} in degree 1, the two terms are exactly the cone of χ1.

2.1F1step 1.1step 1.2algebra∎

The source conflict and the grading comparison. In the integer grading, the negative cone has Euler characteristic q−2(⟨Dei⟩−⟨D⟩), as in arXiv section 7, whereas reversing its two terms changes the sign; moreover the printed χ0 with equal shifts would still have bidegree (0,2) by [F1]. Thus that prose display is incompatible with both the bidegree condition and Figure 6. For the published positive cone, shifting the outer degrees −1,0 by [−12] gives −12,12, and adding (−12,−12) to the internal shifts gives (−12,32) and (−12,−12), exactly formula (12). For the negative cone, [12] moves degrees 0,1 to −12,12, and adding (12,12) to both internal shifts (0,−2) gives (12,−32), exactly formula (13). The maps remain χ0,χ1, up to compatible shift signs; agreement with the published cones therefore requires the recorded regrading.

DefinitionDefinition: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The Khovanov-Rozansky complex and trigraded braid homology

Definition

Let D be a finite marked oriented tangle diagram, with at least one mark on every internal edge and every circle, and any finite number of marks (possibly none) on boundary edges. Label all marks and boundary points by variables x1,…,xm. For the braid-homology construction specialize to a braid diagram, a generic projection of the closure of a clockwise-oriented braid (The braid group by Artin presentation, The closure of a geometric braid); crossings are resolved as in The positive and negative Khovanov-Rozansky crossing complexes.

Define C(D):=⨂p crossingCp⊗⨂c arcCc, the tensor product over the polynomial ring generated by a and all labels, then restricted to the ring generated by a and the boundary labels as in The factorization of a marked MOY graph, viewed as a complex of objects of hmfw with w=a∑pϵpxp over the boundary points; for a closed braid diagram w=0. For a nonempty closed braid diagram D, let CHj(D) be the direct sum of the two inner parity cohomologies of Cj(D), with their parity labels forgotten. It is a bigraded Q-vector space on which a acts trivially; the differential ∂ of C(D) induces a differential on CH(D), and the cohomology H(D)=⨁j,k,lHk,lj(D) of the resulting complex is a triply graded Q-vector space (cohomological degree j, first bigrading k and second bigrading l). Its Euler characteristic is ⟨D⟩:=∑j,k,l(−1)jtkqldim⁡QHk,lj(D).

For the zero-strand empty diagram all tensor products are empty: C(∅)=Q[a] in outer degree 0 and even parity, with zero differential. Its cohomology is Q[a], on which a acts by multiplication, not trivially. Since deg⁡a=(2,0), its raw integer-graded Euler series is ⟨∅⟩=(1−t2)−1. This tensor-unit boundary case is distinct from the nonempty-link normalization proved later.

Caveats: the link-invariance results below use braid diagrams only (the oriented IIb move is not used); the marking data are auxiliary, but independence of the marking is proved later on this page; no independence of the diagram is asserted here; the trigrading is kept separate throughout, and t records the first bigrading while q records the second, in the source's convention.

Facts & Assumptions

Given: a marked braid diagram D with its crossings, arcs and labels, the local factorizations Cc and the crossing complexes Cp, and the tensor product C(D) over the shared polynomial ring.

[F1]

Each crossing complex is a two-term complex of matrix factorizations with potential w=a(x1+x2−x3−x4), the differential χ0 or χ1 having bidegree (0,0) on the shifted terms (The positive and negative Khovanov-Rozansky crossing complexes).

[F2]

Each local factorization is an object of hmfw whose differential squares to its own potential: a(x1−x2) for an arc with endpoint labels x1,x2, a(x1+x2−x3−x4) for a wide edge, and the potential of a marked graph is a∑pϵpxp over its boundary points, vanishing for closed graphs; the empty graph tensor unit is Q[a] with zero differential (The factorization of a marked MOY graph).

[F3]

For a nonempty closed graph, row reduction extracts a row (a,0). After restricting scalars to Q, its polynomial splitting reduces cohomology to the remaining Koszul complex at a=0, retaining its odd parity and internal shift; a acts trivially on that cohomology (Koszul row operations and variable exclusion preserve homotopy type).

Proof

technique · direct assembly of the tensor product and termwise reduction to the Koszul standard form
1.1F1F2algebra

The tensor product is a complex with the stated potential. The differential of C(D) is the sum, with the Koszul signs of the totalization, of the differentials of the factors Cp and Cc. Each Cp is a two-term complex by [F1] and each Cc is a single factorization by [F2], so the totalized differential satisfies ∂2=0 strictly, and C(D) is an object of K(hmfw). The square of the internal differential of a tensor product accumulates the individual potentials, so that of C(D) is a∑pϵpxp over the boundary points: every internal label occurs in exactly two local factors with opposite signs and cancels, exactly as for a marked graph in [F2]. For a closed braid diagram there are no boundary points and the potential is w=0, so C(D) is a genuine complex of bigraded Q[a]-modules.

1.2F2F3algebra

Termwise cohomology and trivial a-action. Every resolution of the nonempty closed braid is a nonempty closed marked graph with at least one linear row: a crossingless circle has a mark and hence an arc factor, while each resolved crossing contributes arc or wide-edge factors. The row reduction of [F3] turns its first linear row into (a,0) and leaves all other linear and quadratic rows with first entry zero. The explicit polynomial splitting of that first row over Q reduces its cohomology to the specialization a=0 of the remaining Koszul complex, with the first row's parity and internal shift retained. Thus a acts trivially on every CHj(D) and these are bigraded Q-vector spaces. This reduction does not imply finite rank over Q[a]; the one-mark circle already leaves the polynomial variable x. Each resolution nevertheless has finite-dimensional pieces in each bigrading, since it uses finitely many polynomial variables of positive degrees and finitely many shifted Koszul terms.

2.1F2step 1.1algebra

The empty boundary case. For the zero-strand diagram there are no crossings or arc factors. The empty tensor is the graph tensor unit Q[a] of [F2], in degree 0 with zero differential. Thus CH0=H0=Q[a] and all other outer degrees vanish. Its homogeneous monomials ad have bigrading (2d,0), so each fixed bidegree is finite and the raw Euler series is ∑d≥0t2d=(1−t2)−1. Multiplication by a is nonzero, as asserted separately.

3.1F1F3step 1.1step 1.2step 2.1∎

The induced differential and the trigraded cohomology. The differential ∂ of C(D) is a sum of morphisms χ0,χ1 of bidegree (0,0) between factorizations, so it commutes with the internal differentials of the terms, hence maps cycles to cycles and boundaries to boundaries in each term and induces a map ∂ ⁣:CHj(D)→CHj+1(D). Since ∂2=0 on C(D) by step 1.1, the induced maps satisfy ∂2=0 on CH(D), and since they preserve the bigrading, the cohomology H(D)=⨁j,k,lHk,lj(D) is triply graded with j the cohomological degree and k,l the two bigrading degrees; the Euler characteristic ⟨D⟩=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) is therefore defined. This is the integer-graded construction of Khovanov-Rozansky II, section 1; invariance is established by later items.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Oriented kink shifts for braid diagrams

Statement

Let D1,D2 be the two diagrams of the type IA oriented Reidemeister I move of Khovanov-Rozansky II, Figure 12 (the two braid-oriented curl diagrams, with the orientations displayed there and potential w=a(x1−x4)), and let E1,E2 be the two diagrams of the type IB oriented Reidemeister I move of Figure 14. Then, in K(hmfw):

C(D1)≅ΠC(D2){1,1}[1]

for the type IA pair, where Π reverses inner factorization parity, {1,1} is the bigrading shift and [1] the cohomological shift; and

C(E1)≅C(E2)

with no shift for the type IB pair. Equivalently, for IA one computes C(D2){0,2}≅ΠC(Γ){−1,1}[−1] with Γ the straight-strand factorization, so that ΠC(D2){1,1}[1]≅C(D1). All three gradings are accounted for, and the two conclusions are not interchangeable.

Caveat: the labels IA and IB refer to the source's two oriented pictures; the asymmetry of the shifts is a convention of the source, and a reader must reproduce the pictures rather than relabel them "positive" and "negative". Internal shifts on this page retain parity, so Π cannot be absorbed into {1,1}. After taking termwise cohomology and forgetting its parity label, the IA relation has the source's trigrading shift {1,1}[1]. The source's published convention suppresses this separate parity (printed p. 1391). The two moves realize the corresponding oriented stabilizations of braid closures (Markov conjugation and stabilization moves).

Facts & Assumptions

Given: the four diagrams D1,D2 (type IA) and E1,E2 (type IB) with their marked resolutions, the complex C(⋅) of The Khovanov-Rozansky complex and trigraded braid homology, and the Koszul forms (8), (9) of C(Γ0), C(Γ1) with the flip morphism χ1=Id⊗ψ(x4−x2).

[F1]

C(D) is the tensor product of the crossing complexes Cp and the arc factors Cc over the shared polynomial ring; its differential has bidegree (0,0) between the shifted terms, and the complex is an object of K(hmfw) (The Khovanov-Rozansky complex and trigraded braid homology).

[F2]

Elementary row operations are isomorphisms of factorizations; a row (0,y−μ) with y internal may be deleted and y substituted by μ everywhere else, producing a chain homotopy equivalent factorization over the smaller ring (Koszul row operations and variable exclusion preserve homotopy type).

[F3]

In the Koszul forms (8), (9) the matrices of C(Γ0) and C(Γ1) are related by the row operations [12]1 and [21]−x2, and the morphism χ1 becomes Id⊗ψ(x4−x2), whose first-term component is the identity and whose middle component is multiplication by x4−x2 (The wide-edge morphisms chi-zero and chi-one, Koszul row operations and variable exclusion preserve homotopy type).

Proof

technique · direct computation in Koszul form, splitting off a contractible summand and excluding one internal variable
1.1F1F3algebra

The complex of the type IA curl. By [F1] and [F3], setting x3=x2 in the Koszul forms (8), (9) presents C(D2){0,2} as the two-term complex whose two terms are the factorization X⊗(0,0) with X=(a,x1−x4), and whose differential is the morphism Id⊗ψ(x4−x2) of [F3]. Indeed both rows of the two matrices become (a,x1−x4) and (0,0), and the flip morphism ψ(x4−x2) has components the identity on the first term and multiplication by x4−x2 on the middle term, where the shift R{−1,3}→R{−1,1} makes the total bidegree (0,0); the potential of the curl diagrams is w=a(x1−x4) and x2 is the label of the internal mark.

2.1F1step 1.1

Splitting off the first row. The differential is the identity on the X factor; in the two-term complex with terms X⊗(0,0) and differential Id⊗ψ(x4−x2), the summand on which ψ acts by the identity splits off as the contractible complex 0→X→1X→0. What remains is the tensor product of X with the two-term complex 0→R{−1,3}→x4−x2R{−1,1}→0, with the surviving row in odd inner parity, exactly the splitting displayed in section 4 of the source. Tensoring X with this odd scalar row yields ΠX with the indicated internal shifts, not the even scalar tensor unit.

2.2F1F2F3step 1.1algebra

The type IB computation. Relabeling its external ends to have potential a(x1−x4), the positive curl has the same specialization x3=x2 in the two Koszul forms, but uses IdX⊗ψ′(x4−x2) with the positive source shift {0,2}. The odd components have the identical shift {−1,3} and the map between them is the identity, so that pair is contractible. The even components leave 0→R{0,2}→x4−x2R→0, in cohomological degrees −1,0. Polynomial division gives R=R′⊕(x4−x2)R as an R′-module; multiplication by x4−x2 is an isomorphism from the source to the second summand of the target and is homogeneous with the given shifts. Canceling that pair leaves only R′ in degree 0 with zero shift. Tensoring with X therefore leaves exactly the straight-strand factorization, so C(E1)≅C(E2) with no shift.

3.1F1F2step 2.1algebra

Excluding the internal variable. The variable x2 is internal with w=a(x1−x4)∈R′=Q[a,x1,x4] and the surviving row is (0,x4−x2)=−(0,x2−x4); by [F2], with y=x2 and μ=x4, the polynomial-subspace map Ro(x4−x2)R is invertible over R′ and its two-term subcomplex splits off contractibly and the remaining factorization descends to R′ with x2↦x4. The two-term complex 0→R{−1,3}→x4−x2R{−1,1}→0 therefore reduces to the odd-parity shifted copy R′{−1,1}[−1] of the scalar complex, and C(D2){0,2}≅ΠX{−1,1}[−1]=ΠC(Γ){−1,1}[−1] with Γ the straight-strand diagram. Since Γ is D1 with the same labels and the same potential, rearranging the shifts and using Π2=1 gives C(D1)≅ΠC(D2){1,1}[1], which is the type IA conclusion.

4.1step 3.1step 2.2∎

Conclusion. Steps 1.1-3.1 establish C(D1)≅ΠC(D2){1,1}[1] for the type IA pair, with inner parity retained separately from the three gradings; after forgetting inner parity on termwise cohomology the shift is {1,1}[1]; step 2.2 establishes C(E1)≅C(E2) with no shift for the type IB pair. The two shift conventions differ, so the two conclusions cannot be interchanged, and the caveat records that the labels IA and IB refer to the source's printed oriented pictures.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Invariance under the braid-like Reidemeister III move

Statement

Let D1,D2 be the two diagrams of the braid-like Reidemeister III move with orientations pointing in the same direction (Khovanov-Rozansky II, Figure 18), with the ground ring R=Q[a,x1,…,x6] and potential w=a(x1+x2+x3−x4−x5−x6). Then C(D1)≅C(D2) in K(hmfw), with no grading shift.

Caveat: only the type III move with coherent orientations is claimed, as in the source; no other orientation pattern of the III move is considered.

Facts & Assumptions

Given: the two coherently oriented three-crossing diagrams of the Statement, their marked resolution cubes, the boundary coefficient ring U=Q[a,x1,…,x6], and the common potential w.

[F1]

The diagram complex is the cube totalization of the local crossing cones; its maps have bidegree (0,0) after the source shifts, and its internal differential has square w (The Khovanov-Rozansky complex and trigraded braid homology, The positive and negative Khovanov-Rozansky crossing complexes).

[F2]

Homogeneous Koszul row operations are isomorphisms, and an internal linear row (0,y−μ) can be removed by polynomial division with y=μ substituted in all other rows (Koszul row operations and variable exclusion preserve homotopy type).

[F3]

In the two-row normal form the crossing maps are Id⊗ψ′(x4−x2) and Id⊗ψ(x4−x2); their components on the second row are (x4−x2,1) and (1,x4−x2), respectively (The wide-edge morphisms chi-zero and chi-one).

[F4]

In type A2, R′=Q[x1,x2,x3] has the place-permutation action, si exchanges xi,xi+1, and the coordinate root βi=xi−xi+1 and balanced root αi=σiβi, σi=(−1)i−1, define the same reflection and invariant ring. The Soergel bimodule is Bi=R′⊗R′siR′(1); its two outer actions are balanced over R′si (The standard type-A reflection realization and its polynomial ring, The Soergel bimodule Bi of a simple reflection).

[F5]

The Rouquier generators are Fi=[Bi→miR′(1)] in degrees 0,1 with multiplication differential, and Fi−1=[R′(−1)→ηiBi] in degrees −1,0, where ηi(1)=αi⊗1+1⊗αi (The positive and negative Rouquier generator complexes).

[F6]

The positive Rouquier triples satisfy Fi⊗Fi+1⊗Fi≃Fi+1⊗Fi⊗Fi+1 without grading shift. The inverse lemma gives two-sided homotopy inverses, so tensor-inverting this equivalence gives the corresponding no-shift relation for inverse triples (Rouquier complexes satisfy the three-term braid relation, Opposite Rouquier generator complexes are homotopy inverse).

Proof

technique · extract the common curved total-sum row, compare the remaining free Koszul resolutions functorially, and lift the explicit Rouquier survivor homotopies. All comparison homotopies are specified below
1.1F2F1F4algebra

A common curved row and invariant-average split. Put A=Q[y1,y2], with y1=x1−x2 and y2=x2−x3, and at the jth marked three-strand level put tj=(xj,1+xj,2+xj,3)/3. The coordinate change is invertible over Q, with xj,1=tj+(2yj,1+yj,2)/3, xj,2=tj+(−yj,1+yj,2)/3, and xj,3=tj−(yj,1+2yj,2)/3; hence R′=A[tj]. Both simple reflections fix tj and act on A, so R′si=Asi[tj]. Thus the full uncurved type-A Soergel bimodule splits as (A⊗AsiA)(1)⊗QQ[tj], with the common invariant tj acting equally on both outer sides. In the curved KR diagram the endpoint averages are instead retained as separate variables in the common factor X below; only the reduced difference coordinates enter the coefficient bimodules. This is the invariant-average split used here, and it does not identify the two endpoint averages t0,t3. The six boundary variables therefore give U≅S[a,t0,t3], where S=AL⊗QAR, and w=3a(t0−t3). At layer j the total-sum row is (a,3(tj−1−tj)). A homogeneous Koszul row operation on the three such rows extracts the single row X=(a,3(t0−t3)) and leaves first-entry-zero rows for the internal averages t1,t2; remove those rows by [F2], substituting their linear relations. The remaining coordinates are the two differences at each layer. Removing redundant straight-arc marks by [F2] leaves every resolution in the form X⊗Kϵ, where Kϵ is the parity folding of the ordinary Koszul complex of its remaining layer relations over S. Thus dX2=3a(t0−t3)=w, and the common curved factor is the same on both sides.

1.2F1F2F3algebra

Explicit local map homotopies. In a two-strand layer put z=x1+x2−x3−x4, yL=x4−x3, yR=x1−x2, u=(yL−yR)/2 and v=(yL+yR)/2. Then x2−x3=u+z/2 and x4−x2=v−z/2. In the common first row X0=(a,z), replace the second exterior generator by e1−e0/2 for the arc resolution, and by e1+(−(v−u)/2+z/4)e0 for the wide resolution. These are the row operations making the second entries u and uv. In the resulting exterior bases, χ0 sends 1↦v−z/2, e0↦(v−z/2)e0, e1↦e1−ue0/2, e0∧e1↦e0∧e1. Its difference from IdX0⊗ψ′(v) is dH0+H0d, where H0(1)=−e0/2 and H0 is zero on the other three basis elements. Similarly, χ1 sends 1↦1, e0↦e0, e1↦(v−z/2)e1+ue0/2, e0∧e1↦(v−z/2)e0∧e1. Its difference from IdX0⊗ψ(v) is dH1+H1d, where H1(e1)=−e0∧e1/2 and H1 is zero on the other basis elements. Substitution in d=a(e0∧−)+zι0+uι1 or its target version with uvι1 verifies all four equations; for example the differences on e1 are −ue0/2 for χ0 and −ze1/2+ue0/2 for χ1. After the crossing shifts, both homotopies have bidegree (−1,−1).

2.1F4F2step 1.1algebra

Ordered regular layer resolutions. At each level write the reduced incoming and outgoing coordinates as (y1,y2) and (y1′,y2′), after separating the average. An identity resolution has the two straight-strand difference relations y1′−y1=0 and y2′−y2=0; ordered by y1′,y2′, they are monic linears in fresh output variables. For a wide edge at simple root ρ=yi, let ζ be the adjacent invariant coordinate (ζ=yi+1+yi/2 for i=1, or ζ=yi−1+yi/2 for i=2), and let ρ′ and ζ′ denote the outgoing root and invariant coordinate. The straight-strand difference after subtracting the average change is exactly −23(ζ′−ζ), so its vanishing is the linear invariant-coordinate relation ζ′−ζ=0. The wide-edge relation is Q=(ρ′)2−ρ2=0. Order these as ζ′−ζ,Q: the first is monic linear in the fresh invariant coordinate, and the second is monic quadratic in the fresh root coordinate. The invariant ring is Asi=Q[ζ,ρ2], so this quotient is precisely A⊗AsiA and has basis 1,ρ′. Each later layer introduces fresh outgoing difference coordinates; concatenate the identity or wide-edge lists in layer order. Modulo earlier rows every new monic relation is a non-zero-divisor: the highest fresh-variable coefficient of its product with a nonzero polynomial cannot vanish. Thus the residual sequence is regular. Its Koszul exactness follows by induction on the rows. Adjoining a row f gives the cone of multiplication by f on the previous Koszul complex; writing a cycle as a pair and subtracting lifts of boundaries gives zero homology above degree one, degree-one homology ker⁡(f:M→M), and degree-zero homology M/fM, where M is the preceding quotient. Injectivity of f kills the kernel, proving the induction. Polynomial division gives one basis element at an identity layer and 1,ρ′ at a wide edge; adjoining the shift (1) gives the Soergel bimodule of [F4]. This proves the quotient description with both boundary difference actions retained and the exactness of Kϵ→Mϵ as an augmented free S-resolution: its terms are free over S on the internal-variable monomials times the exterior bases. The endpoint averages stay in X and are not quotiented here. A wedge for a degree-d relation has usual internal degree d; regrading Koszul degree p and usual degree d to (−p,d−p) gives the KR row shifts (−1,1) for linears and (−1,3) for quadratics.

3.1F5F1F3F4step 1.1step 2.1step 1.2algebra

The coefficient maps and the full-strand row. The extra straight strand is an identity tensor factor in the local calculation. Combining its linear row with the pair-sum row into the total-average row uses the same basis change on both resolutions and preserves the remaining row operations; consequently each crossing edge in step 1.1 is IdX times the comparison map of the regular quotients in step 2.1. Write Bˉi=A⊗AsiA for the unshifted KR wide-edge bimodule and βi=xi−xi+1. On the degree-zero quotient modules, step 1.2 sends 1 to v=(βiL+βiR)/2; the KR positive map rbi of [F5] sends 1 to βiL+βiR=2v. Thus the comparison from the original χ0 edge to the KR positive edge contributes the rational unit 2 (equivalently, scale the wide-resolution vertex by 2). The KR negative map is multiplication Bˉi→A. The type-A Rouquier bimodule is Bi=Bˉi(1), so after the library shift convention the positive KR complex is Fi−1{1} and the negative KR complex is Fi{−1}: the former has terms A{2}→Bˉi in degrees −1,0, and the latter has Bˉi{−2}→A{−2} in degrees 0,1. The multiplication differential is unchanged. For the positive differential, ηi(1)=αiL+αiR=σi(βiL+βiR), so it differs from the KR map by the unit σi; relative to the original local map of step 1.2, the positive Rouquier differential is 2σi times that map. On the three-crossing cube, rescale each resolution vertex by the product of 2σik over its positive crossings resolved wide; from an arc vertex to its wide target the scalar ratio is exactly 2σik, while negative edges need no rescaling. These scalars commute around every cube square, so this is an isomorphism of the signed totalizations.

3.2F4F5step 2.1constructalgebra

A functorial free resolution. For a graded S-module M, use the normalized bar resolution Pn(M)=S⊗QS‾⊗n⊗QM, where S‾ is the augmentation ideal of the positive-degree polynomial ring S. Its differential multiplies adjacent factors, with alternating signs, and the last factor acts on M; its augmentation is s⊗m↦sm. The usual bar contraction over Q sends m to 1⊗m and inserts 1⊗s0‾ at the beginning of a higher tensor. Expanding the alternating differential cancels its adjacent terms in pairs, leaving ds+sd=1 on the augmented complex. Thus it is a resolution. By the ordered polynomial division in step 2.1, each Mϵ has the explicit Q-basis of left polynomial monomials times one basis element at each wide-edge layer, so every Pn(Mϵ) is free over S. The construction is additive and functorial on all coefficient maps and homotopies. In a fixed usual internal degree, its normalized tensor factors have positive degree, so only finitely many homological degrees and basis tensors occur.

4.1step 2.1step 3.2constructalgebra

Comparison maps and their homotopies. Compare any Kϵ with P(Mϵ) by augmentation-preserving maps. On a free S-basis of degree zero, lift its augmentation to the target resolution; on a basis vector b in degree n>0, define the lift recursively by fn(b)=stargetfn−1d(b) and extend S-linearly. The target's augmented Q-contraction exists for the bar complex by step 3.2 and for Kϵ by homogeneous Gaussian elimination on each finite-dimensional usual-degree complex, which is exact by step 2.1; choose the first pivot in the fixed monomial order. The displayed recurrence is a chain map because its argument is a cycle and ds is the identity on cycles. Construct f and g in both directions. For T=gf−1 define, on the same free basis, Hn(b)=sK(Tn(b)−Hn−1d(b)), starting with H−1=0; its argument is a cycle by induction, and this gives dH+Hd=T. The identical formula gives fg≃1 on the bar resolution. It also shows that two lifts of any coefficient map are homotopic: use their difference for T. All maps preserve usual internal degree; f,g preserve Koszul degree, while H raises it by one, so after the regrading in step 2.1 the maps have bidegree (0,0) and homotopies have bidegree (−1,−1). The fixed homogeneous pivots avoid any arbitrary choice of lifts.

5.1F5F1step 3.1step 4.1algebra

Pass to the curved factor. Extend these free resolutions from S to U and tensor with X. The signed extension of an inner homotopy is H~(x⊗k)=(−1)∣x∣x⊗H(k); the two cross terms involving dX cancel, giving dH~+H~d=1X⊗(dH+Hd) even though dX2=w. Thus step 4.1 yields actual homotopy equivalences in hmfw. Its uniqueness of lifts makes the comparison squares for every crossing commute in that category. Therefore the two diagram complexes in K(hmfw) are isomorphic to X⊗P(F(σ)) and X⊗P(F(σ′)), respectively, where F denotes the coefficient complexes of [F5]. No averaging coordinate, Koszul degree or crossing degree has been discarded.

6.1F6F1F5step 3.1step 4.1step 5.1algebra∎

Lift the complete survivor homotopies and check the no-shift normalization. The two three-letter words are (i,i+1,i) and (i+1,i,i+1), and in each braid-like diagram the three crossings have the same sign. The positive no-shift braid equivalence and the two-sided inverse contractions in [F6] give the corresponding equivalence for the inverse triple. The supplier homotopies are bimodule maps, so base-changing their two outer actions along R′=A[t]→t↦0A preserves every chain and homotopy equation and gives the relation on the reduced coefficient ring; the endpoint averages t0,t3 remain in X. Its explicit inclusion, projection and contractions give maps Φ,Ψ and homotopies ΨΦ−1=dh+hd, ΦΨ−1=dh′+h′d on the coefficient complexes. If all three crossings are negative, the KR complex of either word is the corresponding positive Rouquier triple shifted by {−3}, so the same equivalence has no additional internal or cohomological shift. If all three crossings are positive, it is the inverse Rouquier triple shifted by {3}; the root-unit and rational-normalization rescalings of step 3.1 have products (2σi)2(2σi+1)=8σi+1 and (2σi+1)2(2σi)=8σi on the two all-wide vertices. Their ratio remains σiσi+1=−1 after the common factor 8 cancels. This residual scalar is a unit, absorbed by rescaling the comparison map; both words still have the same shift {3}. Apply the additive bar functor to the four homotopy equations; it preserves compositions and sums. Tensoring with X preserves them with the signed totalization, since the two cross terms of each extended inner homotopy cancel as in step 5.1. Combining these maps with the comparison equivalences and homotopies of steps 4.1–5.1 gives homotopy inverses between C(D1) and C(D2) in K(hmfw). The Rouquier equivalence, vertex scalars, bar comparison maps and curved factor all have internal degree zero after the equal shifts just computed; the homotopies have cohomological degree −1. Hence the isomorphism has no trigrading shift, as claimed.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The normalized Khovanov-Rozansky HOMFLYPT Euler series

Definition

Assume the Axiom of Choice (The Axiom of Choice) for the rationality identification via A finite graded module over a standard graded algebra has rational Hilbert series and eventual polynomial growth below. The diagram-wise formal-series construction itself requires no choice. For a braid diagram D on s(D)≥1 strands, whose closure is nonempty (The braid group by Artin presentation, The closure of a geometric braid) let ∣D∣+ and ∣D∣− be its numbers of positive and negative crossings (the source's convention: σi is positive, σi−1 negative, and the braid is clockwise oriented), and let ⟨D⟩ be the Euler characteristic of The Khovanov-Rozansky complex and trigraded braid homology. Put α:=−t−1q−1 in Z[q±1,t±1] and let α denote a fixed formal square root in T0:=Z[q±1,t±1,α±1/2,(1−q2)−1] (with α−1/2 the inverse of the chosen root). The normalized Khovanov-Rozansky HOMFLYPT Euler series of D is F~(D):=α ∣D∣+−∣D∣−−s(D)+1 ⟨D⟩∈T0.

This is the normalization displayed immediately before formula (7) of Khovanov-Rozansky II (printed p. 10), designed to remove the positive and negative stabilization factors of the unnormalized Euler series.

Caveats: F~ is here a function of braid diagrams, and its Markov invariance is not asserted in this definition (it is the content of the categorification theorem at the end of the page, which uses the Markov moves of Markov conjugation and stabilization moves); the square root is formal and the exponent may be negative, so all inverses of α are used; the whole expression depends on the source's clockwise-braid and crossing conventions, which must be kept fixed. The displayed normalization is the arXiv v2 one; the published version of the same construction replaces it by Wu's half-integer regrading so that the invariant is defined without an overall shift, and the comparison between the two normalizations is part of the categorification theorem at the end of this page.

Facts & Assumptions

Given: a braid diagram D on s(D) strands with ∣D∣+ positive and ∣D∣− negative crossings, the Euler characteristic ⟨D⟩ of its trigraded homology, and AC and the ring T0=Z[q±1,t±1,α±1/2,(1−q2)−1] with a fixed square root α of α=−t−1q−1.

[F1]

The Euler characteristic ⟨D⟩=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) is defined for every braid diagram, and, under AC, the trigraded groups are well defined up to an overall shift under change of braid representative (The Khovanov-Rozansky complex and trigraded braid homology, Khovanov-Rozansky braid homology is an oriented link invariant up to shift).

[F2]

In the braid group Bn the generators are σ1,…,σn−1; a positive crossing is an occurrence of some σi and a negative crossing an occurrence of some σi−1, so ∣D∣+ and ∣D∣− depend only on the braid word presented by the diagram (The braid group by Artin presentation).

[F3]

Eliminating an internal linear row substitutes its variable in all other rows and retains the remaining quadratic relations. A closed nonempty resolution reduces to a finite Koszul complex over a polynomial ring in finitely many remaining mark variables, all of second internal degree 2 (Koszul row operations and variable exclusion preserve homotopy type).

[F4]

Finite-variable polynomial rings over a Noetherian ring are Noetherian; finite modules over them are Noetherian. Under AC, the Hilbert series of a finite graded module over a standard graded polynomial algebra over Q has Laurent-polynomial numerator and denominator a power of 1−z (If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N, Finitely generated modules over a left Noetherian ring are Noetherian, A finite graded module over a standard graded algebra has rational Hilbert series and eventual polynomial growth, The Axiom of Choice).

Proof

technique · verification of well-definedness of the exponent, of the coefficient ring, and of the unknot value
1.1F1F2algebra

The exponent is well defined. The numbers ∣D∣+ and ∣D∣− are determined by the braid word of D by [F2] and depend only on the diagram, and s(D)=n for D⊂Bn; hence the integer ∣D∣+−∣D∣−−s(D)+1 is a well-defined function of the braid diagram. The power αm is defined for every m∈Z because α is invertible in Z[q±1,t±1] and α and α−1/2 are units of T0 by construction. The remaining issue is that the Euler series is in this localized ring, proved next.

1.2F2algebra

The two stabilizations move the exponent controllably. For the positive stabilization Dσn of a diagram on n strands one has ∣Dσn∣+=∣D∣++1 and s=n+1, so the exponent ∣D∣+−∣D∣−−s+1 is unchanged; for the negative stabilization Dσn−1 one has ∣Dσn−1∣−=∣D∣−+1 and the exponent decreases by 2. This is the arithmetic reason for the choice of normalization, and it is used in the categorification theorem together with the stabilization values of the Euler series, not asserted as invariance here.

2.1F1F3F4step 1.1algebra

The rational coefficient ring. For a nonempty braid closure, the finitely many resolution complexes in [F3] are finite complexes of finite free modules over Q[x1,…,xN], after the universal (a,0) row is removed. Only finitely many first internal degrees occur. This polynomial ring is Noetherian by [F4], since Q has only the ideals 0,Q; thus their kernels, images and cohomology, and then the cohomology of the finite crossing cube, are finitely generated in each first internal degree. Split each second internal grading into its two parity classes and set z=q2. Regrading a parity class to integer degrees makes it a finite standard graded polynomial module. Hilbert-Serre [F4], under AC, writes each such series as a Laurent polynomial in q divided by a power of 1−q2. There are finitely many cochain and first internal degrees, so their signed t-weighted sum is in Z[t±1,q±1,(1−q2)−1]. Multiplication by the specified root power yields F~(D)∈T0. The rational expressions are expanded using (1−q2)−1=∑d≥0q2d when read as formal series. The zero-strand empty diagram is excluded from this normalized-link definition: its raw complex is Q[a], with deg⁡a=(2,0), and its raw v2 Euler is (1−t2)−1. Substituting s=e=0 into the normalization expression would formally give α/(1−t2) in the larger localization adjoining (1−t2)−1; this is not identified with an empty-link HOMFLYPT value.

3.1F1step 1.1step 2.1algebra∎

The unknot value. For the one-strand diagram D of the unknot one has ∣D∣+=∣D∣−=0 and s(D)=1, so the exponent is 0 and F~(D)=⟨D⟩. The direct computation of the one-mark circle gives H(D)≅Q[x]{−1,1} and ⟨D⟩=∑m≥0t−1q1+2m=t−1q/(1−q2)=t−1/(q−1−q); with α=−t−1q−1 one has α/(1−q−2)=−t−1q−1q2/(q2−1)=t−1q/(1−q2), so F~(D)=α/(1−q−2), the normalization recorded in section 7 of the source.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial

Statement

Assume the Axiom of Choice (The Axiom of Choice) for the stated Hilbert-Serre rationality, the Alexander/Markov passage to oriented links, and the Hecke comparison. Let D have a nonempty braid closure, so s(D)≥1. Let Cv2(D) be the complex of The Khovanov-Rozansky complex and trigraded braid homology, and let Cpubraw(D) be the complex formed from the published half-integer crossing cones (12)-(13) of Khovanov-Rozansky II. If s(D) is the number of strands in the braid whose closure is D, define the published grading-corrected complex by Cpub(D):=Cpubraw(D){s(D)/2,s(D)/2}[s(D)/2]. Put e=∣D∣+−∣D∣− and r=(s(D)−e)/2. The source-cone regrading is Cpub(D)=Cv2(D){r,r}[r]. Write Hk,lj(D) for the trigraded cohomology of Cpub(D) and put ⟨D⟩pub:=∑j,k,l(−1)j+kt2kqk+ldim⁡QHk,lj(D). Also write ⟨D⟩v2 for the Euler characteristic of the uncorrected integer-graded cohomology of Cv2(D).

Then:

(1) Published normalization. Every Hk,lj(D) is finite dimensional. The published grading correction makes the termwise-cohomology complex CHpub(D), with its inner parity labels forgotten, invariant under braid Markov moves. If inner parity is retained, the invariant factorization complex is instead Π⌊r⌋Cpub(D). Its Euler characteristic satisfies ⟨D⟩pub=F(D)/(1−t2), where F is the multiplicative HOMFLYPT function: the unique oriented-link invariant with F(L1⊔L2)=F(L1)F(L2), skein relation tF(L+)−t−1F(L−)=−(q−q−1)F(L0) and F(unknot)=t−1−tq−q−1.

(2) arXiv v2 normalization. In the integer grading of The normalized Khovanov-Rozansky HOMFLYPT Euler series the same data are normalized by the series F~ of that item: F~(D)=α ∣D∣+−∣D∣−−s(D)+1⟨D⟩v2,α=−t−1q−1. It is invariant under all Markov moves and has unknot value α/(1−q−2). Precisely, under tv2=−t2q, qv2=q and the choice α=(tq)−1, F(D)=(1−t2)tq F~(D)(−t2q,q). This is the v2 form of the same HOMFLYPT function. The v2 section 1, section 7, and formula (7) displays have a recorded q↔q−1 sign discrepancy in the elimination step; the published formulas (3), (4), and (28)-(30) are mutually consistent.

(3) AC-conditional comparison with the Hecke-Markov normalization. Assume the Axiom of Choice for the Hecke-trace oriented-link-invariance theorem (The Hecke trace construction is an oriented link invariant). Let R be the coefficient ring of The HOMFLYPT coefficient ring, put T=Z[q±1,t±1,(q−q−1)−1,(t2−1)−1], let δ=t−1−tq−q−1, and let P be the Hecke-Markov invariant of The HOMFLYPT polynomial from the Hecke Markov trace. The assignments v↦q−2, s↦q−1, u↦t−1q, z↦(q2−1)t2q2(1−t2) satisfy s2=v and vzu2=z+1−v, hence define a ring homomorphism φ ⁣:R→T with φ(l)=t−1, φ(m)=q−1−q and φ(α)=δ. Under φ the skein relation l−1P(L+)−lP(L−)=mP(L0) of The HOMFLYPT skein relation becomes exactly the relation of (1); and the unknot normalization gives F=δ⋅φ(P), where δ=t−1−tq−q−1; hence ⟨D⟩pub=δ1−t2 φ(P(D^)).

Caveats: half-integer shifts extend the indexing of the component modules and outer complex; they do not themselves reverse inner parity. The source suppresses that parity (printed p. 1391), whereas it is explicit in this page's factorization category. The published formula (5) prints the opposite unknot sign, (t−t−1)/(q−q−1); our F uses the sign forced by formula (3), the computed unknot Euler series (printed p. 1424), and the unlink computation below. The Hecke comparison is made in the published normalization; the v2 series uses the specified integer-grading and square-root conventions; φ is not asserted to be injective. The local crossing, stabilization and unlink calculations are choice-free. AC is used for rationality through the normalized Euler Definition, and for Alexander/Markov oriented-link descent in parts (1)-(2), as well as the Hecke-trace supplier in part (3). The zero-strand raw complex is separately Cv2(∅)=Cpub(∅)=Q[a]; its v2 Euler is (1−t2)−1 and its published-weight Euler is (1−t4q2)−1. Neither raw empty value is asserted to be a HOMFLYPT empty-link normalization.

Facts & Assumptions

Given: AC, a nonempty braid closure D, the v2 complex Cv2(D), the published raw and corrected complexes Cpubraw(D) and Cpub(D), and the normalized series F~ of the definition item.

[F1]

Cv2(D) is the integer-graded complex of The Khovanov-Rozansky complex and trigraded braid homology, with finite tensor products of local factorizations and termwise cohomology on which a acts trivially. Its Euler characteristic is ⟨D⟩v2=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) (The Khovanov-Rozansky complex and trigraded braid homology).

[F2]

F~(D)=α ∣D∣+−∣D∣−−s(D)+1⟨D⟩v2 with α=−t−1q−1 in T0=Z[q±1,t±1,α±1/2,(1−q2)−1], and the exponent is unchanged by a positive stabilization and decreases by 2 under a negative stabilization (The normalized Khovanov-Rozansky HOMFLYPT Euler series).

[F3]

Each resolution graph has finitely many rows and variables; after contractible rows and eliminable internal variables are removed, its cohomology is computed by a finite Koszul complex over a polynomial ring in finitely many remaining mark variables, and a acts trivially (Koszul row operations and variable exclusion preserve homotopy type). Each fixed bidegree of such a complex is finite dimensional.

[F4]

In the v2 integer grading the type IA kink has inner parity reversal Π in addition to the shift {1,1}[1], and type IB has neither (Oriented kink shifts for braid diagrams). In the published grading, the braid-closure correction is {s(D)/2,s(D)/2}[s(D)/2] and the Reidemeister I shift for the corresponding one-strand closure is {1/2,1/2}[1/2] (published formulas (14) and (20)); These local shifts, rather than an invocation of the source Theorem 1, supply the stabilization calculation below.

[F5]

Marking changes alter C(D) only by chain homotopy equivalences with no grading shift (Markings do not change the Khovanov-Rozansky complex).

[F6]

The braid-like Reidemeister IIa move gives an isomorphism of complexes with no shift (Invariance under the braid-like Reidemeister IIa move).

[F7]

The braid-like Reidemeister III move with coherent orientations gives an isomorphism of complexes with no shift (Invariance under the braid-like Reidemeister III move).

[F8]

Conjugation of braid words gives an isomorphism of complexes with no shift, hence unchanged trigraded cohomology (Invariance under braid conjugation).

[F9]

In the v2 grading, the positive crossing is the cone of χ0 with source shift {0,2} and the negative crossing is the cone of χ1 with overall shift {0,−2}; the maps have bidegrees (0,2) and (0,0) (The positive and negative Khovanov-Rozansky crossing complexes). The published cones use the half-integer shifts (12)-(13) of the cited source.

[F10]

Assume AC. The Hecke-Markov construction defines an oriented-link invariant P with P(unknot)=1; it has coefficient ring R with units v,z,s,u satisfying s2=v and vzu2=z+1−v, together with l=us, m=s−s−1, and α=(uz)−1. Its skein relation is l−1P(L+)−lP(L−)=mP(L0) (The Axiom of Choice, The HOMFLYPT coefficient ring, The HOMFLYPT polynomial from the Hecke Markov trace, The Hecke trace construction is an oriented link invariant, The HOMFLYPT skein relation).

[F11]

Under AC, ambient-isotopic braid closures are connected by a finite sequence of Markov moves. Braid homology is invariant under those moves up to the stated shifts; distant crossings commute by the disjoint-factor signed flip (Markov's theorem for braid closures, Khovanov-Rozansky braid homology is an oriented link invariant up to shift).

[F12]

Under AC, every oriented link is the closure of a braid; its proof uses a finite reduction of the common oriented Seifert-circle picture followed by reading a height-zero diagram as a braid (Alexander's theorem: every link is a closed braid).

Proof

technique · explicit regrading of crossing cones, local Markov calculations, unlink evaluation and finite descending-diagram skein induction
1.1F1F2F3

Finiteness. Retain the finitely many mark variables not removed by linear exclusion; a closed circle, for example, retains its polynomial variable. After separating the universal (a,0) row, [F3] gives a finite Koszul complex over this finite-variable polynomial ring. The generators have finitely many first internal degrees, and all polynomial variables have second degree 2, so every fixed bidegree is finite dimensional. The crossing cube is finite; kernels and quotients preserve this degreewise finiteness. The localized rational-series conclusion follows from [F2], whose Hilbert-Serre argument is explicitly AC-qualified.

1.2F1F9algebra

The exact crossing regrading. Let e=∣D∣+−∣D∣−, s=s(D) and r=(s−e)/2. In a positive published cone the Γ0 term has shift {−1/2,3/2} in degree −1/2 and the Γ1 term shift {−1/2,−1/2} in degree 1/2. These are the v2 positive cone shifted by {−1/2,−1/2}[−1/2]. In the negative cone both published terms have shift {1/2,−3/2} in degrees −1/2,1/2, so it is the v2 negative cone shifted by {1/2,1/2}[1/2]. Tensoring gives Cpubraw(D)=Cv2(D){−e/2,−e/2}[−e/2], and therefore Cpub(D)=Cv2(D){r,r}[r]. The equality is read through the canonical totalization identifications; any tensor-shift differential sign is transported by those identifications.

2.1F4F5F6F7F8F11step 1.2algebra

Both stabilizations and oriented-link descent. A positive stabilization increases s,e by 1, hence leaves r unchanged, and its v2 type IB complex has no shift by [F4]. A negative stabilization increases s by 1 and decreases e by 1, hence replaces r by r+1. The type IA relation of [F4] is Cv2(Dstraight)≃ΠCv2(Dnegative curl){1,1}[1], so the stabilized v2 complex is ΠCv2(D){−1,−1}[−1]. Its published correction {r+1,r+1}[r+1] cancels the trigrading shift, leaving Π. Since r increases by one, ⌊r⌋ also increases by one, so Π⌊r⌋Cpub(D) has no residual parity reversal. Taking termwise cohomology and forgetting its parity also removes Π. Inverse moves reverse these equivalences. Conjugation, markings, inverse cancellations and adjacent braid relations preserve the complex by [F5]-[F8]; distant crossings commute by the disjoint-factor signed flip of [F11]. Braid relations, inverse cancellations and conjugations keep s,e and hence ⌊r⌋ fixed. Thus both the parity-corrected factorization complex and CHpub(D) with parity forgotten are invariant under every Markov move. Under AC, [F11] supplies a finite Markov sequence for two ambient-isotopic closures, proving oriented-link descent.

2.2F1F9step 1.2algebra

The published weight and the two cone relations. A homogeneous class of C of degree (j,k,l) has degree (j−n,k+n1,l+n2) in C{n1,n2}[n]. Its published weight is therefore multiplied by (−1)n1−nt2n1qn1+n2, whenever n1−n is integral; it is this difference, rather than the sum, that applies to half-integer cones. Applying the explicit shifts of step 1.2 gives ⟨Dσi⟩pub=t−1q−1⟨Dei⟩pub−t−1q⟨D⟩pub, ⟨Dσi−1⟩pub=tq−1⟨Dei⟩pub−tq−1⟨D⟩pub. The strand correction is common to all four diagrams. Also j+k is integral: the common shift {r,r}[r] changes this sum by r−r=0 from its integer-graded v2 value.

3.1F12step 2.1step 2.2algebra

Skein elimination. Multiplying the positive relation by tq gives ⟨Dei⟩pub=tq⟨Dσi⟩pub+q2⟨D⟩pub. Substitution in the negative relation yields t⟨Dσi⟩pub−t−1⟨Dσi−1⟩pub=−(q−q−1)⟨D⟩pub. To apply this relation to a general oriented skein triple, smooth all its crossings: the three diagrams have the same oriented Seifert circles, with only one crossing strip distinguished. Apply the finite reducing algorithm of [F12] to that common picture, choosing its finitely many reducing arcs away from the distinguished strip. Endpoints can be moved along the circle arcs and each reducing arc perturbed away from the distinguished point; shrink the local strip disk as needed. Each such reduction is the identical ReidemeisterII move outside that disk in all three diagrams. The resulting common height-zero picture is read as three braid closures differing at the distinguished crossing/smoothing. Link invariance from step 2.1 transports the braid relation back to the original triple. Consequently G=(1−t2)⟨−⟩pub has the asserted oriented-link skein relation.

3.2F3step 1.2step 2.2algebra

All unlink values. For the crossingless m-strand closure, m≥1, the factorization is the tensor product of m circle rows (a,0). Subtract the first row from each remaining row: it becomes one (a,0) row and m−1 zero rows. The cohomology of the first row is Q[x1,…,xm]{−1,1}; each zero row contributes Q⊕Q{−1,1}. The outer v2 degree is zero, and the published correction is {m/2,m/2}[m/2]. Thus ⟨unlink⁡m⟩pub=−tm−2qm(1−t−2)m−1(1−q2)m=t−m(1−t2)m−1(q−q−1)m. Therefore G(unlink⁡m)=δm, where δ=(t−1−t)/(q−q−1). For m=1 this gives the published unknot series t−1/(q−q−1) and G(◯)=δ.

4.1step 3.1step 3.2algebra

Finite skein uniqueness and multiplicativity. Fix an ordering and basepoint on each component of a finite regular oriented diagram, away from the crossings. Traverse components in that order, starting at their basepoints; a crossing is bad if its first encounter is on the underpassing branch. Switching the first bad crossing reduces the number of bad crossings by one without changing the others, whereas oriented smoothing reduces the total crossing number. The skein relation expresses the value at this diagram as a unit multiple of the switched-diagram value plus a multiple of the smoothed-diagram value. Induction on the lexicographic pair (crossing number, number of bad crossings) therefore terminates. A diagram with no bad crossing is descending: pull its traversed arcs successively above the remaining arcs, starting at the first component, to isotope it to disjoint unknotted circles. Their prescribed values δm determine every value. This proves uniqueness among oriented-link invariants with the skein relation and these unlink values. To check multiplicativity, apply the same induction to a diagram of L1 in a ball disjoint from a fixed L2; then to L2. It reduces both G(L1⊔L2) and G(L1)G(L2) to the identical unlink products δm1+m2. Thus G is the multiplicative HOMFLYPT function F, proving (1).

5.1F2F4F9F11step 1.2step 2.1step 3.2step 4.1algebra

The v2 normalization and its precise relation to the published one. In integer grading, ⟨C{u,v}[n]⟩v2=(−1)ntuqv⟨C⟩v2. Positive stabilization has factor 1; negative stabilization has factor −t−1q−1=α by step 2.1. Its exponent e−s+1 decreases by 2, whereas the positive stabilization leaves that exponent unchanged, so F~ is invariant under both moves. The v2 unknot value is the circle tower t−1q/(1−q2)=α/(1−q−2) from [F2]. Under the variable substitution tv2=−t2q and qv2=q, choose α=(tq)−1; then step 1.2 and the published weight give ⟨D⟩pub=(tq)s−e⟨D⟩v2(−t2q,q)=tq F~(D)(−t2q,q). Hence F(D)=(1−t2)tq F~(D)(−t2q,q): this is the explicit sense in which the v2 normalization is the same HOMFLYPT invariant after regrading. The local v2 cone relations are ⟨Dσi⟩=⟨Dei⟩−q2⟨D⟩ and ⟨Dσi−1⟩=q−2(⟨Dei⟩−⟨D⟩), giving q−1⟨Dσi⟩−q⟨Dσi−1⟩=(q−1−q)⟨D⟩ by direct elimination. This records the consistent sign independently of the discrepant v2 source display. Oriented-link descent again uses AC via [F11], proving (2).

6.1F10step 4.1algebra∎

The Hecke coefficient homomorphism. The assignments in (3) obey (q−1)2=q−2 and q−2(q2−1)t2q2(1−t2)t−2q2=q2−1q2(1−t2)=(q2−1)t2q2(1−t2)+1−q−2. All assigned units are units in T, so they define φ:R→T. It has φ(l)=t−1, φ(m)=q−1−q and φ(α)=δ by the displayed definitions of [F10]. Thus ψ=φ(P) is an oriented-link invariant with the same skein relation and unknot value 1. Apply its skein relation at a small kink on an unlink: both crossing choices are isotopic to that unlink, and the smoothing adds one unknotted component. Since q−q−1 is a unit in T, this gives ψ(unlink⁡m+1)=δψ(unlink⁡m), hence ψ(unlink⁡m)=δm−1. The invariant δψ therefore has the unlink values δm and the skein relation of F. Finite uniqueness from step 4.1 gives F=δφ(P) and ⟨D⟩pub=δφ(P(D^))/(1−t2). This comparison also uses the explicit AC assumption of the Hecke supplier [F10], proving (3).

5 · Examples, counterexamples and false statements

None yet.

Sources