Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 regular integral dot-orbit labelling convention

Definition

Fix a finite-dimensional complex semisimple Lie algebra g of type An−1 with Cartan h, positive system Φ+, Weyl vector ρ, Weyl group W (identified with Sn) and dot action w⋅λ=w(λ+ρ)−ρ. Fix a dominant regular integral weight λ, i.e. ⟨λ+ρ,α∨⟩≠0 for every root and λ integral, and let Oλ be the corresponding regular integral block in the conventions of The regular integral block and its antidominant weight: standard objects Δ(w⋅λ)=M(w⋅λ), simples L(w⋅λ), indecomposable projectives P(w⋅λ) for w∈W, with λ=e⋅λ the unique dominant and w0⋅λ the unique antidominant element and Δ(w0⋅λ)=L(w0⋅λ).

This item freezes the following conventions, each inherited from the cited suppliers and used verbatim below.

(i) Multiplicity conventions. (P(w⋅λ):Δ(y⋅λ)) is the Verma-flag multiplicity of Finite Verma flags and their multiplicities and [M(y⋅λ):L(w⋅λ)] the composition multiplicity, and (P(w⋅λ):Δ(y⋅λ))=[M(y⋅λ):L(w⋅λ)] by BGG reciprocity (BGG reciprocity).

(ii) Bruhat reversal convention. Along the bijection W∋w↦w⋅λ the Bruhat order runs opposite to the dominance order, in the two exact senses used on this page: y≤w implies w⋅λ≤y⋅λ in the dominance order, and every nonzero multiplicity forces the index direction, i.e. [M(y⋅λ):L(w⋅λ)]≠0 implies y≤w in the Bruhat order. The first sense is the inclusion direction of Dominant integral dot translates embed canonically in the Verma module (for w≥y one has M(w⋅λ)⊆M(y⋅λ), so the highest weight of the submodule is the lower one), and the second is Jordan-Holder factors of Verma modules dominate the head (BGG 8.12), which confines every composition factor of M(y⋅λ) to labels w≥y. The full statement that the two orders are isomorphic as posets is not needed here and is not asserted; only these two directions, together with the finiteness of intervals of the Bruhat order (Basic properties of the Bruhat order on Sn), are used.

(iii) Hecke and Kazhdan–Lusztig normalization. The Kazhdan–Lusztig basis H‾w=∑y≤wpy,wHy of the normalized type-A Hecke algebra (Existence and uniqueness of the Kazhdan–Lusztig basis), with py,w=vℓ(w)−ℓ(y)Py,w(v−2) in the classical q=v−2 normalization (Kazhdan–Lusztig polynomials in the classical q-normalization), support py,w=0 unless y≤w, diagonal pw,w=1, and simultaneous inversion symmetry py−1,w−1=py,w.

(iv) Soergel label and character dictionary. Write Rx for the polynomial standard graph bimodule supported at x, and Bx for the normalized indecomposable polynomial Soergel bimodule, which is generally not a standard graph bimodule. With right reduction Bˉ=B⊗SC and left coinvariant-module values of V, the projective dictionary is V(P(w⋅λ))≅Bˉw−1 (Indecomposable projectives correspond to indecomposable Soergel modules). The graph label x corresponds to the standard Δ(x−1⋅λ). The individual support ranks are measured on the polynomial lift before reduction, as in Verma-flag multiplicities are standard-filtration ranks under V; no separated graph-support filtration of the reduced module is asserted.

For degree bookkeeping use precisely the standard-generator normalization of Standard graph bimodules, support filtrations and characters: Δx(d)=Rx(d−ℓ(x)), and rx,d(B) counts these normalized polynomial standard layers. Thus the coefficient polynomial is mx(B;v):=∑drx,d(B)vd,hΔ(B)=∑xmx(B;v)T~x,T~x=vℓ(x)Tx. Here T~x is the normalized standard Hecke element Hx used in clause (iii) and The normalized type-A Hecke algebra and its bar involution. The published Soergel split-Grothendieck-ring convention instead names its simple Kazhdan--Lusztig generators Hi=v(Ti+1)=T~si+v; these must not be confused with the standard element Hsi=vTi (The split Grothendieck group of the Soergel category is the type-A Hecke algebra). The standard-character supplier The type-A standard character is multiplicative identifies hΔ with that split-Grothendieck-ring isomorphism. This records the coefficient normalization, and does not infer the image of a general indecomposable Bx by multiplying simple generators. In particular the character theorem must be used to identify hΔ(Bx) with H‾x; a product of simple Soergel classes is a Bott--Samelson class and need not be [Bx]. The inverse labels and all rank comparisons above use auxiliary polynomial gradings only; forgetting them gives the ordinary projective dictionary.

Depends on

Used by

Dependency tree · two levels

90 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