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 be finite-dimensional complex simple, let 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 is connected. Equivalently, has no partition into two nonempty mutually orthogonal root subsets.
Statement references
Facts & Assumptions
Given: A finite-dimensional complex simple Lie algebra, a Cartan subalgebra, its root decomposition, and the induced positive-definite root inner product.
Finite-dimensional simple complex Lie algebra: has no nonzero proper ideals.
Finite semisimple Cartan, root and string structure: , when is a root, opposite-root brackets lie in the coroot line, and the coroots span .
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
Form the graph whose vertices are roots and whose edges join nonorthogonal roots. Suppose it has at least two connected components, and let be the roots in one component. If , , then . Moreover cannot be a root: if it were, and , joining both components to the vertex . Likewise is impossible across components because then .
Let be the span of the coroots of roots in and put . 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 . For and , , orthogonality gives ; step 1.1 and [F2] give . Thus every is stable under brackets with and all root spaces, so is an ideal of .
Each 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.