Non-linearizable root group data

From MaRDI portal





The article proves the existence of RGD systems which are not linearizable. An RGD system \(D\) is called linear with respect to a reduced root basis \(B\) if, for every prenilpotent pair of distinct roots \(\{\alpha,\beta\}\), the commutator \([U_\alpha,U_\beta]\) is generated by those root groups corresponding to the algebraic interval \((\alpha,\beta)^B_{\mathrm{lin}}\). It is called linearizable if this holds for some reduced root basis \(B\).\N\NThe main result states that there exist uncountably many RGD systems which are not linearizable. This shows that the linear version of the commutation axiom is genuinely stronger than the usual RGD commutation axiom. The article proves this phenomenon in two different settings: for RGD systems of universal type and for RGD systems of type \((4,4,4)\) over \(\mathbb{F}_2\).\N\NFor universal type, the construction uses commutator blueprints and produces uncountably many examples whose prescribed commutator relations force non-linearizability. For type \((4,4,4)\) over \(\mathbb{F}_2\), the examples come from RGD systems recently constructed by the author; the paper shows that their commutation relations cannot be made linear with respect to any reduced root basis associated with the Coxeter system.











This page was built for publication: Non-linearizable root group data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288480)