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

Weak BGG resolution of the trivial module

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let Bk be the standard induced complex of The standard induced resolution of the trivial module and let Bkχ0 denote its generalised central-character component at the central character χ0 of M(0). Then 0→B∣Φ+∣χ0→⋯→B1χ0→B0χ0→C→0 is a resolution of the trivial module by objects of O, and Typ⁡Bkχ0={w∘0:ℓ(w)=k}, each weight occurring once.

Facts & Assumptions

Given: The Axiom of Choice, the standard induced complex (B∙,d∙) with augmentation B0→C of The standard induced resolution of the trivial module, and the central character χ0 of M(0).

[F1]

(B∙,d∙) is a complex of objects of O with Bk≅U(n−)⊗Λk(n−), and 0→B∣Φ+∣→⋯→B0→C→0 is exact (The standard induced resolution of the trivial module, The standard induced complex is a resolution of the trivial module).

[F2]

The induced module U(g)⊗U(b)N for a finite-dimensional h-semisimple b-module N is Verma-filtered with type Wt⁡N (Induced modules from finite-dimensional B-modules have type their weights). Since g/b≅n− has weights Φ−=−Φ+, the exterior power Λk(g/b) has weight multiset Wt⁡Λk(g/b)={−∑α∈Sα:S⊆Φ+, ∣S∣=k}, so Typ⁡Bk={−∑α∈Sα:∣S∣=k}.

[F3]

The central-character projection (−)χ0 is an exact functor on O and sends a Verma-filtered module M to a Verma-filtered module with Typ⁡Mχ0={ψ∈Typ⁡M:χψ=χ0} (Generalized central-character decomposition of O, Generalized central-character summands, Central-character cuts of a typed module are typed by the matching weights).

[F4]

χψ=χ0 if and only if ψ=w∘0 for some w∈W; the weights w∘0 are pairwise distinct and w∘0=−∑α∈Πwα with Πw={α∈Φ+:w−1α∈Φ−}, #Πw=ℓ(w); if S⊆Φ+ has ∑α∈Sα=∑α∈Πwα then S=Πw (Central characters are dot-Weyl orbits, Weight subsets with equal root sums are unique, Positive coroot pairings of a dominant integral weight).

[F5]

The trivial module C has central character χ0, so Cχ0=C (Generalized central-character subcategories, Central-character cuts of a typed module are typed by the matching weights).

Proof

1.1F1F3F5

The projection functor is exact by [F3], so applying it to the exact complex of [F1] and to its augmentation gives an exact complex 0→B∣Φ+∣χ0→⋯→B1χ0→B0χ0→Cχ0→0; by [F5] this is a resolution of C by the objects Bkχ0 of O.

1.2F2F3F4

By [F2] the type of Bk is the multiset {−∑α∈Sα:S⊆Φ+, ∣S∣=k}. Cutting by χ0 and using [F3], the type of Bkχ0 consists of those sums −∑α∈Sα with χ−∑Sα=χ0; by [F4] this is equivalent to −∑α∈Sα=w∘0 for some w∈W.

2.1F4step 1.2

For every w∈W of length k the subset Πw has k elements and w∘0=−∑α∈Πwα by [F4], so w∘0 occurs in Typ⁡Bkχ0. Conversely, if S⊆Φ+ has k elements and −∑α∈Sα=w∘0=−∑α∈Πwα, then ∑Sα=∑Πwα and the uniqueness statement of [F4] gives S=Πw, so the sum is the one attached to w; in particular k=∣S∣=#Πw=ℓ(w). Distinct w give distinct weights w∘0 and distinct subsets Πw by [F4], so the correspondence w↔Πw is a bijection between the elements of length k and the surviving k-element subsets. Hence Typ⁡Bkχ0={w∘0:ℓ(w)=k} with each weight occurring once.

3.1step 1.1step 2.1∎

Steps 1.1 and 2.1 together give the asserted resolution and its type.

Depends on

Used by

Dependency tree · two levels

40 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