Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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.

The adjoint representation splits into simple ideals

Statement

For a finite-dimensional semisimple characteristic-zero Lie algebra, every adjoint submodule is an ideal with an ideal complement, and the irreducible adjoint summands are precisely the simple ideals.

Facts & Assumptions

Given: A semisimple Lie algebra g under its adjoint action.

[L1]

Weyl's theorem gives every submodule an invariant complement (Weyl's complete reducibility theorem).

[L2]

The algebra is a finite direct sum of simple ideals (Semisimple Lie algebras decompose into simple ideals).

Proof

technique · translate module language into ideal language
1.1L1

A subspace U⊆g is stable under the adjoint action exactly when [g,U]⊆U, which is exactly the ideal condition. Therefore [L1] says every ideal has an ideal complement.

2.1L2step 1.1∎

An irreducible adjoint summand is a nonzero ideal with no nonzero proper ideal of g. It cannot be abelian, since that would be a solvable ideal of a semisimple algebra. Its ideal complement commutes with it, so an ideal inside the summand is also an ideal of g; hence the summand is simple. Conversely, each simple factor from [L2] has no proper adjoint submodule and is irreducible. The zero algebra has the empty decomposition.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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