Skip to main content
$1$ is the natural bound when using one of the initial coefficients as a pivot
Source Link
Luc Guyot
  • 7.9k
  • 2
  • 30
  • 51

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following lemma and the two observations below.

Lemma. Let $R = \prod_i R_i$ be a direct product of unital and commutative rings $R_i$. Let $n \ge 2$ and $A = (A_i )_i\in SL_n(R) \simeq \prod_i SL_n(R_i)$. If for every $i$ the matrix $A_i$ is the product of at most $k$ elementary matrices over $R_i$, then $A$ is the product of at most $k(n^2 - n)^k$ elementary matrices over $R$. In particular, we have $A \in E_n(R)$.

Proof. Consider each matrix $A_i$ as a word $w_i$ over an alphabet of elementary matrix types (there are $n(n -1)$ types). Since there are at most $(n^2 - n)^k$ such words $w_i$, they all fit in a word of length at most $k(n^2 - n)^k$.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$ (expend $\det(A)$ and use the triangle inequality).
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only (use the above observation as a basis for an induction on $n$).

Combining the last observation with the lemma yields the result.

Let us detail the case of $SL_2(\ell^{\infty})$.

Proof for $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$$1$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following lemma and the two observations below.

Lemma. Let $R = \prod_i R_i$ be a direct product of unital and commutative rings $R_i$. Let $n \ge 2$ and $A = (A_i )_i\in SL_n(R) \simeq \prod_i SL_n(R_i)$. If for every $i$ the matrix $A_i$ is the product of at most $k$ elementary matrices over $R_i$, then $A$ is the product of at most $k(n^2 - n)^k$ elementary matrices over $R$. In particular, we have $A \in E_n(R)$.

Proof. Consider each matrix $A_i$ as a word $w_i$ over an alphabet of elementary matrix types (there are $n(n -1)$ types). Since there are at most $(n^2 - n)^k$ such words $w_i$, they all fit in a word of length at most $k(n^2 - n)^k$.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$ (expend $\det(A)$ and use the triangle inequality).
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only (use the above observation as a basis for an induction on $n$).

Combining the last observation with the lemma yields the result.

Let us detail the case of $SL_2(\ell^{\infty})$.

Proof for $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following lemma and the two observations below.

Lemma. Let $R = \prod_i R_i$ be a direct product of unital and commutative rings $R_i$. Let $n \ge 2$ and $A = (A_i )_i\in SL_n(R) \simeq \prod_i SL_n(R_i)$. If for every $i$ the matrix $A_i$ is the product of at most $k$ elementary matrices over $R_i$, then $A$ is the product of at most $k(n^2 - n)^k$ elementary matrices over $R$. In particular, we have $A \in E_n(R)$.

Proof. Consider each matrix $A_i$ as a word $w_i$ over an alphabet of elementary matrix types (there are $n(n -1)$ types). Since there are at most $(n^2 - n)^k$ such words $w_i$, they all fit in a word of length at most $k(n^2 - n)^k$.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$ (expend $\det(A)$ and use the triangle inequality).
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only (use the above observation as a basis for an induction on $n$).

Combining the last observation with the lemma yields the result.

Let us detail the case of $SL_2(\ell^{\infty})$.

Proof for $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $1$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

Explains with details why the second observation implies the result
Source Link
Luc Guyot
  • 7.9k
  • 2
  • 30
  • 51

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following lemma and the two observations below.

Lemma. Let $R = \prod_i R_i$ be a direct product of unital and commutative rings $R_i$. Let $n \ge 2$ and $A = (A_i )_i\in SL_n(R) \simeq \prod_i SL_n(R_i)$. If for every $i$ the matrix $A_i$ is the product of at most $k$ elementary matrices over $R_i$, then $A$ is the product of at most $k(n^2 - n)^k$ elementary matrices over $R$. In particular, we have $A \in E_n(R)$.

Proof. Consider each matrix $A_i$ as a word $w_i$ over an alphabet of elementary matrix types (there are $n(n -1)$ types). Since there are at most $(n^2 - n)^k$ such words $w_i$, they all fit in a word of length at most $k(n^2 - n)^k$.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$ (expend $\det(A)$ and use the triangle inequality).
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only (use the above observation as a basis for an induction on $n$).

Here is a proof forCombining the case $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtainlast observation with the identity matrixlemma yields the result. All in all, we used at most ten elementary matrices to perform our reduction and

Let us detail the coefficientscase of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$)$SL_2(\ell^{\infty})$.

Proof for $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following two observations.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$.
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only.

Here is a proof for the case $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following lemma and the two observations below.

Lemma. Let $R = \prod_i R_i$ be a direct product of unital and commutative rings $R_i$. Let $n \ge 2$ and $A = (A_i )_i\in SL_n(R) \simeq \prod_i SL_n(R_i)$. If for every $i$ the matrix $A_i$ is the product of at most $k$ elementary matrices over $R_i$, then $A$ is the product of at most $k(n^2 - n)^k$ elementary matrices over $R$. In particular, we have $A \in E_n(R)$.

Proof. Consider each matrix $A_i$ as a word $w_i$ over an alphabet of elementary matrix types (there are $n(n -1)$ types). Since there are at most $(n^2 - n)^k$ such words $w_i$, they all fit in a word of length at most $k(n^2 - n)^k$.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$ (expend $\det(A)$ and use the triangle inequality).
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only (use the above observation as a basis for an induction on $n$).

Combining the last observation with the lemma yields the result.

Let us detail the case of $SL_2(\ell^{\infty})$.

Proof for $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

Fixes bound on the maximum modulus: there are $n!$ terms in the expansion of the determinant, not just $n$.
Source Link
Luc Guyot
  • 7.9k
  • 2
  • 30
  • 51

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following two observations.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n}$$1/\sqrt[n]{n!}$.
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n} C$$2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only.

Here is a proof for the case $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following two observations.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n}$.
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n} C$ where $\nu(n)$ depends on $n$ only.

Here is a proof for the case $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

The answer is yes. The identity $SL_n(\ell^{\infty}) = E_n(\ell^{\infty})$ holds for every $n \ge 2$ and $\mathbb{C}$ can be replaced by any normed field. This can be inferred using the following two observations.

Let $A \in SL_n(\mathbb{C})$. Then we have:

  • The largest complex modulus of a coefficient of $A$ is greater or equal to $1/\sqrt[n]{n!}$.
  • If the coefficients of $A$ are bounded above by $C > 1$, then $A$ is the product of $\nu(n)$ elementary matrices with coefficients bounded above by $2\sqrt[n]{n!} C$ where $\nu(n)$ depends on $n$ only.

Here is a proof for the case $n = 2$. Multiplying $A = (a_{ij})_{1 \le i, j \le 2}$ by at most four elementary matrices whose coefficients are bounded above by $1$, we obtain a matrix $A' = (a'_{ij})_{1 \le i, j \le 2}$ whose coefficients are those of $A$, up to some permutation and some sign changes, and such that $\vert a'_{11} \vert$ is maximal. Using $a'_{11}$ as a pivot, we can turn $A$ into $\begin{pmatrix} a'_{11} & 0 \\ 0 & 1/a'_{11} \end{pmatrix}$ by means of two elementary matrices whose coefficients are bounded above by $\sqrt{2}C$. Using four more matrices whose coefficients are bounded above by $2\sqrt{2}C$, such as those used in Whitehead's lemma, we obtain the identity matrix. All in all, we used at most ten elementary matrices to perform our reduction and the coefficients of all these matrices are bounded above by $2\sqrt{2}C$ (hence we can set $\nu(2) = 10$).

Shortens the first sentence for clarity's sake
Source Link
Luc Guyot
  • 7.9k
  • 2
  • 30
  • 51
Loading
Integrates YCor's comment AND fixes few typos
Source Link
Luc Guyot
  • 7.9k
  • 2
  • 30
  • 51
Loading
Source Link
Luc Guyot
  • 7.9k
  • 2
  • 30
  • 51
Loading