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.
The simple-root singular vector in a Verma module
Statement
Let be simple and put . If , then is a singular vector in of weight .
Facts & Assumptions
Given: The Verma convention Verma modules and its supplied triangular root-space decomposition, together with the reflection and Weyl-vector conventions Root reflections and the Weyl group action and The Weyl vector rho for a chosen positive system.
The PBW model identifies with as a vector space (The PBW model of a Verma module).
For a maximal-toral subalgebra of a finite-dimensional complex semisimple Lie algebra, Finite semisimple Cartan, root and string structure supplies normalized root vectors with and the corresponding relations.
Proof
The supplied root-space direct sum has zero weight space . Thus every is diagonalizable, is abelian, and its centralizer is its zero weight space ; hence it is maximal toral. Apply [L2] to choose nonzero and with . The resulting relations give, by induction, At this is zero, while [L1] shows .
For , because is not a root; hence every also kills . Its weight is , so it is singular of the stated dot weight.
Depends on
Used by
- Equal central character does not give every Verma embedding direction Counterexample
- Ordinary Weyl orbits do not classify central characters Counterexample
- Dot-conjugate type-A₂ weights have the same central character Example
- The BGG resolution for sl2 Example
- The augmentation kernel is the sum of the simple-reflection Verma submodules Lemma
- Simple-reflection embeddings of Verma modules Proposition
- Harish-Chandra isomorphism for the center Theorem
Dependency tree · two levels
18 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
- Pavel Etingof, Representations of Lie Groups, Exercise 8.15(i) (standard reference, not scraped)