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 be the finite-dimensional simple module of highest weight . Put , where is the base-case complex of Weak BGG resolution of the trivial module and is the central character of , the tensor product being over with diagonal -action and the superscript denoting the generalised central-character component of . Then
is a resolution of by objects of , and , each weight occurring once.
Facts & Assumptions
Given: The Axiom of Choice, a dominant integral weight with simple module , its central character , and the base-case complex of the trivial module.
is an exact complex of objects of , and with each weight occurring once (Weak BGG resolution of the trivial module).
For a finite-dimensional -module , the functor (diagonal action) is exact and maps into itself; and if is Verma-filtered with type , then is Verma-filtered with type the multiset union : filter by submodules with successive quotients and tensor each short exact sequence with the exact functor , using (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).
The projection onto the generalised central-character component is an exact functor on (Generalized central-character decomposition of O); for Verma-filtered the component is Verma-filtered with ; and if and only if (Central-character cuts of a typed module are typed by the matching weights, Central characters are dot-Weyl orbits).
has highest weight : is a weight, is the unique highest weight, every weight of satisfies , i.e. ; the weight multiset is -stable, and for each the weight 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).
Every central element acts on the cyclic highest-weight module by the scalar ; consequently is its own generalised central-character component (Central elements act by scalars on cyclic highest-weight modules, Central characters are dot-Weyl orbits).
For put . Then , and , so ; a sum of positive roots is zero only if the index set is empty, hence if and only if (Weight subsets with equal root sums are unique).
The dot translates for are pairwise distinct: forces (Positive coroot pairings of a dominant integral weight). The -objects and the ambient conventions are those of The classical BGG category O.
Proof
Tensoring the exact complex of [F1] with the finite-dimensional module gives, by exactness of , an exact complex whose terms lie in , with as -modules.
We classify the surviving pairs. Suppose with and . Since , this reads ; applying and putting gives by [F6]. Now because the weight multiset is -stable, so by [F4]; on the other hand lies in . A nonnegative integral combination of positive roots lying in is zero, so , which forces and hence by [F6]; thus and .
Applying the exact projection functor to the complex of step 1.1 gives the exact complex with all terms in , and by [F5]. Hence the displayed sequence is a resolution of by objects of .
By [F1] each is Verma-filtered with type (each weight once), so [F2] gives that is Verma-filtered with type the multiset . Cutting by and using [F3], the type of consists exactly of those with , and , the multiplicities being inherited from the multiset above.
Conversely, for every of length the weight occurs in by [F4], and , so the pair is a surviving pair contributing the weight ; by step 1.2 these are all the surviving pairs. For fixed the multiplicity of in is therefore the product of the multiplicity of in , which is by [F1], and the multiplicity of in , which is by [F4]. Distinct give distinct weights by [F7]. Hence with each weight occurring once.
Depends on
- Weak BGG resolution of the trivial module
- Tensoring a Verma module by a finite-dimensional module shifts the type
- Central-character cuts of a typed module are typed by the matching weights
- Generalized central-character decomposition of O
- Central characters are dot-Weyl orbits
- Finite semisimple Cartan, root and string structure
- Finite Weyl closed chambers and stabilizers
- Finite-dimensional tensoring preserves O
- Integral, dominant, and strictly dominant weights
- The classical BGG category O
- The Axiom of Choice
- Weight subsets with equal root sums are unique
- Positive coroot pairings of a dominant integral weight
- Extremal Weyl-orbit weights
- Central elements act by scalars on cyclic highest-weight modules
- Type of a module with a Verma filtration
- Highest weight modules lie below the top weight
- Simple reflections preserve weight multiplicities
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
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 5.3, pp. 35-36 (standard reference, not scraped)
- A. Rocha-Caridi, Splitting criteria for modules induced from a subalgebra of a semisimple Lie algebra, Trans. AMS 262 (1980), Introduction p. 335 and Sec. 7 (BGG Theorem 9.9) (standard reference, not scraped)
- J. van Ekeren, Topics in representation theory (IMPA 2024), Sec. 29, pp. 122-124 (standard reference, not scraped)