TheoremBase

Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products

The operator norm of a real matrix is nonnegative, bounds the length of Ax by its multiple of the length of x, is the least such constant, vanishes exactly at the zero matrix, is absolutely homogeneous, satisfies the triangle inequality and is submultiplicative.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let m,n,p∈Nm,n,p\in\mathbb{N}, let A,B∈Mm×n(R)A,B\in\mathcal{M}_{m\times n}(\mathbb{R}) and C∈Mn×p(R)C\in\mathcal{M}_{n\times p}(\mathbb{R}) be real matrices, and let t,c∈Rt,c\in\mathbb{R}, with the sum A+BA+B and scalar multiple tAtA, the zero matrix 0∈Mm×n(R)0\in\mathcal{M}_{m\times n}(\mathbb{R}), the matrix product AC∈Mm×p(R)AC\in\mathcal{M}_{m\times p}(\mathbb{R}), the matrix-vector product AxAx, the Euclidean norm ∥x∥\lVert x\rVert of a point xx of Rn\mathbb{R}^{n}, the operator norm ∥⋅∥\lVert\cdot\rVert of matrices, and the absolute value ∣t∣|t|.

0≤∥A∥0\le\lVert A\rVert.

∥Ax∥≤∥A∥ ∥x∥\lVert Ax\rVert\le\lVert A\rVert\,\lVert x\rVert for every x∈Rnx\in\mathbb{R}^{n}.

If ∥Ax∥≤c ∥x∥\lVert Ax\rVert\le c\,\lVert x\rVert for every x∈Rnx\in\mathbb{R}^{n}, then ∥A∥≤c\lVert A\rVert\le c.

∥A∥=0\lVert A\rVert=0 if and only if A=0A=0.

∥tA∥=∣t∣ ∥A∥\lVert tA\rVert=|t|\,\lVert A\rVert.

∥A+B∥≤∥A∥+∥B∥\lVert A+B\rVert\le\lVert A\rVert+\lVert B\rVert.

∥AC∥≤∥A∥ ∥C∥\lVert AC\rVert\le\lVert A\rVert\,\lVert C\rVert.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…