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.
Chevalley–Eilenberg cochains
Definition
For a Lie algebra over and a -module , the degree- Chevalley–Eilenberg cochains are
Set for . Since , evaluation at identifies with . Cochains may equivalently be viewed as alternating -linear maps . No finite-dimensionality or characteristic hypothesis is needed. If in the finite-dimensional case, the exterior power and hence the cochain space are zero.
Depends on
Used by
- Omitting the exterior root-weight shifts gives the wrong dot weight Counterexample
- Whitehead vanishing does not apply to the nilpotent radical Counterexample
- Chevalley–Eilenberg differential Definition
- Classical Lie-action BRST cochain complex Definition
- Central actions on nilradical cohomology factor through the Harish–Chandra projection Lemma
- Each extremal harmonic space is one-dimensional Lemma
- Gan-Ginzburg and Skryabin inputs for the type-A pyramid good grading Lemma
- The Chevalley–Eilenberg Laplacian is scalar on weight components Lemma
- The extremal weight cochain of a Weyl element is closed and unique Lemma
- Chevalley–Eilenberg cohomology computes Ext of the trivial module Proposition
- Degree-zero Lie algebra cohomology is the invariant subspace Proposition
- The normalizer acts on Lie algebra cohomology Proposition
- Kostant's nilradical cohomology theorem Theorem
- Skryabin's equivalence for the type-A Whittaker pair Theorem
Dependency tree · two levels
10 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
- Weibel, Lie Algebra Homology and Cohomology, §7.7 (standard reference, not scraped)