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.
Local conditioning times backward error controls forward error to first order
Statement
Let be a map between normed spaces, let , and let be the absolute local condition number of Absolute and relative local condition numbers of a problem map.
- Quantified form. If , then for every there is a such that every with and satisfies
- First-order form. If , then along admissible , that is: for every there is such that implies .
- Relative form. If additionally and , and , then along admissible ,
In the vocabulary of Forward and backward stability for a problem family under an arithmetic model: a computed value has backward error , and its forward error is, to first order in that backward error, at most the condition number times the backward error; the linear-system instance uses the backward error of Normwise and componentwise backward error for an approximate linear-system solution.
Facts & Assumptions
Given: Normed spaces , a map , a point , and where .
The absolute condition number is the infimum over of the nondecreasing map (Absolute and relative local condition numbers of a problem map).
An infimum characterisation: if is the infimum of a set , then for every there is an element with ; in particular for every there is with .
Proof
By [L2] applied to the set whose infimum is by [L1], every admits some with .
By the definition of as a supremum, every admissible with satisfies , hence , which is claim 1 with .
For every the number is strictly larger than , so claim 1 supplies with for all admissible of norm below ; this is exactly the stated bound, which is claim 2.
For the relative form, divide the inequality of claim 2 by the fixed positive number and multiply by the fixed positive number : , and the error term is because the positive constants are fixed, which is claim 3.
Claims 1, 2 and 3 are steps 2.1, 3.1 and 4.1.
Depends on
Used by
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, Theorem 15.1 (standard reference, not scraped)