Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 with trivial coefficients

Example

For the trivial g-module k there is a natural isomorphism

H1(g,k)≅Hom⁡k(g/[g,g],k)=(g/[g,g])∗.

No finite-dimensionality assumption on g is needed.

Facts & Assumptions

Given: A Lie algebra g over k, with k carrying the trivial action.

[L1]

First cohomology is derivations modulo inner derivations (First cohomology is derivations modulo inner derivations).

[L2]

The quotient g/I consists of cosets, and its canonical projection q:g→g/I is linear (Quotient Lie algebras).

Verification

technique · direct
1.1L1givenalgebra

A linear map λ:g→k is a derivation precisely when λ([x,y])=x⋅λ(y)−y⋅λ(x)=0. Thus Z1(g,k) is exactly the space of linear forms vanishing on [g,g].

1.2L1algebra

Every inner derivation into the trivial module has the form x↦x⋅a=0, so B1(g,k)=0 and H1=Z1.

2.1L2step 1.1step 1.2algebra∎

Put I=[g,g]. If λ is in the space from step 1.1, define λˉ(x+I)=λ(x). This is well-defined because x+I=y+I implies x−y∈I and hence λ(x−y)=0; it is plainly linear and satisfies λ=λˉ∘q. Conversely every linear form on g/I pulls back along the linear map q from [L2] to a form vanishing on I. These constructions are linear and inverse, proving the displayed natural isomorphism together with steps 1.1–1.2. If the abelianization is zero, both sides are zero; no basis or choice is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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