Norms

Work in progress. This note is still being written and incomplete.

A norm is a real-valued function measuring the size of a vector or a matrix.

Vector Norm

For x⃗=(x1,x2,…,xn)T\vec{x} = (x_1, x_2, \ldots, x_n)^T, 3 standard vector norms:

1-Norm

Sum of the absolute values of x⃗\vec{x}‘s components. Aka. taxicab norm, since it measures distance travelled along grid lines rather than in a straight line.

∥x⃗∥1=∑i=1n∣xi∣\lVert \vec{x} \rVert_1 = \sum_{i=1}^{n} |x_i|

2-Norm

Aka. Euclidean norm. Straight-line distance from x⃗\vec{x} to the origin.

∥x⃗∥2=(∑i=1nxi2)1/2\lVert \vec{x} \rVert_2 = \left( \sum_{i=1}^{n} x_i^2 \right)^{1/2}

Infinity Norm

Largest absolute value among x⃗\vec{x}‘s components.

∥x⃗∥∞=max⁡1≤i≤n∣xi∣\lVert \vec{x} \rVert_\infty = \max_{1 \leq i \leq n} |x_i|

Equivalent Norms

2 norms ∥⋅∥v1,∥⋅∥v2\lVert \cdot \rVert_{v1}, \lVert \cdot \rVert_{v2} on Rn\mathbb{R}^n are equivalent iff there exist positive constants c1,c2c_1, c_2 such that for all x⃗∈Rn\vec{x} \in \mathbb{R}^n,

c1∥x⃗∥v1≤∥x⃗∥v2≤c2∥x⃗∥v1c_1 \lVert \vec{x} \rVert_{v1} \leq \lVert \vec{x} \rVert_{v2} \leq c_2 \lVert \vec{x} \rVert_{v1}

∥⋅∥1,∥⋅∥2,∥⋅∥∞\lVert \cdot \rVert_1, \lVert \cdot \rVert_2, \lVert \cdot \rVert_\infty are equivalent on Rn\mathbb{R}^n.

∥x⃗∥∞≤∥x⃗∥2≤n ∥x⃗∥∞\lVert \vec{x} \rVert_\infty \leq \lVert \vec{x} \rVert_2 \leq \sqrt{n} \, \lVert \vec{x} \rVert_\infty ∥x⃗∥2≤∥x⃗∥1≤n ∥x⃗∥2\lVert \vec{x} \rVert_2 \leq \lVert \vec{x} \rVert_1 \leq \sqrt{n} \, \lVert \vec{x} \rVert_2 ∥x⃗∥∞≤∥x⃗∥1≤n ∥x⃗∥∞\lVert \vec{x} \rVert_\infty \leq \lVert \vec{x} \rVert_1 \leq n \, \lVert \vec{x} \rVert_\infty

Matrix Norm

A matrix norm is a norm on the set of n×nn \times n matrices, additionally satisfying submultiplicativity: ∥AB∥≤∥A∥ ∥B∥\lVert AB \rVert \leq \lVert A \rVert \, \lVert B \rVert for all n×nn \times n matrices A,BA, B.

Induced Matrix Norm

Aka. operator norm, subordinate norm.

The matrix norm induced by a vector norm ∥⋅∥v\lVert \cdot \rVert_v on Rn\mathbb{R}^n

∥A∥M=sup⁡x⃗≠0⃗∥Ax⃗∥v∥x⃗∥v=sup⁡∥x⃗∥v=1∥Ax⃗∥v\lVert A \rVert_M = \sup_{\vec{x} \neq \vec{0}} \frac{\lVert A\vec{x} \rVert_v}{\lVert \vec{x} \rVert_v} = \sup_{\lVert \vec{x} \rVert_v = 1} \lVert A\vec{x} \rVert_v

For A=(aij)A = (a_{ij}), 1≤i,j≤n1 \leq i, j \leq n:

∥A∥∞=max⁡1≤i≤n∑j=1n∣aij∣(maximum row sum)\lVert A \rVert_\infty = \max_{1 \leq i \leq n} \sum_{j=1}^{n} |a_{ij}| \quad \text{(maximum row sum)} ∥A∥1=max⁡1≤j≤n∑i=1n∣aij∣(maximum column sum)\lVert A \rVert_1 = \max_{1 \leq j \leq n} \sum_{i=1}^{n} |a_{ij}| \quad \text{(maximum column sum)}

Spectrum

The spectrum of AA, σ(A)\sigma(A), is the set of all eigenvalues of AA.

σ(A)={λ  ;  Av⃗=λv⃗,v⃗∈Rn,λ is an eigenvalue of A}\sigma(A) = \{ \lambda \; ; \; A\vec{v} = \lambda \vec{v}, \vec{v} \in \mathbb{R}^n, \lambda \text{ is an eigenvalue of } A \}

Spectral Radius

The spectral radius of AA, ρ(A)\rho(A), is the maximum absolute value among the eigenvalues of AA.

ρ(A)=max⁡{∣λ∣  ;  λ∈σ(A)}\rho(A) = \max \{ |\lambda| \; ; \; \lambda \in \sigma(A) \}

The matrix norm induced by the 2-norm

∥A∥2=ρ(ATA)\lVert A \rVert_2 = \sqrt{\rho(A^TA)}
Written by September 28, 2026 1 min read
Was this helpful?