An algorithmic proof of Suslin's stability theorem for polynomial rings

From MaRDI portal
Publication:1904081

DOI10.1006/JABR.1995.1349zbMATH Open0841.19001arXivalg-geom/9405003OpenAlexW1990716575MaRDI QIDQ1904081FDOQ1904081


Authors: Hyungju Park, Cynthia J. Woodburn Edit this on Wikidata


Publication date: 1 February 1996

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: Let k be a field. Then Gaussian elimination over k and the Euclidean division algorithm for the univariate polynomial ring k[x] allow us to write any matrix in SLn(k) or SLn(k[x]), ngeq2, as a product of elementary matrices. Suslin's stability theorem states that the same is true for the multivariate polynomial ring SLn(k[x1,ldots,xm]) with ngeq3. As Gaussian elimination gives us an algorithmic way of finding an explicit factorization of the given matrix into elementary matrices over a field, we develop a similar algorithm over polynomial rings.


Full work available at URL: https://arxiv.org/abs/alg-geom/9405003




Recommendations





Cited In (36)





This page was built for publication: An algorithmic proof of Suslin's stability theorem for polynomial rings

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