Search arXivSearch

arXiv · 1510.07143

The commutators of classical groups

Abstract

In his seminal paper, half a century ago, Hyman Bass established a commutator formula in the setting of (stable) general linear group which was the key step in defining the K_1 group. Namely, he proved that for an associative ring A with identity, E(A)=[E(A),E(A)]=[GL(A),GL(A)] where GL(A) is the stable general linear group and E(A) is its elementary subgroup. Since then, various commutator formulas have been studied in stable and non-stable settings, and for a range of classical and algebraic like-groups, mostly in relation to subnormal subgroups of these groups. The major classical theorems and methods developed include some of the splendid results of the heroes of classical algebraic K-theory; Bak, Quillen, Milnor, Suslin, Swan and Vaserstein, among others. One of the dominant techniques in establishing commutator type results is localisation. In this note we describe some recent applications of localisation methods to the study (higher/relative) commutators in the groups of points of algebraic and algebraic-like groups, such as general linear groups, GL(n,A), unitary groups GU(2n,A, Lambda) and Chevalley groups G(Phi,A). We also state some of the intermediate results as well as some corollaries of these results. This note provides a general overview of the subject and covers the current activities. It contains complete proofs of several main results to give the reader a self-contained source. We have borrowed some of the proofs from our previous papers and expositions

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. Hazrat, N. Vavilov, Z. Zhang. 2015-10-24. The commutators of classical groups. https://arxiv.org/abs/1510.07143

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

KEEP EXPLORING

Related papers

From Eigenvalues/Eigenvectors of Hypermatrices to Canonical Form of Tensors

The rings of non-square matrices based on the dimension-keeping (DK-) semi-tensor product (STP) are considered, where a virtual identity is introduced to make each ring possess an identity element. Using this ring structure, four kinds of eigenvalues/eigenvectors (EEs) of hypermatrices, namely, the ordinary EE (OEE), the universal EE (UEE), the diagonal EE (DEE), and the horizontal diagonal EE (HDEE), are proposed with respect to preassigned matricizings. The Kronecker canonical form (KCF) of non-square pencils is used to calculate the OEEs; the monic decomposition algorithm (MDA) is then applied to extract the UEEs, DEEs, and HDEEs from them. Finally, the KCF of non-square pencils is further used to construct the KCF of a tensor, which reveals all the EEs of the tensor. The KCF of a tensor not only shares the main properties of the Jordan canonical form of matrices but also includes the latter as a special case. Consequently, all the EEs of a hypermatrix are straightforwardly computable via its KCF.

math.RA

Phantom categories on 3-vertex directed DG quivers

We construct infinitely many pairwise non-derived-Morita-equivalent phantom categories $\mathcal{P}_{m}, m\in\mathbb{Z}$ from concrete directed DG quivers with 3 vertices. Moreover, there exists a fixed finite-dimensional DG algebra $C$ such that for each $m\in\mathbb{Z}$, there is a way to reassign cohomological gradings on $C$ (without changing the differential) to obtain a new DG algebra $C_{m}$ with $\mathrm{Perf}(C_{m})\cong \mathcal{P}_{m}$.

math.RA

Toeplitz multiplication and graded factorization of determinant recurrences

Toeplitz matrices are matrices whose entries are constant along each diagonal. When only finitely many diagonals are nonzero, the determinants of successively larger matrices obey a fixed linear recurrence: each new determinant is a fixed linear combination of finitely many preceding ones. We ask whether the recurrence for a complicated band can be built from recurrences for simpler factors, and show that it can. Multiplying two finite banded Toeplitz matrices reproduces the expected product throughout the interior, with discrepancies only near two opposite corners. Shifting the factors relative to the main diagonal redistributes these boundary discrepancies, and the different shifts account exactly for the pieces from which the full determinant recurrence is assembled. For several factors, all allowed shifts are described by a finite system of linear inequalities, giving a systematic decomposition of the recurrence. This viewpoint also leads to a recursive construction that works directly with polynomial coefficients, without solving for their roots. When a factorization into bounded-degree pieces is supplied, a valid recurrence can be constructed using essentially a linear number of arithmetic operations in the number of coefficients that must be output. A five-diagonal example shows how a sixth-order recurrence is assembled from two tridiagonal Toeplitz factors together with two boundary contributions.

math.RA