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

Projective Verma multiplicities are Kazhdan–Lusztig values at one

Statement

Assume the Axiom of Choice. In a regular integral type-A block Oλ, for all y,w∈W (P(w⋅λ):Δ(y⋅λ))=Py,w(1), the value at q=1 of the classical Kazhdan–Lusztig polynomial of the pair y≤w; the multiplicity is the total value at one, not an individual coefficient of Py,w, and it vanishes unless y≤w in the Bruhat order.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the projective-lift theory cited below), a regular integral type-A block Oλ with W=Sn, labels y,w∈W, and the grading variable v with q=v−2.

[F1]

The standard-rank comparison (Projective Verma multiplicities equal Soergel standard ranks): (P(w⋅λ):Δ(y⋅λ))=∑dry−1,d(Bw−1), where Bw−1 is the polynomial lift with right reduction V(P(w⋅λ))=Bˉw−1 and the rx,d are the pre-reduction graded standard-support multiplicities in the normalization of Standard graph bimodules, support filtrations and characters.

[F2]

Soergel's character theorem (Soergel's character conjecture for type A): for every x∈Sn the character of the indecomposable type-A Soergel bimodule Bx is the Kazhdan–Lusztig basis element ch(Bx)=H‾x, equivalently [Bx]↦H‾x under the identification of the split Grothendieck group with the Hecke algebra; the scalar-extension comparison identifies the rational and real versions.

[F3]

The actual standard-character normalization (Standard graph bimodules, support filtrations and characters, The type-A standard character is multiplicative, The split Grothendieck group of the Soergel category is the type-A Hecke algebra, The regular integral dot-orbit labelling convention): rx,d(B) counts the normalized standard layer Δx(d)=Rx(d−ℓ(x)) before reduction, so hΔ(B)=∑xmx(B;v)T~x with mx(B;v)=∑drx,d(B)vd and T~x=vℓ(x)Tx=Hx in the normalized standard Hecke basis of [F4]. The character hΔ equals the split-Grothendieck-ring isomorphism. Its simple value is v(Ti+1)=Hsi+v, rather than the standard Hsi; multiplying these simple values computes a Bott--Samelson character, not in general the character of an indecomposable.

[F4]

Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis): H‾w=∑y≤wpy,wHy with pw,w=1, py,w=0 unless y≤w, and simultaneous inversion symmetry py−1,w−1=py,w.

[F5]

Classical normalization (Kazhdan–Lusztig polynomials in the classical q-normalization): py,w=vℓ(w)−ℓ(y)Py,w(v−2) for y≤w, with Py,w=0 unless y≤w and Pw,w=1; specialising v=1 gives py,w(1)=Py,w(1).

[F6]

Block conventions (The regular integral dot-orbit labelling convention): (P(w⋅λ):Δ(y⋅λ)) is the Verma-flag multiplicity, V(P(w⋅λ))=Bˉw−1 is the label-inverting projective dictionary, and the support convention py,w=0 unless y≤w is the Bruhat direction fixed there.

Proof

technique · direct
1.1F1F6

The comparison of [F1] expresses the Verma-flag multiplicity of the indecomposable projective P(w⋅λ) as the total graded standard-support rank of the polynomial lift Bw−1: (P(w⋅λ):Δ(y⋅λ))=∑dry−1,d(Bw−1).

1.2F2F3F4

The character theorem [F2] gives hΔ(Bw−1)=H‾w−1=∑xpx,w−1Hx. By the coefficient formula of [F3], the left side is ∑xmx(Bw−1;v)Hx, where mx(Bw−1;v)=∑drx,d(Bw−1)vd uses the normalized polynomial standard layers before reduction. Comparing coefficients in the standard Hecke basis of [F4] yields mx(Bw−1;v)=px,w−1(v) for every x, as an identity of Laurent polynomials. This comparison uses the character formula; it does not identify an indecomposable class with a product of simple classes.

2.1F4F5step 1.1step 1.2∎

Evaluate step 1.2 at the label x=y−1 and at v=1: the left side becomes ∑dry−1,d(Bw−1), which equals the multiplicity by step 1.1, and the right side becomes py−1,w−1(1); the inversion symmetry py−1,w−1=py,w of [F4] and the specialization py,w(1)=Py,w(1) of [F5] turn this into (P(w⋅λ):Δ(y⋅λ))=Py,w(1) for all y,w∈W. The vanishing clause is the support statement py,w=0 unless y≤w of [F4] and [F5], and only the total value at one is used: no individual coefficient of Py,w is interpreted as a category-O multiplicity, and no grading on O is constructed — the grading in play is the auxiliary grading of the polynomial lift, normalized on the Soergel side.

Depends on

Used by

Dependency tree · two levels

46 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