Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Scalar neutral delay equations and the derivative-segment shift

Definition

Use the fixed positive-delay/history convention of Retarded delay equations and their history space in dimension d=1. The canonical isometric coordinate map between R and R1 is as specified in Vector-valued functions f:A→Rm, their limits and continuity, with the dictionary to the metric notions; the formulas below write the single coordinate as a real scalar.

Let τ>0, T=Kτ with integer K≥1, a∈R, and let U be an open interval containing [0,T]. Let f:U×R×R→R be continuous and globally Lipschitz in its last two variables: for some L≥0, ∣f(t,x,z)−f(t,x~,z~)∣≤L(∣x−x~∣+∣z−z~∣)(t∈U). Let ϕ:[−τ,0]→R be continuously differentiable, with continuity and derivative as in Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point and The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set. A scalar neutral delay initial-value problem is y′(t)−ay′(t−τ)=f(t,y(t),y(t−τ)),0≤t≤T, with history y(t)=ϕ(t) for −τ≤t≤0. A solution is continuous on [−τ,T], continuously differentiable on [0,T] with domain-relative endpoint derivatives, and satisfies the equation. The history is compatible at zero when ϕ′(0)=aϕ′(−τ)+f(0,ϕ(0),ϕ(−τ)). The parameter restriction ∣a∣<1 is the stable derivative-shift branch used below; the equation itself is defined for every real a. No state-dependent delay is included.

For the finite horizon T=Kτ, write a derivative path as segments uk(s)=y′(kτ+s) for 0≤k<K and 0≤s≤τ. Let XK be the set of K-tuples of continuous real functions on [0,τ], with continuity as in Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point, and define ∥u∥XK=max⁡0≤k<Ksup⁡0≤s≤τ∣uk(s)∣, and the delay shift SK by (SKu)0(s)=0 and (SKu)k(s)=uk−1(s) for 1≤k<K. The known derivative history on the first segment is a forcing term; on each later segment the delayed derivative is exactly the preceding segment SKu. Thus the neutral derivative relation has the operator form (I−aSK)u=r, with r containing the right-hand side and the known initial derivative history.

For a compatible-grid method with h=τ/m, m≥1, and N=Km, the corresponding mesh shift on arrays v=(v0,…,vN−1)∈RN is (SK,mv)n=0 for 0≤n<m and (SK,mv)n=vn−m for m≤n<N. For any finite array length M∈N0 and integer m≥1, denote the same rule by Sm(M). If M≥1, use the max norm ∥v∥∞=max⁡0≤n<M∣vn∣. If M=0, the coordinate space R0 consists of its unique empty array, the zero vector (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}); define its norm to be 0 and define Sm(0) to be the unique map from this zero space to itself. Thus no maximum of an empty real set is used. In particular SK,m=Sm(Km). This records the delayed discrete derivative when estimating any partial sequence of Euler steps. The known derivative values from ϕ′ occupy the first m steps.

Depends on

Used by

Dependency tree · two levels

36 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