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.
Verma-filtered objects are acyclic for n-minus coinvariants
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be Verma-filtered. Then for all . In particular the coinvariant functor is exact on Verma-filtered objects.
Facts & Assumptions
Given: The Axiom of Choice, a Verma-filtered object with a filtration and .
Each Verma module satisfies as a left -module, so it is free, hence projective (The PBW model of a Verma module, Tor from a projective resolution of the left module).
If the resolved variable is projective, then for all for every supplied projective resolution (Positive Tor vanishes when the resolved variable is projective).
For a short exact sequence of left -modules and the right module there is a natural long exact sequence in , ending in ; it requires Dependent Choice to supply the resolutions, and the Axiom of Choice implies Dependent Choice (The long exact Tor sequence in the left-module variable, The Axiom of Choice).
Verma filtrations and their length are as in Type of a module with a Verma filtration.
Proof
For one has : by [F1] the module is free, hence projective, and [F2] applies to a projective resolution of .
Induction on the filtration length . For we have and all Tors vanish. For use the short exact sequence and its long exact Tor sequence [F3]. Its piece has vanishing outer terms for : the first by induction and the second by step 1.1. Exactness in the middle gives for all .
For exactness of the coinvariant functor, let be a short exact sequence of Verma-filtered objects. Its long exact Tor sequence begins ; the first term vanishes by step 2.1, so is exact. Hence is exact on Verma-filtered objects.
Depends on
Used by
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. 4.2.3, pp. 27-29 (standard reference, not scraped)
- A. Rocha-Caridi, Splitting criteria, Trans. AMS 262 (1980), Sec. 7, pp. 345-348 (standard reference, not scraped)