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.

Can the "inducing" vector norm be deduced or "recovered" from an induced (operator) norm?

This question occurred to me after seeing this question. I'm hoping that perhaps there exists something like the polarization identity, i.e. some identity one may use to "recover" the vector norm the same way the polarization identity "recovers" the inner product.

I am aware that any induced norm satisfies the inequality $$ \left|\|A^r\|\right|^{1/r} \geq \rho(A) $$ Also, there exists some invertible matrix $S$ such that $$ \left|\|SAS^{-1}\|\right| = \rho(A) $$ I'm wondering if one or both of the above might also be a sufficient condition for $\left|\|\cdot \|\right|$ to be a derived norm, and that they might somehow be used to derive some sort of identity producing the necessary vector norm.

Any input is appreciated!

Runaway train of thought below:

Following HHO's advice (see comment below), here's a neat way to recover the vector norm (assuming that a suitable vector norm does exist):

Let $\|\cdot \|_O$ denote the operator norm. I will define a vector norm $\|\cdot \|$ as follows: arbitrarily, I set $\|e_1\| = 1$ (because $\alpha \|\cdot\|$ is a vector norm for any $\alpha>0$ and any vector norm $\|\cdot\|$ and since both of these result in the same induced norm, we may set $\|e_1\| = \alpha$ for any $\alpha>0$). From there, we may define $$ \|u\| = \left\| u e_1^* \right\|_O = \left\| \pmatrix{|&|&&|\\ u&0&\cdots&0\\ |&|&&|} \right\|_O $$ What remains to be seen is under which conditions this defines a valid vector-norm.

In fact, the above must always be a valid vector-norm, by the definition of a matrix norm. It is necessary to check whether the vector norm produced above induces the operator norm that we started with.

By the above, here's a neat criterion for checking whether $\|\cdot\|_O$ is an operator norm:

We can state that $\|\cdot\|_O$ is an induced (matrix) norm if and only if for all $A \in \mathbb{F}^{n\times n}$, we have $$ \|A\|_O = \max_{x \neq 0} \frac{\|Ax e_1^*\|_O}{\|xe_1^*\|_O} $$ and, presumably, $e_1$ can be replaced by any convenient $v \in \mathbb{F}^n: v^*v = 1$. I guess I answered my own question then.

Is this a known theorem? This question is now a reference request. If anyone has seen something like this, please say so.

share|improve this question
Take a good look at rank one operators … err, matrices … and their norm. –  Harald Hanche-Olsen Dec 1 '13 at 20:49
@HaraldHanche-Olsen so with rank one matrices and vector norm $\|\cdot \|$, we have $A = \alpha u v^*$ for $\alpha \in \mathbb{F}$ and vectors $u,v$ with $\|u\|=\|v\|= 1$. From there, we note that the induced norm $|\|\cdot\||$ satisfies $$\left|\|A\|\right| = \alpha v^*v \frac{\|u\|}{\|v\|} = \alpha v^*v$$ Is there anything I'm missing? –  Omnomnomnom Dec 1 '13 at 21:22
There might be something missing. First, if you plug in the Frobenius norm, you obtain that it is an operator norm, which is not true. Second, what would be a convenient $v$? Last, $|||A|||=\alpha v^*v\frac{\|u\|}{\|v\|}$ does not hold for any induced norm except the 2-norm (and Frobenius norm). Actually, $|||A|||=|\alpha|\|u\|\|v\|_*$, where $\|\cdot\|_*$ is dual to $\|\cdot\|$. –  Algebraic Pavel Dec 2 '13 at 10:12
@AlgebraicPavel for some reason I had made the assumption that for $A = \alpha u v^*, x = \frac{v}{\|v\|}$ would be the $x$ that attains the maximum $\max_{\|x\| = 1} \|A\|$. This is clearly not generally the case, certainly not in the infinite dimensional case when this supremum (as I should have it) is not always attained. I will have to rethink this at some point. Thank you for the input. –  Omnomnomnom Dec 2 '13 at 13:50

Your Answer


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

Browse other questions tagged or ask your own question.