14.68 min read
Error Analysis
To make the LLA derivation of the chain rule rigorous, we must show the composite error is . Write: where . Let , so .
Then where .
Substituting and rearranging, the composite error is . Since , both terms are , completing the proof.
Formal View
Theorem 14.4 — Chain Rule Error Bound
The composite error satisfies as , establishing .
Why This Matters
Understanding error analysis for composed functions clarifies the role of differentiability in making the chain rule valid.
- Numerical differentiation: error accumulation through composed function evaluations
- Floating-point arithmetic in automatic differentiation: rounding errors in composed computations
- Convergence analysis: rates at which iterative methods converge depend on composition of approximation errors
Quiz
Question 1
In the error analysis, why is even though ?
Question 2
The chain rule error analysis shows that differentiability of at and differentiability of at are both required.
Common Mistakes
- Skipping the error analysis and treating the chain rule as "obvious from notation".
- Not distinguishing between and .
- Forgetting that both differentiability conditions are needed, not just one.