Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 Φ⊆E be a reduced crystallographic root system. Then Φ is the disjoint union Φ=Φ1⊔⋯⊔Φm of nonempty root systems Φi⊆Ei:=span⁡Φi that are irreducible, pairwise orthogonal, and span E as an orthogonal direct sum E=E1⊕⋯⊕Em. More generally, if Φ=Ψ1⊔⋯⊔Ψk is any decomposition into pairwise orthogonal root systems Ψj spanning pairwise orthogonal subspaces Fj with E=⨁jFj, then each Ψj is a union of some of the Φi, and each Φi is contained in some Ψj. If the Ψj 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 E=0, this is the empty decomposition (m=0); 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 E.

[L1]

Φ is finite, spans E, 0∉Φ, sα(Φ)=Φ for all α∈Φ, every Cartan integer 2(β,α)/(α,α) is an integer, and Rα∩Φ={±α} (Reduced crystallographic Euclidean root system).

[L2]

Φ is reducible when Φ=(Φ∩E1)⊔(Φ∩E2) for an orthogonal direct decomposition E=E1⊕E2 with both Ei nonzero, and irreducible otherwise; each part of such a decomposition spans its subspace (Reducible and irreducible root systems).

[L3]

For a linear subspace V⊆E with Φ∩V≠∅, the set Φ∩V is a reduced crystallographic root system in span⁡(Φ∩V): it is finite, 0∉ it, reducedness and integrality are inherited, and for α,β∈Φ∩V one has sα(β)∈Φ∩V because sα preserves Φ and maps V into V. (Reduced crystallographic Euclidean root system)

Proof

technique · direct
1.1givenalgebra

Define a graph G with vertex set Φ, two distinct vertices α,β being joined by an edge exactly when (α,β)≠0. Let C1,…,Cm be the connected components of G, with m=0 if Φ is empty, so that Φ=C1⊔⋯⊔Cm and every Ci is nonempty.

2.1L1step 1.1algebra

If α∈Ci and β∈Cj with i≠j, then (α,β)=0, since otherwise an edge would join the two vertices and they would lie in one component. Consequently span⁡Ci⊥span⁡Cj for i≠j, and E=span⁡Φ=span⁡C1⊕⋯⊕span⁡Cm is an orthogonal direct sum.

2.2givenstep 1.1algebra

For uniqueness, let Φ=Ψ1⊔⋯⊔Ψk with each Ψj a reduced crystallographic root system in Fj=span⁡Ψj, the Fj pairwise orthogonal, and E=⨁jFj. If α∈Ψj and β∈Ψj′ with j≠j′ then (α,β)=0 because Fj⊥Fj′; hence no edge of G joins distinct parts, and each connected component Ci of G is contained in a single Ψj.

3.1L1step 2.1algebra

For each i one has Ci=Φ∩span⁡Ci. Indeed, if γ∈Φ∩span⁡Ci then γ=∑α∈Cicαα; if γ∉Ci then (γ,α)=0 for every α∈Ci by step 2.1 applied to the components, whence (γ,γ)=∑αcα(γ,α)=0 and γ=0, contradicting 0∉Φ.

4.1L2step 1.1step 3.1algebra

Each Ci is a reduced crystallographic root system in Ei=span⁡Ci: this is [L3] applied to V=Ei, whose intersection with Φ is Ci by step 3.1, and Ci spans Ei by definition. Moreover Ci is irreducible: if Ci=(Ci∩U)⊔(Ci∩V) came from an orthogonal decomposition Ei=U⊕V with both summands nonzero, then no edge of G would join a vertex in Ci∩U to a vertex in Ci∩V, so the graph G restricted to Ci would be disconnected, contradicting that Ci is a component of G.

4.2step 2.1step 3.1step 2.2algebra

Conversely each Ψj is a union of components: if γ∈Ψj then by the argument of step 3.1 applied inside the subsystem Ψj, the whole component Ci∋γ of the graph G lies in Ψj, since a root of Φ nonorthogonal to γ must lie in Fj (it is orthogonal to every other Fj′). Hence Ψj=⋃{Ci:Ci⊆Ψj}.

5.1step 3.1step 4.1

Steps 3.1 and 4.1 exhibit Φ as the disjoint union of the irreducible root systems C1,…,Cm, whose spans are pairwise orthogonal and span E; this is the asserted decomposition.

6.1L2step 4.1step 2.2step 4.2∎

If each Ψj is irreducible, discard all empty Ψj (whose spans are zero). Each remaining Ψj 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 Ψj contains exactly one component. Therefore the components C1,…,Cm are a permutation of the nonempty parts Ψj, and the decomposition into nonempty components is unique up to order. If Φ=∅, every Ψj is empty and deleting them leaves exactly the empty decomposition with E=0.

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