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.
Irreducibility and connected Dynkin diagrams
Statement
Let be a reduced crystallographic root system with base and Dynkin diagram (Dynkin diagram with edge multiplicity and arrow convention). Then is irreducible (Reducible and irreducible root systems) if and only if is empty or connected. In particular, for a nonempty root system irreducibility is equivalent to connectedness of the diagram. The empty alternative follows the local convention that the rank-zero root system is irreducible.
Facts & Assumptions
Given: A reduced crystallographic root system with base and its Dynkin diagram , whose vertex set is and in which are joined exactly when .
is the disjoint union of irreducible root systems spanning pairwise orthogonal nonzero subspaces, and this decomposition is unique up to order for its nonempty components (Unique irreducible decomposition, Reducible and irreducible root systems).
The simple roots form a basis of ; every root is an integral combination of simple roots with all nonzero coefficients of one sign (Simple roots form a signed integral basis).
The Cartan matrix entry vanishes exactly when (Cartan matrix of a based root system).
A positive root is simple exactly when it is not a sum of two positive roots; every root reflection preserves (Positive systems and simple roots, Reduced crystallographic Euclidean root system).
Proof
Suppose first that . If is disconnected, partition its vertices as into two nonempty unions of connected components. Then by [L3], and , are nonzero orthogonal subspaces with by [L2]. Every root has support in just one side. Otherwise, after replacing a root by its negative if necessary, choose a positive root of least height whose support meets both and . It is not simple, so [L4] writes for positive roots . Minimality makes each summand supported on one side, and because is mixed they lie on opposite sides; hence . Reflection in then gives but has nonzero simple-root coefficients of both signs, contradicting [L2]. Thus is an orthogonal splitting with both parts nonempty, and is reducible.
If is reducible, write as an orthogonal union of nonempty subsystems spanning orthogonal nonzero subspaces by [L1]. Put . Every simple root belongs to exactly one , so . Each is nonempty: choose a positive root and expand it in the basis using [L2]; orthogonal projection to the other component, together with linear independence of the simple roots there, forces all coefficients from to vanish, while leaves a coefficient from . Since , no edge of joins to , and is disconnected.
For , steps 1.1 and 1.2 prove the two implications by contraposition, so irreducibility is equivalent to connectedness of . For , the spanning axiom gives and the base and diagram are empty; the zero space has no splitting into two nonzero subspaces, so this root system is irreducible by [L1]. Conversely an empty diagram gives by [L2], hence . Thus in all ranks irreducibility is equivalent to the diagram being empty or connected.
Depends on
Used by
Dependency tree · two levels
11 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)
- Pavel Etingof, MIT 18.745 Lie Groups and Lie Algebras I, Lectures 19-24 (standard reference, not scraped)