SearcharxivSearch

arXiv · 2412.03688

Decomposition of matrices from $SL_ 2(K[x, y])$

Abstract

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$ can not be generated by elementary matrices. The known counterexample was pointed out by P.M. Cohn. Conversely, A.A.Suslin proved that the group $\text{SL}_{r}\left(\mathbb{K}[x_{1},\dots,x_{n}]\right)$ is generated by elementary matrices for $r\ge 3$ and arbitrary $n\geq 2$, the same is true for $n=1$ and arbitrary $r.$ It is proven that any matrix from $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ with at least one entry of degree $\le 2$ is either a product of elementary matrices or a product of elementary matrices and of a matrix similar to the one pointed out by P. Cohn. For any matrix $\begin{pmatrix}\begin{array}{cc} f & g\\ -Q & P \end{array}\end{pmatrix}\in\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$, we obtain formulas for the homogeneous components $P_i , Q_i$ for the unimodular row $(-Q, P) $ as combinations of homogeneous components of the polynomials $f, g, $ respectively, with the same coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Y. Chapovskyi, O. Kozachok, A. Petravchuk. 2024-12-04. Decomposition of matrices from $SL_ 2(K[x, y])$. https://arxiv.org/abs/2412.03688

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR