Is this a valid step?||Ax|| + ||Bx|| <= ||A||*||x|| + ||B||*||x||

  • Thread starter Thread starter EvLer
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around the validity of a mathematical inequality involving matrices and vectors, specifically examining the relationship between the norms of matrix products and the norms of the matrices themselves. The original poster questions whether the expression ||Ax|| + ||Bx|| <= ||A||*||x|| + ||B||*||x|| holds true under certain conditions.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the properties of matrix norms and vector norms, questioning the definitions and constraints involved. Some discuss the implications of the triangle inequality in the context of matrix addition.

Discussion Status

The discussion is active, with participants providing insights into the definitions of matrix norms and raising questions about the assumptions underlying the original inequality. There is a focus on clarifying the definitions and exploring the implications of the properties of norms.

Contextual Notes

There are mentions of specific constraints on the vector x, as well as the need for clarity regarding the definitions of norms used in the discussion. Some participants note potential misunderstandings regarding the application of these definitions.

EvLer
Messages
454
Reaction score
0
Is this a valid step?

||Ax|| + ||Bx|| <= ||A||*||x|| + ||B||*||x|| ??

where A and B are actually matrices, x is a vector but actually it can be reduced to just numbers and a variable, respectively. And ||x|| = sqrt (x*x)

thanks as always :)
 
Physics news on Phys.org
It suffices to know that if M is any matrix and v is any vector (such that Mv is defined), then [itex]||Mv|| \leq ||M||\, ||v||[/itex]. What's the definition of [itex]||M||[/itex]?
 
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||)
 
||A+B||=max(|(A+B)x|/|x|=max(|Ax+Bx|)/|x| and Ax and Bx are just vectors...so you can just use the triangle inequalities.

Also, do note, your definition for norm is wrong. You have to some constraint on x. The most common is |x|<=1.

Alos, I don't know if you realize this or not, but you're suppose to be taking the vector norm of Ax divided by the vector norm of x.
 
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.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
12
Views
2K
  • · Replies 19 ·
Replies
19
Views
3K
Replies
5
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K