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.
Forward Euler has uniform local order one and a one-step Lipschitz bound
Statement
Let , , and let be an open time-state domain whose fibers are open and convex. Let be compact. Let have continuous first partial derivatives, and suppose is a solution of , , on an open interval containing , with graph on contained in . For each local defect under consideration, require the Euler input and output time-state pairs to lie in ; the exact solution segment already lies in .
For , assume finite constants satisfy throughout
Here is the matrix with entries , and the last inequality defines the operator bound used below. The forward Euler map is . Then, with , for every and with whose Euler input and output pairs lie in , its local defect satisfies
so it has uniform local order one on along , with . For every , every admitted , and every ,
This is a local defect and one-step stability result. It does not assert a global error estimate or an order for any other named method.
Facts & Assumptions
Given: The stated open ODE domain with open convex state fibers, continuous first partial derivatives and bounds, the solution through on an open interval containing , the compact set containing its graph and the Euler time-state pairs under consideration, and the definition of uniform local order.
One-step ODE methods, local defect, uniform order, and step stability: ; uniform local order one means a uniform defect; one-step Lipschitz stability is the displayed bound.
First-order systems, initial value problems, and solutions on intervals: an IVP has open time-state domain, and a solution is differentiable on an interval, has graph in the domain, and satisfies and its initial value.
If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative: continuous first partial derivatives give a total derivative whose matrix is the Jacobian of those partials.
Total differentiability gives a local increment bound and therefore continuity: total differentiability implies continuity at each point.
A convex subset of contains every line segment between two of its points: a convex set contains the segment between each pair of its points; each open convex state fiber has this property.
On a convex open set, a uniform bound implies : on an open convex Euclidean set, a uniform derivative bound implies .
Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: a continuous vector field locally Lipschitz in the state variable has a unique maximal IVP solution. The given derivative bound and [F3]–[F6] provide that local Lipschitz condition on each state fiber.
A vector field along an ODE solution has an explicit derivative bound: along an exact solution, has derivative bounded by .
A first-order initial value problem is equivalent to its Volterra integral equation: for any initial time on the solution interval, the solution satisfies .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a real function is continuous on a closed interval and differentiable in its interior, its endpoint difference is its derivative at an interior point times the interval length.
The Euclidean inner product on : for , .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: for , the Euclidean norm satisfies .
Proof
By [F3]–[F4], is totally differentiable and continuous on , with state derivative matrix . On each open convex fiber , the derivative bound and [F5]–[F6] make -Lipschitz. Thus the hypotheses of [F7] hold and the IVP has a unique maximal solution; the given solution agrees with it throughout .
Fix any and with satisfying the stated compact-set condition, and fix a component . Define for . The exact path segment lies in , so [F8] gives on .
For each , [F10] applied to on yields ; at the same inequality is equality.
Apply [F9] to the IVP restarted at ; then . Euler's output from the exact state is , so . Using [step 2.1] gives . Squaring the component bounds, summing, and using [F11] gives the asserted Euclidean norm estimate. Its constant is independent of and , proving uniform local order one under [F1].
For any admitted , , and , [F3] identifies the derivative of with ; [F5]–[F6] give . Therefore [F12] gives , which is the one-step stability bound in [F1] for inputs in .
Remarks
The defect proof is choice-free and uses only the time-along-flow chain rule and the componentwise integral remainder. The Taylor supplier is used by the scalar linear example, not needed to prove this theorem. The global error recurrence in the cited numerical-analysis sources is outside this item.
Depends on
- One-step ODE methods, local defect, uniform order, and step stability
- A convex subset of $\mathbb{R}^m$ contains every line segment between two of its points
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- First-order systems, initial value problems, and solutions on intervals
- A vector field along an ODE solution has an explicit derivative bound
- A first-order initial value problem is equivalent to its Volterra integral equation
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative
- Total differentiability gives a local $O(\|h\|_2)$ increment bound and therefore continuity
- On a convex open set, a uniform bound $\|Df(z)v\|_2\le M\|v\|_2$ implies $\|f(y)-f(x)\|_2\le M\|y-x\|_2$
- Every Picard–Lindelöf initial value problem has one maximal solution on an open interval
Used by
Dependency tree · two levels
54 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
- Ernst Hairer, course notes, Chapter III: Équations Différentielles Ordinaires, Sections III.2–III.3 (standard reference, not scraped)
- MIT OpenCourseWare, 18.330 Introduction to Numerical Analysis (Spring 2012), Chapter 5, Sections 5.2.1–5.2.2 (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, Julia Edition, Sections 6.2.1–6.2.2 (standard reference, not scraped)