Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generated
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.

Grid-aligned Euler has first-order error for retarded delays

Statement

Fix T,τ,η,ρ>0 and Lt≥0. Write Br={x∈Rd:∥x∥2≤r}. Let f and a history ϕ:[−τ,0]→Rd define the retarded problem of Retarded delay equations and their history space on [0,T+η], with global state Lipschitz constant Ls, and assume [−ρ,T+η+ρ]⊂U. Let y be the unique solution there by Method of steps gives a unique retarded-delay solution. Suppose ϕ is twice continuously differentiable on the interval interior, with continuous one-sided extensions of ϕ′ and ϕ′′ to the endpoints, and ∥ϕ′′(s)∥2≤Mϕ. For 0<h=τ/m≤h0≤η, where m is a positive integer, assume the exact path and all Euler nodes generated for target T lie in a fixed closed ball BR. Choose Q≥0 such that ∥f(t,0,0)∥2≤Q for −ρ≤t≤T+η+ρ, and set Rz=(∥ϕ(0)∥2+(Q+LsR)(T+η))eLs(T+η),R∗=1+max⁡{R,Rz}. Assume that on [−ρ,T+η+ρ]×BR∗×BR∗, f is bounded in norm by Mf, and on [0,T+η]×BR∗×BR∗ it satisfies ∥f(t,x,z)−f(s,x,z)∥2≤Lt∣t−s∣ for fixed x,z and all s,t in this time interval. Put S=max⁡{sup⁡[−τ,0]∥ϕ′(s)∥2,Mf} and Cloc=Lt+Ls(S+Mf)2,Code={Cloc(eLs(T+η)−1)/Ls,Ls>0,Cloc(T+η),Ls=0, Chist=Code+Mf/2+Mϕh0/8,Cdde=Chist(1+Ls(T+η)e2Ls(T+η)). Then, when Explicit Euler with a stored piecewise-linear delay history completes all N updates (no evaluation budget or an integer budget B≥N), its returned piecewise-linear interpolant through Th=Nh, where N is the least integer with Nh≥T, satisfies sup⁡−τ≤t≤T∥y^h(t)−y(t)∥2≤Cddeh. All constants are independent of m. The claim uses a fixed positive delay, grid alignment h=τ/m, time-Lipschitz f, and a common compact tube; it asserts no order for state-dependent delays or a higher-order method crossing a delay breakpoint.

Facts & Assumptions

Given: The retarded delay problem on [0,T+η], the bounded twice differentiable history, an aligned grid, a completed Euler run (no budget or B≥N), the stated uniform tube for the exact and Euler paths, and the stated bounds on f.

[F1]

The retarded problem's solution equals ϕ on [−τ,0] and satisfies y′(t)=f(t,y(t),y(t−τ)) on [0,T+η] (Retarded delay equations and their history space, Method of steps gives a unique retarded-delay solution).

[F2]

The algorithm uses Yn+1=Yn+hf(tn,Yn,Yn−m), and its stored history is the piecewise-linear interpolant of its history and solution nodes (Explicit Euler with a stored piecewise-linear delay history).

[F3]

The global state Lipschitz bound is ∥f(t,x,z)−f(t,x~,z~)∥2≤Ls(∥x−x~∥2+∥z−z~∥2) (Retarded delay equations and their history space).

[F4]

A path with derivative norm at most M is M-Lipschitz, and its increments equal integrals of its derivative (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz).

[F6]

If exact nodal values of a path with cellwise second derivative bounded by M are linearly interpolated on cells of width h, the interpolation error is at most Mh2/8 (Error bound for piecewise-linear stored delay histories).

[F7]

A nonnegative retarded-delay integral inequality with history bound H and forcing q has running maximum at most (H+∫0tq)e2Lst (A Gronwall bound for retarded-delay inequalities).

[F8]

A continuous state-Lipschitz ODE field has a unique local solution; if it is bounded on a compact state ball, the quantitative local theorem gives continuation on a short interval (Picard-Lindelöf local existence and uniqueness for first-order systems).

[F9]

For the one-step map with local defect at most Ch2, stability at most 1+Lsh, and exact and numerical states and stages inside a common compact tube, the uniform-grid global error on an interval of length T′ is at most C(eLsT′−1)h/Ls for Ls>0, and CT′h for Ls=0 (Global error from uniform one-step defect and stability).

[F10]

If u(t)≤a+Ls∫0tu(s)ds with nonnegative continuous u, then u(t)≤aeLst (Gronwall's integral inequality with variable and constant coefficients).

[F11]

The exact-start local defect of a one-step map is its output from the exact starting value minus the exact next value (One-step ODE methods, local defect, uniform order, and step stability).

[A1]

The exact path and Euler nodes lie in BR, and the stated field and time-Lipschitz bounds hold on the displayed compact tubes.

Proof

1.1F2F3F5F4F8F10F12A1givenconstruct

Fix h=τ/m≤h0, let N be the least integer with Nh≥T, and put Th=Nh≤T+η. Run the algorithm through Th and call its stored interpolant y^h. Convex interpolation and [A1] give ∥y^h(t)∥2≤R. Extend it constantly just beyond each endpoint for local ODE neighborhoods of time radius less than min⁡{ρ,τ}. Define Fh(t,x)=f(t,x,y^h(t−τ)) for 0≤t≤Th. It is continuous and Ls-Lipschitz in x. By [F3], ∥Fh(t,0)∥2≤Q+LsR. Local solutions of z′=Fh(t,z) therefore obey ∥z(t)∥2≤∥ϕ(0)∥2+(Q+LsR)t+Ls∫0t∥z(s)∥2ds. The vector integral norm bound [F5] and triangle inequality [F12] justify this estimate. For t≤T+η, replace the first two terms by the constant A=∥ϕ(0)∥2+(Q+LsR)(T+η) and apply [F10]; this gives ∥z(t)∥2≤AeLs(T+η)=Rz. On the compact tube of radius R∗ the field is bounded by Mf, so [F8] continues each local solution by a common positive short-time amount while it remains in that ball. The a priori bound keeps each continuation endpoint within radius Rz; finitely many continuations cover [0,Th]. Denote the resulting solution by zh and set zh=ϕ on [−τ,0]. Since tn−τ=tn−m is a stored node, [F2] shows the Euler updates are exactly forward Euler applied to this fixed ODE.

2.1F2F4F5givenstep 1.1algebra

The auxiliary path and the Euler states lie in the radius-R∗ tube, and ∥zh′(t)∥2≤Mf. On positive-time cells, each slope of y^h is an Euler right-hand side bounded by Mf; on history cells, [F4] and [F5] bound its slope by sup⁡∥ϕ′∥2. Thus y^h is S-Lipschitz on [−τ,Th].

3.1F3F4F5F9F11F12A1givenstep 2.1algebra

The Euler map for the fixed ODE is Ψh,n(x)=x+hFh(tn,x). By [F3] and the triangle inequality [F12] it satisfies ∥Ψh,n(x)−Ψh,n(x~)∥2≤(1+Lsh)∥x−x~∥2. For s∈[tn,tn+1], [F3], the time bound, and step 2.1 give ∥Fh(s,zh(s))−Fh(tn,zh(tn))∥2≤(Lt+Ls(Mf+S))(s−tn). By [F4], the exact increment is the integral of Fh(s,zh(s)); integrating this estimate and using [F5] gives exact-start local defect at most Cloch2 by [F11] and [F12]. Apply [F9] on the uniform grid of length Th, with initial error zero. Since Th≤T+η, it gives max⁡0≤n≤N∥Yn−zh(tn)∥2≤Codeh.

4.1F2F6F12givenstep 2.1step 3.1algebra

On a solution cell, the nodal error bound proved in the preceding step contributes at most Codeh by the triangle inequality [F12]. The interpolant of the two exact zh endpoints differs from zh(t) by at most Mfh/2: if λ=(t−tn)/h, the endpoint-increment estimate is 2λ(1−λ)Mfh≤Mfh/2. Hence ∥y^h(t)−zh(t)∥2≤(Code+Mf/2)h. On history cells, [F6] gives error at most Mϕh2/8≤(Mϕh0/8)h. Therefore sup⁡−τ≤t≤Th∥y^h(t)−zh(t)∥2≤Chisth.

5.1F1F3F4F7F12givenstep 1.1step 4.1algebra∎

Let u(t)=∥zh(t)−y(t)∥2 for −τ≤t≤Th. It is zero on the history. Subtract the integral equations for zh and y using [F1] and [F4], then use [F3] and bound ∥y^h(t−τ)−y(t−τ)∥2 by Chisth+u(t−τ) using step 4.1. This yields u(t)≤∫0t(LsChisth+Ls(u(s)+u(s−τ)))ds. Apply [F7] with H=0 and constant forcing q=LsChisth to obtain sup⁡0≤t≤Thu(t)≤LsChisth(T+η)e2Ls(T+η). The triangle inequality and the interpolation bound from step 4.1 give the claimed estimate on [−τ,T] by [F12].

Depends on

Used by

Dependency tree · two levels

70 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