Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

The root-space decomposition classifies real semisimple Lie algebras with no extra data

Statement

The root-space decomposition of the complexification of a real semisimple Lie algebra determines that real Lie algebra up to isomorphism, with no further data.

Facts & Assumptions

Given: The complexification of a real Lie algebra g0 is g0RC with the complex-bilinear bracket; an element x is nilpotent when adx is a nilpotent endomorphism, as in Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms with adx(y)=[x,y] from Derivations of Lie algebras; a real Lie algebra is semisimple when its radical vanishes (Simple, semisimple, and reductive Lie algebras); and sl2(C) is the algebra of The special linear Lie algebra sl_2, whose root-space decomposition over the Cartan subalgebra Ch is the one supplied by Root-space decomposition.

[L1]

In the basis (h,e,f) the Killing form of sl2 satisfies B(h,h)=8, B(e,f)=B(f,e)=4, and all other basis pairings vanish; over a characteristic-zero field, a finite-dimensional Lie algebra is semisimple if and only if its Killing form is nondegenerate (Killing form of sl_2, Cartan's semisimplicity criterion).

Refutation

technique · explicit witness
1.1

Define the two real Lie algebras sl2(R)={AM2(R):trA=0} and su2={AM2(C):A=A, trA=0}, each under the commutator bracket. Both are closed under the bracket and are three-dimensional over R: sl2(R) has basis e,f,h as in the special linear case, while the general element of su2 is (iαββiα) with αR, βC.

givenalgebra
2.1

Both real algebras are semisimple. For sl2(R), the adjoint matrices in the real basis (h,e,f) give the Killing matrix (800004040) from [L1], whose determinant is nonzero. For su2, use the real basis (ih,ef,i(e+f)). The same bracket computation gives the diagonal Killing matrix diag(8,8,8) in this basis. Thus both Killing forms are nondegenerate, and [L1] makes both algebras semisimple.

L1step 1.1algebra
2.2

Both complexify to sl2(C). For sl2(R) this is clear from the real basis e,f,h. For su2, the three real matrices (i00i), (0110), (0ii0) belong to su2 and are linearly independent over C, so the complex span of su2 is the three-dimensional space of traceless complex matrices. Hence both real algebras have the same complexification and therefore the same root-space decomposition over Ch.

givenstep 1.1algebra
2.3

They are not isomorphic: an isomorphism of real Lie algebras preserves nilpotent elements, since it conjugates adjoint operators. The element e=(0100) is a nonzero nilpotent element of sl2(R), because ade is nilpotent and nonzero. On the other hand su2 has no nonzero nilpotent element: every Asu2 is normal, hence diagonalisable over C with purely imaginary eigenvalues iθ1,iθ2, and the eigenvalues of adA on the complexification are the differences i(θjθk); if all of them vanished then θ1=θ2, so A would be a scalar multiple of the identity and then trA=0 forces A=0.

givenstep 1.1algebra
3.1

Consequently the common complexification and its root-space decomposition do not determine the real semisimple Lie algebra: sl2(R) and su2 are non-isomorphic real semisimple Lie algebras with the same complexification sl2(C), whose root decomposition is that of the previous facts. Real forms therefore require extra data, and the statement is false.

givenstep 2.1step 2.2step 2.3algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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