Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Reducible and irreducible root systems

Definition

Let ΦE be a reduced crystallographic root system in the finite-dimensional real inner product space E (Reduced crystallographic Euclidean root system).

Then Φ is reducible if there are linear subspaces E1,E2E with E=E1E2, (E1,E2)=0, both Ei nonzero, and Φ=(ΦE1)(ΦE2), the union being disjoint. Otherwise Φ is irreducible.

Equivalently, Φ is reducible if it is the disjoint union of two nonempty subsets Φ1,Φ2 with (Φ1,Φ2)=0, in which case one may take Ei=spanΦi: indeed if Φ=(ΦE1)(ΦE2) then Φ spans E1 and E2 separately, because otherwise a nonzero vector of Ei orthogonal to ΦEi and to E3i would be orthogonal to all of Φ and hence zero. Consequently both ΦEi are nonempty, and each of them is itself a reduced crystallographic root system in Ei whose roots are those of Φ lying in Ei.

A one-element root system is impossible: if αΦ, reflection in α sends α to the distinct root α, because α0. 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

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