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.
Verma embedding for an arbitrary positive root
Statement
For , if , then .
Facts & Assumptions
Given: The determinant formula The Shapovalov determinant formula, its generic factor-hyperplane radical lemma The generic radical on a Shapovalov factor hyperplane, and the reflection conventions Root reflections and the Weyl group action and The Weyl vector rho for a chosen positive system.
A singular vector yields a Verma homomorphism (The universal property of Verma modules), and every nonzero Verma homomorphism is injective (A nonzero homomorphism between Verma modules is injective).
Proof
Put and . At weight , the determinant formula has the factor with exponent . Thus its hyperplane is a factor hyperplane, and at generic points on it the generic-radical lemma supplies a nonzero singular vector in .
In fixed PBW coordinates the maps have matrix entries polynomial in . Stack them to form one matrix . Step 1.1 says it has a nonzero kernel at a dense set of points on the affine hyperplane . Hence every maximal minor of vanishes identically on that hyperplane: a polynomial that vanishes outside a countable union of proper affine subspaces there is zero. In particular has a nonzero kernel. A vector in it is killed by every simple positive-root vector, hence by all of , and has weight .
By [F1] this vector defines a nonzero map , which is injective. Since , this is the required embedding.
Depends on
Used by
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
- Pavel Etingof, Representations of Lie Groups, Theorem 15.11 (standard reference, not scraped)