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.
Right-hand-side perturbations in Ax = b are amplified by the condition number
Statement
Let , let with , let , let with , let , and let satisfy . Then
In words: the relative perturbation of the solution is at most the condition number of The condition number kappa_p(A) = ||A||_p ||A^{-1}||_p of a nonsingular linear system times the relative perturbation of the right-hand side.
Facts & Assumptions
Given: An invertible matrix with , vectors with , and .
Compatibility of the induced norm: for every (Induced matrix norms are compatible with matrix-vector multiplication, submultiplicative, and satisfy ||I|| = 1).
Proof
Subtracting the two equations gives , and multiplying on the left by with [L1] gives .
Since , [L2] gives , and forces and , so .
By [L2] applied to at the vector , step 1.1 gives .
Multiplying the bound of step 2.1 by the bound of step 1.2 gives , and [L3] identifies the coefficient product as , which is the stated bound.
Step 3.1 proves the stated bound.
Remarks
- The bound is sharp at . The constant is optimal, but the two equalities in the proof are attained on different singular directions: choose along a right singular vector for the largest singular value of , so has norm , and choose along a left singular vector for the smallest singular value, so . Then the bound is attained with coefficient .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- L. N. Trefethen and D. Bau III, Numerical Linear Algebra, Lecture 12 (standard reference, not scraped)
- James Demmel, Math 221 Lecture 3: Vector Norms, Matrix Norms, and Condition Numbers (standard reference, not scraped)