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.

A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule

Statement

Assume the Axiom of Choice (AC), inherited from The remaining closure Koszul complex is the diagonal Hochschild complex. Let D be a closed marked MOY resolution with r wide edges and m≥1 strands, let R~=Q[xi,j], K(D), R′=Q[x0,1,…,x0,m], B′(D)=⨂j=1rBsj′ and B(D)=⨂j=1rBsj be as in The first-layer relations of a closed MOY resolution form a regular sequence, and let R=Q[x1−x2,…,xm−1−xm]⊂R′ be the reduced ring of The reduced type-A polynomial ring and Soergel bimodules for the HHH construction, so that R′=R[t] for t=(x1+⋯+xm)/m by Unreduced type-A Soergel bimodules and the trivial polynomial factor. Then:

(a) for every h≥0 there is an isomorphism HHh(R′,B′(D))≅Hh(K(D)), where K(D) is the Koszul complex of the (r+1)m-element sequence over R~;

(b) with yj:=xj−x1 (2≤j≤m), the diagonal elements uyj=yjL−yjR of the R′-bimodule B′(D) satisfy ut=0, and HHh(R′,B′(D))≅(HHh(R,B(D))⊗QQ[t])⊕(HHh−1(R,B(D)){2}⊗QQ[t]) for every h≥0, with HH−1=0: the homology is the direct sum of two copies of HH∙(R,B(D))⊗QQ[t] with a relative shift of one in the Hochschild degree and two in internal degree (the two-term factor of the trivial coordinate contributes the doubling);

(c) deleting the trivial factor Q[t] from either copy leaves the graded Q-vector space HH∙(R,B(D)), which is the contribution of the resolution D to the reduced Khovanov-Rozansky homology H‾(D) of The reduced Khovanov-Rozansky homology; the trigrading shifts relating the two sides are fixed by the trigrading comparison proved later on this page, and no other normalization is asserted here.

Facts & Assumptions

Given: a closed marked MOY resolution D with r wide edges and m strands, the rings R~, R′, R, the bimodules B′(D), B(D), the Koszul complex K(D), the coordinate t=(x1+⋯+xm)/m, and AC.

[L1]

The first rm elements of the sequence form a regular sequence on R~ with quotient B′(D), their Koszul complex is a free resolution of B′(D), and the remaining m closure differences x0,j−xr,j are the diagonal elements uj=xjL−xjR of the R′-bimodule B′(D); hence the Koszul complex of all (r+1)m elements is quasi-isomorphic to the diagonal Koszul complex of B′(D) and computes HH∙(R′,B′(D)) (The first-layer relations of a closed MOY resolution form a regular sequence, The remaining closure Koszul complex is the diagonal Hochschild complex).

[L2]

B′(D)=B(D)⊗QQ[t] as graded (R′,R′)-bimodules, with R′=R[t] and t central, so the coordinate t acts by the same multiplication on both sides; B(D) is a Q-algebra bimodule over the reduced ring R (Unreduced type-A Soergel bimodules and the trivial polynomial factor).

[L3]

If yi=∑jaijxj and the matrix (aij) is invertible, the induced generator-matrix chain map is an isomorphism K(y;M)≅K(x;M) (Koszul Complex Invariant Under Invertible Generator Change), and K(x,y;M)≅K(x;M)⊗MK(y;M) (Koszul Complex Concatenation Tensor Isomorphism).

[L4]

Under AC, for R′=k[x1,…,xm] and a k-central R′-bimodule M, HHh(R′,M)≅Hh(K(u1,…,um;R′e)⊗R′eM), naturally in M (Polynomial Hochschild homology from the diagonal Koszul complex).

[L5]

The construction of H‾(D) repeats the matrix-factorization construction over the ring of differences Q[a,x2−x1,…,xm−x1]. For a nonempty closed resolution, homogeneous row operations isolate the row (a,0), whose retained cohomology has shift {−1,1}; the remaining rows have first entry zero and compute the resolution homology by their folded Koszul complex (Koszul row operations and variable exclusion preserve homotopy type) (The reduced Khovanov-Rozansky homology, The Khovanov-Rozansky complex and trigraded braid homology).

Proof

technique · direct
1.1L1L4givenalgebra

Compute HH∙(R′,B′(D)) as the homology of K(D). By [L1] the Koszul complex of all (r+1)m elements is quasi-isomorphic to the diagonal Koszul complex of the R′-bimodule B′(D), whose homology is HH∙(R′,B′(D)) by [L4] applied to M=B′(D); this proves (a), with the naturality of [L4] supplying the compatibility with coefficient maps.

1.2L2L3givenalgebra

Change the diagonal generators. In the R′-bimodule B′(D) the diagonal elements ux1,ux2,…,uxm are Q-linear combinations of ut,uy2,…,uym and conversely, the change matrix being the invertible matrix of the coordinate change (x1,…,xm)↔(t,y2,…,ym); by [L3] the two Koszul complexes are isomorphic. The element t, the average of all coordinates, is invariant under every simple reflection, hence balances in every tensor factor and satisfies t⊗1=1⊗t, so ut=0 on B′(D).

2.1L2L3step 1.1step 1.2algebra

Split off the trivial coordinate. By [L3] the Koszul complex of the sequence (ut,uy2,…,uym) over the commutative ring B′(D) is the tensor product of the two-term complex K(ut;B′(D))=[B′(D){2}→0B′(D)] with K(uy2,…,uym;B′(D)). Since the differential of the first factor is zero by step 1.2 and steps 1.1 and 1.2 identify HH∙(R′,B′(D)) with the homology of this Koszul complex, the tensor product is the direct sum of two copies of K(uy2,…,uym;B′(D)), placed in homological degrees 0 and 1, so that HHh(R′,B′(D))≅Hh(K(uy2,…,uym;B′(D)))⊕Hh−1(K(uy2,…,uym;B′(D))){2}, the two summands being the two copies.

3.1L2step 2.1algebra

Identify the reduced complex. By [L2] B′(D)=B(D)⊗QQ[t] and each uyj acts on B(D) through the bimodule structure and trivially on Q[t]; therefore K(uy2,…,uym;B′(D))=K(uy2,…,uym;B(D))⊗QQ[t], and because Q[t] is flat over Q its homology is H∙(K(uy2,…,uym;B(D)))⊗QQ[t].

4.1L3L4step 3.1algebra

Compute the reduced homology. The elements yj=xj−x1 (2≤j≤m) are an invertible linear combination of the standard generators x1−x2,…,xm−1−xm of R (explicitly xj−x1=−(x1−x2)−⋯−(xj−1−xj)), so by [L3] their Koszul complex is isomorphic to the diagonal Koszul complex of the polynomial ring R; by [L4] applied to the polynomial ring R and the Q-central R-bimodule B(D) its homology is HH∙(R,B(D)). Substituting into the two-copy formula of step 2.1 and the tensor decomposition of step 3.1 gives the displayed formula of (b).

5.1L1L2L4L5step 1.2step 2.1step 4.1algebra∎

Recover the original a-theory. In the full closed-graph factorization, the sum of all linear entries is zero: the differences telescope between layers and around the closure, and each wide edge preserves the sum of its two coordinates. The row operation summing the linear rows therefore gives a distinguished row (a,0), with all other first entries zero. Its odd cohomology is Q{−1,1} and its even cohomology is zero; polynomial division in a splits off the contractible pairs, leaving the remaining Koszul complex with this universal shift and parity. When a=0 instead, that distinguished row becomes (0,0) and supplies two copies. After the regular-layer quotient, its zero relation is the closure of the common invariant coordinate t: summing the linear relations gives m(tL−tR)=0. The nonzero scalar m is absorbed by a basis change, so this is exactly the zero diagonal row split in step 2.1. Removing that row and the polynomial coordinate t leaves the reduced diagonal Koszul complex of B(D), whose homology is HH∙(R,B(D)) by step 4.1. Thus the original reduced resolution contribution agrees after accounting for the universal {−1,1} shift with one of the two copies in (b); setting a=0 without removing the zero row retains both copies. This proves (c) and explains the grading correction used by the next lemma. The only use of AC is [L4].

Depends on

Used by

Dependency tree · two levels

49 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