I am not sure how to even start this proof. I know that for any induced matrix norm, $||Ax||$ is less than or equal to $||Ax||$ $||x||$.
2026-03-29 14:07:23.1774793243
On
Prove that for an induced matrix norm, the norm of Identity matrix is 1.
2.4k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
On
If $\Vert A\Vert$ is the norm of the matrix induced by the norm $\Vert \cdot \Vert$, it means that
$$\Vert A \Vert =\sup \{\Vert Ax \Vert \mid \Vert x \Vert =1\}$$
If $A$ is the identity matrix, then $Ix=x $ for all $x \in V$ the associated vector space. Hence $\Vert Ix \Vert =1$ for all $x $ such that $\Vert x \Vert =1$.
Therefore $\Vert I \Vert =1$.
If we take the usual definition of norm, $\|A\| = sup \{\|Ax\|:\|x\| = 1\}$
By definition of the induced norm of $A$, we have $\|A\| \leq \|Ax\|$. It follows that $\|I\| \leq \|Ix\|= \|x\| = 1$ for all $x$ such that $\|x\| = 1$
And as you say, $\|Ix\| \leq \|I\| \|x\|$, then if we take some $x\not=0$, we have $\frac{\|Ix\|}{\|x\|} \leq \|I\|$, thus $1 = \frac{\|x\|}{\|x\|} = \frac{\|Ix\|}{\|x\|}\leq \|I\|$
Then $1 \leq \|I\| \leq 1 \implies \|I\| = 1$