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

Indecomposable projective functors are indexed by the Weyl group

Statement

Assume the Axiom of Choice. In a regular integral block with dominant representative λ:

  1. Projective functors form a Krull-Schmidt category.
  2. Their indecomposables are indexed by W, with Θw characterized by ΘwΔ(λ)≅P(w⋅λ). For a reduced word w=s1⋯sk, the functor Θw is a multiplicity-one summand of θsk⋯θs1, and every other indecomposable summand has a label x<w. In particular every indecomposable projective functor is generated as a summand by wall crossings.
  3. Two projective functors are naturally equivalent exactly when their induced operators on the Grothendieck group agree.

The characterization concerns evaluation on the dominant projective Verma; no faithfulness of that evaluation on all natural maps of arbitrary endofunctors is asserted.

Facts & Assumptions

Given: The regular integral block Oλ with dominant representative λ, its projective functors, and the wall-crossing functors θs.

[F1]

Duflo–Joseph identifies the finite adjoint part of End⁡M(λ) with Uχ, and the harmonic isotypic modules of U surject onto those of Uχ (Duflo–Joseph g-finite endomorphisms of every Verma module, Adjoint isotypic modules have the zero-weight rank). Tensor-Hom adjunction expresses a g-map E⊗M(λ)→F⊗M(λ) as a g-map F∗⊗E→End⁡M(λ), so these suppliers lift its matrix coefficients to U.

[F2]

Every standard Δ(y⋅λ) embeds in the dominant standard Δ(λ) (Dominant integral dot translates embed canonically in the Verma module, BGG reciprocity).

[F3]

Every indecomposable projective of the block is a summand of a word of wall crossings applied to Δ(λ), the top summand P(w⋅λ) occurring once and all other summands having labels x<w (Wall-crossing compositions produce the projective with the top standard label, The wall-crossing functor and its unit and counit).

[F4]

The class map c:K0(Oλ)→Z[W] is an isomorphism and the BGG matrix [P(x):Δ(y)] is unitriangular for the Bruhat order, so a projective is determined up to isomorphism by its class (The wall-crossing action on the Grothendieck group is multiplication by 1+s, BGG reciprocity, The Grothendieck group and character of O).

Proof

technique · direct
1.1F1

Let A be the class of projective functors and evaluate a natural transformation α at Δ(λ). For ambient tensor functors, lift the finite equivariant coefficient map in [F1] to U. Its tensor coefficients act on every module by the same formula, yielding a natural g-map. For projected functors, extend a map between projected evaluations by inclusion and projection to the ambient tensors, lift it there, then project on the output and include on the input. The same inclusion/retraction procedure handles functor summands. Thus evaluation is surjective on Hom spaces.

2.1F2step 1.1

The evaluation kernel is nilpotent. If α vanishes on Δ(λ), then by exactness and naturality it vanishes on every standard, since each standard embeds in Δ(λ) by [F2] and exactness preserves the embedding; on a fixed projective generator with a finite Verma flag of length k, vanishing on the standard factors strictly lowers the flag, so a composition of k such maps is zero. Hence ker⁡ is a nilpotent ideal on every finite additive functor sum.

3.1step 2.1algebra

Idempotents lift across a nilpotent ideal (if e2−e=d lies in a nilpotent ideal, replace e by e+(1−2e)d; its idempotent error lies in the square of the previous error ideal, so finitely many repetitions give an idempotent) and an element 1+nilpotent is invertible by a finite geometric series; hence decompositions and isomorphism classes of projective functors coincide with those of their evaluations at Δ(λ), and the endomorphism algebra of an indecomposable is local exactly when its evaluation is. Hom spaces are finite-dimensional for a separate reason: a natural transformation between right-exact functors is determined by its value on a finite projective generator H=⨁xP(x⋅λ), since every object has a finite presentation by sums of H. Its component is a member of the finite-dimensional space Hom⁡(FH,F′H) (maps are determined by images of finitely many weight-homogeneous generators into finite-dimensional weight spaces). Thus the functor category has finite-dimensional endomorphism algebras and split idempotents. Nilpotent-kernel lifting matches its indecomposable decompositions to those of the evaluations, proving Krull–Schmidt.

4.1F3step 3.1

By [F3] the wall word θsk⋯θs1 evaluated at Δ(λ) has the decompositions P(w⋅λ)⊕⨁x<wP(x⋅λ)mx; by step 3.1 this decomposition lifts uniquely to a decomposition of the functor, producing Θw with ΘwΔ(λ)≅P(w⋅λ) and with all other summands labelled x<w; conversely every indecomposable projective functor is a summand of such a word, so the labels w∈W exhaust the indecomposables. This proves (1) and (2).

5.1F4step 3.1∎

If two projective functors have the same class operator on K0, then their evaluations at Δ(λ) are projectives with the same class; by the unitriangular BGG matrix [F4] their indecomposable decompositions agree, so the evaluations are isomorphic, and by step 3.1 the functors are naturally equivalent; the converse is formal. This proves (3).

Depends on

Used by

Cited to discharge well-definedness by The wall-crossing functor and its unit and counit.

Dependency tree · two levels

106 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