Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 finite-sweep error bound for synchronous waveform relaxation

Statement

Let r,s≥1 and d=r+s, write u=(x,z)∈Rr×Rs, and let F=(f,g):D→Rd be continuous on an open set D⊆Rd. Fix u0∈D, Δ>0, and a closed ball B‾R(u0)⊆D with radius R≥0. Suppose ∥F(u)∥2≤M and ∥F(u)−F(v)∥2≤K∥u−v∥2 on that ball, where M,K≥0, MΔ≤R, and q:=KΔ<1. Let XR be the set of continuous waveforms U:[0,Δ]→Rd with U(0)=u0 and sup⁡t∥U(t)−u0∥2≤R, with the supremum metric, and define Φ(U)(t)=u0+∫0tF(U(s)) ds. Then Φ:XR→XR is a contraction with factor q. It has a unique fixed point U∗, which solves U′=F(U) with U(0)=u0. For any starting waveform U0∈XR, if Uk+1=Φ(Uk) and δ0:=∥U1−U0∥∞, then ∥Uk−U∗∥∞≤qk1−q δ0(k≥1). Thus the finite-window algorithm certifies tolerance ε after k sweeps whenever this displayed bound is at most ε; budget exhaustion without that inequality supplies no such certificate.

Facts & Assumptions

Given: The domain, initial value, bounded/Lipschitz field, radius and window conditions, and waveform map in the Statement.

[F1]

Synchronous Picard waveform relaxation on a finite window: XR is the closed radius-R set of continuous curves with initial value u0, and Φ(U)(t)=u0+∫0tF(U(s)) ds updates both component waveforms from the previous pair.

[F2]

Continuous Rd-valued curves on a nonempty compact interval form a complete space in the supremum metric (Continuous Rn-valued curves on a nonempty compact interval form a complete supremum-metric space).

[F3]

A closed subset of a complete metric space is complete in ZF, without a choice axiom (Closed subspaces of complete metric spaces are complete; the converse under countable choice, claim 2).

[F4]

For an integrable vector function on an increasing interval, ∥∫abV(s) ds∥2≤∫ab∥V(s)∥2 ds (For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable).

[F5]

The vector Riemann integral is componentwise and additive over subintervals (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral). A continuous real-valued function on a compact interval is Riemann integrable, so the continuous vector integrand is componentwise integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

[F6]

A contraction of a nonempty complete metric space into itself has a unique fixed point, its iterates converge, and for m≥k the iterates satisfy d(Um,Uk)≤qkd(U1,U0)/(1−q) (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point).

[F7]

A continuous curve solves the first-order IVP exactly when it satisfies the associated Volterra equation (A first-order initial value problem is equivalent to its Volterra integral equation).

[A1]

MΔ≤R and q=KΔ<1; the stated field bounds hold throughout the closed ball.

Proof

1.1F1F2F3givenalgebra

The constant waveform U(t)=u0 belongs to XR, so XR is nonempty. By [F2] the ambient continuous-curve space is complete. If Un∈XR and Un→U uniformly, then U(0)=u0 and, for every t, ∥U(t)−u0∥2≤∥U−Un∥∞+R; letting n→∞ gives ∥U(t)−u0∥2≤R. Hence XR is closed and complete by the choice-free direction [F3].

1.2F1F4F5A1algebra

For U∈XR, continuity of U and the field Lipschitz bound imply ∥F(U(t))−F(U(t0))∥2≤K∥U(t)−U(t0)∥2→0 as t→t0; this holds with one-sided limits at endpoints. Thus F∘U is continuous and componentwise integrable by [F5]. For 0≤s≤t≤Δ, additivity and [F4] give ∥Φ(U)(t)−Φ(U)(s)∥2≤M(t−s); also Φ(U)(0)=u0 and ∥Φ(U)(t)−u0∥2≤Mt≤MΔ≤R. Thus Φ(U)∈XR.

1.3F1F4A1algebra

For U,V∈XR and t∈[0,Δ], [F4] and the field Lipschitz bound yield ∥Φ(U)(t)−Φ(V)(t)∥2≤∫0tK∥U(s)−V(s)∥2 ds≤KΔ∥U−V∥∞=q∥U−V∥∞. Taking the supremum proves that Φ is a contraction with q<1.

2.1F1F2F3F6step 1.1step 1.2step 1.3

By [F1], [F2]–[F3], and step 1.3, [F6] applies to the nonempty complete space XR and the map Φ:XR→XR. It gives a unique fixed point U∗ and convergence of the iterates from every U0∈XR.

3.1F1F7step 2.1

The fixed-point identity is U∗(t)=u0+∫0tF(U∗(s)) ds. By [F7], this is equivalent to the IVP U′=F(U), U(0)=u0.

4.1F1F6step 2.1algebra∎

Fix k≥1. By [F6], for every m≥k, ∥Um−Uk∥∞≤qkδ0/(1−q). Since Um→U∗ in XR, the triangle inequality gives ∣∥U∗−Uk∥∞−∥Um−Uk∥∞∣≤∥U∗−Um∥∞→0; passing to the limit proves the stated bound. The algorithm reports tolerance-certified only when this bound is at most ε; when the finite budget ends first, it reports budget-exhausted without claiming the requested tolerance.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by Synchronous Picard waveform relaxation on a finite window.

Dependency tree · two levels

88 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