SearcharxivSearch

arXiv · 2003.07230

Commutators of relative and unrelative elementary subgroups in Chevalley groups

Abstract

In the present paper, which is a direct sequel of our papers [10,11,35] joint with Roozbeh Hazrat, we achieve a further dramatic reduction of the generating sets for commutators of relative elementary subgroups in Chevalley groups. Namely, let $\Phi$ be a reduced irreducible root system of rank $\ge 2$, let $R$ be a commutative ring and let $A,B$ be two ideals of $R$. We consider subgroups of the Chevalley group $G(\Phi,R)$ of type $\Phi$ over $R$. The unrelative elementary subgroup $E(\Phi,A)$ of level $A$ is generated (as a group) by the elementary unipotents $x_{\alpha}(a)$, $\alpha\in\Phi$, $a\in A$, of level $A$. Its normal closure in the absolute elementary subgroup $E(\Phi,R)$ is denoted by $E(\Phi,R,A)$ and is called the relative elementary subgroup of level $A$. The main results of [11,35] consisted in construction of economic generator sets for the mutual commutator subgroups $[E(\Phi,R,A),E(\Phi,R,B)]$, where $A$ and $B$ are two ideals of $R$. It turned out that one can take Stein---Tits---Vaserstein generators of $E(\Phi,R,AB)$, plus elementary commutators of the form $y_{\alpha}(a,b)=[x_{\alpha}(a),x_{-\alpha}(b)]$, where $a\in A$, $b\in B$. Here we improve these results even further, by showing that in fact it suffices to engage only elementary commutators corresponding to {\it one\/} long root, and that modulo $E(\Phi,R,AB)$ the commutators $y_{\alpha}(a,b)$ behave as symbols. We discuss also some further variations and applications of these results.

Explore related subjects

Keep this discovery

BibTeXRIS

Nikolai Vavilov, Zuhong Zhang. 2020-03-13. Commutators of relative and unrelative elementary subgroups in Chevalley groups. https://arxiv.org/abs/2003.07230

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA