SearcharxivSearch

arXiv · 2007.12305

Expressing Matrices Into Products of Commutators of Involutions, Skew-Involutions, Finite Order and Skew Finite Order Matrices

Abstract

Let $R$ be an associative ring with unity $1$ and consider that $2,k$ and $2k\in \mathbb{N}$ are invertible in $R$. For $m\geq 1$ denote by $UT_n(m,R)$ and $UT_{\infty}(m,R)$, the subgroups of $UT_n(R)$ and $UT_{\infty}(R)$ respectively, which have zero entries on the first $m-1$ super diagonals. We show that every element on the groups $UT_n(m,R)$ and $UT_{\infty}(m,R)$ can be expressed as a product of two commutators of involutions and also, can be expressed as a product of two commutators of skew-involutions and involutions in $UT_{\infty}(m,R)$. Similarly, denote by $UT^{(s)}_{\infty}(R)$ the group of upper triangular infinite matrices whose diagonal entries are $s$th roots of $1$. We show that every element of the groups $UT_n(\infty,R)$ and $UT_{\infty}(m,R)$ can be expressed as a product of $4k-6$ commutators all depending of powers of elements in $UT^{(k)}_{\infty}(m,R)$ of order $k$ and, also, can be expressed as a product of $8k-6$ commutators of skew finite matrices of order $2k$ and matrices of order $2k$ in $UT^{(2k)}_{\infty}(m,R)$. If $R$ is the complex field or the real number field we prove that, in $SL_n(R)$ and in the subgroup $SL_{VK}(\infty,R)$ of the Vershik-Kerov group over $R$, each element in these groups can be decomposed into a product of commutators of elements as described above.

Explore related subjects

Keep this discovery

BibTeXRIS

Ivan Italo Gonzales Gargate, Michael Santos Gonzales Gargate. 2020-07-24. Expressing Matrices Into Products of Commutators of Involutions, Skew-Involutions, Finite Order and Skew Finite Order Matrices. https://arxiv.org/abs/2007.12305

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