Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

A fixed finite modified flow matches its method map to the stated Taylor order

Statement

Fix an integer N≥r and a compact set K⋐U for which the method maps and their selected branches are defined on a neighborhood. Let Hh[N] and Xh[N] be the finite modified Hamiltonian and vector field from A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain, and let φh[N] be the time-h flow of Xh[N]. If the method, the comparison flow, and all Taylor segments remain in a compact K′⋐U, then there are h0,CN>0 such that EK(h)≤CN∣h∣N+2(∣h∣≤h0), where EK(h)=0 if K=∅, and otherwise EK(h):=max⁡z∈K∥Φh(z)−φh[N](z)∥. For nonempty K, this maximum exists by continuity on the compact set and equals the ordinary real supremum. In both cases EK(h) is the least nonnegative upper bound for the pointwise errors on K: for empty K every nonnegative real is an upper bound and 0 is the least. This convention does not assign a real supremum to an empty subset of R. The constants depend on the fixed truncation order and the compact derivative bounds; no uniformity as N→∞ is claimed.

Facts & Assumptions

Given: Fixed finite N, the smooth method and finite modified vector field, and the compact tube and comparison-segment assumptions.

[A1]

The method has a smooth local branch of the required finite regularity on K′. For implicit midpoint this follows from its smooth defining equation and invertible branch derivative. The parametrized implicit function theorem with Ck regularity

[F1]

The Taylor coefficients of the method and the finite modified-flow recursion agree through degree N+1. A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain

[F2]

A local C1 flow exists for a smooth vector field; its integral equation is u(t)=z+∫0tXh[N](u(s))ds. C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade

[F3]

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

[F4]

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

technique · fixed-parameter time Taylor expansion, finite coefficient regrouping, and compact uniform bounds
1.1A1F2F4givenalgebra

If K=∅, its pointwise error family is empty, so every nonnegative real bounds it and 0 is the least such bound. Thus EK(h)=0 satisfies the estimate, for example with h0=CN=1. Assume henceforth K≠∅. For each admitted fixed h, [A1] and [F2] make the method and time-h flow continuous in their initial state. By [F4] their error norm attains a finite nonnegative maximum on K; its maximum is its least nonnegative upper bound and its ordinary real supremum.

1.2A1F1F3F4givenalgebra

The method is a finite composition of smooth shears, or the smooth implicit branch in [A1]. For sufficiently small h0≤1, its derivatives with respect to the step parameter through order N+2 are bounded on the compact admitted comparison set. Applying [F3] to each component therefore gives Φh(z)=z+∑q=1N+1hqdq(z)+RΦ(h,z) with ∥RΦ(h,z)∥≤CΦ∣h∣N+2 uniformly on K. The coefficients dq are those in [F1].

1.3F1F2F3F4giveninductionalgebra

Hold h fixed and put Xh=XH+∑j=rNhjXj. Along its trajectory uh(t,z), the integral equation in [F2] gives ∂tuh=Xh(uh). Repeated differentiation in t gives ∂tquh=Bq(h,uh), where B1(h,w)=Xh(w) and Bq+1(h,w)=DwBq(h,w)Xh(w). Each Bq is a finite polynomial in h with smooth coefficient functions of w, because Xh is such a polynomial by [F1]. For ∣h∣≤h0≤1 these coefficient functions and the required derivatives are uniformly bounded on the compact tube K′ by [F4]. Thus the time derivatives through q=N+2 are uniformly bounded on the stipulated trajectories. Apply [F3] in the time variable, with parameter h fixed, between t=0 and t=h (also for negative h). It gives φh[N](z)=z+∑q=1N+1hqBq(h,z)/q!+Ru(h,z), where ∥Ru(h,z)∥≤Cu∣h∣N+2 uniformly on K. No derivative of the flow with respect to the field parameter h is used.

2.1F1F4step 1.1step 1.2step 1.3algebra∎

Expand the finitely many polynomials Bq(h,z) in step 1.3 and collect equal powers of h. Every term of degree at least N+2 is bounded by a fixed constant times ∣h∣N+2 for ∣h∣≤1, 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 N+1 with the method coefficients dq in step 1.2. Subtracting the two expansions leaves only their uniform remainders and the discarded higher-degree polynomial terms. Consequently ∥Φh(z)−φh[N](z)∥≤CN∣h∣N+2 for all z∈K, after increasing CN to a positive constant. Taking the attained maximum from step 1.1 proves the asserted estimate; step 1.1 already covers empty K.

Depends on

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