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.
Boundary-compatible clamped cubic interpolation is fourth order in the maximum norm
Statement
Let , , with and . Suppose has continuous derivatives through order four on an open interval containing , and let satisfy there. Let be the clamped cubic interpolant at with the boundary-compatible slopes and . Then
The conclusion uses the exact endpoint derivatives; it is not a rate claim for the natural boundary condition or for estimated endpoint slopes.
Facts & Assumptions
Given: A strictly increasing partition, with continuous derivatives through order four near , a bound on , and the clamped interpolant with endpoint slopes equal to those of .
Clamped cubic spline interpolation exists uniquely gives the second-derivative system, the cubic piece formula, and the endpoint-slope formulae for the clamped interpolant.
A uniform derivative bound gives a uniform Taylor remainder bound: if a function has derivatives through order on the closed segment between and , with endpoint continuity, and its st derivative is bounded by , its degree- Taylor remainder is at most . Here the proof uses for , for , and for ; the resulting factorials are , , and .
, , and on a neighborhood of the partition.
Proof
Put and . By [F2], on each adjacent interval of length , Taylor expansion gives and with ; the corresponding secant slopes satisfy and , with . Substitution in an interior row of [F1] shows that the residual obtained by inserting in place of has magnitude at most : the first-derivative terms cancel, and the remaining terms are bounded by . The same expansions in the first row give residual at most ; expansion backward from gives at most in the last row.
Fix an interval of length and let be the cubic Hermite interpolant matching and at both endpoints. Let be the Taylor polynomial of degree three for at , and put . By [F2], , , , and . With , the Hermite basis functions for the right value and right slope are and ; their absolute values on are at most and . Therefore , and .
In the clamped system matrix, each diagonal exceeds the sum of the absolute off-diagonal entries by respectively , , and . Let and choose an index with maximal . Since the residual equation is , its row at that index has magnitude at least the row's diagonal-dominance margin times . Step 1.1 bounds that same row by times the margin. Hence .
At an interior node , [F1] gives . Substituting the backward Taylor expansions in step 1.1 and cancels the terms in and . The remaining Taylor terms are bounded by , and the terms by . Thus . At and this difference is zero by the boundary conditions.
The difference is a cubic with zero endpoint values and with endpoint slope differences and . Its Hermite form is . Each displayed shape function has absolute value at most on . Step 3.1 therefore gives . Combining with step 1.2 yields on this interval.
The intervals cover , and . Taking the supremum over all intervals proves the stated maximum-norm estimate.
Depends on
Used by
Dependency tree · two levels
9 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
- Carl de Boor, A Practical Guide to Splines, revised edition, Chapter V, pp. 51–56 (standard reference, not scraped)
- Brian LeMesurier, Introduction to Numerical Methods and Analysis with Python, §3.4.3, Theorem 3.5 (standard reference, not scraped)