Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

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).

Depends on

Used by

Dependency tree · two levels

58 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