Every reduced crystallographic root system has a base
ProvedFamousTheorems.root_system_has_base_7bEvery reduced crystallographic root system has a base. Let be a finite reduced crystallographic root system in a vector space over a field of characteristic . Then has a base: a linearly independent subset such that every root is an integer combination of elements of with coefficients all nonnegative or all nonpositive.
The elements of a base are the simple roots. They determine the Weyl group, the Cartan matrix and the Dynkin diagram, and so the classification of root systems and of semisimple Lie algebras. The classical proof chooses a linear functional that is nonzero on all roots and takes the indecomposable positive roots.
Formalization note. Mathlib's RootPairing.nonempty_base. Mathlib treats root systems as RootPairings: a family of roots in and coroots in indexed by , with a perfect pairing between and . IsRootSystem says that the roots span and the coroots span , IsCrystallographic that the pairings of roots with coroots are integers, and IsReduced that the only roots proportional to a root are . P.Base is the type of bases in Mathlib's sense, which also requires the corresponding condition for coroots.
import Mathlib
namespace FamousTheorems
theorem root_system_has_base_7b {ι R M N : Type*} [Finite ι] [AddCommGroup M] [AddCommGroup N] [Field R] [CharZero R] [Module R M]
[Module R N] (P : RootPairing ι R M N) [P.IsRootSystem] [P.IsCrystallographic] [P.IsReduced] :
Nonempty P.Base := by sorry
end FamousTheorems