Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Inverse Kazhdan–Lusztig polynomials

Definition

For x,w∈Sn set qx,w′:=∑m≥0(−1)m∑x=z0<z1<⋯<zm=wpz0,z1pz1,z2⋯pzm−1,zm∈A, where the inner sum is over strictly increasing Bruhat chains from x to w, the m=0 chain occurs only when x=w, and pu,v are the coefficients of the Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis). Every chain lies in a finite Bruhat interval by Basic properties of the Bruhat order on Sn, so the sum is finite. If x≰w there are no chains; if x=w, the empty chain gives qw,w′=1. If x<w, each chain has at least one factor pu,v∈vZ[v] with u<v, so qx,w′∈vZ[v].

Let P=(px,w) and Q′=(qx,w′). The matrix N:=P−I is strictly triangular on the finite Bruhat poset, hence nilpotent; the (x,w) entry of Nm is the sum of products over chains of m strict steps. Therefore Q′=I−N+N2−⋯+(−1)MNM=(I+N)−1=P−1, where M can be any integer at least the maximum strict-chain length. In particular, Q′P=PQ′=I and ∑zqx,z′pz,w=δx,w=∑zpx,zqz,w′.

The inverse Kazhdan–Lusztig polynomials in the classical sign convention are qx,w:=sgn(x)sgn(w)qx,w′. If Σ is the diagonal matrix with entries Σx,x=sgn(x), then Q=(qx,w)=ΣQ′Σ. Equivalently, if Dx is the basis of H∗=HomA(H,A) dual to the Kazhdan–Lusztig basis, then qx,w′=Dx(Hw), since Hw=∑zqz,w′H‾z.

Remarks

The finite chain inverse and dual-basis description use the locally proved unitriangular basis and coefficient clauses of Existence and uniqueness of the Kazhdan–Lusztig basis. Coefficientwise positivity is not required.

Depends on

Used by

Dependency tree · two levels

13 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