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.
A fixed finite modified flow matches its method map to the stated Taylor order
Statement
Fix an integer and a compact set for which the method maps and their selected branches are defined on a neighborhood. Let and be the finite modified Hamiltonian and vector field from A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain, and let be the time- flow of . If the method, the comparison flow, and all Taylor segments remain in a compact , then there are such that where if , and otherwise For nonempty , this maximum exists by continuity on the compact set and equals the ordinary real supremum. In both cases is the least nonnegative upper bound for the pointwise errors on : for empty every nonnegative real is an upper bound and is the least. This convention does not assign a real supremum to an empty subset of . The constants depend on the fixed truncation order and the compact derivative bounds; no uniformity as is claimed.
Facts & Assumptions
Given: Fixed finite , the smooth method and finite modified vector field, and the compact tube and comparison-segment assumptions.
The method has a smooth local branch of the required finite regularity on . For implicit midpoint this follows from its smooth defining equation and invertible branch derivative. The parametrized implicit function theorem with regularity
The Taylor coefficients of the method and the finite modified-flow recursion agree through degree . A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain
A local flow exists for a smooth vector field; its integral equation is . C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade
Scalar Taylor expansion along a real segment gives a derivative-controlled finite-order remainder; componentwise bounds give a Euclidean remainder bound. Multivariable Taylor formula with a Lagrange remainder along a line segment
A continuous real-valued function on a nonempty compact metric space has a finite attained maximum, equal to its real supremum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
Proof
If , its pointwise error family is empty, so every nonnegative real bounds it and is the least such bound. Thus satisfies the estimate, for example with . Assume henceforth . For each admitted fixed , [A1] and [F2] make the method and time- flow continuous in their initial state. By [F4] their error norm attains a finite nonnegative maximum on ; its maximum is its least nonnegative upper bound and its ordinary real supremum.
The method is a finite composition of smooth shears, or the smooth implicit branch in [A1]. For sufficiently small , its derivatives with respect to the step parameter through order are bounded on the compact admitted comparison set. Applying [F3] to each component therefore gives with uniformly on . The coefficients are those in [F1].
Hold fixed and put . Along its trajectory , the integral equation in [F2] gives . Repeated differentiation in gives , where and . Each is a finite polynomial in with smooth coefficient functions of , because is such a polynomial by [F1]. For these coefficient functions and the required derivatives are uniformly bounded on the compact tube by [F4]. Thus the time derivatives through are uniformly bounded on the stipulated trajectories. Apply [F3] in the time variable, with parameter fixed, between and (also for negative ). It gives , where uniformly on . No derivative of the flow with respect to the field parameter is used.
Expand the finitely many polynomials in step 1.3 and collect equal powers of . Every term of degree at least is bounded by a fixed constant times for , because there are finitely many such terms and their coefficient functions are bounded on the compact tube. The recursion in [F1] (its coefficient construction) identifies all collected coefficients through degree with the method coefficients in step 1.2. Subtracting the two expansions leaves only their uniform remainders and the discarded higher-degree polynomial terms. Consequently for all , after increasing to a positive constant. Taking the attained maximum from step 1.1 proves the asserted estimate; step 1.1 already covers empty .
Depends on
- A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain
- The parametrized implicit function theorem with $C^k$ regularity
- C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade
- Multivariable Taylor formula with a Lagrange remainder along a line segment
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
Used by
Dependency tree · two levels
53 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, Geometric Numerical Integration, TU München Lecture 3: Backward error analysis (standard reference, not scraped)
- Nikolaj Nordkvist and Poul G. Hjorth, Classical Mechanics and Symplectic Integration (standard reference, not scraped)