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.
Direct summands of Verma-filtered objects are Verma-filtered
Statement
Assume the Axiom of Choice (The Axiom of Choice). If is a direct sum decomposition in and is Verma-filtered (Finite Verma flags and their multiplicities), then both and are Verma-filtered.
Facts & Assumptions
Given: The Axiom of Choice, a Verma-filtered object with a fixed Verma flag of length , and an enumeration of the two summands.
If and is a subobject, then . The weights of are the union of the weights of the factors of any Verma flag, and a maximal weight of is the label of some factor (Finite Verma flags and their multiplicities).
If is maximal among the weights of a Verma-filtered object with a flag of length and is a vector of weight , then is a highest-weight vector, the induced homomorphism is injective, and the cokernel has a Verma flag of length (Peeling a maximal-weight Verma from a standard filtration).
If is exact and and are Verma-filtered, then is Verma-filtered: concatenating a flag of with the preimages of a flag of gives a flag of . [F1]
Proof
If then , so and both summands are Verma-filtered with the empty flag.
Let . The finite set of labels of the fixed flag has a maximal element ; every weight of lies below one of those labels, so a weight strictly above would force a flag label strictly above it. Thus is a maximal element of the set of weights of , with no greatest-label assumption. By [F1] the weight is the label of some factor of the fixed flag: it lies in for a factor , so , while is a weight of and is maximal, so comparability forces . Choose a nonzero vector of weight ; writing with , some is again a maximal-weight vector, and after exchanging the names of the summands we may assume . Assume as induction hypothesis that every Verma-filtered direct sum with a flag of length has Verma-filtered summands.
By [F2] the induced homomorphism is injective with image in (its image is the submodule generated by ) and cokernel Verma-filtered with a flag of length . Since , [F1] gives ; the induction hypothesis applies to this Verma-filtered direct sum of flag length , so and are Verma-filtered. From the exact sequence , both ends Verma-filtered, [F3] makes Verma-filtered.
By induction on , steps 1.1 and 2.1 show that whenever is Verma-filtered, both summands are Verma-filtered.
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
- Lin Chen, lecture notes (Spring 2024), Lecture 9, Lemma 1.7 with proof (standard reference, not scraped)
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Sec. 20.2 (standard reference, not scraped)