Alphabeta Math
CorollaryStatement: 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 normalized graded Euler series of HHH recovers HOMFLYPT

Statement

Assume the Axiom of Choice, inherited from the comparison HHH is isomorphic to reduced Khovanov-Rozansky homology and the rationality/oriented-link descent of Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial. Let σ be a braid word with nonempty braid closure and braid diagram D on s(D)≥1 strands and closure D^, and form the Euler characteristic of HHH in the corrected trigrading (c,h,p) with the sign (−1)c on the cohomological (Rouquier) degree and the marked variables of the dictionary a=−h, q=p−h, t=c: ⟨HHH(σ)⟩:=∑h,p,c(−1)ct−hqp−hdim⁡QHHHc,h,p(σ). Then the normalized series E(σ):=(tq−1(1−q2))−1α ∣D∣+−∣D∣−−s(D)+1 ⟨HHH(σ)⟩ is the HOMFLYPT invariant of the closure in the v2 normalization of The normalized Khovanov-Rozansky HOMFLYPT Euler series and Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial: E(σ)=F~(D^), the Markov-invariant v2 series with one-strand value α/(1−q−2); here ∣D∣+,∣D∣− are the crossing numbers of D, s(D) its number of strands and α=−t−1q−1. Equivalently ⟨HHH(σ)⟩=tq−1(1−q2)α s(D)−1−∣D∣++∣D∣− F~(D^), so applying the explicit diagram-dependent normalization factor to the HHH Euler series gives the v2 HOMFLYPT series of the closure. That factor is (tq−1(1−q2))−1α ∣D∣+−∣D∣−−s(D)+1; adjoining the trivial factor Q[x], which multiplies the reduced Euler characteristic by (1−q2)−1, recovers the unreduced series of The normalized Khovanov-Rozansky HOMFLYPT Euler series.

Caveats: the formula is stated in the integer grading of the Khovanov-Rozansky theory of The Khovanov-Rozansky complex and trigraded braid homology, in which raw homology changes under stabilization by the specified overall shifts, removed by the displayed series normalization; the sign (−1)c is the one carried by the cohomological (Rouquier) degree, the Hochschild degree entering the weights only through the shifts k=−h and l=p−h, and it is read off the global correction of the comparison and verified on the one-strand braid; the HOMFLYPT normalization is the v2 one of the cited items, namely the series F~ with one-strand value α/(1−q−2)=t−1q/(1−q2); the published function F of the categorification theorem uses the distinct normalization F(unknot)=(t−1−t)/(q−q−1). This corollary identifies HHH with the v2 series only and makes no explicit formula comparison between the two Euler normalizations.

Facts & Assumptions

Given: a braid word σ with diagram D on s(D) strands, its closure D^, the corrected trigrading of the comparison, and AC.

[F1]

The comparison gives HHHc,h,p(σ)≅H‾j,k,l(D^) at raw degrees j=c, k=−h−1, l=p−h+1; applying the fixed correction (k,l)↦(k+1,l−1) gives corrected degrees (−h,p−h) (HHH is isomorphic to reduced Khovanov-Rozansky homology).

[F2]

The reduced Khovanov-Rozansky homology satisfies H(D)≅H‾(D)⊗QQ[x] for the trivial variable x, and the reduced unknot is one-dimensional; the coefficient a is retained in the reduced construction (The reduced Khovanov-Rozansky homology).

[F3]

The Khovanov-Rozansky complex of a braid diagram has trigraded cohomology H(D)=⨁j,k,lHk,lj(D) with the integer-graded Euler characteristic ⟨D⟩=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) (The Khovanov-Rozansky complex and trigraded braid homology).

[F4]

The series F~(D)=α∣D∣+−∣D∣−−s(D)+1⟨D⟩ with α=−t−1q−1 is invariant under all Markov moves and has one-strand value α/(1−q−2); it is the v2 form of the HOMFLYPT function, whose published-normalization version F satisfies F(unknot)=(t−1−t)/(q−q−1) (The normalized Khovanov-Rozansky HOMFLYPT Euler series, Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial).

[F5]

AC is the choice-function principle (The Axiom of Choice), used through [F1] and the rationality/oriented-link descent of [F4].

Proof

technique · direct
1.1F1F3givenalgebra

Read the Euler characteristic through the raw dictionary of [F1]: j=c, k=−h−1, l=p−h+1. Its raw weight is (−1)jtkql=t−1q (−1)ct−hqp−h. Consequently ⟨HHH(σ)⟩=tq−1∑j,k,l(−1)jtkqldim⁡QH‾k,lj(D^)=tq−1⟨H‾(D^)⟩. The constant records precisely the corrected grading used for HHH.

2.1F2F3step 1.1algebra

The trivial factor. By [F2] the unreduced theory is H≅H‾⊗QQ[x], and the trivial variable x has internal degree 2 in the second bigrading of the tower Q[x]{−1,1} of the one-mark circle; the tower therefore contributes ∑m≥0q2m=(1−q2)−1 to the Euler characteristic, so ⟨H‾(D^)⟩=(1−q2)⟨H(D^)⟩. Substituting into step 1.1 gives ⟨HHH(σ)⟩=tq−1(1−q2)⟨H(D^)⟩.

3.1F4F5step 2.1algebra

The invariant normalization. By [F4] and [F3], ⟨H(D^)⟩=α s(D)−1−∣D∣++∣D∣−F~(D^); substituting into step 2.1 gives the displayed identity for ⟨HHH(σ)⟩, and dividing by the explicit factor (tq−1(1−q2))α s(D)−1−∣D∣++∣D∣− shows that the normalized series E(σ) of the statement equals F~(D^), the Markov-invariant v2 HOMFLYPT series of the closure. Adjoining the trivial factor of step 2.1 recovers the unreduced series. AC is used through [F1] and the rationality/oriented-link descent of [F4].

4.1F4step 3.1algebra∎

Verification on the one-strand braid. For the trivial one-strand braid D one has ∣D∣+=∣D∣−=0, s(D)=1, and HHH(σ∗)=Q in (0,0,0) by the base case of the comparison, so ⟨HHH(σ∗)⟩=1 and E(σ∗)=(tq−1(1−q2))−1⋅1⋅α 0=t−1q/(1−q2)=α/(1−q−2), while F~(unknot)=α/(1−q−2)=t−1q/(1−q2) by [F4]; both sides of the identity E(σ∗)=F~(unknot) are therefore equal to t−1q/(1−q2), so the sign (−1)c and the constant tq−1 of the statement are exactly those of the one-strand normalization.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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