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.
Central-character cuts of a typed module are typed by the matching weights
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be Verma-filtered with type , and for a central character let be the generalised central-character component (Generalized central-character subcategories). Then is Verma-filtered and , where is the central character of . In particular, by the Harish-Chandra theorem in the form Central characters are dot-Weyl orbits, consists of the elements of in the dot-Weyl orbit defining .
Facts & Assumptions
Given: The Axiom of Choice, a Verma-filtered module with a fixed filtration and weights with , and a central character .
Every decomposes canonically as into finitely many generalised central-character submodules, and the canonical projections are exact functors (Generalized central-character summands, Generalized central-character decomposition of O).
If is an exact sequence in , applying the exact projection functor gives an exact sequence , and the quotients of a filtration are computed by (F1, Type of a module with a Verma filtration).
Every cyclic highest-weight module has a well-defined central character; on every acts by the scalar , and therefore if while if (Central elements act by scalars on cyclic highest-weight modules, Generalized central-character subcategories).
if and only if lies in the dot-Weyl orbit of (Central characters are dot-Weyl orbits).
Proof
Apply the exact projection functor to each short exact sequence . By [F2] the result is an exact sequence , so the modules form an increasing filtration of with successive quotients .
By [F3] the quotient equals when , and is when . Deleting the redundant equalities from the filtration of step 1.1 leaves a finite filtration of whose successive quotients are exactly the Verma modules for those with . Hence is Verma-filtered and .
The final description of that set is [F4]: membership is exactly the condition that lies in the dot-Weyl orbit defining the central character.
Depends on
Used by
Dependency tree · two levels
20 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.1, Lemma 9.7, p. 31 (standard reference, not scraped)
- J. van Ekeren, Topics in representation theory (IMPA 2024), Sec. 29, pp. 123-124 (standard reference, not scraped)