3
$\begingroup$

Let $R$ be a ring. An elementary matrix over $R$ is a matrix with $1$s along the diagonal and at most one other nonzero entry. Let $\text{EL}_n(R)$ denote the subgroup of $\text{GL}_n(R)$ generated by the elementary matrices.

I understand that $\text{EL}_n(R) = \text{SL}_n(R)$ provided that $R$ is a Euclidean domain.

Why does $\text{EL}_n(\mathbf{Z}[X_1,\ldots,X_m]) = \text{SL}_n(\mathbf{Z}[X_1,\ldots,X_m])$?

$\endgroup$
2
  • 4
    $\begingroup$ Don't you also need to add $n\geq 3$? $\endgroup$ Feb 29, 2012 at 0:47
  • $\begingroup$ Yes I think so. $\endgroup$ Mar 1, 2012 at 11:18

1 Answer 1

7
$\begingroup$

This is the "Suslin stability theorem". There is an algorithmic proof in Park+ Woodburn, "An algorithmic proof of the Suslin stability theorem for polynomial rings."

$\endgroup$
1
  • 1
    $\begingroup$ As Gjergji Zaimi notes in his comment, Suslin's theorem does require the assumption $n \geq 3$. $\endgroup$ Mar 1, 2012 at 0:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.