Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Delayed feedback gives an explicit two-block Euler recurrence

Example

Let τ>0, a∈R, and consider y′(t)=ay(t−τ) with history ϕ(s)=1 on [−τ,0], through T=2τ. This is the retarded problem of Retarded delay equations and their history space, and its unique solution is supplied by Method of steps gives a unique retarded-delay solution. For h=τ/m with integer m≥1, apply Explicit Euler with a stored piecewise-linear delay history. The exact endpoint error is ∣y(2τ)−Y2m∣=a2τh2. It vanishes when a=0 and is first order in h otherwise, in agreement with Grid-aligned Euler has first-order error for retarded delays.

Facts & Assumptions

Given: A fixed delay τ>0, scalar coefficient a, constant history ϕ=1, target 2τ, and the aligned grid h=τ/m.

[F1]

The exact equation is y′(t)=ay(t−τ) with the given history; the retarded method of steps gives its unique solution (Retarded delay equations and their history space, Method of steps gives a unique retarded-delay solution).

[F2]

The algorithm initializes exact history values and updates Yn+1=Yn+haYn−m (Explicit Euler with a stored piecewise-linear delay history).

[F3]

Under grid alignment, compact-tube, and time-Lipschitz assumptions, this algorithm has uniform first-order error for the returned interpolation (Grid-aligned Euler has first-order error for retarded delays).

Proof

1.1F1givenalgebra

On the first block 0≤t≤τ, the delayed value is 1, so y(t)=1+at. On the second block, writing s=t−τ∈[0,τ], the delayed value is y(s)=1+as, hence y′(τ+s)=a+a2s and y(2τ)=1+2aτ+a2τ2/2.

1.2F2givenalgebra

The first Euler block gives Yj=1+ajh for 0≤j≤m. On the second block, [F2] gives Ym+j+1=Ym+j+ahYj for 0≤j<m. Summing yields Y2m=1+aτ+ah∑j=0m−1(1+ajh). Pairing the terms j and m−1−j (and retaining the middle term when m is odd) gives ∑j=0m−1j=m(m−1)/2, so Y2m=1+2aτ+a2h2m(m−1)/2.

2.1F1F2F3step 1.1step 1.2givenalgebra∎

Subtracting step 1.2 from step 1.1 and using τ=mh gives y(2τ)−Y2m=a2h2m/2=a2τh/2. Since this is nonnegative, its absolute value is the claimed error, including a=0. On the first Euler block, ∣Yj∣≤1+∣a∣τ; on the second, ∣Ym+j∣≤1+∣a∣τ+∣a∣τ(1+∣a∣τ) for 0≤j≤m. The exact solution is polynomial on each of the first three delay blocks: besides step 1.1, on [2τ,3τ] it is y(2τ+s)=y(2τ)+(a+a2τ)s+(a2/2)s2+(a3/6)s3. These formulas give a common bounded tube independent of h. The data therefore satisfy [F3] with η=h0=τ, because f(t,x,z)=az is time-independent, the history has zero second derivative, and the tube is compact. Thus the exact error formula is consistent with the first-order guarantee.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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