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 BGG differential from signed Verma maps
Definition
Assume the Axiom of Choice (The Axiom of Choice). Fix and a compatible sign function , i.e. a function from the arrows of the Bruhat graph to whose product over the four edges of every square is (Compatible signs exist on the Bruhat graph). Write for the value of on the arrow whenever are elements of , and let be the canonical cover embedding of Bruhat covers give canonical Verma embeddings, and composites are inclusions.
For define a -homomorphism
out of the degree- Verma sum of The Bruhat graph and the BGG Verma sum in degree k by requiring that its component
from the summand indexed by (with ) into the summand indexed by (with ) is
and that all components between pairs of summands with or are zero. Since a finite direct sum in an abelian category is a biproduct, a family of morphisms between finitely many summands and vanishing outside the pairs just described determines a unique -homomorphism ; each lies in and for , so for as a map out of the zero object. The map is a morphism of degree for the grading by of the graded object (Chain complex in an abelian category).
Set , the canonical surjection of A Verma module has a unique simple quotient, and set for . The maps are the differentials of the BGG complex. For another compatible signing , Compatible signs exist on the Bruhat graph supplies vertex signs with and . The automorphism that multiplies the summand indexed by by satisfies : the two component coefficients agree because . Also is the identity, so this intertwines the augmentations. Hence the resulting complexes are isomorphic. Whether depends only on the square condition on and is proved in The BGG differential squares to zero.
Depends on
Used by
- The BGG complex cannot be used unchanged at a singular weight Counterexample
- Unsigned Bruhat edge sums need not square to zero Counterexample
- Sign cancellation in an A2 Bruhat diamond Example
- The A2 BGG resolution with six Verma summands Example
- The BGG resolution for sl2 Example
- 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
- The BGG differential squares to zero Proposition
- The BGG resolution of a finite-dimensional simple module Theorem
Dependency tree · two levels
26 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 for modules induced from a subalgebra of a semisimple Lie algebra, Trans. AMS 262 (1980), Sec. 10, p. 355 (definition of the maps $d_k$) (standard reference, not scraped)
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 3.2, p. 11 (standard reference, not scraped)