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.

Surjectivity modulo n-minus for free weight-generated modules (BGG 10.5)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let N∈O. Let M be a U(n−)-module that is free on weight-vector generators v1,…,vn (every element of M is a finite sum ∑iuivi with ui∈U(n−)), and let φ ⁣:M→N be a U(n−)-module map such that each image φ(vi) is a weight vector of N. Then φ is surjective if and only if the induced map φˉ ⁣:M/n−M→N/n−N is surjective.

Facts & Assumptions

Given: The Axiom of Choice, an object N of the classical category O of The classical BGG category O, a U(n−)-module M free on weight-vector generators v1,…,vn, and a U(n−)-linear map φ ⁣:M→N whose values φ(vi) on the generators are weight vectors of N.

[F1]

Every object of O is h-semisimple with finite-dimensional weight spaces, and its weight set is contained in a finite union of cones λ1−Q+,…,λr−Q+ (The support description of category O with finite generation, The classical BGG category O).

[F2]

n−=⨁α∈Φ+Cfα, so U(n−) is spanned by PBW monomials in the fα, and for a U(n−)-module the coinvariants are N/n−N (Triangular decomposition from a chosen positive root system, The PBW model of a Verma module).

[F3]

n−N=∑α∈Φ+fαN, and n−N is h-stable, so N/n−N is h-semisimple with finite-dimensional weight spaces (N/n−N)μ=Nμ/∑αfαNμ+α (The classical BGG category O).

Proof

1.1givenalgebra

If φ is surjective, then φˉ is surjective, because φ(n−M)=n−φ(M)=n−N by U(n−)-linearity, so φ induces a surjection of the quotients.

1.2F1algebra

Conversely assume φˉ surjective; we prove that every weight vector of N lies in im⁡φ by descending induction on the weight. Since the weight set of N is contained in finitely many cones λi−Q+, the set of weights ν of N with ν−μ∈Q+∖{0} is finite for every weight μ (only the finitely many cones with λi−μ∈Q+ contribute, and there the coefficients of ν−μ are bounded by those of λi−μ).

2.1F3step 1.2algebra

Inductive step. Fix a weight μ and u∈Nμ, and assume all weight vectors of N of weight >μ lie in im⁡φ. Since φˉ is surjective, uˉ is a linear combination of the classes φ(vi)‾, and each nonzero φ(vi)‾ is a weight vector because φ(vi) is a weight vector by hypothesis and the quotient map is h-equivariant. As N/n−N is h-semisimple, taking the weight-μ component of the relation lets us discard every generator whose class has weight different from μ; hence uˉ=∑iciφ(vi)‾ with ci=0 whenever wt⁡φ(vi)≠μ (for the surviving indices ci is the original coefficient and the corresponding vectors have weight μ). Therefore u−∑iciφ(vi)∈Nμ∩n−N.

3.1F2F3step 2.1algebra

By [F3] the element u−∑iciφ(vi) has weight μ and lies in n−N=∑αfαN, so its weight-μ component is a sum ∑αfαwα with wα∈Nμ+α: indeed fα lowers weights by α. Each wα has weight μ+α>μ, so wα∈im⁡φ by the induction hypothesis, and then fαwα∈im⁡φ because im⁡φ is a U(n−)-submodule. Hence u∈im⁡φ.

4.1F1step 3.1∎

The base of the induction is the case of a maximal weight, where the sum in step 3.1 is empty and u=∑iciφ(vi)∈im⁡φ; the induction is well founded by step 1.2. Since N is spanned by its weight vectors, im⁡φ=N, so φ is surjective.

Depends on

Used by

Dependency tree · two levels

13 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