Skip to main content
$V_n$ instead of $M_n(R)$ in the first sentence
Source Link
Denis Serre
  • 52.3k
  • 10
  • 146
  • 300

The dimension of $M_n(\mathbb{R})$$V_n$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

One way to salvage your question would be to look at matrices whose singular values are $(1,1-r/(n-1), 1-2r/(n-1), \ldots, 1-(n-2)r/(n-1), 1-r)$, for $r \in [0,1]$.

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

One way to salvage your question would be to look at matrices whose singular values are $(1,1-r/(n-1), 1-2r/(n-1), \ldots, 1-(n-2)r/(n-1), 1-r)$, for $r \in [0,1]$.

The dimension of $V_n$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

One way to salvage your question would be to look at matrices whose singular values are $(1,1-r/(n-1), 1-2r/(n-1), \ldots, 1-(n-2)r/(n-1), 1-r)$, for $r \in [0,1]$.

deleted 82 characters in body
Source Link
David E Speyer
  • 156.3k
  • 14
  • 421
  • 763

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

This suggests that what you should do is consider a union of the form $\bigcup_{0 \leq r \leq 1} M(s_1(r), \ldots, s_n(r))$ where $s_i(1)=1$ and the $s_j(r)$One way to salvage your question would be to look at matrices whose singular values are distinct$(1,1-r/(n-1), 1-2r/(n-1), \ldots, 1-(n-2)r/(n-1), 1-r)$, for $r \in [0,1)$. I'm not sure what the best choice of functions would be$r \in [0,1]$.

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

This suggests that what you should do is consider a union of the form $\bigcup_{0 \leq r \leq 1} M(s_1(r), \ldots, s_n(r))$ where $s_i(1)=1$ and the $s_j(r)$ are distinct for $r \in [0,1)$. I'm not sure what the best choice of functions would be.

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

One way to salvage your question would be to look at matrices whose singular values are $(1,1-r/(n-1), 1-2r/(n-1), \ldots, 1-(n-2)r/(n-1), 1-r)$, for $r \in [0,1]$.

edited body
Source Link
David E Speyer
  • 156.3k
  • 14
  • 421
  • 763

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>1$$n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

This suggests that what you should do is consider a union of the form $\bigcup_{0 \leq r \leq 1} M(s_1(r), \ldots, s_n(r))$ where $s_i(1)=1$ and the $s_j(r)$ are distinct for $r \in [0,1)$. I'm not sure what the best choice of functions would be.

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>1$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

This suggests that what you should do is consider a union of the form $\bigcup_{0 \leq r \leq 1} M(s_1(r), \ldots, s_n(r))$ where $s_i(1)=1$ and the $s_j(r)$ are distinct for $r \in [0,1)$. I'm not sure what the best choice of functions would be.

The dimension of $M_n(\mathbb{R})$ is at most $\binom{n}{2} +n$. For $n>2$, this is less than $2 \binom{n}{2} +1$.

It is convenient to solve a more general problem. Fix $s_1 \geq s_2 \geq \cdots \geq s_n \geq 0$. Let $M(s_1, \ldots, s_n)$ be the space of matrices with singular values $s_i$. Let $d_1$, $d_2$, ..., $d_k$ be the list of multiplicites with which the $s$'s occur, so $\sum d_i = n$. For example, if the $s$'s are $(1,1,1,\ldots, 1, r)$ then $(d_1, d_2) = (n-1, 1)$.

I claim that $\dim M(s) = 2 \binom{n}{2} - \sum \binom{d_i}{2}$. Proof: The group $O(n) \times O(n)$ acts transitively on $M(s)$, so the dimension of $M(s)$ is $\dim ( O(n) \times O(n)) = 2 \binom{n}{2}$ minus the dimensional of the stabilizer of the diagonal matrix $d(s) := \mathrm{diag}(s_1, s_2, \ldots, s_{n-1}, s_n)$. We compute the Lie algebra of the stabilizer. Let $g$ and $h$ be skew-symmetric matrices. Then, to first order, $e^g d(s) e^h = d(s)$ if and only if $g d(s) + d(s) h=0$.

For every $(i,j)$, this gives the equations $g_{ij} s_j + s_i h_{ij}$ and $s_i g_{ij} + s_j h_{ij} =0$. If $s_i \neq \pm s_j$, this forces $g_{ij} = h_{ij}=0$. If $s_i = \pm s_j$ then the sign must be $+$, as the $s_i$ are nonnegative, and we get $g_{ij} = - h_{ij}$. So the Lie algebra of the stabilizer has a basis element for every $(i,j)$ with $s_i = s_j$, and we see that the dimension of the stabilizer is $\sum \binom{d_i}{2}$.

You are interested in $\bigcup_{0 \leq r \leq 1} M(1,1,\ldots,1,r)$. Each space in the union has dimension $2\binom{n}{2} - \binom{n-1}{2} = \binom{n}{2} + n-1$, except for the $r=1$ term which is even smaller. Thus, the union has dimension at most $\binom{n}{2} +n$. I have not been able to work out whether the union is a manifold near the boundary points $r=0$ and $r=1$.

This suggests that what you should do is consider a union of the form $\bigcup_{0 \leq r \leq 1} M(s_1(r), \ldots, s_n(r))$ where $s_i(1)=1$ and the $s_j(r)$ are distinct for $r \in [0,1)$. I'm not sure what the best choice of functions would be.

Source Link
David E Speyer
  • 156.3k
  • 14
  • 421
  • 763
Loading