An Algorithmic Proof of Suslin's Stability Theorem over Polynomial Rings
| dc.creator | Park, H. | |
| dc.creator | Woodburn, C. | |
| dc.date | 1994-05-10 | |
| dc.date.accessioned | 2026-07-07T09:06:04Z | |
| dc.date.available | 2026-07-07T09:06:04Z | |
| dc.description | 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 $SL_n(k)$ or $SL_n(k[x])$, $n\geq 2$, as a product of elementary matrices. Suslin's stability theorem states that the same is true for the multivariate polynomial ring $SL_n(k[x_1,\ldots ,x_m])$ with $n\geq 3$. 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. | |
| dc.description | 23 pages, LaTex | |
| dc.identifier | https://arxiv.org/abs/alg-geom/9405003 | |
| dc.identifier | http://arxiv.org/abs/alg-geom/9405003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/149889 | |
| dc.subject | Algebraic Geometry | |
| dc.title | An Algorithmic Proof of Suslin's Stability Theorem over Polynomial Rings | |
| dc.type | text |