Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Synchronous Picard waveform relaxation on a finite window

Definition

Let r,s≥1, d=r+s, D⊆Rd be open, F=(f,g):D→Rd be continuous, and u0=(x0,z0)∈D. Choose a window length Δ>0, radius R≥0, bounds M,K≥0, tolerance ε≥0, and integer sweep budget B≥0. The admissibility conditions are that the closed Euclidean ball B‾R(u0) lies in D, ∥F(u)∥2≤M on that ball, ∥F(u)−F(v)∥2≤K∥u−v∥2 there, MΔ≤R, and q:=KΔ<1. If an input condition fails, return not-admissible.

Let CΔ=C([0,Δ],Rd) with d∞(U,V):=sup⁡0≤t≤Δ∥U(t)−V(t)∥2, and let XR:={U∈CΔ:U(0)=u0, sup⁡t∥U(t)−u0∥2≤R}. The synchronous Picard waveform map is Φ(U)(t):=u0+∫0tF(U(s)) ds, where the vector integral is componentwise. This updates both state waveforms from the same preceding pair.

Procedure. If B=0, return the constant waveform U0(t):=u0 with status budget-exhausted and no error certificate. Otherwise set U0(t):=u0 and, for k=1,…,B, compute Uk:=Φ(Uk−1). After the first sweep set δ0:=d∞(U1,U0). After sweep k, compute Ek:=qkδ0/(1−q). If Ek≤ε, return (Uk,tolerance-certified,Ek,k); if the budget is exhausted first, return (UB,budget-exhausted,EB,B). Integrals and waveform updates are exact mathematical operations here; quadrature and inexact subsolves require separate error terms.

Depends on

Used by

Dependency tree · two levels

35 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