Documentation

TauCeti.LinearAlgebra.RootSystem.SimplyConnectedRootDatum.NonSimplyLaced

Reducedness of the non-simply-laced pinned root data #

The pinned simply connected root data of types B, C, F₄, and G₂ are reduced. For B, C, and F₄, the proof uses a criterion tailored to crystallographic root data over : if every Cartan integer has absolute value at most two, then two dependent roots have equal or opposite signs. Indeed, dependence forces the product of the two Cartan integers to be four, and the bound leaves only the pairs (2, 2) and (-2, -2). Type G₂ also has Cartan integers of absolute value three, so its small explicit coordinate table is checked directly instead.

For the classical families, the bound follows uniformly from their signed-coordinate models. For F₄, it is checked against the explicit coordinate table that defines its root datum. These instances provide the remaining reducedness hypotheses needed to apply Mathlib's Geck construction to the rational scalar extensions of the pinned data.

Main results #

References #

The pinned simply connected root datum of type B is reduced.

The pinned simply connected root datum of type C is reduced.

The pinned simply connected root datum of type F₄ is reduced.

The pinned simply connected root datum of every valid non-simply-laced Dynkin type is reduced.