Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

First cohomology is derivations modulo inner derivations

Statement

A linear map δ:g→M is a 1-cocycle exactly when

δ([x,y])=xδ(y)−yδ(x).

The 1-coboundaries are δm(x)=xm. Hence H1(g,M)=Der⁡(g,M)/Inn⁡(g,M); for the adjoint module this is Der⁡(g)/ad⁡(g).

Facts & Assumptions

Given: A Lie algebra g and a module M.

[L1]

The CE differential has the declared low-degree formula (Chevalley–Eilenberg differential).

[L2]

Cohomology is cocycles modulo coboundaries (Lie algebra cohomology).

[L3]

Ordinary derivations obey the Leibniz rule for the adjoint module (Derivations of Lie algebras).

Proof

technique · compute in degrees zero and one
1.1L1

For a 1-cochain δ, [L1] gives (dδ)(x,y)=xδ(y)−yδ(x)−δ([x,y]). Thus its kernel is precisely the space of module-valued derivations in the displayed sense.

1.2L1L2

For m∈C0=M, [L1] gives (dm)(x)=xm, so the image consists exactly of the inner module-valued derivations. Taking the quotient in [L2] proves the first identification.

2.1L3step 1.11.2∎

If M=g with the adjoint action, step 1.1 becomes δ([x,y])=[δx,y]+[x,δy], the derivation law in [L3], while step 1.2 gives x↦[x,m]=ad⁡−m(x); its span is the same inner-derivation space. Zero algebras and zero modules satisfy the same formulas.

Depends on

Used by

Dependency tree · two levels

9 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