Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Wall-crossing compositions produce the projective with the top standard label

Statement

Assume the Axiom of Choice. For a dominant regular integral representative λ and a reduced word w=s1⋯sk, set θw‾=θsk⋯θs1, so that the standards follow right multiplication in word order. Then θw‾Δ(λ)≅P(w⋅λ)⊕⨁x<wP(x⋅λ)mx,mx∈Z≥0. Its class is (1+s1)⋯(1+sk) under the standard class map, with actual subexpression multiplicities. The BGG matrix satisfies (P(x⋅λ):Δ(y⋅λ))=[Δ(y⋅λ):L(x⋅λ)], vanishes unless y≤x in the Bruhat order, and has diagonal entries one. Hence the top summand P(w⋅λ) occurs once and is the only summand whose flag contains Δ(w⋅λ); the remaining multiplicities are determined by this triangular matrix and the product class. Consequently every indecomposable projective is a summand of a word of wall crossings applied to Δ(λ).

Facts & Assumptions

Given: The regular integral block Oλ with dominant representative λ, a reduced word w=s1⋯sk, and the word functor θw‾.

[F1]

The dominant Verma Δ(λ) is projective in the block: by the universal property Hom⁡Oλ(Δ(λ),N)≅Nλ, and the λ-weight functor is exact on the block because λ is the maximal weight of its linkage class; wall crossing is exact and biadjoint, hence preserves projectives; projectives have Verma flags and decompose into finitely many indecomposables (The regular integral block and its antidominant weight, The universal property of Verma modules, Projective functors on a regular integral block, Projectives in category O have finite Verma flags, Projective covers in O are indecomposable and unique, Fitting decomposition in a finite-length abelian category).

[F2]

The class of θw‾Δ(λ) is (1+s1)⋯(1+sk) with subexpression multiplicities, and every standard factor of θw‾Δ(λ) has a label ≤w in the Bruhat order (The wall-crossing action on the Grothendieck group is multiplication by 1+s, Wall-crossing acts on standard modules by a two-step extension).

[F3]

For a projective P(x⋅λ) the BGG reciprocal multiplicities (P(x⋅λ):Δ(y⋅λ))=[Δ(y⋅λ):L(x⋅λ)] vanish unless y≤x in the Bruhat order, and (P(x⋅λ):Δ(x⋅λ))=1: the nonzero-composition direction is the published label triangle, and the Bruhat form follows from strong linkage and the strong-exchange/reflection-descent criterion for the dominant orbit (BGG reciprocity, The triangular restriction on projective Verma flags, The strong linkage principle for Verma modules, Finite Weyl strong exchange and deletion, Bruhat order on a finite Weyl group, The BGG criterion for homomorphisms between Verma modules).

Proof

technique · direct
1.1F1F2

The object Y:=θw‾Δ(λ) is projective by [F1], and the block has finite-dimensional Hom spaces and finite decompositions, so Y≅⨁xP(x⋅λ)mx with nonnegative multiplicities; its standard-flag multiplicities are read from its class in [F2], and every standard factor has a label ≤w.

2.1F3step 1.1

No summand P(x⋅λ) with x≰w occurs: the diagonal entry of the BGG matrix gives (P(x⋅λ):Δ(x⋅λ))=1 by [F3], so such a summand would contribute a standard factor Δ(x⋅λ) to Y with x≰w, contradicting step 1.1.

3.1F3step 1.1step 2.1

The full subexpression contributes Δ(w⋅λ) with multiplicity one to the product class, and no other summand P(x⋅λ) with x≤w, x≠w contributes to the multiplicity of Δ(w⋅λ): (P(x⋅λ):Δ(w⋅λ))≠0 forces w≤x by [F3], so with x≤w it forces x=w. Hence mw=1, and the only summand whose flag contains Δ(w⋅λ) is P(w⋅λ).

4.1step 3.1algebra

The remaining multiplicities mx, x<w, are determined recursively from the product class: the coefficient of Δ(x⋅λ) in the class of Y equals mx+∑x<zmz(P(z⋅λ):Δ(x⋅λ)), whose second term involves only strictly larger labels already determined; solving downward in the finite Bruhat order gives all mx.

5.1step 3.1∎

Every indecomposable projective is a summand of such a word: the decomposition of step 1.1 with diagonal support realizes each P(w⋅λ) as a summand of θw‾Δ(λ) for any reduced word w, which is the stated generation statement.

Depends on

Used by

Dependency tree · two levels

67 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