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 Bruhat graph and the BGG Verma sum in degree k
Definition
Fix a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra , positive Borel , positive system , simple roots , Weyl group and Weyl vector , as in Finite Weyl root system, lattice and chamber conventions and The root set is a reduced crystallographic root system. Let be the dominant integral weights (Integral, dominant, and strictly dominant weights) and let . Write for the dot action of The Weyl vector rho for a chosen positive system.
The Bruhat graph has vertex set ; an arrow means that is a cover in Bruhat order, i.e. and (Bruhat order on a finite Weyl group). Equivalently, and for a unique positive root (Bruhat covers are right multiplication by positive-root reflections). A square is a quadruple with , , , and .
For put
the direct sum of Verma modules (Verma modules) over the elements of of length , with its fixed direct-sum decomposition indexed by those elements. Each is an object of (The classical BGG category O), being a finite direct sum of Verma modules. The endpoints are and , where is the longest element (Finite Weyl closed chambers and stabilizers); moreover for . Because is regular (Positive coroot pairings of a dominant integral weight), the weights are pairwise distinct: forces . The integral Weyl group of The integral Weyl group of a weight therefore acts by the regular dot orbit on the indexing set.
Depends on
- Verma modules
- Bruhat order on a finite Weyl group
- Integral, dominant, and strictly dominant weights
- Finite Weyl root system, lattice and chamber conventions
- The Weyl vector rho for a chosen positive system
- The classical BGG category O
- The integral Weyl group of a weight
- The root set is a reduced crystallographic root system
- Finite Weyl positive roots and simple reflections
- Bruhat covers are right multiplication by positive-root reflections
- Positive coroot pairings of a dominant integral weight
- Finite Weyl closed chambers and stabilizers
Used by
- The BGG resolution has length the number of positive roots Corollary
- The Euler-character identity for a finite-dimensional simple module Corollary
- The BGG complex cannot be used unchanged at a singular weight Counterexample
- 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
- Bruhat covers give canonical Verma embeddings, and composites are inclusions Lemma
- Composition factors of the BGG kernel lie above the degree (BGG 10.6a) Lemma
- Dimension of the kernel modulo n-minus equals the next term (BGG 10.7) Lemma
- 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
- Tor with the trivial module is computed by the weak BGG resolution Lemma
- The BGG differential squares to zero Proposition
- The BGG resolution of a finite-dimensional simple module Theorem
Dependency tree · two levels
28 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, Sec. 2.1-2.2, pp. 3-5 (standard reference, not scraped)