Skip to main content

[Community Question] Linear-algebra: Singular value inequality for sum of 2 matrices

One of our user asked:

I found a theorem mentioned in a couple of places, but could not find a proof. The theorem states the following:

Let $A, B \in \mathbb{F^{m,n}}$, $p=min(m,n)$ with singular values $\sigma_1(A) \geqslant...\geqslant \sigma_p(A)$ and $\sigma_i(B) \geqslant...\geqslant \sigma_p(B)$ respectively, then $\sigma_{i+j-1}(A+B) \leqslant \sigma_i(A) + \sigma_j(B)$.

I am looking for a proof of the above. Thanks in advance.


Comments

Popular posts from this blog

[Community Question] Calculus: calculating 2 constants in a function

One of our user asked: $$M=\{f\in C[0,2\pi],\int_{0}^{2\pi}f(x)sinxdx=\pi,\int_{0}^{2\pi}f(x)sin2xdx=2\pi\} $$ $a,b\in \mathbb R, g\in M, g(x)=asinx+bsin2x,x\in [0,2\pi]$ I've read on the answers that $a=1,b=2$ and I don't know how to calculate them. Can somebody explain me,please? By the way, the problem is to determine $ \int_{0}^{2\pi}(g(x))^2 dx$ so you have to first get the constants $a$ and $b$ .

Calculus: A difficulty in understanding a step in a solution.

Here is the solution: But I could not understand how the last term in the fourth line came from the line before it, could anyone explain this for me please?