Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Kazhdan–Lusztig polynomials in the classical q-normalization

Definition

Identify Z[q] with Z[v−2] by q↦v−2. For y≤w in Sn, put d=ℓ(w)−ℓ(y) and define the Kazhdan–Lusztig polynomial Py,w(q)∈Z[q] by Py,w(v−2)=v−dpy,w, where H‾w=∑y≤wpy,wHy is the Kazhdan–Lusztig basis of Existence and uniqueness of the Kazhdan–Lusztig basis. The parity clause of that theorem makes the right side a polynomial in v−2. The conventions are: Py,w=0 unless y≤w, Pw,w=1, Py,w has constant term 1, and for y<w its degree is at most (ℓ(w)−ℓ(y)−1)/2. The μ-coefficient is μ(y,w):=coefficient of q(ℓ(w)−ℓ(y)−1)/2 in Py,w, defined to be 0 when ℓ(w)−ℓ(y) is even; equivalently μ(y,w) is the coefficient of v in py,w. One writes μ(y∣w)≠0 when y≠w and (y<w and μ(y,w)≠0) or (w<y and μ(w,y)≠0). The dictionary with the literature is recorded for use: with the classical parameter Ts2=(q−1)Ts+q one has Hw=vℓ(w)Tw, the element H‾w is the basis element Cw′ of [EW], and hy,w=py,w with vℓ(w)−ℓ(y)Py,w(v−2)=hy,w [EW, Remark 3.2].

Remarks

The coefficient rescaling, support, constant term and degree bound use the locally proved coefficient, parity and degree clauses of Existence and uniqueness of the Kazhdan–Lusztig basis. Coefficientwise positivity is not required.

Depends on

Used by

Dependency tree · two levels

10 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