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 Cartan subalgebra of an arbitrary Lie algebra means a maximal abelian subalgebra
Statement
In an arbitrary Lie algebra, "Cartan subalgebra" means a maximal abelian subalgebra, the two notions being interchangeable.
Facts & Assumptions
Given: The two-dimensional complex Lie algebra with , which is a Lie algebra because the bracket is alternating and, on a basis with a single nonzero product, all Jacobi identities reduce to and its alternating variants. A Cartan subalgebra is nilpotent and equal to its normalizer (Cartan subalgebra, Normalizer of a Lie subalgebra), and nilpotence for the one-dimensional subalgebra is the vanishing of the lower central series (Lower central series and nilpotent Lie algebras, Lie algebras over a field).
Refutation
The subalgebra is maximal abelian: it is one-dimensional, hence abelian, and itself is not abelian, so no abelian subalgebra strictly contains it.
But is not a Cartan subalgebra: equals , because and ; a Cartan subalgebra would have to equal its normalizer, and .
The definition is nevertheless not vacuous: is a Cartan subalgebra of , since forces , so , and is abelian and therefore nilpotent. Thus a maximal abelian subalgebra of an arbitrary Lie algebra need not be a Cartan subalgebra, and the proposed identification fails.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter II (standard reference, not scraped)