Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (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.

The root system of a simple Lie algebra is irreducible

Statement

Let g be finite-dimensional complex simple, let h be a Cartan subalgebra, and let Φ be its root system in the Euclidean realization of lem-finite-semisimple-cartan-root-and-string-structure. Then Φ is irreducible: its graph with vertices the roots and an edge between distinct roots α,β when (α,β)≠0 is connected. Equivalently, Φ has no partition into two nonempty mutually orthogonal root subsets.

Facts & Assumptions

Given: A finite-dimensional complex simple Lie algebra, a Cartan subalgebra, its root decomposition, and the induced positive-definite root inner product.

[F1]

Finite-dimensional simple complex Lie algebra: g has no nonzero proper ideals.

[F2]

Finite semisimple Cartan, root and string structure: g=h⊕⨁α∈Φgα, [gα,gβ]⊆gα+β when α+β is a root, opposite-root brackets lie in the coroot line, and the coroots span h.

[F3]

Finite Weyl root system, lattice and chamber conventions and Finite Weyl positive roots and simple reflections: Φ is finite and reduced; simple roots and simple coroots are bases, simple reflections generate the Weyl group, and every root is a Weyl translate of a simple root.

Proof

1.1F3algebra

Form the graph whose vertices are roots and whose edges join nonorthogonal roots. Suppose it has at least two connected components, and let Φi be the roots in one component. If α∈Φi, β∉Φi, then (α,β)=0. Moreover α+β cannot be a root: if it were, (α+β,α)=(α,α)≠0 and (α+β,β)=(β,β)≠0, joining both components to the vertex α+β. Likewise β=−α is impossible across components because then (α,β)=−(α,α)≠0.

2.1F2F3step 1.1algebra

Let hi be the span of the coroots of roots in Φi and put gi=hi⊕⨁α∈Φigα. Partition the simple roots by graph component. A simple reflection from another component fixes a root orthogonal to its simple root; a reflection from the same component either fixes the root or sends it to a root still nonorthogonal to that simple root. Since every root is a Weyl translate of a simple root [F3], the coroots of each component lie in the span of that component's simple coroots. Their basis property gives h=⨁ihi. For α∈Φi and β∈Φj, i≠j, orthogonality gives β(hα)=0; step 1.1 and [F2] give [gα,gβ]=0. Thus every gi is stable under brackets with h and all root spaces, so is an ideal of g.

3.1F1F2F3step 2.1∎

Each gi is nonzero because it contains a root space. With at least two components it is proper because the root and coroot bases in [F3] split among them. This contradicts simplicity [F1]. Therefore the graph is connected, proving irreducibility.

Depends on

Dependency tree · 2 levels

Sources