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.
Reducible and irreducible root systems
Definition
Let be a reduced crystallographic root system in the finite-dimensional real inner product space (Reduced crystallographic Euclidean root system).
Then is reducible if there are linear subspaces with , , both nonzero, and the union being disjoint. Otherwise is irreducible.
Equivalently, is reducible if it is the disjoint union of two nonempty subsets with , in which case one may take : indeed if then spans and separately, because otherwise a nonzero vector of orthogonal to and to would be orthogonal to all of and hence zero. Consequently both are nonempty, and each of them is itself a reduced crystallographic root system in whose roots are those of lying in .
A one-element root system is impossible: if , reflection in sends to the distinct root , because . The zero vector space carries the empty root system under the stated root-system axioms; it is irreducible by the definition above, since the zero space has no orthogonal direct-sum decomposition into two nonzero subspaces. Every rank-one root system is likewise irreducible.
Depends on
Used by
- Existence and uniqueness of the highest root Proposition
- Irreducibility and connected Dynkin diagrams Proposition
- Restricted root systems may be nonreduced Proposition
- Unique irreducible decomposition Proposition
- Classification of irreducible root systems Theorem
- Existence of each classified root system Theorem
Dependency tree · two levels
2 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)