Sub-multiplicative Norm

In mathematics, a matrix norm is a vector norm in a vector space whose elements (vectors) are matrices (of given dimensions).

Preliminaries

Given a field $K$ of either real or complex numbers, let $K^$ be the -vector space of matrices with $m$ rows and $n$ columns and entries in the field $K$. A matrix norm is a norm on $K^$.

This article will always write such norms with double vertical bars (like so: $\, A\,$). Thus, the matrix norm is a function $\, \cdot\, : K^ \to \R$ that must satisfy the following properties:

For all scalars $\alpha \in K$ and matrices $A, B \in K^$,
*$\, A\, \ge 0$ (''positive-valued'')
*$\, A\, = 0 \iff A=0_$ (''definite'')
*$\left\, \alpha A\right\, =\left, \alpha\ \left\, A\right\,$ (''absolutely homogeneous'')
*$\, A+B\, \le \, A\, +\, B\,$ (''sub-additive'' or satisfying the ''triangle inequality'')

The only feature distinguishing matrices from rearranged vectors is multiplication. Matrix norms are particularly useful if they are also sub-multiplicative:

*$\left\, AB\right\, \le \left\, A\right\, \left\, B\right\,$The condition only applies when the product is defined, such as the case of square matrices ().

Every norm on can be rescaled to be sub-multiplicative; in some books, the terminology ''matrix norm'' is reserved for sub-multiplicative norms.

Matrix norms induced by vector norms

Suppose a vector norm $\, \cdot\, _$ on $K^n$ and a vector norm $\, \cdot\, _$ on $K^m$ are given. Any $m \times n$ matrix induces a linear operator from $K^n$ to $K^m$ with respect to the standard basis, and one defines the corresponding ''induced norm'' or ''operator norm'' or ''subordinate norm'' on the space $K^$ of all $m \times n$ matrices as follows:
$\begin \, A\, _ &= \sup\ \\ &= \sup\left\. \end$
where $\sup$ denotes the supremum. This norm measures how much the mapping induced by $A$ can stretch vectors.
Depending on the vector norms $\, \cdot\, _$, $\, \cdot\, _$ used, notation other than $\, \cdot\, _$ can be used for the operator norm.

Matrix norms induced by vector p-norms

If the ''p''-norm for vectors ($1 \leq p \leq \infty$) is used for both spaces $K^n$ and $K^m$, then the corresponding operator norm is:
$\, A\, _p = \sup_ \frac.$

These induced norms are different from the "entry-wise" ''p''-norms and the Schatten ''p''-norms for matrices treated below, which are also usually denoted by $\, A\, _p .$

In the special cases of $p = 1, \infty$, the induced matrix norms can be computed or estimated by
$\, A\, _1 = \max_ \sum_^m , a_ , ,$
which is simply the maximum absolute column sum of the matrix;
$\, A\, _\infty = \max_ \sum _^n , a_ , ,$
which is simply the maximum absolute row sum of the matrix.

For example, for
$A = \begin -3 & 5 & 7 \\ 2 & 6 & 4 \\ 0 & 2 & 8 \\ \end,$
we have that
$\, A\, _1 = \max(, , +2+0; 5+6+2; 7+4+8) = \max(5,13,19) = 19,$
$\, A\, _\infty = \max(, , +5+7; 2+6+4;0+2+8) = \max(15,12,10) = 15.$

In the special case of $p = 2$ (the Euclidean norm or $\ell_2$-norm for vectors), the induced matrix norm is the ''spectral norm''. (The two values do ''not'' coincide in infinite dimensions — see Spectral radius for further discussion.) The spectral norm of a matrix $A$ is the largest singular value of $A$ (i.e., the square root of the largest eigenvalue of the matrix $A^*A$, where $A^*$ denotes the conjugate transpose of $A$):
$\, A\, _2 = \sqrt = \sigma_(A).$
where $\sigma_(A)$ represents the largest singular value of matrix $A$. Also,
$\, A^* A\, _2 = \, A A^* \, _2 = \, A\, _2^2$
since $\, A^* A\, _2 = \sigma_(A^*A) = \sigma_(A)^2 = \, A\, ^2_2$ and similarly $\, AA^*\, _2 = \, A\, ^2_2$ by singular value decomposition (SVD). There is another important inequality:
$\, A\, _2 = \sigma_(A) \leq \, A\, _ = \left(\sum_^m \sum_^n , a_, ^2\right)^ = \left(\sum_^ \sigma_^2\right)^,$
where $\, A\, _\textrm$ is the Frobenius norm. Equality holds if and only if the matrix $A$ is a rank-one matrix or a zero matrix. This inequality can be derived from the fact that the trace of a matrix is equal to the sum of its eigenvalues.

When $p=2$ we have an equivalent definition for $\, A\, _2$ as $\sup\$. It can be shown to be equivalent to the above definitions using the Cauchy–Schwarz inequality.

Properties

Any operator norm is consistent with the vector norms that induce it, giving
$\, Ax\, _\beta \leq \, A\, _\, x\, _\alpha.$

Suppose $\, \cdot\, _$; $\, \cdot\, _$; and $\, \cdot\, _$ are operator norms induced by the respective pairs of vector norms $(\, \cdot\, _, \, \cdot\, _)$; $(\, \cdot\, _, \, \cdot\, _)$; and $(\, \cdot\, _, \, \cdot\, _)$. Then,
:$\, AB\, _ \leq \, A\, _ \, B\, _ ;$
this follows from
$\, ABx\, _ \leq \, A\, _ \, Bx\, _ \leq \, A\, _ \, B\, _ \, x\, _$
and
$\sup_ \, ABx \, _ = \, AB\, _ .$

Square matrices

Suppose $\, \cdot\, _$ is an operator norm on the space of square matrices $K^$
induced by vector norms $\, \cdot\, _$ and $\, \cdot\, _\alpha$.
Then, the operator norm is a sub-multiplicative matrix norm:
$\, AB\, _ \leq \, A\, _ \, B\, _.$

Moreover, any such norm satisfies the inequality

for all positive integers ''r'', where is the spectral radius of . For symmetric or hermitian , we have equality in () for the 2-norm, since in this case the 2-norm ''is'' precisely the spectral radius of . For an arbitrary matrix, we may not have equality for any norm; a counterexample would be
$A = \begin 0 & 1 \\ 0 & 0 \end,$
which has vanishing spectral radius. In any case, for any matrix norm, we have the spectral radius formula:
$\lim_\, A^r\, ^=\rho(A).$

Consistent and compatible norms

A matrix norm $\, \cdot \,$ on $K^$ is called ''consistent'' with a vector norm $\, \cdot \, _$ on $K^n$ and a vector norm $\, \cdot \, _$ on $K^m$, if:
$\left\, Ax\right\, _ \leq \left\, A\right\, \left\, x\right\, _$
for all $A \in K^$ and all $x \in K^n$. In the special case of and $\alpha = \beta$, $\, \cdot \,$ is also called ''compatible'' with $\, \cdot \, _$.

All induced norms are consistent by definition. Also, any sub-multiplicative matrix norm on $K^$ induces a compatible vector norm on $K^n$ by defining $\left\, v \right\, := \left\, \left( v, v, \dots, v \right) \right\,$.

"Entry-wise" matrix norms

These norms treat an $m \times n$ matrix as a vector of size $m \cdot n$, and use one of the familiar vector norms. For example, using the ''p''-norm for vectors, , we get:

:$\, A \, _ = \, \mathrm(A) \, _p = \left( \sum_^m \sum_^n , a_, ^p \right)^$

This is a different norm from the induced ''p''-norm (see above) and the Schatten ''p''-norm (see below), but the notation is the same.

The special case ''p'' = 2 is the Frobenius norm, and ''p'' = ∞ yields the maximum norm.

and norms

Let $(a_1, \ldots, a_n)$ be the columns of matrix $A$. From the original definition, the matrix $A$ presents n data points in m-dimensional space. The $L_$ norm is the sum of the Euclidean norms of the columns of the matrix:

:$\, A \, _ = \sum_^n \, a_ \, _2 = \sum_^n \left( \sum_^m , a_, ^2 \right)^$

The $L_$ norm as an error function is more robust, since the error for each data point (a column) is not squared. It is used in robust data analysis and sparse coding.

For , the $L_$ norm can be generalized to the $L_$ norm as follows:

:$\, A \, _ = \left(\sum_^n \left( \sum_^m , a_, ^p \right)^\right)^.$

Frobenius norm

When for the $L_$ norm, it is called the Frobenius norm or the Hilbert–Schmidt norm, though the latter term is used more frequently in the context of operators on (possibly infinite-dimensional) Hilbert space. This norm can be defined in various ways:

:$\, A\, _\text = \sqrt = \sqrt = \sqrt,$

where $\sigma_i(A)$ are the singular values of $A$. Recall that the trace function returns the sum of diagonal entries of a square matrix.

The Frobenius norm is an extension of the Euclidean norm to $K^$ and comes from the Frobenius inner product on the space of all matrices.

The Frobenius norm is sub-multiplicative and is very useful for numerical linear algebra. The sub-multiplicativity of Frobenius norm can be proved using Cauchy–Schwarz inequality.

Frobenius norm is often easier to compute than induced norms, and has the useful property of being invariant under rotations (and unitary operations in general). That is, $\, A\, _\text = \, AU\, _\text = \, UA\, _\text$ for any unitary matrix $U$. This property follows from the cyclic nature of the trace ($\operatorname(XYZ) = \operatorname(ZXY)$):

:$\, AU\, _\text^2 = \operatorname\left( (AU)^A U \right) = \operatorname\left( U^ A^A U \right) = \operatorname\left( UU^ A^A \right) = \operatorname\left( A^ A \right) = \, A\, _\text^2,$

and analogously:

:$\, UA\, _\text^2 = \operatorname\left( (UA)^UA \right) = \operatorname\left( A^ U^ UA \right) = \operatorname\left( A^A \right) = \, A\, _\text^2,$

where we have used the unitary nature of $U$ (that is, $U^* U = U U^* = \mathbf$).

It also satisfies

:$\, A^* A\, _\text = \, AA^*\, _\text \leq \, A\, _\text^2$
and
:$\, A + B\, _\text^2 = \, A\, _\text^2 + \, B\, _\text^2 + 2 Re \left( \langle A, B \rangle_\text \right),$

where $\langle A, B \rangle_\text$ is the Frobenius inner product, and Re is the real part of a complex number (irrelevant for real matrices)

Max norm

The max norm is the elementwise norm in the limit as goes to infinity:

:$\, A\, _ = \max_ , a_, .$

This norm is not sub-multiplicative.

Note that in some literature (such as Communication complexity), an alternative definition of max-norm, also called the $\gamma_2$-norm, refers to the factorization norm:

:$\gamma_2(A) = \min_ \, U \, _ \, V \, _ = \min_ \max_ \, U_ \, _2 \, V_ \, _2$

Schatten norms

The Schatten ''p''-norms arise when applying the ''p''-norm to the vector of singular values of a matrix. If the singular values of the $m \times n$ matrix $A$ are denoted by ''σ_i'', then the Schatten ''p''-norm is defined by

:$\, A\, _p = \left( \sum_^ \sigma_^p(A) \right)^.$

These norms again share the notation with the induced and entry-wise ''p''-norms, but they are different.

All Schatten norms are sub-multiplicative. They are also unitarily invariant, which means that $\, A\, = \, UAV\,$ for all matrices $A$ and all unitary matrices $U$ and $V$.

The most familiar cases are ''p'' = 1, 2, ∞. The case ''p'' = 2 yields the Frobenius norm, introduced before. The case ''p'' = ∞ yields the spectral norm, which is the operator norm induced by the vector 2-norm (see above). Finally, ''p'' = 1 yields the nuclear norm (also known as the ''trace norm'', or the Ky Fan 'n'-norm), defined as

:$\, A\, _ = \operatorname \left(\sqrt\right) = \sum_^ \sigma_(A),$

where $\sqrt$ denotes a positive semidefinite matrix $B$ such that $BB=A^*A$. More precisely, since $A^*A$ is a positive semidefinite matrix, its square root is well-defined. The nuclear norm $\, A\, _$ is a convex envelope of the rank function $\text(A)$, so it is often used in mathematical optimization to search for low rank matrices.

Monotone norms

A matrix norm $\, \cdot \,$ is called ''monotone'' if it is monotonic with respect to the Loewner order. Thus, a matrix norm is increasing if

:$A \preccurlyeq B \Rightarrow \, A\, \leq \, B\, .$

The Frobenius norm and spectral norm are examples of monotone norms.

Cut norms

Another source of inspiration for matrix norms arises from considering a matrix as the adjacency matrix of a weighted, directed graph. The so-called "cut norm" measures how close the associated graph is to being bipartite:
$\, A\, _=\max_$
where . Note that Lovász rescales to lie in . Equivalent definitions (up to a constant factor) impose the conditions ; ; or .

The cut-norm is equivalent to the induced operator norm , which is itself equivalent to the another norm, called the Grothendieck norm.

To define the Grothendieck norm, first note that a linear operator is just a scalar, and thus extends to a linear operator on any . Moreover, given any choice of basis for and , any linear operator extends to a linear operator , by letting each matrix element on elements of via scalar multiplication. The Grothendieck norm is the norm of that extended operator; in symbols:
$\, A\, _=\sup_$

The Grothendieck norm depends on choice of basis (usually taken to be the standard basis) and .

Equivalence of norms

For any two matrix norms $\, \cdot\, _$ and $\, \cdot\, _$, we have that:

:$r\, A\, _\alpha\leq\, A\, _\beta\leq s\, A\, _\alpha$

for some positive numbers ''r'' and ''s'', for all matrices $A\in K^$. In other words, all norms on $K^$ are ''equivalent''; they induce the same topology on $K^$. This is true because the vector space $K^$ has the finite dimension $m \times n$.

Moreover, for every vector norm $\, \cdot\,$ on $\R^$, there exists a unique positive real number $k$ such that $l\, \cdot\,$ is a sub-multiplicative matrix norm for every $l \ge k$.

A sub-multiplicative matrix norm $\, \cdot\, _$ is said to be ''minimal'', if there exists no other sub-multiplicative matrix norm $\, \cdot\, _$ satisfying $\, \cdot\, _ < \, \cdot\, _$.

Examples of norm equivalence

Let $\, A\, _p$ once again refer to the norm induced by the vector ''p''-norm (as above in the Induced Norm section).

For matrix $A\in\R^$ of rank $r$, the following inequalities hold:Roger Horn and Charles Johnson. ''Matrix Analysis,'' Chapter 5, Cambridge University Press, 1985. .

*$\, A\, _2\le\, A\, _F\le\sqrt\, A\, _2$
*$\, A\, _F \le \, A\, _ \le \sqrt \, A\, _F$
*$\, A\, _ \le \, A\, _2 \le \sqrt\, A\, _$
*$\frac\, A\, _\infty\le\, A\, _2\le\sqrt\, A\, _\infty$
*$\frac\, A\, _1\le\, A\, _2\le\sqrt\, A\, _1.$

Another useful inequality between matrix norms is

:$\, A\, _2\le\sqrt,$

which is a special case of Hölder's inequality.

See also

* Dual norm
* Logarithmic norm

Notes

References

{{reflist

Bibliography

* James W. Demmel, Applied Numerical Linear Algebra, section 1.7, published by SIAM, 1997.
* Carl D. Meyer, Matrix Analysis and Applied Linear Algebra, published by SIAM, 2000

* John Watrous (computer scientist), John Watrous, Theory of Quantum Information
2.3 Norms of operators
lecture notes, University of Waterloo, 2011.
* Kendall Atkinson, An Introduction to Numerical Analysis, published by John Wiley & Sons, Inc 1989

Norms (mathematics)
Linear algebra