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.

Irreducibility and connected Dynkin diagrams

Statement

Let ΦE be a reduced crystallographic root system with base Δ and Dynkin diagram Γ (Dynkin diagram with edge multiplicity and arrow convention). Then Φ is irreducible (Reducible and irreducible root systems) if and only if Γ is empty or connected. In particular, for a nonempty root system irreducibility is equivalent to connectedness of the diagram. The empty alternative follows the local convention that the rank-zero root system is irreducible.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with base Δ={α1,,αr} and its Dynkin diagram Γ, whose vertex set is Δ and in which αi,αj are joined exactly when (αi,αj)0.

[L1]

Φ is the disjoint union of irreducible root systems spanning pairwise orthogonal nonzero subspaces, and this decomposition is unique up to order for its nonempty components (Unique irreducible decomposition, Reducible and irreducible root systems).

[L2]

The simple roots form a basis of E; every root is an integral combination of simple roots with all nonzero coefficients of one sign (Simple roots form a signed integral basis).

[L3]

The Cartan matrix entry aij vanishes exactly when (αi,αj)=0 (Cartan matrix of a based root system).

[L4]

A positive root is simple exactly when it is not a sum of two positive roots; every root reflection preserves Φ (Positive systems and simple roots, Reduced crystallographic Euclidean root system).

Proof

technique · direct
1.1

Suppose first that Φ. If Γ is disconnected, partition its vertices as Δ=ST into two nonempty unions of connected components. Then (S,T)=0 by [L3], and U=spanS, W=spanT are nonzero orthogonal subspaces with E=UW by [L2]. Every root has support in just one side. Otherwise, after replacing a root by its negative if necessary, choose a positive root β of least height whose support meets both S and T. It is not simple, so [L4] writes β=γ+δ for positive roots γ,δ. Minimality makes each summand supported on one side, and because β is mixed they lie on opposite sides; hence (γ,δ)=0. Reflection in γ then gives sγ(β)=β2(β,γ)(γ,γ)γ=δγΦ, but δγ has nonzero simple-root coefficients of both signs, contradicting [L2]. Thus Φ=(ΦU)(ΦW) is an orthogonal splitting with both parts nonempty, and Φ is reducible.

L2L3L4algebra
1.2

If Φ is reducible, write Φ=Φ1Φ2 as an orthogonal union of nonempty subsystems spanning orthogonal nonzero subspaces by [L1]. Put Δi=ΔΦi. Every simple root belongs to exactly one Φi, so Δ=Δ1Δ2. Each Δi is nonempty: choose a positive root βΦi and expand it in the basis Δ using [L2]; orthogonal projection to the other component, together with linear independence of the simple roots there, forces all coefficients from Δ3i to vanish, while β0 leaves a coefficient from Δi. Since (Φ1,Φ2)=0, no edge of Γ joins Δ1 to Δ2, and Γ is disconnected.

L1L2L3algebra
2.1

For Φ, steps 1.1 and 1.2 prove the two implications by contraposition, so irreducibility is equivalent to connectedness of Γ. For Φ=, the spanning axiom gives E=0 and the base and diagram are empty; the zero space has no splitting into two nonzero subspaces, so this root system is irreducible by [L1]. Conversely an empty diagram gives E=0 by [L2], hence Φ=. Thus in all ranks irreducibility is equivalent to the diagram being empty or connected.

L1L2step 1.1step 1.2algebra

Depends on

Used by

Dependency tree · two levels

11 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