Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Degree-zero Lie algebra cohomology is the invariant subspace

Statement

Let a be a Lie algebra and V an a-module. In the convention of Chevalley–Eilenberg cochains, evaluation at 1 identifies C0(a,V) with V, and Chevalley–Eilenberg differential gives (d0v)(x)=x⋅v for x∈a, v∈V. Hence H0(a,V)=Va={v∈V:x⋅v=0 for every x∈a}, so the degree-zero cohomology is the invariant subspace; for the trivial module this reads H0(a,k)=k. This normalizes the degree-zero end of the page and agrees with Zeroth Lie algebra cohomology is invariants.

Facts & Assumptions

Given: A Lie algebra a and an a-module V.

[L1]

Degree-zero cochains are Hom⁡k(Λ0a,V), and evaluation at 1∈k=Λ0a identifies this space with V; the cochain spaces vanish in negative degrees (Chevalley–Eilenberg cochains).

[L2]

The differential in degree zero is (d0v)(x)=x⋅v for all x∈a and v∈V (Chevalley–Eilenberg differential), and d1d0=0 (The Chevalley–Eilenberg differential squares to zero).

[L3]

Hq(a,V)=ker⁡dq/im⁡dq−1 (Lie algebra cohomology).

[L4]

The published statement H0(g,M)=Mg for the same Chevalley–Eilenberg convention (Zeroth Lie algebra cohomology is invariants); the module identity [x,y]v=x(yv)−y(xv) of Representations of Lie algebras is not needed below, only the action itself.

Proof

technique · compute in degree zero
1.1L1L2

By [L1] an element of C0(a,V) is the same as a vector v∈V, and d0v=0 means exactly that the linear map x↦x⋅v vanishes, that is x⋅v=0 for every x∈a. Hence ker⁡d0={v∈V:x⋅v=0 for every x∈a}.

2.1L1L3step 1.1

The space C−1(a,V) is zero by [L1], so im⁡d−1=0; substituting into [L3] gives H0(a,V)=ker⁡d0, and step 1.1 identifies this with the invariant subspace Va.

3.1L4step 1.1∎

For the trivial module the action on k is zero by definition, so every vector is invariant and H0(a,k)=k; this is the special case M=k of [L4]. If a=0 the condition x⋅v=0 is vacuous, so H0(0,V)=V; if V=0 both sides are zero.

Depends on

Used by

Dependency tree · two levels

12 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