Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Translation to a singular wall in type A_2

Example

Let g=sl2 and use the coordinate l=⟨λ,α∨⟩, so the dot action is s⋅l=−l−2 and the facets are (−∞,−1), {−1}, (−1,∞) (Dot-Weyl facets and single-wall translation data, Example 3.11 of the source). Take λ=−2, μ=−1. Then the singular block O−1 has the single simple L(−1)=M(−1)=P(−1), and the translation functor T=T−2−1 satisfies TM(−2)=M(−1), TM(0)=M(−1), TL(−2)=L(−1)(the label 1∈WJ),TL(0)=0(the label s∉WJ), and TP(−2)=2 P(−1), because the projective cover P(−2) of L(−2) has the Verma flag Δ(−2),Δ(0) and both factors are sent to Δ(−1).

For g=sl3 take λ=−2ρ, J={s1} and the dot-antidominant μ with μ+ρ=−ω2; then WJ={1,s2,s1s2} and by Singular category O multiplicities are parabolic Kazhdan–Lusztig values the composition and Verma-flag matrices of the singular block are [M(y⋅μ):L(w⋅μ)]=(P(w⋅μ):Δ(y⋅μ))=(100110111) in the row/column order (1, s2, s1s2): explicitly M(μ) is irreducible, M(s2⋅μ) has composition factors L(μ),L(s2⋅μ) once each, and M(s1s2⋅μ) has all three simples once; dually (P(μ):Δ(y⋅μ))=1 for all three y, (P(s2⋅μ):Δ(s2⋅μ))=(P(s2⋅μ):Δ(s1s2⋅μ))=1, with its Δ(μ) multiplicity zero, and P(s1s2⋅μ)=Δ(s1s2⋅μ) has the single top-label standard. The surviving simple labels are exactly the minimal coset representatives, so translation onto the wall kills L(w⋅λ) for w∉WJ (for instance L(s1⋅λ) and L(w0⋅λ) in the sl3 case).

Facts & Assumptions

Given: The Axiom of Choice; for sl2 the facet datum λ=−2, μ=−1 with J={s}, WJ={1}; for sl3 take λ=−2ρ and the standard parabolic J={s1}, WJ={1,s1}, WJ={1,s2,s1s2} and the dot-antidominant weight with μ+ρ=−ω2 (Dot-Weyl facets and single-wall translation data, The singular integral block and its dot stabilizer).

[F1]

Wall translation: TΔ(w⋅λ)≅Δ(w⋅μ), and TL(w⋅λ)≅L(w⋅μ) for w∈WJ, TL(w⋅λ)=0 otherwise (Translation to the wall on Verma, simple and projective objects (1),(2)); T is exact and preserves finite Verma flags.

[F2]

The most singular block: for μ=−ρ (that is μ+ρ=0) the Verma M(μ)=L(μ) is simple and its block has the single simple; the projective cover has flag [Δ(μ)] and equals L(μ), so it is projective and injective (Translation to the wall on Verma, simple and projective objects (3)).

[F3]

The singular multiplicity formula is [M(y⋅μ):L(w⋅μ)]=Pyw0,ww0(1) (Singular category O multiplicities are parabolic Kazhdan–Lusztig values). Every supported pair needed here has length gap at most two, so its value is one by the ordinary degree bound and constant term (Kazhdan–Lusztig polynomials in the classical q-normalization); unsupported pairs have value zero. The reduced-subword test is Basic properties of the Bruhat order on Sn.

[F4]

BGG reciprocity gives (P(w⋅μ):Δ(y⋅μ))=[M(y⋅μ):L(w⋅μ)] (BGG reciprocity). For the rank-one computation, PBW gives the basis fkvl of M(l) (The PBW model of a Verma module); the sl2 relations are The root sl_2 triple, and M(−2) is simple by Antidominant regular Verma modules are simple.

[F5]

The sl_3 weights: μ=−(4α1+5α2)/3, s2⋅μ=−(4α1+2α2)/3, s1s2⋅μ=−(α1+2α2)/3, with s2⋅μ−μ=α2, s1s2⋅μ−s2⋅μ=α1, s1s2⋅μ−μ=α1+α2 in Q+, and no other pairs of the three labels are dominance-linked (The singular integral block and its dot stabilizer, Dot-Weyl facets and single-wall translation data).

Verification

technique · direct: evaluate the wall-translation theorem on the two smallest wall data and read the matrices off the regular Kazhdan-Lusztig values at one
1.1F2algebra

The sl_2 singular block. For μ=−1=−ρ the dot orbit is {−1}, so O−1 has the single simple L(−1), and by [F2] M(−1)=L(−1)=P(−1)=∇(−1) is projective and injective.

1.2F1algebra

The sl_2 translation. Here WJ={1}. By [F1], TM(−2)=M(−1) and TM(0)=M(−1); and on simples TL(−2)=L(−1), while TL(0)=0 because s∉WJ.

1.3F3F4F5algebra

The sl_3 matrices. For y=(1,s2,s1s2) the products yw0=(w0,s1s2,s2) form the descending Bruhat chain w0>s1s2>s2 by reduced subwords. Their supported length gaps are zero, one or two. Thus [F3] gives the displayed LOWER unitriangular matrix A: its row y, column w is one exactly when y≥w. BGG [F4] gives the same entries for (P(w⋅μ):Δ(y⋅μ)). Thus the column at w=1 consists of three ones, the column at w=s2 has zeros at y=1 and ones at y=s2,s1s2, and the column at w=s1s2 has only the diagonal one. These are precisely the corrected projective flags displayed above; reading rows gives the unchanged simple composition factors of the three Vermas.

2.1F1F4step 1.1step 1.2algebra

The sl_2 projective. The relations in [F4] give efkvl=k(l−k+1)fk−1vl by induction using [e,f]=h and [h,f]=−2f. For l=0, the span of fkv0, k≥1, is the copy of M(−2) generated by fv0, and the quotient is the one-dimensional L(0). Since M(−2) is simple, BGG [F4] gives (P(−2):Δ(−2))=(P(−2):Δ(0))=1; the rank-one dot orbit has no further labels. Applying exact T to this Verma flag gives two factors Δ(−1)=P(−1) by [F1] and step 1.1. Every extension of these projectives splits, so TP(−2)≅P(−1)⊕P(−1).

3.1F1step 1.3algebra∎

Surviving labels. Applying [F1] to the simple labels: L(w⋅λ) survives translation iff w∈WJ={1,s2,s1s2}; hence L(s1⋅λ) and L(w0⋅λ)=L(s1s2s1⋅λ) are sent to zero, as are all other non-minimal labels. This proves every displayed assertion.

Depends on

Used by

Dependency tree · two levels

88 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