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.
Simple-reflection embeddings of Verma modules
Statement
If , there is an embedding .
Facts & Assumptions
Given: The positive integer , the singular vector of The simple-root singular vector in a Verma module, and the universal property The universal property of Verma modules.
The PBW model identifies with as a vector space for every (The PBW model of a Verma module).
The PBW filtration has (PBW gives an ordered monomial basis for the enveloping algebra).
Proof
The singular vector has weight , so the universal property gives a homomorphism taking its highest vector to it.
By [F1], every source vector is uniquely with . Its image is , which vanishes only if in , again by [F1]. If , its highest nonzero PBW symbol and the symbol of have nonzero product in the polynomial domain of [F2]. Therefore , and the map is injective.
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
- Yiannis Sakellaridis, Verma Modules and the Category O, Proposition 3.2 (standard reference, not scraped)