Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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 C be a nonempty closed product ball of admissible stage vectors in (Rd)M, with metric ∥U−V∥∞,2=max⁡i∥Ui−Vi∥2. For each V∈C, assume the inner stage map Z⟼1u+hQΔF(Z)+h(Q−QΔ)F(V) maps C into itself, and assume the stage field F(U)=(f(t+cih,Ui))i=1M is L-Lipschitz there for some L≥0. Put a=hL∥QΔ∥∞,q=hL∥Q−QΔ∥∞1−a. If a<1 and q<1, then every sweep is uniquely defined in C, the sweep map S:Uk↦Uk+1 is a contraction with constant q, and its unique fixed point U∗ is the unique collocation stage vector in C. For every V∈C, ∥V−U∗∥∞,2≤∥S(V)−V∥∞,21−q. If the initial iterate satisfies U0∈C, then the iterates Uk+1=S(Uk) obey ∥Uk−U∗∥∞,2≤qk∥U0−U∗∥∞,2. In particular, a residual-certified predictor used with Finite explicit-left-Euler spectral deferred-correction sweep must lie in C. 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 QΔ, a nonempty closed product ball C, and the self-map and Lipschitz hypotheses in the Statement. The geometric iterate estimate additionally has the stated premise U0∈C.

[F1]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R: every Cauchy sequence in a finite-dimensional Euclidean space converges in that space.

[F3]

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.

[F4]

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.

[F5]

Collocation tableau from distinct quadrature nodes: ∥Q∥∞=max⁡i∑j∣Qij∣, and the row-sum norm satisfies ∥AV∥∞,2≤∥A∥∞∥V∥∞,2 for block vectors.

[F6]

Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric: a metric is symmetric, separates distinct points, and satisfies the triangle inequality.

[F7]

Cauchy sequence in a metric space: a sequence is Cauchy when its pairwise distances tend to zero uniformly beyond a sufficiently large index.

[F8]

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.

[A1]

For each V∈C, the inner stage map Z↦1u+hQΔF(Z)+h(Q−QΔ)F(V) maps C into itself; F is L-Lipschitz in ∥⋅∥∞,2 on C; and a<1, q<1. For the geometric iterate estimate, U0∈C.

Proof

1.1givenA1F1F2F6F7F8construct

The block distance d(U,V)=max⁡i∥Ui−Vi∥2 has the metric properties [F6]: symmetry and separation hold coordinatewise, and [F2] gives d(U,W)≤d(U,V)+d(V,W). If (Un) is d-Cauchy in the sense of [F7], then each of its finitely many Euclidean coordinates is Cauchy; [F1] gives coordinate limits. Since C is a closed product ball, the coordinatewise limit belongs to C, so [F8] makes (C,d) complete.

2.1A1F3F5step 1.1algebra

For a fixed previous iterate V∈C, the new-stage equation is Z=1u+hQΔF(Z)+h(Q−QΔ)F(V). Its right-hand side maps C into itself by [A1]; the norm inequality in [F5] and the Lipschitz bound in [A1] show that its difference at Z,W∈C is at most a∥Z−W∥∞,2. Since a<1, [F3] gives a unique Z=S(V) in C.

3.1A1F5step 2.1algebra

Let V,W∈C, and write Z=S(V), Z′=S(W). Subtracting their stage equations cancels the fixed initial derivative and yields ∥Z−Z′∥∞,2≤hL∥QΔ∥∞∥Z−Z′∥∞,2+hL∥Q−QΔ∥∞∥V−W∥∞,2. Rearranging by 1−a>0 gives ∥S(V)−S(W)∥∞,2≤q∥V−W∥∞,2, so S is a contraction of C.

4.1A1F3F4step 1.1step 3.1induction

By [F3] and step 1.1, S has a unique fixed point U∗∈C. Fact [F4] identifies it with the unique collocation stage vector in this ball. Under the iterate premise U0∈C in [A1], repeated application of the contraction inequality in step 3.1 gives ∥Uk−U∗∥∞,2≤qk∥U0−U∗∥∞,2.

5.1A1step 3.1step 4.1F2algebra∎

For any V∈C, S(U∗)=U∗ and the triangle inequality give ∥V−U∗∥∞,2≤∥V−S(V)∥∞,2+∥S(V)−S(U∗)∥∞,2≤∥V−S(V)∥∞,2+q∥V−U∗∥∞,2. Since 1−q>0, rearranging proves the residual estimate.

Depends on

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