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

A maximal abelian subalgebra that is not a Cartan subalgebra

Statement refuted

In every Lie algebra, a maximal abelian subalgebra is a Cartan subalgebra, so the notion of a Cartan subalgebra reduces to maximal abelianness.

Facts & Assumptions

Given: The two-dimensional complex Lie algebra g=CXCY with [X,Y]=Y and [Y,X]=Y, all other brackets zero, which satisfies alternation and Jacobi (Lie algebras over a field). A Cartan subalgebra is by definition nilpotent and equal to its normalizer (Cartan subalgebra, Normalizer of a Lie subalgebra), and CX is nilpotent because its lower central series ends at once (Lower central series and nilpotent Lie algebras). An abelian ideal is solvable, the radical contains every solvable ideal, and a finite-dimensional algebra is semisimple exactly when its radical is zero (Derived series and solvable Lie algebras, Solvable radical, Semisimple Lie algebras).

Counterexample

technique · explicit witness
1.1

The one-dimensional subalgebra CY is abelian and maximal abelian: no abelian subalgebra can strictly contain it, because g itself is not abelian, as [X,Y]=Y0. It is also a nonzero ideal, since both [X,Y] and [Y,Y] lie in CY. Being abelian it is solvable, so 0CYrad(g); consequently g is not semisimple.

givenalgebra
2.1

However Ng(CY)=g: for aX+bY one has [aX+bY,Y]=aYCY and [Y,Y]=0, so every element of g normalizes CY, while CYg. Hence CY is not a Cartan subalgebra, since a Cartan subalgebra must equal its normalizer.

givenstep 1.1algebra
3.1

The notion is therefore strictly finer than maximal abelianness in this nonsemisimple algebra: nonsemisimplicity was proved in step 1.1, and CX is a Cartan subalgebra, as [aX+bY,X]=bYCX forces b=0, so Ng(CX)=CX and CX is abelian, whereas CY is maximal abelian but not Cartan. This witnesses the failure of the claimed equivalence.

givenstep 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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