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

From MaRDI portal
(Redirected from Publication:1904081)




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.




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)