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 resolution for sl2
Example
Assume the Axiom of Choice (The Axiom of Choice). Let with , positive root , and with dominant integral. Then and the BGG resolution of The BGG resolution of a finite-dimensional simple module reads
with the injection the canonical embedding of the Verma submodule generated by the singular vector and the surjection the canonical projection. Both end degrees are computed: , , , .
Facts & Assumptions
Given: The Axiom of Choice, with its standard positive root and , the Weyl group , a dominant integral weight with , and the BGG complex .
, , and for ; the only arrow is the cover , the first differential is with , and (The Bruhat graph and the BGG Verma sum in degree k, The BGG differential from signed Verma maps).
The canonical embedding is a nonzero -homomorphism, injective with image the submodule generated by the singular vector of weight ; it is the canonical submodule and every element of the one-dimensional space is a scalar multiple of it (The simple-root singular vector in a Verma module, Dominant integral dot translates embed canonically in the Verma module, Bruhat covers give canonical Verma embeddings, and composites are inclusions, Simple-reflection embeddings of Verma modules).
For the full augmented sequence is exact: , , and here because and is injective (The BGG resolution of a finite-dimensional simple module, The augmentation kernel is the sum of the simple-reflection Verma submodules).
The irreducible -module with highest weight has dimension (Finite-dimensional representations of sl_2); the weight satisfies , so is simple (Antidominant regular Verma modules are simple).
Verification
The terms: by [F1] and [F2], and , and for ; hence the complex is concentrated in degrees and , and the sequence displayed in the Example is the BGG complex with .
The injection: by [F3] the map is, up to the sign , the canonical embedding with image the Verma submodule generated by , and it is injective; its source is even a simple Verma module by [F5], but simplicity is not needed for the injection.
Exactness at : by [F4], and ; equivalently the middle quotient is the standard finite-dimensional quotient of dimension by [F5].
Exactness at : , since and is injective by step 1.2; this is the injectivity of a nonzero Verma map.
Combining the computed end degrees of step 1.1, the identification of the injection in step 1.2, and the exactness in steps 1.3 and 2.1, the BGG resolution of is exactly with the stated maps, and is the length of the resolution.
Depends on
- The BGG resolution of a finite-dimensional simple module
- The augmentation kernel is the sum of the simple-reflection Verma submodules
- Bruhat covers give canonical Verma embeddings, and composites are inclusions
- Simple-reflection embeddings of Verma modules
- The simple-root singular vector in a Verma module
- Antidominant regular Verma modules are simple
- The Axiom of Choice
- The Bruhat graph and the BGG Verma sum in degree k
- The BGG differential from signed Verma maps
- The Weyl vector rho for a chosen positive system
- Finite Weyl root system, lattice and chamber conventions
- Finite-dimensional representations of sl_2
- Dominant integral dot translates embed canonically in the Verma module
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
63 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.2, p. 11 (rank-one case) (standard reference, not scraped)
- P. Etingof, Lie Groups and Lie Algebras II (18.755), Sec. 25 and Sec. 25.4, pp. 134-138 (Verma modules and the U(n-) model) (standard reference, not scraped)