Alphabeta Math
False statementConstruction: 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.

Second cohomology classifies all nonabelian extensions

Statement refuted

H2(g,M) classifies all Lie-algebra extensions, including those with nonabelian kernel.

Facts & Assumptions

Given: A characteristic-zero field and the split extension displayed below.

[L1]

The H2 classification theorem applies to extensions with abelian kernel, regarded as a module (Second cohomology classifies abelian extensions).

Counterexample

technique · exhibit an extension outside the construction
1.1

Let h be the three-dimensional Heisenberg algebra and take the split extension 0hhktkt0. Its kernel is nonabelian because it contains basis elements x,y,z with [x,y]=z0.

givenconstruct
2.1

In every extension constructed from a CE 2-cocycle with coefficient module M, the kernel is M0 and its internal bracket is zero. Thus no such construction can be equivalent—by a map fixing the kernel—to the extension in step 1.1. The proof of [L1] uses abelianness both to make the quotient action independent of lifts and to turn Jacobi into the linear equation dω=0. Nonabelian kernels require outer-action and nonlinear obstruction data. Hence the word “all” is refuted.

L1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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