Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $|v|$ be the Euclidean norm norm on $\mathbb{R^n} $. For $A\in \mathrm{Mat}_{n\times n}(\mathbb{R})$ we define $\displaystyle \|A\|:= \sup_{\large v\in \mathbb{R^n},\,v \neq 0}\frac{|Av|}{|v|}$. How to show that $\|A\|$ is finite for every $A$? It would be very helpful if someone could give hints. I think I should show that $\|-\|$ is bounded,but I dont know how...

share|improve this question
1  
This is not completely straightforward. Yes every linear operator on a finnite-dimensional real/complex normed vector space is bounded (ie continuous). This can be shown using the equivalence of all norms in finite dimension. –  1015 Feb 17 '13 at 14:15
    
See this thread for a more general case: math.stackexchange.com/questions/112985/… –  1015 Feb 17 '13 at 14:23
    
sorry if my previous answer was a bit short –  Dominic Michaelis Feb 17 '13 at 14:39
    
As opposed to what I first said, it is actually straightforward with the Euclidiean norm... –  1015 Feb 17 '13 at 15:28
    
If you are satisfied by an answer, you can accept it. –  Dominic Michaelis Feb 17 '13 at 18:53

4 Answers 4

Assume $A\in \Bbb R^{m\times n}$ and write $Ax=: y$, where $x\in\Bbb R^n$, $\ y\in\Bbb R^m$. Then by Schwarz' inequality $$y_i^2=\left(\sum_{k=1}^n a_{ik}x_k\right)^2\leq \sum_{k=1}^n a_{ik}^2\ \sum_{k=1}^n x_k^2=|a_{i\cdot}|^2\ |x|^2\qquad(1\leq i\leq m)$$ and therefore $$|y|^2=\sum_{i=0}^m y_i^2\leq C|x|^2$$ with $$C:=\sum_{i=1}^m |a_{i\cdot}|^2=\sum_{i,k} a_{ik}^2\ .$$ It follows that $$\|A\|\ \leq\ \left(\sum_{i,k} a_{ik}^2\right)^{1/2}\ .$$

share|improve this answer
    
Yes, that's the best possible answer here, +1. –  1015 Feb 17 '13 at 15:31
    
I can't agree more, the most understandable answer, +1 –  dineshdileep Feb 17 '13 at 15:47

Ok seems like I should make it a bit more explicit: At first we can scale the problem using the homogenity of norms: $$ \sup_{v\in \mathbb{R}^n, v\neq 0} \frac{|Av|}{|v|}=\sup_{v\in \mathbb{R}^n, v\neq 0} |A\frac{v}{|v|}| = \sup_{|v|=1, v\in \mathbb{R}^n} |Av|$$ Now we write the Matrix $A$ like this one $$\begin{pmatrix} a & b \\ c & d\\ \end{pmatrix} = \begin{pmatrix} a& b \\0 & 0 \\ \end{pmatrix} + \begin{pmatrix} 0 & 0 \\ c & d \\ \end{pmatrix}$$ We decomposite the Matrix $A$ in a sum of matrizes $A_i$ where only 1 column has not only $0$ entries. So we get $$\sup_{|v|=1,v\in \mathbb{R}^n } |Av|=\sup_{|v|=1,v\in \mathbb{R}^n} |\sum_{i=1}^n A_i v|$$ Using the triangle inequality we get $$\sup_{|v|=1,v\in \mathbb{R}^n} |Av|\leq \sup_{|v|=1,v\in \mathbb{R}^n} \sum_{i=1}^n |A_i v|$$ We can identify $A_i\in \mathbb{R}^{n\times n}$ with a vector $b_i\in \mathbb{R}^n$, $b_i$ does have the non zero entries of $A_i$. Note that $A_i v$ is a vector with only 1 non $0$ entry. So $$A_i \cdot v=\langle b_i,v \rangle \cdot e_i$$ where $e_i=(0,\dots,1,0,\dots,0)$

Let $\langle \cdot , \cdot \rangle$ be the euklidean scalarproduct we get: $$\sup_{|v|=1,v\in \mathbb{R}^n} \sum_{i=1}^n |A_i v| =\sup_{|v|=1,v\in \mathbb{R}^n} \sum_{i=1}^n \operatorname{abs}(\langle b_i, v\rangle) \cdot |e_i| $$ Using Cauchy Schwarz we get
$$\sup_{|v|=1,v\in \mathbb{R}^n}\sum_{i=1}^n \operatorname{abs}(\langle b_i, v\rangle) \cdot |e_i| \leq \sup_{|v|=1, v\in \mathbb{R}^n} \sum_{i=1}^n |b_i|\cdot |e_i|$$ Since this is (finally) independent of $v$ $$ \sup_{|v|=1, v\in \mathbb{R}^n} \sum_{i=1}^n |b_i|\cdot |e_i|=\sum_{i=1}^n |b_i|\cdot |e_i|$$

share|improve this answer
    
Your $b_i$ is actually $A^tAv$ and it should be $\sqrt{\langle b_i,v\rangle}$. So your $b_i$ depend on $v$ and your reasoning is kinf od circular. You basically brought the boundedness of $A$ back to the boundedness of $A^tA$. –  1015 Feb 17 '13 at 15:03
    
Yes, $b_i$ is a vector in $\mathbb{R}^n$, I never said otherwise. But it is $A_i^tA_iv$, so it depends on $v$. –  1015 Feb 17 '13 at 15:06
1  
I don't think I misunderstood anything. But note that $|A_iv|=\sqrt{\langle A_iv,A_iv\rangle}=\sqrt{\langle A_i^tA_iv,v\rangle}$. So, again $b_i=A_i^tA_iv$ depends on $v$. And it is not, in general, a column of $A$ like you claim it is. –  1015 Feb 17 '13 at 15:12
1  
For instance, the sentence: "We can identify $A_i$ ..." does not justify the following equality since, again, $b_i$ is actually equal to $A_i^tA_iv$. –  1015 Feb 17 '13 at 15:27
1  
You're welcome. Now it makes sense! –  1015 Feb 17 '13 at 16:22

Let $||\cdot ||$ be any norm on a finite dimensional vector space $X$. Then define the norm $N$ on the space of endomorphisms $\mathcal{L}(X)$ by $N(\varphi)= \sup\limits_{x \in X \backslash \{0\}} ||\varphi(x)||/||x||$. It is straightforward that $N(\varphi)= \sup\limits_{x \in X, ||x||=1} ||\varphi(x)||$. You can deduce that $N(\varphi)<+ \infty$ from the continuity of $\varphi$ (any endomorphism of a finite dimensional normed spaces is continuous) and the compacity of the sphere $\{x \in X : ||x||=1\}$ (a finite dimensional normed space is locally compact).

share|improve this answer

Hint: Let $S=\{v\in\mathbb{R}^n\;|\;|v| = 1\}, N = \{\frac{|Av|}{|v|}\;|\;v\in\mathbb{R}^n.\;v\ne 0\}, N' = \{|Av|\;|\;v\in\mathbb{R}^n.\;|v|=1\}$

Step 1: $||A|| = \sup N = \sup N'$

Step 2: Show that $x\to|Ax|$ is a continuous map. $S$ is closed and bounded in $\mathbb{R}^n$ therefore compact, |Ax| attains max on $S$.

Done

Do you happen to be in Linear Algebra II class?

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.