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.
Dominant integral dot translates embed canonically in the Verma module
Statement
Let and . Then in the strong linkage order, so embeds in ; the image is the submodule generated by the (unique up to scalar) singular vector of weight in . If in Bruhat order, then , and the inclusion is the unique-up-to-scalar nonzero element of .
Facts & Assumptions
Given: A dominant integral weight and elements ; the dot action .
If and , then there is an embedding (Verma embedding for an arbitrary positive root).
means that there are weights and positive roots with and ; the empty chain gives . This is the definition in The strong linkage order on weights.
Every nonzero homomorphism between Verma modules is injective, and for all weights (A nonzero homomorphism between Verma modules is injective, Homomorphism spaces between Verma modules have dimension at most one).
For and a positive root , and is regular (Positive coroot pairings of a dominant integral weight).
For a positive root and its reflection : if and only if (Finite Weyl strong exchange and deletion).
A Bruhat relation is witnessed by a saturated reflection chain with , and , choosing each since (Bruhat order on a finite Weyl group).
A homomorphism is determined by the image of the highest weight vector, which must be a vector of weight killed by ; such nonzero vectors are exactly the singular vectors of weight (The universal property of Verma modules).
Proof
We prove by induction on that and that embeds in with image generated by a singular vector of weight . For the chain is empty and the identity embeds in itself. If , choose a reduced word with ; then and by induction. Since , step [F5] gives ; hence by [F4]. So [F2] provides the one-step chain , which concatenated with the inductive chain gives , and [F1] gives an embedding that we compose with .
Now let . By [F6] fix a saturated chain with and . At each step the pairing is a positive integer: , and gives by [F5], so . Hence [F1] gives embeddings for all , whose composite embeds in ; the pair is nonzero in , which is one dimensional by [F3].
By the embeddings constructed in step 1.1, , of dimension exactly by [F3]; its image is the submodule generated by the image of the highest weight vector, which by [F7] is the unique-up-to-scalar singular vector of weight in . This proves the first two assertions.
Both the composite and the embedding of step 2.1 are nonzero elements of the one-dimensional space ; rescaling the chosen embedding by the reciprocal scalar makes the composite equal to the canonical embedding, so after this normalisation the image of lies inside the image of inside , i.e. for the canonical singular-vector submodules. The stated uniqueness is exactly the one-dimensionality of [F3].
Depends on
- Positive coroot pairings of a dominant integral weight
- Bruhat covers are right multiplication by positive-root reflections
- Verma embedding for an arbitrary positive root
- Homomorphism spaces between Verma modules have dimension at most one
- A nonzero homomorphism between Verma modules is injective
- The strong linkage order on weights
- The integral Weyl group of a weight
- The strong linkage principle for Verma modules
- Finite Weyl strong exchange and deletion
- Bruhat order on a finite Weyl group
- The universal property of Verma modules
Used by
- Unsigned Bruhat edge sums need not square to zero Counterexample
- The A2 BGG resolution with six Verma summands Example
- The BGG resolution for sl2 Example
- Bruhat covers give canonical Verma embeddings, and composites are inclusions Lemma
- The augmentation kernel is the sum of the simple-reflection Verma submodules Lemma
Dependency tree · two levels
30 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. 3.1-3.2, pp. 9-11 (standard reference, not scraped)
- N. Hemelsoet and R. Voorhaar, A computer algorithm for the BGG resolution, arXiv:1911.00871, Prop. 2.1, p. 3 (standard reference, not scraped)