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

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

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

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

HHH is isomorphic to reduced Khovanov-Rozansky homology

Statement

Assume the Axiom of Choice (inherited through the diagonal Koszul comparison of A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule). Let σ be a braid word on m≥1 strands with closure σ^, let HHH(σ) be the termwise Hochschild theory of The termwise Hochschild complex of a Rouquier complex and the groups HHH, and let H‾(σ^) be the reduced Khovanov-Rozansky homology of The reduced Khovanov-Rozansky homology evaluated on the corresponding braid diagram. Then there is an isomorphism of trigraded Q-vector spaces HHHc,h,p(σ)≅H‾c,−h−1,p−h+1(σ^) under the trigrading correspondence of The Koszul-Hochschild comparison respects crossing differentials and trigradings: writing kcorr=k+1 and lcorr=l−1 for the corrected Khovanov-Rozansky grading, kcorr=−h, lcorr=p−h, j=c; equivalently a=−h, q=p−h, t=c in the marked corrected variables (a,q,t)=(kcorr,lcorr,j). The unreduced Khovanov-Rozansky theory is recovered from the reduced one by adjoining the trivial polynomial factor, as recorded in The reduced Khovanov-Rozansky homology.

Caveats: only the reduced theory is compared; the isomorphism is trigrading-preserving only after the global correction, and no absolute normalization beyond it is claimed; the compatibility has to hold over all resolutions, including the corrected negative crossing and the signs of the Koszul total differentials; the Axiom of Choice enters only through the comparison of the bar and diagonal Koszul resolutions inside the cited identification, not through the construction of HHH.

Facts & Assumptions

Given: a braid word σ with N crossings and closure σ^, the cube of resolutions of the braid diagram, the termwise Hochschild complex of The termwise Hochschild complex of a Rouquier complex and the groups HHH and the reduced Khovanov-Rozansky complex of The reduced Khovanov-Rozansky homology, and AC.

[F1]

For the generator complex F(σ) of Khovanov's generator complexes for the HHH construction the groups HHHc,h,p(σ)=Hc(HHh(R,F(σ)∙))p are the cohomology of a bounded complex whose terms are the Hochschild homologies of the resolution terms F(σ)ν=⨂ν(local term) over the crossings, with differentials induced by the maps rbs,brs (The termwise Hochschild complex of a Rouquier complex and the groups HHH).

[F2]

The reduced Khovanov-Rozansky theory is built over the ring of differences with the coefficient a retained; for a fixed resolution Dν the reduced summand of the Koszul homology is HH∙(R,B(Dν)) with B(Dν)=⨂sBs over the wide edges, and the unreduced theory differs by adjoining the trivial polynomial factor (The reduced Khovanov-Rozansky homology, A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule).

[F3]

The a=0 specialization of the Khovanov-Rozansky complex is the folded Koszul complex of the resolution sequence, and the crossing complexes are the cones of χ0 and χ1 with the shifts {0,2} and {0,−2} (The Khovanov-Rozansky complex and trigraded braid homology, The positive and negative Khovanov-Rozansky crossing complexes).

[F4]

The local maps induced by χ0 and χ1 on the reduced summands are, up to nonzero rational units, the maps rbs and brs, the identification is compatible with the tensor products over the layers, and the trigradings correspond by k=−h, l=p−h, j=c after the correction (k,l)↦(k+1,l−1) (The Koszul-Hochschild comparison respects crossing differentials and trigradings).

[F5]

AC is the choice-function principle (The Axiom of Choice), used only through the diagonal Koszul identification inside [F2].

Proof

technique · direct
1.1F1F2givenalgebra

Resolution-wise identification. Fix a resolution Dν of the braid diagram, obtained by replacing each crossing by an arc (0-resolution) or a wide edge (1-resolution). By [F2] the reduced Koszul homology of Dν is HH∙(R,B(Dν)), and by [F1] the term of the termwise complex attached to the same choice of resolutions is HH∙ of the corresponding tensor product of local terms, which is the same bimodule B(Dν) when the reduced bimodules Bs are assigned to the wide edges and R to arcs; therefore the resolution-wise contributions coincide up to the fixed shifts, and the identification is natural for bimodule maps.

2.1F3F4step 1.1algebra

Intertwining the differentials. Two adjacent resolutions differ at one crossing, and the differential of the cube complex at that edge is χ0 (positive crossing) or the corrected χ1 (negative crossing) on the Khovanov-Rozansky side, and rbs or brs on the termwise Hochschild side. By [F4] the resolution-wise identifications of step 1.1 carry one into the other up to nonzero rational units and the fixed shifts, and they are compatible with the tensor products over the layers and with the Koszul signs of the total differentials; hence they assemble over the 2N resolutions into a chain isomorphism, up to the overall shift, between the complex computing HHH(σ) and the corrected original reduced Khovanov-Rozansky resolution-homology complex. The complete a=0 specialization has a second copy from its universal zero row; [F4] removes that row and retains the original theory's fixed {−1,1} shift. The consistent vertex rescalings of [F4], not independent arbitrary edge scalars, give the stated chain isomorphism.

3.1F4step 2.1algebra

Cohomology and the trigrading. Taking cohomology of the chain isomorphism of step 2.1 gives a Q-linear isomorphism HHHc,h,p(σ)≅H‾j,k,l(σ^); by [F4] the grading classes correspond by k=−h, l=p−h, j=c after the global correction, and the correction is the one that moves the one-strand class (−1,1,0) in the order (k,l,j) of the Khovanov-Rozansky theory to (0,0,0), matching the one-dimensional class of HHH in (0,0,0) for the trivial one-strand braid.

4.1F2F5step 1.1step 3.1∎

The unreduced theory. The unreduced construction carries the coefficient variable a and the trivial polynomial factor; by [F2] and The reduced Khovanov-Rozansky homology the unreduced groups are obtained from the reduced ones by adjoining that factor, so the isomorphism of step 3.1 is exactly the comparison stated in the source between HHH and the reduced homology. The only use of AC is through [F2], in step 1.1.

Depends on

Used by

Dependency tree · two levels

31 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