Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Koszul-Hochschild comparison respects crossing differentials and trigradings

Statement

Assume AC, inherited from the diagonal Koszul comparison in A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule. Let σ be a braid word, let p be one of its crossings at strands s,s+1, and let Γ0 (two arcs) and Γ1 (one wide edge) be the two local resolutions of p. Write χ0 ⁣:C(Γ0)→C(Γ1) and χ1 ⁣:C(Γ1)→C(Γ0) for the wide-edge morphisms of The wide-edge morphisms chi-zero and chi-one and let Cp+=[C(Γ0){0,2}→ χ0 C(Γ1)],Cp−=[C(Γ1){0,−2}→ χ1 C(Γ0){0,−2}] be the positive and the corrected negative crossing complexes of The positive and negative Khovanov-Rozansky crossing complexes. Then:

(a) under the identification of a closed resolution's Koszul complex with the Hochschild homology of its Soergel bimodule and the splitting off of the trivial factor (A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule), the local quotient map for χ0 is rbs ⁣:R{2}→Bs,rbs(1)=ys⊗1+1⊗ys, and the local quotient map for χ1 is brs ⁣:Bs→R,brs(a⊗b)=ab, of Khovanov's generator complexes for the HHH construction, up to multiplication by nonzero rational units (the factor 2 in the composite brsrbs=2ys and the sign of the balanced root). On the reduced resolution homology the induced maps are HHh(R,rbs) and HHh(R,brs), tensored with the other layers. Consequently the two-term complexes agree term by term with the generator complexes F(σs)=[R{2}→Bs] and F(σs−1)=[Bs{−2}→R{−2}] of that item, with matching shifts. The correspondence is uniform in the position s and compatible with the tensor products over the layers, so the resolution-wise identifications intertwine the crossing differentials of the complex computing the termwise Hochschild theory HHH with those of the corrected reduced resolution homology of the Khovanov-Rozansky complex. The full a=0 specialization retains an extra zero Koszul row and has two copies; that row must be removed as specified in the preceding comparison lemma.

(b) write (j,k,l) for the trigrading of The Khovanov-Rozansky complex and trigraded braid homology (cohomological degree, first bigrading, second bigrading) and (c,h,p) for the HHH trigrading (Rouquier degree, Hochschild degree, internal degree). After undoing the source's built-in shift by the global correction (k,l)↦(k+1,l−1) that moves the one-strand class (−1,1,0) to (0,0,0), the two trigradings are related by k=−h,l=p−h,j=c, equivalently a=−h, q=p−h, t=c in the marked variables (a,q,t)=(k,l,j) of the Khovanov-Rozansky theory.

Caveats: the identification is a statement about the reduced theories; the trivial polynomial factor and the source's coordinate x1 are handled by Unreduced type-A Soergel bimodules and the trivial polynomial factor; the constants of (b) are fixed by the bidegrees of the folded Koszul complex and are anchored by the two worked normalizations, the one-strand class of the trivial one-braid and the (2,n) computation; AC enters only through the preceding diagonal Koszul comparison; the local map and grading calculations use no additional choice.

Facts & Assumptions

Given: a braid word σ, a crossing at strands s,s+1 with its two local resolutions Γ0,Γ1, the morphisms χ0,χ1 and the two crossing complexes, the reduced ring R, the bimodules Bs and the maps rbs,brs.

[L1]

χ0 ⁣:C(Γ0)→C(Γ1) has bidegree (0,2) and χ1 ⁣:C(Γ1)→C(Γ0) has bidegree (0,0); in the Koszul standard forms of the two factorizations they are the flip morphisms Id⊗ψ′(x4−x2) and Id⊗ψ(x4−x2), and their composites satisfy χ1χ0=χ0χ1=Id⊗((x4−x2)⋅id) (The wide-edge morphisms chi-zero and chi-one).

[L2]

The positive crossing complex is the cone of χ0 with source shift {0,2} and the corrected negative crossing complex is the cone of χ1 with overall shift {0,−2}; both differentials have bidegree (0,0) as maps of the shifted terms (The positive and negative Khovanov-Rozansky crossing complexes).

[L3]

rbs ⁣:R{2}→Bs and brs ⁣:Bs→R are the well-defined degree-zero maps of graded (R,R)-bimodules with the displayed values, and F(σs)=[R{2}→rbsBs], F(σs−1)=[Bs{−2}→brsR{−2}] are the generator complexes with the B-term in cohomological degree 0 (Khovanov's generator complexes for the HHH construction, Unreduced type-A Soergel bimodules and the trivial polynomial factor).

[L4]

For a closed resolution D with Koszul complex K(D) there is an isomorphism HHh(R′,B′(D))≅Hh(K(D)) natural for coefficient maps, and after splitting off the trivial coordinate the reduced summand is HH∙(R,B(D)) with B(D)=⨂jBsj over the wide edges (A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule).

[L5]

For a layer of a closed marked resolution the first relations form a regular sequence with quotient B′(D), and the Koszul symbols of the folded complex carry the shifts (−1,1) for a linear relation and (−1,3) for the quadratic relation, so that every differential has bidegree (1,1) in the bigrading (deg⁡a,deg⁡x)=(2,0),(0,2) (The first-layer relations of a closed MOY resolution form a regular sequence, Setting a to zero in a closed KR factorization gives the layer-by-layer Koszul complex).

[L6]

The trigraded Khovanov-Rozansky complex of a braid diagram has cohomology H(D)=⨁j,k,lHk,lj(D) with the Euler characteristic ∑(−1)jtkqldim⁡Hk,lj(D), the shifts of the local terms being 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 Khovanov-Rozansky complex and trigraded braid homology, The wide-edge morphisms chi-zero and chi-one, The reduced Khovanov-Rozansky homology).

[L7]

The reduced instance of the library's Rouquier generator complexes has Bslib=Bs{−1} and differentials the ordinary multiplication map εs(a⊗b)=ab and ηs, with ηs(1)=αs⊗1+1⊗αs and αs=κsys, κs=(−1)s−1 a unit. Thus ηs=κsrbs with the corresponding shifts; the root sign does not multiply the differential εs (The positive and negative Rouquier generator complexes).

Proof

technique · direct
1.1L2L3L4L5givenalgebra

The local quotient modules. At a=0, the two-arc Koszul resolution has quotient the identity bimodule R′, while the wide-edge resolution has quotient Bs′=Q[x1,x2,x3,x4]/(x1+x2−x3−x4, x1x2−x3x4). Choose the left strand coordinates (x4,x3) and right strand coordinates (x1,x2); this order agrees with the arcs x1=x4, x2=x3. Put yL=x4−x3 and yR=x1−x2. The sum relation implies x4−x2=(yL+yR)/2 in Bs′. The common invariant coordinate and the other strand coordinates pass through this local calculation unchanged. The regular-layer quotient and diagonal identification in [L4] carry these coefficient modules to the corresponding termwise Hochschild contributions; removing the universal zero row recovers the original a-theory with its fixed {−1,1} correction.

2.1L1L2L3L7step 1.1algebra

Read the induced maps from the matrices. The degree-zero Koszul homology is the quotient of the even coefficient summand. The even matrices of [L1] have first entries x4−x2 for χ0 and 1 for χ1. Consequently χ0 induces 1↦(yL+yR)/2 from the identity module to Bs′, while χ1 induces the quotient map Bs′→R′ setting yL=yR, namely multiplication. The first map is a bimodule map because (yL−yR)(yL+yR)=0 in the wide-edge quotient and the invariant generators already balance. After removing the common invariant polynomial factor, these are exactly rbs/2 and brs on the reduced modules. In particular rbsbrs is multiplication by yL+yR on Bs, rather than multiplication by the single scalar ys; brsrbs=2ys on R. Rescaling the source of the positive two-term complex by a nonzero rational scalar turns rbs/2 into rbs, and the negative map already equals brs. All shifts are those in [L2] and [L3].

3.1L1L2L3L4step 1.1step 2.1algebra

Assembly over the layers. The local quotient maps of step 2.1 are tensored with the identity on every other layer. The regular-layer augmentations and the diagonal Koszul comparison are natural for these coefficient maps by [L4], so the resolution-wise identifications intertwine each crossing edge. Multiplying a resolution's coefficient module by the product of the source-rescaling constants for its positive arc terms makes all positive maps exactly rbs simultaneously: changing one resolution choice changes precisely the factor belonging to that crossing. The scalars commute, so the two routes around each cube face agree, and the ordinary cube signs are preserved. These isomorphisms therefore assemble into a chain isomorphism between the corrected reduced resolution-homology complex and the termwise Hochschild complex of F(σ). For the universal-row reduction, the normal-form differential is a(e0∧−)+dK, and the crossing matrices and homogeneous row changes contain no a. Comparing the coefficient of a in the chain-map equation forces each crossing map to commute with e0∧−. It therefore preserves the image of this wedge operator, the copy retained by the original (a,0) row after polynomial cancellation. Its induced coefficient map there is the one computed above. The extra zero-row copy of the full a=0 theory is not included.

4.1L4L5step 3.1algebra

The first grading. On the Khovanov-Rozansky side the first bigrading of a class of the folded complex is the negative of the number of Koszul symbols of the closure block that produced it, because each relation of the closure block contributes the shift (−1,1) by [L5], while the layer block contributes nothing on homology: it is a regular sequence whose Koszul complex is a resolution of B′(D). Under the identification of step 1.1 the closure block is exactly the Hochschild block of the termwise complex, whose homology degree is h; hence k=−h after the global correction, which does not involve the first bigrading of the moving classes beyond the fixed shift (1,−1,0).

4.2L2L4L5L6step 3.1algebra

The second and third gradings. By [L5] a relation of internal degree d contributes the shift (−1,d−1) to the folded complex, and the surviving class has internal degree p equal to the sum of the degrees of the relations and of the coefficient bimodules of the resolution; therefore its second bigrading is l=p−h, because each of the h closure factors contributes d to the internal degree p and d−1 to the second bigrading, a difference of exactly h down from p. The cohomological degree j of the assembled complex is the position in the cube of resolutions, which is the same index as the Rouquier degree c of the termwise complex; hence j=c. The three displays combine to k=−h, l=p−h, j=c, that is a=−h, q=p−h, t=c in the variables of the statement.

5.1L6step 4.1step 4.2algebra∎

The global correction and the constants. The source records that the Khovanov-Rozansky trigrading carries a built-in shift by (−1,1,0) coming from the variable a, that both the one-strand classes lie in (0,0,0) after undoing it, and that after the correction the third gradings match, the Hochschild grading equals the Koszul grading with the minus sign, and the second grading equals the x-degree grading minus the Hochschild grading; these are exactly the three displays of steps 4.1 and 4.2, with the correction (k,l)↦(k+1,l−1) applied to the first two. The one-strand class is (−1,1,0) on the Khovanov-Rozansky side and (0,0,0) on the Hochschild side, so the correction is fixed, and the (2,n) computation with its alternating differentials of degrees 2 confirms that no further constant is needed.

Depends on

Used by

Dependency tree · two levels

37 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources