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.
Unique irreducible decomposition
Statement
Let be a reduced crystallographic root system. Then is the disjoint union of nonempty root systems that are irreducible, pairwise orthogonal, and span as an orthogonal direct sum . More generally, if is any decomposition into pairwise orthogonal root systems spanning pairwise orthogonal subspaces with , then each is a union of some of the , and each is contained in some . If the are also irreducible, deleting their empty terms makes the two decompositions agree up to order. Thus the decomposition into nonempty irreducible components is unique up to order. For and , this is the empty decomposition (); the empty root system remains irreducible under the definition, but is not counted as a component.
Facts & Assumptions
Given: A reduced crystallographic root system in the finite-dimensional real inner product space .
is finite, spans , , for all , every Cartan integer is an integer, and (Reduced crystallographic Euclidean root system).
is reducible when for an orthogonal direct decomposition with both nonzero, and irreducible otherwise; each part of such a decomposition spans its subspace (Reducible and irreducible root systems).
For a linear subspace with , the set is a reduced crystallographic root system in : it is finite, it, reducedness and integrality are inherited, and for one has because preserves and maps into . (Reduced crystallographic Euclidean root system)
Proof
Define a graph with vertex set , two distinct vertices being joined by an edge exactly when . Let be the connected components of , with if is empty, so that and every is nonempty.
If and with , then , since otherwise an edge would join the two vertices and they would lie in one component. Consequently for , and is an orthogonal direct sum.
For uniqueness, let with each a reduced crystallographic root system in , the pairwise orthogonal, and . If and with then because ; hence no edge of joins distinct parts, and each connected component of is contained in a single .
For each one has . Indeed, if then ; if then for every by step 2.1 applied to the components, whence and , contradicting .
Each is a reduced crystallographic root system in : this is [L3] applied to , whose intersection with is by step 3.1, and spans by definition. Moreover is irreducible: if came from an orthogonal decomposition with both summands nonzero, then no edge of would join a vertex in to a vertex in , so the graph restricted to would be disconnected, contradicting that is a component of .
Conversely each is a union of components: if then by the argument of step 3.1 applied inside the subsystem , the whole component of the graph lies in , since a root of nonorthogonal to must lie in (it is orthogonal to every other ). Hence .
Steps 3.1 and 4.1 exhibit as the disjoint union of the irreducible root systems , whose spans are pairwise orthogonal and span ; this is the asserted decomposition.
If each is irreducible, discard all empty (whose spans are zero). Each remaining is by step 4.2 a nonempty union of components, and by step 4.1 each component is irreducible; an irreducible root system cannot be the orthogonal disjoint union of two nonempty root subsystems, so contains exactly one component. Therefore the components are a permutation of the nonempty parts , and the decomposition into nonempty components is unique up to order. If , every is empty and deleting them leaves exactly the empty decomposition with .
Depends on
Used by
Dependency tree · two levels
3 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)