Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 Kazhdan–Lusztig multiplicity matrix for the sl_3 principal block

Example

Take g=sl3 (type A2, W=S3) and the principal block, i.e. the regular integral block O0 of the weight λ=0 (0+ρ=ρ is regular). In one-line notation the labels w∈{123,213,132,231,312,321} index the weights w⋅0=0,−α1,−α2,−2α1−α2,−α1−2α2,−2ρ. All nineteen Kazhdan–Lusztig polynomials of comparable pairs in S3 equal 1 (there are nineteen pairs y≤w in the Bruhat order on S3), so [M(y⋅0):L(w⋅0)]=Py,w(1)=1  if y≤w,0  otherwise: the multiplicity matrix is the Bruhat zeta matrix of S3 (with rows y, columns w), e.g. [M(0):L(w⋅0)]=1 for all six w, [M(321⋅0):L(w⋅0)]=0 unless w=321, and M(213⋅0) has the four composition factors L(213⋅0),L(231⋅0),L(312⋅0),L(321⋅0), each once. By BGG reciprocity the Verma-flag matrix (P(w⋅0):Δ(y⋅0)) is the same zeta matrix, e.g. (P(123⋅0):Δ(y⋅0))=0 for y≠123 and (P(321⋅0):Δ(y⋅0))=1 for all y.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the multiplicity and BGG suppliers below), the one-based group S3 with its Bruhat order, the normalized Hecke algebra Hv(3) with α:=v−v−1, and sl3 with the dominant regular integral weight 0 and its principal block O0.

[F1]

Hecke algebra and bar (The normalized type-A Hecke algebra and its bar involution, The Hecke bar involution is well defined): Hsi2=1−αHsi with α=v−v−1; the bar is the semilinear multiplicative involution with Hsi‾=Hsi+α; HwHsi=Hwsi when ℓ(wsi)=ℓ(w)+1; the {Hw} form an A-basis.

[F2]

Existence and uniqueness of the Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis): H‾w is the unique bar-fixed element of Hw+∑y<wvZ[v]Hy, these elements form a basis, and H‾w=∑y≤wpy,wHy with py,w=0 unless y≤w and pw,w=1.

[F3]

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

[F4]

Bruhat order of S3 (Basic properties of the Bruhat order on Sn): the reduced-subword criterion, graded by inversion length, ranks {123},{132,213},{231,312},{321} with the eight covers (123,132), (123,213), (132,231), (132,312), (213,231), (213,312), (231,321), (312,321).

[F5]

The composition-multiplicity theorem (Simple Verma composition multiplicities are Kazhdan–Lusztig values): in the regular integral block O0, [M(y⋅0):L(w⋅0)]=Py,w(1), vanishing unless y≤w.

[F6]

BGG reciprocity (BGG reciprocity): (P(μ):Δ(ν))=[M(ν):L(μ)] for all weights, with Δ(ν)=M(ν) the Verma module of Verma modules.

[F7]

Block conventions (The regular integral dot-orbit labelling convention): for the dominant regular integral weight λ=0 of sl3 the standards are Δ(w⋅0)=M(w⋅0), the simples L(w⋅0), the projectives P(w⋅0), the dot action is w⋅0=w(ρ)−ρ, and the multiplicity notations are those of [F5] and [F6].

Verification

technique · direct
1.1F7algebra

The dot orbit. With ρ=α1+α2 for the root system A2, the dot action w⋅0=w(ρ)−ρ computes: 123⋅0=0; 213⋅0=s1(ρ)−ρ=−α1; 132⋅0=s2(ρ)−ρ=−α2; 231⋅0=(s1s2)⋅0=s1⋅(−α2)=s1(ρ−α2)−ρ=−2α1−α2; 312⋅0=(s2s1)⋅0=−α1−2α2; 321⋅0=w0(ρ)−ρ=−2ρ. The positive-root pairings of ρ are 1,1,2, and the negative-root pairings are their negatives; Weyl conjugation permutes these nonzero integral pairings, so all six weights are dot-regular and integral, so O0 is a regular integral block with the six labelled standards, simples and projectives.

1.2F1F2F4algebra

The Kazhdan–Lusztig basis of Hv(3). Put X=H213, Y=H132 and A:=X+v, B:=Y+v; by [F1] both A and B are bar-fixed, because X+v‾=(X+α)+v−1=X+v and likewise for Y. The reduced words give H231=XY, H312=YX and H321=YXY in the one-based model, so AB=H231+v(H213+H132)+v2H123 and BA=H312+v(H132+H213)+v2H123. For the length-three element, expanding (Y+v)(X+v)(Y+v) and replacing Y2 by 1−αY gives BAB=H321+v(H231+H312)+(1+v2)H132+v2H213+(v+v3)H123, hence BAB−B=H321+v(H231+H312)+v2(H132+H213)+v3H123. Each of the six elements H123, A, B, AB, BA, BAB−B is bar-fixed and lies in its top standard basis element plus a vZ[v]-span of strictly lower Bruhat elements (the lower indices are strictly lower by the rank description of [F4]); by the uniqueness in [F2] they are exactly H‾123,H‾213,H‾132,H‾231,H‾312,H‾321.

2.1F3F4step 1.2algebra

All polynomials equal 1, and the count. Reading the six expansions of step 1.2 against H‾w=∑y≤wpy,wHy gives py,w=vℓ(w)−ℓ(y) whenever y≤w: the coefficients are 1 on the diagonal, v at gap one, v2 at gap two and v3 at the longest pair. Hence [F3] gives Py,w(q)=1 for every one of the comparable pairs. By the rank description [F4] the comparable pairs are: the six diagonal pairs; for y=123 the five strict pairs; for each of y=213,132 the three strict pairs (the two rank-two elements and 321); and for each of y=231,312 the pair with 321; altogether 6+5+3+3+1+1=19 pairs, and every one has Py,w=1.

3.1F4F5step 2.1

The multiplicity matrix. By [F5] and step 2.1, [M(y⋅0):L(w⋅0)]=Py,w(1)=1 exactly when y≤w and 0 otherwise; this is the Bruhat zeta matrix of S3 with rows y and columns w. For the displayed instances: y=123 is the minimum of the Bruhat order, so [M(0):L(w⋅0)]=1 for all six w; y=321 is the maximum, so [M(321⋅0):L(w⋅0)]=0 unless w=321, where it is 1; and for y=213 the comparable columns are w=213,231,312,321 by [F4], so M(213⋅0) has exactly the four composition factors L(213⋅0),L(231⋅0),L(312⋅0),L(321⋅0), each once.

4.1F6F7step 3.1∎

The Verma-flag matrix. Applying BGG reciprocity [F6] with μ=w⋅0 and ν=y⋅0 gives (P(w⋅0):Δ(y⋅0))=[M(y⋅0):L(w⋅0)], which by step 3.1 is 1 exactly when y≤w and 0 otherwise; the interpretation of the left-hand multiplicity is the Verma-flag multiplicity of the labelled projective by [F7]. In particular (P(123⋅0):Δ(y⋅0))=0 for y≠123 (with value 1 at y=123, since 123 is the minimum and no other y lies below it) and (P(321⋅0):Δ(y⋅0))=1 for all y (all y lie below the maximum 321). So the projective-flag matrix is the same zeta matrix.

Depends on

Used by

Dependency tree · two levels

39 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