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.
Bruhat covers give canonical Verma embeddings, and composites are inclusions
Statement
Let . For every arrow of the Bruhat graph (a cover ) the inclusion of Dominant integral dot translates embed canonically in the Verma module is the unique-up-to-scalar nonzero -homomorphism between these two Verma modules, and it is injective with image a proper submodule. If and are two saturated paths, then the composites and are equal as maps : both are the inclusion of the canonical submodule . In particular the system of inclusions is path-independent, and whenever and (length gap two).
Facts & Assumptions
Given: A dominant integral weight and arrows of the Bruhat graph, i.e. covers with .
For in Bruhat order the unique singular-vector submodules and of satisfy . A nonzero homomorphism between these Verma modules exists and is unique up to scalar (Dominant integral dot translates embed canonically in the Verma module).
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).
The arrows of the Bruhat graph are the covers, and for the weights are pairwise distinct (The Bruhat graph and the BGG Verma sum in degree k).
Proof
For every , fix an embedding with image , taking to be the identity. There are only finitely many choices. For every comparable pair , define , where is the inverse from to ; [F1] gives , so this is well-defined and . These are precisely the literal submodule inclusions transported to the abstract Verma copies. For a cover , the map is nonzero and injective and spans the one-dimensional Hom space by [F2]. Its image is proper: otherwise the two Verma modules would have the same highest weight, contradicting by [F3].
For , the defining equations give . Since is injective, . The same argument for shows that the two diamond composites are equal as maps, rather than merely proportional.
More generally, for one has , so injectivity of proves . Iterating this equality gives path independence, including the claimed length-gap-two case. The normalization depends on the chosen on abstract copies; the submodules and their literal inclusions are canonical. Arbitrarily rescaled cover maps need not have equal diamond composites.
Depends on
Used by
- Unsigned Bruhat edge sums need not square to zero Counterexample
- The BGG differential from signed Verma maps Definition
- Sign cancellation in an A2 Bruhat diamond Example
- The A2 BGG resolution with six Verma summands Example
- The BGG resolution for sl2 Example
- The augmentation kernel is the sum of the simple-reflection Verma submodules Lemma
- The BGG differential induces an injection into kernel coinvariants (BGG 10.6) Lemma
- The BGG differential squares to zero Proposition
Dependency tree · two levels
25 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
- A. Rocha-Caridi, Splitting criteria, Trans. AMS 262 (1980), Sec. 10, p. 353 (choice of injections) (standard reference, not scraped)
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 3.2, p. 10 (standard reference, not scraped)