Proving Norm of Matrix Inequality for Homework

  • Thread starter Thread starter Gtay
  • Start date Start date
  • Tags Tags
    Matrix Norm
Gtay
Messages
14
Reaction score
0

Homework Statement


Let A = [a_{ij}] be a mxn matrix. Show that max_{ij}|a_{ij}| ≤ ‖A‖ ≤ √(∑_{ij}|a_{ij})|

Homework Equations


The Attempt at a Solution



By the definition ‖A‖=max_{||x||≤1}‖A(x)‖ for all x ∈ Rⁿ.So, ‖A‖≥‖A∘(x₁,..,x_{n})^{T}‖ for x = (0,...,1,...0) with 1 is in the i^{ij} position and so ‖A‖ ≥ ‖A∘(x₁,..,x_{n})^{T}‖ = ||(a_{i1},a_{i2},...,a_{ij})|| = √(a_{i1}^{2}+...+a_{in}) ≥ max_{ij}|a_{ij}|.
I do not know what how to do the upper bound.
 
Last edited:
Physics news on Phys.org
Anyone?
 
That's sort of hard to read - do you want to prove that \| A \|^2 \leq \sum_{ij} |a_{ij}|^2?

If so, the Cauchy-Schwarz inequality will be very useful.
 
Thank you for replying!
I will think about this.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top