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 complex cannot be used unchanged at a singular weight
Statement refuted
The BGG construction works unchanged for every weight : with and the signed cover maps it is a complex and resolves ; in particular the hypothesis is not needed.
Facts & Assumptions
Given: with positive root , Weyl vector , , and the singular (non-dominant) weight .
The dot action is . Here is fixed by , so ; consequently , and for , and the only arrow of the Bruhat graph is the cover (The Bruhat graph and the BGG Verma sum in degree k, Finite Weyl root system, lattice and chamber conventions, The Weyl vector rho for a chosen positive system).
The mimic of the BGG differential takes for the arrow the unique-up-to-scalar nonzero homomorphism ; here this is an endomorphism of , is one-dimensional and every nonzero element of it is injective, and is the canonical surjection (The BGG differential from signed Verma maps, Homomorphism spaces between Verma modules have dimension at most one, A nonzero homomorphism between Verma modules is injective, A Verma module has a unique simple quotient).
is simple: the irreducibility criterion holds because ; note that the strict antidominant hypothesis of Antidominant regular Verma modules are simple is not met here, so that supplier alone would not cover this weight (The Verma irreducibility criterion from Shapovalov determinants).
Counterexample
Because , source and target of the only differential coincide: for a sign and a nonzero homomorphism , and ; the unaugmented chain condition holds vacuously since .
By [F2] the one-dimensional space is spanned by the identity and every nonzero element is injective; hence with , so with and .
By [F3] is simple, so the canonical surjection is an isomorphism and . Therefore : the sequence fails to be exact at , is not (that cokernel is ), and even the augmented square condition fails because .
Hence the mimic of the BGG construction at the singular weight does not resolve , so the theorem cannot be extended unchanged to arbitrary weights. Dominant integrality implies regularity of ; regularity alone does not imply dominant integrality.
Depends on
- Antidominant regular Verma modules are simple
- The Verma irreducibility criterion from Shapovalov determinants
- Homomorphism spaces between Verma modules have dimension at most one
- A nonzero homomorphism between Verma modules is injective
- The BGG differential from signed Verma maps
- The Bruhat graph and the BGG Verma sum in degree k
- The Weyl vector rho for a chosen positive system
- Finite Weyl root system, lattice and chamber conventions
- A Verma module has a unique simple quotient
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
36 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. 353 (the hypothesis $\lambda\in P^+$ in the construction) (standard reference, not scraped)
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 3.2, p. 11 (the construction requires $\lambda\in\Lambda^+$) (standard reference, not scraped)