Alphabeta Math
DefinitionDefinition: 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 Khovanov-Rozansky HOMFLYPT Euler series

Definition

Assume the Axiom of Choice (The Axiom of Choice) for the rationality identification via A finite graded module over a standard graded algebra has rational Hilbert series and eventual polynomial growth below. The diagram-wise formal-series construction itself requires no choice. For a braid diagram D on s(D)≥1 strands, whose closure is nonempty (The braid group by Artin presentation, The closure of a geometric braid) let ∣D∣+ and ∣D∣− be its numbers of positive and negative crossings (the source's convention: σi is positive, σi−1 negative, and the braid is clockwise oriented), and let ⟨D⟩ be the Euler characteristic of The Khovanov-Rozansky complex and trigraded braid homology. Put α:=−t−1q−1 in Z[q±1,t±1] and let α denote a fixed formal square root in T0:=Z[q±1,t±1,α±1/2,(1−q2)−1] (with α−1/2 the inverse of the chosen root). The normalized Khovanov-Rozansky HOMFLYPT Euler series of D is F~(D):=α ∣D∣+−∣D∣−−s(D)+1 ⟨D⟩∈T0.

This is the normalization displayed immediately before formula (7) of Khovanov-Rozansky II (printed p. 10), designed to remove the positive and negative stabilization factors of the unnormalized Euler series.

Caveats: F~ is here a function of braid diagrams, and its Markov invariance is not asserted in this definition (it is the content of the categorification theorem at the end of the page, which uses the Markov moves of Markov conjugation and stabilization moves); the square root is formal and the exponent may be negative, so all inverses of α are used; the whole expression depends on the source's clockwise-braid and crossing conventions, which must be kept fixed. The displayed normalization is the arXiv v2 one; the published version of the same construction replaces it by Wu's half-integer regrading so that the invariant is defined without an overall shift, and the comparison between the two normalizations is part of the categorification theorem at the end of this page.

Facts & Assumptions

Given: a braid diagram D on s(D) strands with ∣D∣+ positive and ∣D∣− negative crossings, the Euler characteristic ⟨D⟩ of its trigraded homology, and AC and the ring T0=Z[q±1,t±1,α±1/2,(1−q2)−1] with a fixed square root α of α=−t−1q−1.

[F1]

The Euler characteristic ⟨D⟩=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) is defined for every braid diagram, and, under AC, the trigraded groups are well defined up to an overall shift under change of braid representative (The Khovanov-Rozansky complex and trigraded braid homology, Khovanov-Rozansky braid homology is an oriented link invariant up to shift).

[F2]

In the braid group Bn the generators are σ1,…,σn−1; a positive crossing is an occurrence of some σi and a negative crossing an occurrence of some σi−1, so ∣D∣+ and ∣D∣− depend only on the braid word presented by the diagram (The braid group by Artin presentation).

[F3]

Eliminating an internal linear row substitutes its variable in all other rows and retains the remaining quadratic relations. A closed nonempty resolution reduces to a finite Koszul complex over a polynomial ring in finitely many remaining mark variables, all of second internal degree 2 (Koszul row operations and variable exclusion preserve homotopy type).

[F4]

Finite-variable polynomial rings over a Noetherian ring are Noetherian; finite modules over them are Noetherian. Under AC, the Hilbert series of a finite graded module over a standard graded polynomial algebra over Q has Laurent-polynomial numerator and denominator a power of 1−z (If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N, Finitely generated modules over a left Noetherian ring are Noetherian, A finite graded module over a standard graded algebra has rational Hilbert series and eventual polynomial growth, The Axiom of Choice).

Proof

technique · verification of well-definedness of the exponent, of the coefficient ring, and of the unknot value
1.1F1F2algebra

The exponent is well defined. The numbers ∣D∣+ and ∣D∣− are determined by the braid word of D by [F2] and depend only on the diagram, and s(D)=n for D⊂Bn; hence the integer ∣D∣+−∣D∣−−s(D)+1 is a well-defined function of the braid diagram. The power αm is defined for every m∈Z because α is invertible in Z[q±1,t±1] and α and α−1/2 are units of T0 by construction. The remaining issue is that the Euler series is in this localized ring, proved next.

1.2F2algebra

The two stabilizations move the exponent controllably. For the positive stabilization Dσn of a diagram on n strands one has ∣Dσn∣+=∣D∣++1 and s=n+1, so the exponent ∣D∣+−∣D∣−−s+1 is unchanged; for the negative stabilization Dσn−1 one has ∣Dσn−1∣−=∣D∣−+1 and the exponent decreases by 2. This is the arithmetic reason for the choice of normalization, and it is used in the categorification theorem together with the stabilization values of the Euler series, not asserted as invariance here.

2.1F1F3F4step 1.1algebra

The rational coefficient ring. For a nonempty braid closure, the finitely many resolution complexes in [F3] are finite complexes of finite free modules over Q[x1,…,xN], after the universal (a,0) row is removed. Only finitely many first internal degrees occur. This polynomial ring is Noetherian by [F4], since Q has only the ideals 0,Q; thus their kernels, images and cohomology, and then the cohomology of the finite crossing cube, are finitely generated in each first internal degree. Split each second internal grading into its two parity classes and set z=q2. Regrading a parity class to integer degrees makes it a finite standard graded polynomial module. Hilbert-Serre [F4], under AC, writes each such series as a Laurent polynomial in q divided by a power of 1−q2. There are finitely many cochain and first internal degrees, so their signed t-weighted sum is in Z[t±1,q±1,(1−q2)−1]. Multiplication by the specified root power yields F~(D)∈T0. The rational expressions are expanded using (1−q2)−1=∑d≥0q2d when read as formal series. The zero-strand empty diagram is excluded from this normalized-link definition: its raw complex is Q[a], with deg⁡a=(2,0), and its raw v2 Euler is (1−t2)−1. Substituting s=e=0 into the normalization expression would formally give α/(1−t2) in the larger localization adjoining (1−t2)−1; this is not identified with an empty-link HOMFLYPT value.

3.1F1step 1.1step 2.1algebra∎

The unknot value. For the one-strand diagram D of the unknot one has ∣D∣+=∣D∣−=0 and s(D)=1, so the exponent is 0 and F~(D)=⟨D⟩. The direct computation of the one-mark circle gives H(D)≅Q[x]{−1,1} and ⟨D⟩=∑m≥0t−1q1+2m=t−1q/(1−q2)=t−1/(q−1−q); with α=−t−1q−1 one has α/(1−q−2)=−t−1q−1q2/(q2−1)=t−1q/(1−q2), so F~(D)=α/(1−q−2), the normalization recorded in section 7 of the source.

Depends on

Used by

Dependency tree · two levels

45 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