Root System¶
Encode reflection symmetry by a finite spanning set of Euclidean vectors closed under root reflections, with integral Cartan pairings in the crystallographic setting.
Core Idea¶
A finite root system is a finite set Φ of nonzero vectors spanning a Euclidean space (E), closed under the reflection
for every root α. In the standard reduced crystallographic convention, the only scalar multiples of α in Φ are ±α and every Cartan integer \(2(\beta,\alpha)/(\alpha,\alpha)\) is integral. These axioms compress the reflection symmetry of semisimple Lie algebras and algebraic groups into a finite vector configuration.
Scope of Application¶
Root systems classify finite-dimensional complex semisimple Lie algebras and connected reductive algebraic groups with appropriate additional data. They also organize Weyl groups, representation weights, flag varieties, compact Lie groups, symmetric spaces, and special lattices. Bourbaki gives the systematic reflection, base, and classification theory. Humphreys develops the parallel Coxeter-group structure generated by the root reflections.
Clarity¶
Declare whether the system is finite, reduced, crystallographic, and irreducible; normalize root lengths only where needed; fix the inner-product convention and Cartan-matrix indexing; and distinguish roots from coroots, weights, and lattice points. State whether type labels refer to a root system, Weyl group, Lie algebra, or Dynkin diagram.
Manages Complexity¶
The root system reduces continuous Lie-theoretic symmetry to finite combinatorial data. A base records all roots as integer combinations with coefficients of one sign; a Cartan matrix records angles and length ratios; and a Dynkin diagram exposes decomposition and classification without enumerating every root.
Abstract Reasoning¶
- Extract simultaneous eigenspaces relative to a Cartan subalgebra or begin with a reflection configuration. 2. Verify finiteness, spanning, reflection closure, and the chosen integrality/reducedness axioms. 3. Choose a regular separating hyperplane and declare positive roots. 4. Identify indecomposable positive roots as simple roots. 5. Compute Cartan integers and the Cartan matrix. 6. Generate the Weyl group from simple reflections. 7. Decompose orthogonally into irreducible components.
Knowledge Transfer¶
The portable pattern is encode a large symmetry object by a finite set of generating directions plus their pairwise reflection data. It transfers to Coxeter systems and representation classification. The proposed immediate parent is Symmetry.
Relationships to Other Abstractions¶
Current abstraction Root System Domain-specific
Parents (1) — more general patterns this builds on
-
Root System is a kind of Symmetry Prime
Symmetry is the proposed immediate parent.
Hierarchy path (1) — routes to 1 parentless root
- Root System → Symmetry
Neighborhood in Abstraction Space¶
Root System sits in a sparse region of the domain-specific corpus (89th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Differential Topology & Geometric Structure (11 abstractions)
Nearest neighbors
- Iwasawa decomposition — 0.81
- Borel–de Siebenthal Theory — 0.79
- Profinite Integer — 0.79
- Bundle metric — 0.78
- Fusion Category — 0.78
Computed from structural-signature embeddings · 2026-09-08