Non-linearizable Root Group Data
Abstract
An RGD system is called \emph{linear w.r.t. a root basis } if the commutation relations between the root groups of are `linear' in a certain sense. Moreover, is called \emph{linearizable}, if there exists a root basis such that is linear w.r.t. . For many examples of RGD systems it is easy to see that they are linear w.r.t. a concrete root basis. To the best of our knowledge, it was unclear whether RGD systems exist which are not linearizable. In this article we show that there exist uncountably many RGD systems which are not linearizable. In particular, we provide the first explicit example of such an RGD system. This expands the quote from R\'{e}my that axiom (RGD) is not only a strengthening of axiom (RGD), but is in fact stronger than it. We show that non-linearizability appears in examples of universal type, and also in examples of -spherical type. For the examples of universal type we construct an uncountable family of non-linearizable RGD systems, and for the examples of -spherical type we show that the RGD systems of type recently constructed by the author provide uncountably many non-linearizable RGD systems.
Keywords
Cite
@article{arxiv.2602.21005,
title = {Non-linearizable Root Group Data},
author = {Sebastian Bischof},
journal= {arXiv preprint arXiv:2602.21005},
year = {2026}
}
Comments
13 pages, title changed (originally: (Non-)Linearizable RGD systems); to appear in Archiv der Mathematik