Alphabeta Math
TheoremStatement: 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.

Weak BGG resolution

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ and let Πλ=L(λ) be the finite-dimensional simple module of highest weight λ. Put Bk(λ)=(Bkχ0⊗Πλ)χλ, where Bkχ0 is the base-case complex of Weak BGG resolution of the trivial module and χλ is the central character of M(λ), the tensor product being over C with diagonal g-action and the superscript denoting the generalised central-character component of χλ. Then

0→B∣Φ+∣(λ)→⋯→B1(λ)→B0(λ)→Πλ→0

is a resolution of Πλ by objects of O, and Typ⁡Bk(λ)={w∘λ:ℓ(w)=k}, each weight occurring once.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+ with simple module Πλ=L(λ), its central character χλ, and the base-case complex B∙χ0 of the trivial module.

[F1]

0→B∣Φ+∣χ0→⋯→B1χ0→B0χ0→C→0 is an exact complex of objects of O, and Typ⁡Bkχ0={w∘0:ℓ(w)=k} with each weight occurring once (Weak BGG resolution of the trivial module).

[F2]

For a finite-dimensional g-module V, the functor −⊗V (diagonal action) is exact and maps O into itself; and if N is Verma-filtered with type {ψ1,…,ψn}, then N⊗V is Verma-filtered with type the multiset union ⋃j=1n(ψj+Wt⁡V): filter N by submodules with successive quotients M(ψj) and tensor each short exact sequence with the exact functor −⊗V, using Typ⁡(M(ψ)⊗V)=ψ+Wt⁡V (Finite-dimensional tensoring preserves O, Tensoring a Verma module by a finite-dimensional module shifts the type, Type of a module with a Verma filtration).

[F3]

The projection (−)χ onto the generalised central-character component is an exact functor on O (Generalized central-character decomposition of O); for Verma-filtered N the component Nχ is Verma-filtered with Typ⁡Nχ={ψ∈Typ⁡N:χψ=χ}; and χν=χλ if and only if ν∈W∘λ={u∘λ:u∈W} (Central-character cuts of a typed module are typed by the matching weights, Central characters are dot-Weyl orbits).

[F4]

Πλ has highest weight λ: λ is a weight, λ is the unique highest weight, every weight ν of Πλ satisfies ν≤λ, i.e. λ−ν∈Q+; the weight multiset Wt⁡Πλ is W-stable, and for each u∈W the weight uλ occurs with multiplicity one (Extremal Weyl-orbit weights, Highest weight modules lie below the top weight, Simple reflections preserve weight multiplicities, Integral, dominant, and strictly dominant weights).

[F5]

Every central element z∈Z(U(g)) acts on the cyclic highest-weight module Πλ by the scalar χλ(z); consequently Πλ is its own generalised central-character component (Πλ)χλ=Πλ (Central elements act by scalars on cyclic highest-weight modules, Central characters are dot-Weyl orbits).

[F6]

For v∈W put Πv={α∈Φ+:v−1α∈Φ−}. Then #Πv=ℓ(v), v∘0=−∑α∈Πvα and vρ=ρ−∑α∈Πvα, so vρ−ρ=−∑α∈Πvα; a sum of positive roots is zero only if the index set is empty, hence Πv=∅ if and only if v=1 (Weight subsets with equal root sums are unique).

[F7]

The dot translates w∘λ for w∈W are pairwise distinct: w∘λ=w′∘λ forces w=w′ (Positive coroot pairings of a dominant integral weight). The O-objects Bk(λ) and the ambient conventions are those of The classical BGG category O.

Proof

1.1F1F2

Tensoring the exact complex of [F1] with the finite-dimensional module Πλ gives, by exactness of −⊗Πλ, an exact complex 0→B∣Φ+∣χ0⊗Πλ→⋯→B1χ0⊗Πλ→B0χ0⊗Πλ→C⊗Πλ→0 whose terms lie in O, with C⊗Πλ≅Πλ as g-modules.

1.2F4F6algebra

We classify the surviving pairs. Suppose w∘0+ν=u∘λ with ℓ(w)=k and ν∈Wt⁡Πλ. Since w∘0=wρ−ρ, this reads ν=u(λ+ρ)−wρ; applying u−1 and putting v=u−1w gives u−1ν=λ+ρ−vρ=λ+∑α∈Πvα by [F6]. Now u−1ν∈Wt⁡Πλ because the weight multiset is W-stable, so λ−u−1ν∈Q+ by [F4]; on the other hand λ−u−1ν=−∑α∈Πvα lies in −Q+. A nonnegative integral combination of positive roots lying in −Q+ is zero, so ∑α∈Πvα=0, which forces Πv=∅ and hence v=1 by [F6]; thus u=w and ν=wλ.

2.1F3F5step 1.1

Applying the exact projection functor (−)χλ to the complex of step 1.1 gives the exact complex 0→B∣Φ+∣(λ)→⋯→B1(λ)→B0(λ)→(Πλ)χλ→0 with all terms in O, and (Πλ)χλ=Πλ by [F5]. Hence the displayed sequence is a resolution of Πλ by objects of O.

3.1F1F2F3step 2.1

By [F1] each Bkχ0 is Verma-filtered with type {w∘0:ℓ(w)=k} (each weight once), so [F2] gives that Bkχ0⊗Πλ is Verma-filtered with type the multiset {w∘0+ν:ℓ(w)=k, ν∈Wt⁡Πλ}. Cutting by χλ and using [F3], the type of Bk(λ) consists exactly of those w∘0+ν with ℓ(w)=k, ν∈Wt⁡Πλ and w∘0+ν∈W∘λ, the multiplicities being inherited from the multiset above.

4.1F1F4F7step 3.1step 1.2∎

Conversely, for every w∈W of length k the weight wλ occurs in Πλ by [F4], and w∘0+wλ=w(λ+ρ)−ρ=w∘λ, so the pair (w,wλ) is a surviving pair contributing the weight w∘λ; by step 1.2 these are all the surviving pairs. For fixed w the multiplicity of w∘λ in Typ⁡Bk(λ) is therefore the product of the multiplicity of w∘0 in Typ⁡Bkχ0, which is 1 by [F1], and the multiplicity of wλ in Wt⁡Πλ, which is 1 by [F4]. Distinct w give distinct weights by [F7]. Hence Typ⁡Bk(λ)={w∘λ:ℓ(w)=k} with each weight occurring once.

Depends on

Used by

Dependency tree · two levels

73 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