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.
Tensoring a Verma module by a finite-dimensional module shifts the type
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a finite-dimensional -module with weight multiset and let be a weight. Then is Verma-filtered with .
Facts & Assumptions
Given: The Axiom of Choice, a weight , a finite-dimensional -module with weight multiset , and the Verma module .
Lie's theorem for the solvable algebra : has a -stable flag with one-dimensional quotients; choosing a basis adapted to the flag, each is a weight vector of some weight and , because acts by zero on the one-dimensional quotients (Finite Lie triangularization and rank-one complete reducibility).
The PBW model: is a vector-space isomorphism , and has a PBW basis with associated graded the polynomial algebra , a domain (The PBW model of a Verma module, PBW gives an ordered monomial basis for the enveloping algebra).
Verma filtrations and their type are as in Type of a module with a Verma filtration.
A singular vector of weight in a -module determines a unique homomorphism from sending its highest weight vector to that vector (The universal property of Verma modules).
Proof
Put for . These are -submodules forming an increasing filtration of ; and . To see the latter, induct on the PBW degree of : the diagonal action satisfies plus terms of strictly smaller PBW degree in the first factor. Those terms lie in by induction, and the degree-zero tensors are its generators, so all lie in .
The vector is a weight vector of weight , since , and by [F1]. Hence the class of in is a highest weight vector of weight , and because all the other generators of lie in this class generates as a -module.
is free over on the generators . Indeed, : by [F1] the action of on stays in , and carries to . If with , choose the largest PBW degree occurring among the and take the degree- part of the relation in the associated graded : it reads with whenever and for the maximal ones; since is a domain and the are linearly independent over , all vanish, a contradiction.
Consequently is free of rank one over , generated by the class of . By The universal property of Verma modules there is a nonzero (hence surjective) homomorphism carrying the highest weight vector to ; source and target are both free of rank one over by [F2] and step 3.1, and the map carries a free generator to a free generator, so it is an isomorphism. Thus .
The filtration therefore exhibits as Verma-filtered with type .
Depends on
Used by
- Weak BGG resolution Theorem
Dependency tree · two levels
21 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.10, pp. 31-33 (standard reference, not scraped)
- P. Etingof, Representations of Lie Groups (18.757, Fall 2023), Corollary 20.5(i), p. 101 (standard reference, not scraped)