EvLer said:
I don't know... what I actually have to prove is that ||A+B|| <= ||A|| + ||B|| follows from a norm of a matrix A:
||A|| = max (||Ax||/||x||)
Well what don't you get? You want to prove:
[tex]||Ax|| + ||Bx|| \leq ||A||\, ||x|| + ||B||\, ||x||[/tex]
to do this, it suffices to prove:
[tex]||Ax|| \leq ||A||\, ||x||[/tex]
and
[tex]||Bx|| \leq ||B||\, ||x||[/tex]
right? But there's nothing special about A and B, all you really need to show is that for any matrix M and any vector v that:
[tex]||Mv|| \leq ||M||\, ||v||[/tex]
right? Well, if v is 0, then the inequality holds (and in fact, it's an equality, 0=0). If v is non-zero, then the above is equivalent to:
[tex]||Mv||/||v|| \leq ||M||[/tex]
But the very definition of the norm of a matrix is:
[tex]\sup _{v \neq 0} ||Mv||/||v||[/tex]
(which is pretty much the definition you gave, except you used "max" instead of "sup" which isn't a big deal, and you forgot to rule out x=0, since in that case [itex]||Ax||/||x||[/itex] is undefined). So when v is non-zero,
[tex]||M|| \geq ||Mv||/||v||[/tex]
by the very definition of the matrix norm.