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.
Nonzero highest-weight images survive modulo n-minus (BGG 10.6b)
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let , let , and let be an object all of whose composition factors are of the form with . If is a -homomorphism with , where is a highest weight vector of , then ; equivalently the class of in is nonzero.
Facts & Assumptions
Given: The Axiom of Choice, , an element (fixed throughout and not necessarily the longest element), a nonzero whose composition factors are with , and a homomorphism with for a highest weight vector of .
has finite length, composition factors are additive in exact sequences, and the simple objects are the with only for (Every object of O has finite length, Composition series and composition factors of an object, The simple objects of O).
The weight set of an object of lies in a finite union of cones; every nonzero object has a weight vector killed by (a highest weight vector for a maximal weight), which generates a highest weight module with head (The support description of category O with finite generation, A Verma module has a unique simple quotient, A proper Verma submodule misses the highest-weight line).
If occurs in a composition series of then for some in Bruhat order, so ; in particular the factors of are dominated by , and distinct dot translates of have distinct weights (Jordan-Holder factors of Verma modules dominate the head (BGG 8.12), Positive coroot pairings of a dominant integral weight).
For the coinvariants are computed weight by weight as (The support description of category O with finite generation, The classical BGG category O).
Proof
Choose a weight of which is maximal in the weight poset, and a nonzero . Then : otherwise some of weight would be a weight of above , contradicting maximality. Hence is a highest weight module with head by [F2], so and in particular the hypothesis of the statement forces with .
Case 1: . Then is a highest weight module with highest weight , so its head is and because is a quotient of . By [F3] the factors of are with . Hence in Bruhat order. Since this gives and , we get and therefore ; so .
Case 2: . Let . Then , and again has all composition factors of the form with , because by additivity [F1]; moreover with since has finite length, so has strictly fewer composition factors. By induction on the number of composition factors (the base case being Case 1, which needs no induction hypothesis) we may assume . Since , this implies .
In Case 1, lies in the -weight space with maximal among the weights of ; hence for every , and by [F4] the weight- part of is . As has weight by -equivariance, .
Every of finite length falls into Case 1 or Case 2, and in Case 2 the reduction terminates; hence in all cases , as claimed.
Depends on
- Jordan-Holder factors of Verma modules dominate the head (BGG 8.12)
- Composition series and composition factors of an object
- A Verma module has a unique simple quotient
- A proper Verma submodule misses the highest-weight line
- The support description of category O with finite generation
- Verma composition multiplicities are finite
- The Axiom of Choice
- Every object of O has finite length
- Positive coroot pairings of a dominant integral weight
- The simple objects of O
- The classical BGG category O
Used by
Dependency tree · two levels
42 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
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 4.2.2 (BGG Lemma 10.6b), pp. 25-26 (standard reference, not scraped)
- A. Rocha-Caridi, Splitting criteria, Trans. AMS 262 (1980), Sec. 8, Lemma 8.1, pp. 348-349 (standard reference, not scraped)