How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The matrix norm induced by a published vector p-norm
Definition
Let , let with , and let be a real matrix (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes), regarded as the linear map from to with the published -norms (The -norms for rational , and ). The matrix -norm induced by is
When , the following three displayed quantities are the same number:
the equalities following from positive homogeneity of (Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page, axiom (N2)) and the equality .
The value is a finite nonnegative real. For the norms and are equivalent by For all norms on are equivalent, so there is with for every . For every , , so ; hence the supremum over the unit ball is at most the finite constant .
The induced infinity norm is a separate named case. When , define
As in the rational- case, positive homogeneity gives
The supremum is finite because for every one has , so
At the convention is explicit. The only element of is the zero vector, the only matrix is the empty matrix, and the unit-ball definition gives . The unit sphere and the set of nonzero vectors are empty, so the two ratio formulas above are not asserted in this case.
The induced quantity is a norm on the matrix space : for each rational , and likewise for the separately named -case when , separation, absolute homogeneity and the triangle inequality follow from the same three axioms of the underlying vector norm (Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page) through the defining supremum. The compatibility with matrix-vector multiplication, the submultiplicativity and the value on identity matrices are Induced matrix norms are compatible with matrix-vector multiplication, submultiplicative, and satisfy ||I|| = 1; the explicit value at and the separate -formula are The induced 1-norm is the maximum column sum and the induced infinity-norm is the maximum row sum.
Remarks
-
At this is the published operator norm. The vector -norm is the Euclidean norm (Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page), so the induced -norm of a real matrix is the operator norm of the published spectral/SVD page; The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector identifies it with the largest singular value. No second operator norm is introduced here.
-
Only rational are used. The published The -norms for rational , and exist for rational exponents only, and this definition inherits that restriction verbatim; no statement on this page ranges over a real interval.
Depends on
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- Each $\lVert\cdot\rVert_p$ is a norm on $\mathbb{R}^n$, and the induced metrics are exactly $d_1$, $d_2$ and $d_\infty$ of the published metric-spaces page
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- For $n \ge 1$ all norms on $\mathbb{R}^n$ are equivalent
Used by
- The condition number kappaₚ(A) = ||A||ₚ ||A⁻¹||ₚ of a nonsingular linear system Definition
- Induced matrix norms are compatible with matrix-vector multiplication, submultiplicative, and satisfy ||I|| = 1 Theorem
- The induced 1-norm is the maximum column sum and the induced infinity-norm is the maximum row sum Theorem
Dependency tree · two levels
43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- James Demmel, Math 221 Lecture 3: Vector Norms, Matrix Norms, and Condition Numbers (standard reference, not scraped)
- L. N. Trefethen and D. Bau III, Numerical Linear Algebra, Lecture 3 (standard reference, not scraped)