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.

One-step ODE methods, local defect, uniform order, and step stability

Definition

Let d≥1, let D⊆R×Rd be open, and consider a first-order IVP and solution in the sense of First-order systems, initial value problems, and solutions on intervals. A one-step method is a family of maps Ψh(t,v), defined for admitted times t, positive step sizes h, and states v, whose value is the method's approximation at time t+h from the single input state v at time t. It does not use earlier numerical states.

If y is an exact solution on an interval containing [t,t+h], the local defect is

δh(t;y):=Ψh(t,y(t))−y(t+h).

Let K⊆D be a fixed compact time-state set. The method has uniform local order p on K along y if there are constants C≥0 and h0>0, independent of the admitted starting time t and step 0<h≤h0, such that

∥δh(t;y)∥2≤Chp+1

whenever the exact solution graph on [t,t+h] and the associated method time-state inputs, stages, and outputs under consideration lie in K. Here p is a positive integer and ∥⋅∥2 is the Euclidean norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

The method has one-step Lipschitz stability on K with constant L≥0 if

∥Ψh(t,u)−Ψh(t,v)∥2≤(1+Lh)∥u−v∥2

for every admitted step size h, admitted time t, and input states u,v with (t,u),(t,v)∈K. This is a bound on the change in one step; it is separate from absolute or linear stability regions and does not itself assert a global error estimate.

Depends on

Used by

Dependency tree · two levels

17 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