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.
Contraction and residual error bound for the SDC sweep
Statement
Let be a nonempty closed product ball of admissible stage vectors in , with metric . For each , assume the inner stage map maps into itself, and assume the stage field is -Lipschitz there for some . Put If and , then every sweep is uniquely defined in , the sweep map is a contraction with constant , and its unique fixed point is the unique collocation stage vector in . For every , If the initial iterate satisfies , then the iterates obey . In particular, a residual-certified predictor used with Finite explicit-left-Euler spectral deferred-correction sweep must lie in . These are local stage-iteration claims; they assert no convergence when either contraction inequality fails.
Facts & Assumptions
Given: The SDC sweep, its lower-triangular stage preconditioner , a nonempty closed product ball , and the self-map and Lipschitz hypotheses in the Statement. The geometric iterate estimate additionally has the stated premise .
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in : every Cauchy sequence in a finite-dimensional Euclidean space converges in that space.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation and The Euclidean inner product on : the Euclidean norm has the triangle inequality.
A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point: a contraction of a nonempty complete metric space into itself has a unique fixed point and its iterates converge to that point.
Fixed points of the SDC sweep are collocation stages: a fixed point of the SDC sweep is exactly a solution of the collocation stage equations.
Collocation tableau from distinct quadrature nodes: , and the row-sum norm satisfies for block vectors.
Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric: a metric is symmetric, separates distinct points, and satisfies the triangle inequality.
Cauchy sequence in a metric space: a sequence is Cauchy when its pairwise distances tend to zero uniformly beyond a sufficiently large index.
Complete metric space: every Cauchy sequence converges in the space: a metric space is complete when every Cauchy sequence converges to a point in it.
For each , the inner stage map maps into itself; is -Lipschitz in on ; and , . For the geometric iterate estimate, .
Proof
The block distance has the metric properties [F6]: symmetry and separation hold coordinatewise, and [F2] gives . If is -Cauchy in the sense of [F7], then each of its finitely many Euclidean coordinates is Cauchy; [F1] gives coordinate limits. Since is a closed product ball, the coordinatewise limit belongs to , so [F8] makes complete.
For a fixed previous iterate , the new-stage equation is . Its right-hand side maps into itself by [A1]; the norm inequality in [F5] and the Lipschitz bound in [A1] show that its difference at is at most . Since , [F3] gives a unique in .
Let , and write , . Subtracting their stage equations cancels the fixed initial derivative and yields Rearranging by gives , so is a contraction of .
By [F3] and step 1.1, has a unique fixed point . Fact [F4] identifies it with the unique collocation stage vector in this ball. Under the iterate premise in [A1], repeated application of the contraction inequality in step 3.1 gives .
For any , and the triangle inequality give . Since , rearranging proves the residual estimate.
Depends on
- Collocation tableau from distinct quadrature nodes
- Finite explicit-left-Euler spectral deferred-correction sweep
- Fixed points of the SDC sweep are collocation stages
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Complete metric space: every Cauchy sequence converges in the space
- Cauchy sequence in a metric space
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
Dependency tree · two levels
61 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
- Mathew F. Causley and David C. Seal, On the convergence of spectral deferred correction methods, Communications in Applied Mathematics and Computational Science 14 (2019), §3 (standard reference, not scraped)
- Ernst Hairer, Syvert P. Nørsett, and Gerhard Wanner, Solving Ordinary Differential Equations I, 2nd ed., Chapter II §II.7 (standard reference, not scraped)