Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

Whitehead vanishing does not apply to the nilpotent radical

Statement refuted

False claim. The semisimplicity hypothesis of the Whitehead lemmas can be replaced by nilpotency of the coefficient Lie algebra: for every finite-dimensional nilpotent Lie algebra a over a field of characteristic zero and every finite-dimensional a-module M, one has H1(a,M)=0.

Facts & Assumptions

Given: g=sl2(C), the positive nilpotent subalgebra n+=Ceα (abelian, one dimensional, nilpotent), and the trivial one-dimensional module C.

[L1]

For the zero bracket, [x,y]=0 for all x,y∈n+, and the trivial action satisfies x⋅a=0 for all a∈C (The special linear Lie algebra sl_2, The root sl_2 triple, Positive and negative nilpotent subalgebras and the Borel).

[L2]

The differential is (dω)(x0,…,xq)=∑i(−1)ixi⋅ω(…xi^… )+∑i<j(−1)i+jω([xi,xj],… ), and cohomology is kernel modulo image (Chevalley–Eilenberg differential, Chevalley–Eilenberg cochains, Lie algebra cohomology).

[L3]

The Whitehead lemmas require g finite-dimensional semisimple over a characteristic-zero field and M finite dimensional: then H1(g,M)=0 and H2(g,M)=0 (First Whitehead lemma, Second Whitehead lemma).

Counterexample

technique · compute $H^0$ and $H^1$ directly for the abelian nilradical
1.1L1L2

In degree zero, C0(n+,C)=C and (d0a)(x)=x⋅a=0 for every x∈n+ and a∈C by [L1]; hence d0=0 and H0(n+,C)=C.

2.1L1L2step 1.1

In degree one, C1(n+,C)=(n+)∗ and for every 1-cochain ω and x,y∈n+ one has (dω)(x,y)=x⋅ω(y)−y⋅ω(x)−ω([x,y])=0 by [L1]; moreover C2(n+,C)=Λ2(n+)∗=0 because n+ is one dimensional. Hence every 1-cochain is a cocycle, while im⁡d0=0 by step 1.1, so H1(n+,C)=(n+)∗≅C≠0.

3.1L3step 2.1∎

The algebra n+ is nilpotent and C is finite dimensional, yet H1(n+,C)≠0; the vanishing statements [L3] have the semisimplicity of the coefficient algebra g among their hypotheses, which n+ fails, so they cannot be applied here. Under the inherited choice hypotheses of the Kostant example, the same group appears as the λ=0 case of Kostant's theorem in Kostant cohomology for sl2, where H1(n+,C)=Cs⋅0=C−α.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

50 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