Alphabeta Math
Pipeline-generated
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.

✓ 10 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Geometric numerical integration

1 · Prerequisites

2 · Summary

Summary

This page extends the published global leapfrog maps by stating their local admitted domain when a potential is defined on a proper open configuration set. It fixes kick-then-drift ordering for local symplectic Euler, proves the discrete Jacobian pullback identities directly, and derives first-order symplectic-Euler and second-order leapfrog errors on a controlled compact tube. The implicit midpoint method is defined through its actual one-stage equation, with a selected contraction branch, explicit non-success statuses, symplectic pullback, and finite-time second-order error.

For each fixed finite truncation order, the page constructs a globally defined modified Hamiltonian on a star-shaped phase domain, proves the local map-to-flow remainder and the one-step modified-energy defect, then sums that defect only while the numerical path and comparison segments stay in the declared compact tube. The formal series need not converge. The original Hamiltonian need not be an exact invariant of the discrete map. The published HMC leapfrog result continues to supply its own global reversibility and volume claims under their stated hypotheses; this page does not reprove them.

The companion examples give explicit harmonic-oscillator calculations and separate A-stability from symplecticity.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Local domain restriction for kick, drift, and leapfrog maps

Definition

Let Q⊆Rd be open, let V∈C1(Q,R), and let M be a real symmetric positive-definite matrix. Use the force-kick Ka and drift Db already defined in One-step leapfrog map as force and drift shears, with U there replaced by V. The local kick is the restriction of Ka to Q×Rd. The local drift is the restriction of Db to {(q,p):q∈Q, q+bM−1p∈Q}.

For a signed step h, the local leapfrog map is the restriction of Kh/2∘Dh∘Kh/2 to the states for which all three intermediate configurations lie in Q. Its output is defined only on that admitted set. This definition changes the configuration domain of the published map; it does not redefine the global leapfrog map or assert that the local map is complete.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A smooth local Hamiltonian flow preserves the canonical symplectic matrix

Statement

Let U⊆R2d be open, H∈C∞(U), and use the canonical symplectic form ω=∑i=1ddqi∧dpi with matrix J=(0I−I0). Define XH by ιXHω=dH. Let φt be the local flow on any open set where it is defined. At each initial state and time for which the intervening trajectory lies in U, its derivative satisfies Dφt(z)TJDφt(z)=J. This is a local, choice-free variational proof; no completeness is asserted.

Facts & Assumptions

Given: The open set, smooth Hamiltonian, canonical matrix, and local Hamiltonian flow.

[F1]

The library convention is ιXHω=dH. In these coordinates, if X=(u,v) then ιXω=∑i(ui dpi−vi dqi); equating this with dH gives XH=(∇pH,−∇qH)=J∇H. Hamiltonian vector field and Hamiltonian function

[F2]

The local flow is C1 in its initial state and its derivative solves Y′=DXH(φt(z))Y, Y(0)=I. C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade

[F3]

The Hessian of a smooth scalar function is symmetric. Continuous mixed partials of order k are invariant under permutations

Proof

technique · differentiate the pulled-back constant matrix along the variational equation
1.1F1F3algebra

In canonical coordinates [F1] gives XH=J∇H, hence A(z):=DXH(z)=J∇2H(z). By [F3] the Hessian is symmetric, and JT=−J, J2=−I; therefore ATJ+JA=0.

2.1F2step 1.1algebra∎

Set Y(t)=Dφt(z). By [F2], Y′=A(φt(z))Y and Y(0)=I. The product rule gives ddt(YTJY)=YT(ATJ+JA)Y=0 by step 1.1. Thus Y(t)TJY(t)=Y(0)TJY(0)=J throughout the local time interval.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Local kick-then-drift symplectic Euler step

Definition

Input an admitted state (q,p)∈Q×Rd, step h>0, V∈C1(Q), and symmetric positive-definite M. First set p+=p−h∇V(q). Then set q+=q+hM−1p+. If q+∉Q, return domain-failure; otherwise return (q+,p+). This fixes the kick-then-drift ordering. The returned map is the partial composition Dh∘Kh in the notation of Local domain restriction for kick, drift, and leapfrog maps.

For exact mathematical statements the displayed operations are evaluated exactly. A finite implementation that cannot certify the state and force evaluation returns inconclusive; it does not report a step outside Q as successful.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Local implicit midpoint step for a Hamiltonian vector field

Definition

Let d≥1, let U⊆R2d be open, and let H∈C2(U). Write z=(q,p) in canonical coordinates, set J=(0I−I0), and use the Euclidean norm and its induced operator norm. Define the finite-regularity coordinate field F(q,p):=(∇pH(q,p),−∇qH(q,p))=J∇H(q,p).

Given z∈U and a signed step h, supply a candidate radius ρ≥0. If no radius is supplied or ρ<0, return branch-not-certified. If the closed ball B‾(z,ρ) is certified not to lie in U, return domain-failure; if its containment in U cannot be certified, return branch-not-certified. For a ball contained in U, supply certified bounds M,L≥0 with M≥sup⁡W∈B‾(z,ρ)∥F(W)∥,L≥sup⁡W∈B‾(z,ρ)∥DF(W)∥. If either bound or its certificate is unavailable, or if either admissibility inequality ∣h∣M/2≤ρ or ∣h∣L/2<1 fails, return branch-not-certified. Otherwise the exact local implicit midpoint step selects the unique Z∈B‾(z,ρ) satisfying Z=z+h2F(Z) and returns z+=2Z−z. The returned state is in R2d; a further step is admitted only when that state lies in U and passes a new ball check.

For a finite iteration implementation of an admitted branch, input an output tolerance τ>0 and an update budget B∈N0. Use θ=∣h∣L/2 and proceed as follows.

  1. Set Z0=z. If B=0, return inconclusive with current stage iterate Z0, approximate output z, and output-error bound 2ρ.
  2. If B≥1, compute Z1=z+(h/2)F(Z0) and set d1=∥Z1−Z0∥.
  3. For k=1,…,B, set bk=θkd1/(1−θ) and the output radius rk=2bk. If rk≤τ, return the approximation 2Zk−z with output-error certificate rk. Otherwise, if k<B, compute Zk+1=z+(h/2)F(Zk) and continue. If the check fails at k=B, return inconclusive with current stage iterate ZB, approximate output 2ZB−z, and output-error bound 2bB.

When θ=0, use θk=0 for k≥1; the procedure never evaluates 00. If a finite implementation cannot certify an input or an exact operation needed for these instructions, return inconclusive without a tolerance claim. The certificates concern the displayed exact recurrence and exact output operations; inexact evaluations require additional certified error accounting. An approximate result is not asserted to be exactly symplectic. The exact map is the selected branch value 2Z−z.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Canonical kick and drift shears satisfy the symplectic Jacobian identity

Statement

Let Q⊆Rd be open, V∈C2(Q), and M be symmetric positive definite. Put J=(0I−I0). At every point of their open domains, the local kick and drift from Local domain restriction for kick, drift, and leapfrog maps are C1 and their Jacobians A satisfy ATJA=J. Here this matrix identity is the finite-regularity meaning of symplecticity; no smooth-manifold definition is being applied to a map of insufficient regularity.

Facts & Assumptions

Given: Q,V,M, the local restrictions of the kick and drift from Local domain restriction for kick, drift, and leapfrog maps, and the canonical matrix J.

[F1]

The published force-kick and drift are Ka(q,p)=(q,p−a∇V(q)) and Db(q,p)=(q+bM−1p,p). One-step leapfrog map as force and drift shears

[F2]

The local domain restriction leaves these formulas unchanged wherever the operation is admitted. Local domain restriction for kick, drift, and leapfrog maps

[F3]

Positive definiteness makes M injective, hence invertible in finite dimension; since MT=M, (M−1)T=(MT)−1=M−1. The Hessian of a C2 scalar function is symmetric. Continuous mixed partials of order k are invariant under permutations

Proof

technique · direct block-matrix calculation
1.1F1F2F3givenalgebra

At an admitted point, differentiation of [F1] gives DKa=(I0−a∇2V(q)I). Writing C=−a∇2V(q)=CT, block multiplication gives DKaTJDKa=(C−CTI−I0)=J.

1.2F1F2F3givenalgebra

Differentiation of the drift gives DDb=(IbM−10I). Writing B=bM−1=BT, multiplication yields DDbTJDDb=(0I−IBT−B)=J.

2.1step 1.1step 1.2∎

Thus each admitted shear satisfies the claimed identity at every point of its open domain.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Local leapfrog and kick-then-drift symplectic Euler are symplectic

Statement

Under the hypotheses of Canonical kick and drift shears satisfy the symplectic Jacobian identity, every admitted local leapfrog step and every admitted kick-then-drift symplectic Euler step is a C1 map with continuous Jacobian satisfying DΦTJDΦ=J on its open admitted domain. The result concerns symplecticity, not energy conservation.

Facts & Assumptions

Given: V∈C2(Q), symmetric positive-definite M, the local partial maps and their admitted domains.

[F1]

The local kick, drift, and leapfrog composition have the domains and compositions stated in the local-domain definition. Local domain restriction for kick, drift, and leapfrog maps

[F2]

The symplectic Euler step is the partial composition Dh∘Kh. Local kick-then-drift symplectic Euler step

[F3]

Each admitted kick and drift Jacobian satisfies ATJA=J. Canonical kick and drift shears satisfy the symplectic Jacobian identity

[F4]

At each admitted point z, the chain rule gives D(g∘f)(z)=Dg(f(z))Df(z), with the outer derivative evaluated at the intermediate point f(z). The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

Proof

technique · composition of symplectic shears
1.1givenF1F2

By [F1] and [F2], each step under discussion is a finite composition of admitted local kicks and drifts. The intermediate points lie in Q by the admitted-domain conditions, so every derivative in the composition is defined.

2.1F3F4algebra∎

If A and B satisfy ATJA=J and BTJB=J, then (AB)TJ(AB)=BT(ATJA)B=BTJB=J. Applying this identity successively to [F3], with [F4] identifying the Jacobian of each composition, proves the result for both step maps.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Local and finite-time trajectory error for symplectic Euler and leapfrog

Statement

Let d≥1, Q⊆Rd be open, V∈C3(Q), and M symmetric positive definite. Set H(q,p)=12pTM−1p+V(q) and F(q,p)=(M−1p,−∇V(q)). Fix T>0 and h=T/N with N≥1. Suppose the exact solution, numerical states, all kick/drift intermediate states, and every line segment used below lie in one compact convex tube K⋐Q×Rd, with the derivatives of F through order two bounded there. For z0 in that tube, write enE for the error of iterated kick-then-drift symplectic Euler and enV for the error of iterated local leapfrog relative to the exact solution at tn=nh. Write ΨhE and ΨhV for their admitted one-step maps and φh for the exact flow. For sufficiently small h, constants CE,CV,L independent of h,N,n satisfy ∥ΨhE(z)−φh(z)∥≤CEh2,∥ΨhV(z)−φh(z)∥≤CVh3 for admitted z∈K, and whenever nh≤T, enE≤eLTe0+CETeLTh,enV≤eLTe0+CVTeLTh2. Thus symplectic Euler has global order one and leapfrog has global order two on the stated controlled tube. No unconditional domain-admissibility claim is made.

Facts & Assumptions

Given: V∈C3(Q), SPD M, an exact Hamiltonian solution and numerical trajectories contained in the stated compact convex tube, with all method stages admitted.

[A1]

The local map is the partial kick/drift composition; symplectic Euler uses kick then drift, while leapfrog uses half-kick, full drift, half-kick. Local domain restriction for kick, drift, and leapfrog maps, Local kick-then-drift symplectic Euler step

[F1]

Since M is symmetric positive definite, Mx=0 forces x=0, so M is invertible and (M−1)T=(MT)−1=M−1. Differentiating H(q,p)=12pTM−1p+V(q) therefore gives ∇H=(∇V(q),M−1p) and the coordinate field F=(M−1p,−∇V(q)).

[F2]

The exact local flow and its variational derivative exist on admitted compact trajectory segments. C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade

[F4]

Apply the scalar Taylor theorem coordinatewise on the compact convex tube; finitely many coordinate remainder bounds combine into a Euclidean bound. The same argument applies to the entries of ∇2V. Multivariable Taylor formula with a Lagrange remainder along a line segment

Proof

technique · Taylor defect, one-step stability, and a finite geometric recurrence
1.1A1F1F2F3F4given

By [F1]–[F3], the exact solution satisfies z′=F(z) and z′′=DF(z)F(z). Since D2F is bounded on K, [F4] gives uniformly φh(z)=z+hF(z)+12h2DF(z)F(z)+R(z,h),∥R(z,h)∥≤C0h3.

1.2A1F1F4F5algebra

The kick derivative is I+hAK(q) with AK=(00−∇2V(q)0) and the drift derivative is I+hAD with AD=(0M−100). Their sum is DF(q,p). For kick-then-drift, the derivative product is (I+hAD)(I+hAK)=I+hDF+O(h2). For leapfrog it is (I+(h/2)AK(q1))(I+hAD)(I+(h/2)AK(q))=I+hDF+O(h2); since q1−q=O(h) and D3V is bounded, [F4] applied to each Hessian entry gives ∇2V(q1)−∇2V(q)=O(h). The remainders are uniform on K, so ∥DΨh∥≤1+Lh for a fixed L and small h. The vector-valued mean-value inequality [F5] on the stipulated convex segments gives the same one-step Lipschitz bound for pairs of compared states.

2.1A1F1step 1.1algebra

Kick-then-drift Euler gives pE=p−h∇V(q) and qE=q+hM−1pE. Thus pE=p−h∇V(q) and qE=q+hM−1p−h2M−1∇V(q). Comparing with the two coordinate components of step 1.1 gives a uniform one-step defect at most CEh2.

2.2A1F1F4step 1.1algebra

For leapfrog, the intermediate momentum is p1/2=p−(h/2)∇V(q) and the new position is q1=q+hM−1p1/2=q+hM−1p−(h2/2)M−1∇V(q). Taylor expansion of ∇V(q1), using bounded third derivatives of V, gives p1=p−h2∇V(q)−h2∇V(q1)=p−h∇V(q)−h22∇2V(q)M−1p+O(h3). These are exactly the terms through degree two in step 1.1, so the leapfrog one-step defect is at most CVh3.

3.1A1step 1.2step 2.1step 2.2algebra

For either method, if its local defect is Chs+1, steps 1.2, 2.1, and 2.2 give en+1≤(1+Lh)en+Chs+1. Iterating this inequality and using (1+Lh)j≤eLT and n≤T/h yields en≤eLTe0+CTeLThs.

4.1step 3.1algebra∎

Substitution of s=1,C=CE for symplectic Euler and s=2,C=CV for leapfrog in step 3.1 gives the two stated bounds.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The admitted implicit midpoint branch is symplectic and second order

Statement

Let d≥1, U⊆R2d be open, H∈C2(U), z=(q,p), and J=(0I−I0). Use the Euclidean norm and its induced operator norm, and define F(q,p)=(∇pH(q,p),−∇qH(q,p))=J∇H(q,p). For a signed step h, suppose a declared closed ball B‾(z,ρ)⊂U, with ρ≥0, has certified bounds ∥F∥≤M and ∥DF∥≤L satisfying ∣h∣M/2≤ρ and θ:=∣h∣L/2<1. The exact implicit midpoint branch Local implicit midpoint step for a Hamiltonian vector field then has a unique stage root Z in this ball. The exact iterates Z0=z, Zk+1=z+(h/2)F(Zk) stay in the ball, converge to Z, and for every k∈N0 satisfy ∥Zk−Z∥≤bk:=θk∥Z1−Z0∥1−θ,∥(2Zk−z)−(2Z−z)∥≤2bk. Here θ0=1, including when θ=0; if θ=0, the first update equals Z and bk=0 for k≥1. Also ∥(2Z−z)−z∥≤2ρ, which supplies an output-error bound when no update is computed.

For every finite tolerance τ>0 and budget B∈N0, the implementation in Local implicit midpoint step for a Hamiltonian vector field terminates after at most B updates and at most B evaluations of F; each reported error radius is a valid bound.

Assume additionally H∈C3(U) and that these ball hypotheses hold uniformly for initial values z in a compact convex tube for all ∣h∣≤h0, with some h0>0 and common ρ,M,L, where h0L/2≤1/2. At every admitted initial value the selected branch is locally the restriction of a C1 solution branch, and its exact local map Ψh(z)=2Z−z satisfies DΨh(z)TJDΨh(z)=J.

Fix T>0. Under these additional C3 and uniform branch hypotheses, assume also that the exact and numerical trajectories, the branch balls, and the segments used in comparison lie in a compact convex subset of U whenever n∣h∣≤T, with F and its first two derivatives bounded there. For an initial value z0 in the tube, define zk+1=Ψh(zk) for k∈N0 and en=∥zn−φnh(z0)∥ for n∈N0 (so e0=0). Then for constants C,L1 independent of h,n, every z in the tube, and every ∣h∣≤h0 with n∣h∣≤T, ∥Ψh(z)−φh(z)∥≤C∣h∣3,en≤eL1Te0+CTeL1T∣h∣2. Here φh is the exact Hamiltonian flow. These symplecticity and trajectory-error conclusions concern the exact selected map; no such conclusion is asserted here for a finite iteration output.

Facts & Assumptions

Given: For the contraction and iteration estimates, the stated C2 Hamiltonian, admitted closed ball, bounds, and signed-step inequalities. For the symplecticity and trajectory-error claims, assume additionally the stated C3 regularity, uniform branch hypotheses, and controlled finite-time tube.

[A1]

The field and selected branch obey the domain, closed-ball, bound, and step-size conditions in the Statement. Local implicit midpoint step for a Hamiltonian vector field

[F1]

On a complete metric space, a contraction has a unique fixed point and its iterates converge with tail bound d(Zk,Z)≤qkd(Z1,Z0)/(1−q). A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point

[F2]

A C1 finite-dimensional equation with invertible derivative in the unknown has a locally unique C1 solution branch with the implicit derivative formula. The Euclidean implicit function theorem with derivative formula

[F3]

For a C1 vector field, the local flow is C1 in the initial state and its derivative solves the variational equation; a C2 field gives the needed finite C2 flow regularity. C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade

[F4]

The cited Taylor theorem is scalar. A compact convex tube K⋐U has an open convex neighborhood contained in U, so the theorem can be applied separately to each scalar coordinate function on the stipulated segments, each entry of DF, and each scalar coordinate of a trajectory on its local time interval. Intermediate points may depend on the coordinate. If the coordinate remainders satisfy ∣Ri∣≤Cirs, their vector satisfies ∥R∥2≤(∑iCi2)1/2rs. Multivariable Taylor formula with a Lagrange remainder along a line segment

[F5]

Under the additional C3 hypotheses, differentiating the explicit coordinate field in the Statement gives DF=J∇2H, and the Hessian is symmetric. Continuous mixed partials of order k are invariant under permutations

[F6]

Derivatives of compositions and products obey the total-derivative chain rule. The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

[F7]

The Euclidean p=2 norm on R2d induces d2, and (R2d,d2) is complete; hence this normed space is Banach. A Cauchy sequence in a closed ball converges in R2d, and if xj→x with ∥xj−z∥≤ρ, then ∥x−z∥≤∥x−xj∥+∥xj−z∥≤∥x−xj∥+ρ, so the limit remains in the ball. Each ∥⋅∥p is a norm on Rn, and the induced metrics are exactly d1, d2 and d∞ of the published metric-spaces page, R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R, Banach space

[F8]

Every bounded sequence in R2d has a convergent subsequence. For n≥1 every bounded sequence in Rn has a convergent subsequence

[F9]

For a continuous curve in a Banach space that is differentiable in the interval's interior, a bound ∥γ′(t)∥≤C implies ∥γ(b)−γ(a)∥≤C(b−a). Mean value inequality for a differentiable Banach-valued curve

Proof

technique · contraction branch, Cayley-transform pullback, and a finite-time defect recurrence
1.1A1F1F6F7F9givenalgebra

Since H∈C2(U), the coordinate field F is C1. On the admitted closed ball, Tz(W)=z+(h/2)F(W) maps the ball into itself because ∥Tz(W)−z∥≤∣h∣M/2≤ρ. For W,V in the ball, the curve γ(t)=F(V+t(W−V)) lies in it and [F6] gives ∥γ′(t)∥≤L∥W−V∥; the mean-value inequality [F9] therefore gives ∥Tz(W)−Tz(V)∥≤θ∥W−V∥, where θ=∣h∣L/2<1. The ball is nonempty and complete by [F7], so [F1] gives a unique fixed point Z, keeps all iterates in the ball, and gives ∥Zk−Z∥≤bk=θk∥Z1−Z0∥/(1−θ). Multiplication by two gives ∥(2Zk−z)−(2Z−z)∥=2∥Zk−Z∥≤2bk, and Z∈B‾(z,ρ) gives ∥(2Z−z)−z∥≤2ρ. The convention θ0=1 makes the bound valid at k=0. If θ=0, Tz is constant on the ball, hence Z1=Tz(z)=Tz(Z)=Z and every later iterate equals Z; thus bk=0 for k≥1. These assertions require only the C2 hypotheses.

2.1A1F2F6F8algebra

For the remaining claims, assume the additional C3 and uniform branch hypotheses. Fix an admitted initial value z and let zj→z through admitted initial values with selected roots Zj. Since ∥Zj−zj∥≤ρ and zj→z, (Zj) is bounded. If Zj did not converge to Z, some subsequence would stay a positive distance from Z; by [F8] it would have a convergent subsequence Zjℓ→Z∗. The bound ∥Zjℓ−z∥≤ρ+∥zjℓ−z∥ puts Z∗ in B‾(z,ρ)⊂U, and continuity in Zjℓ=zjℓ+(h/2)F(Zjℓ) gives Z∗=z+(h/2)F(Z∗). The contraction in step 1.1 gives uniqueness of this fixed point in B‾(z,ρ), so Z∗=Z, a contradiction; hence Zj→Z. Now put G(z,Z)=Z−z−(h/2)F(Z). At the selected root, DZG=I−(h/2)A with A=DF(Z). Since ∥(h/2)A∥<1, this matrix is invertible by the Neumann series, and [F2] supplies a local C1 root branch. The continuity just proved and the IFT's local uniqueness identify the selected roots with this branch at every nearby admitted initial value. Differentiating G=0 gives DzZ=(I−(h/2)A)−1 and hence S:=DΨh=(I−B)−1(I+B),B=(h/2)A.

2.2A1F3F4F6step 1.1givenalgebra

Put m=2d and δ=Z−z. The admitted fixed-point equation gives ∥δ∥≤∣h∣∥F(Z)∥/2≤∣h∣M/2, hence δ=O(∣h∣) uniformly. Since H∈C3, F∈C2. Apply the scalar theorem [F4] to each Fi along [z,Z]: Fi(z+δ)=Fi(z)+DFi(z)δ+Ri, where Ri=12D2Fi(z+ϑiδ)[δ,δ] for some ϑi∈(0,1). These points may differ with i. Bounded second derivatives on the tube give ∣Ri∣≤Ci∥δ∥2, hence ∥R∥2≤(∑i=1mCi2)1/2∥δ∥2. Substitution into δ=(h/2)F(z+δ) first gives δ=(h/2)F(z)+O(h2) and then δ=(h/2)F(z)+(h2/4)DF(z)F(z)+O(∣h∣3). Thus 2Z−z=z+hF(z)+(h2/2)DF(z)F(z)+O(∣h∣3). For the exact flow, write gi(t)=(φt(z))i. By [F3] and [F6], gi(1)=Fi(φt(z)), gi(2)=DFi(φt(z))F(φt(z)), and gi(3)=D2Fi(φt(z))[F(φt(z)),F(φt(z))]+DFi(φt(z))DF(φt(z))F(φt(z)) are defined, with the third derivative uniformly bounded on the controlled trajectories. Scalar Taylor in time gives gi(h)=zi+hFi(z)+(h2/2)(DF(z)F(z))i+(h3/6)gi(3)(ηih) for h≠0, with possibly distinct ηi∈(0,1). Each last term is bounded by Ci′∣h∣3; summing their squares gives a Euclidean remainder bound (∑i=1m(Ci′)2)1/2∣h∣3. The case h=0 is immediate. The exact flow therefore has the same terms through degree two as 2Z−z, giving the uniform one-step defect C∣h∣3 for either sign of h. No common Lagrange intermediate point for the vector is used.

3.1F5step 2.1algebra

By [F5], A=J∇2H(Z) and ATJ+JA=0; therefore BTJ+JB=0. Expanding both products gives (I+B)TJ(I+B)−(I−B)TJ(I−B)=2(BTJ+JB)=0. Thus (I−B)TJ(I−B)=(I+B)TJ(I+B).

3.2A1F3F4F6F9step 2.1step 2.2algebra

From step 2.1, S−I=h(I−B)−1DF(Z), and ∥B∥≤h0L/2≤1/2 gives S=I+hDF(Z)+O(h2) uniformly. Also ∥Z−z∥≤∣h∣M/2; Taylor's formula applied to the entries of DF along the stipulated segments, with D2F uniformly bounded, gives DF(Z)=DF(z)+O(∣h∣). Thus DΨh=I+hDF(z)+O(h2) and, after decreasing h0 if needed, ∥DΨh∥≤1+L1∣h∣. For each n, split en+1 into the change of Ψh between zn and φnh(z0) and the one-step defect at φnh(z0). Applying [F9] on the comparison segment and the local estimate of step 2.2 gives en+1≤(1+L1∣h∣)en+C∣h∣3; the flow law in [F3] identifies φh(φnh(z0))=φ(n+1)h(z0). Iteration and (1+L1∣h∣)n≤eL1T when n∣h∣≤T give en≤eL1Te0+CTeL1T∣h∣2.

4.1A1step 2.1step 3.1algebra

The matrices I−B and I+B commute. Multiplying the equality in step 3.1 on the left by (I−B)−T and on the right by (I−B)−1 yields J=(I−B)−T(I+B)TJ(I+B)(I−B)−1=STJS. This proves the exact branch is symplectic.

5.1A1step 1.1step 2.1step 4.1step 2.2step 3.2givenalgebra∎

Step 1.1 proves existence, uniqueness, convergence, and the stage and output certificates under the C2 hypotheses. The implementation returns immediately for B=0; for B≥1 its finite loop either meets the tolerance earlier or takes at most B updates before its final inconclusive branch, and step 1.1 proves every reported radius valid. Under the additional C3 and tube hypotheses, step 2.1 proves the exact branch's stated regularity, step 4.1 proves symplecticity, and steps 2.2 and 3.2 prove local second order and the finite-time error.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain

Statement

Let Q⊆Rd be open and star-shaped about a point q∗∈Q, meaning q∗+t(q−q∗)∈Q for every q∈Q and t∈[0,1]. Let M be real symmetric positive-definite, U=Q×Rd, and equip U with the canonical form ω=∑i=1ddqi∧dpi and matrix J=(0I−I0). Set H(q,p)=12pTM−1p+V(q) with V∈C∞(Q). Let Φh be the kick-then-drift symplectic-Euler map, the local leapfrog map, or an admitted implicit-midpoint branch, on a compact subset where the chosen map is defined. Write r=1 for the kick-then-drift symplectic-Euler map and r=2 for leapfrog or implicit midpoint, as proved in Local and finite-time trajectory error for symplectic Euler and leapfrog and The admitted implicit midpoint branch is symplectic and second order. For a smooth test function f, define the pullback Phf=f∘Φh by its Taylor coefficients at h=0. For fixed finite N≥r, its truncated logarithm is the polynomial log⁡N(Ph)=∑k=1N+1(−1)k+1k(Ph−I)k, computed modulo terms of order hN+2. There are smooth vector fields Xr,…,XN and globally defined functions Hr,…,HN on U such that h−1log⁡N(Ph)=LXH+∑j=rNhjLXj(modhN+1),ιXjω=dHj, where LXf:=Df[X]. Thus Hh[N]=H+∑j=rNhjHj is a globally defined finite modified Hamiltonian. The logarithm is a finite formal polynomial for each fixed N; no convergence of an infinite series is asserted.

Facts & Assumptions

Given: The smooth Hamiltonian on the star-shaped phase domain, a local step map from this page, and a fixed finite order N.

[A1]

Q is star-shaped and method stages are admitted on a compact subset of U.

[F1]

Under their compact convex comparison-tube hypotheses, the local symplectic-Euler and leapfrog defects are respectively O(h2) and O(h3), and both maps satisfy the local symplectic matrix identity. Local kick-then-drift symplectic Euler step, Local domain restriction for kick, drift, and leapfrog maps, Local leapfrog and kick-then-drift symplectic Euler are symplectic, Local and finite-time trajectory error for symplectic Euler and leapfrog

[F2]

Under the stated uniform closed-ball hypotheses the exact implicit midpoint branch is symplectic; its order-two estimate additionally requires the stated compact convex comparison tube. These hypotheses will be supplied locally in step 1.1. Local implicit midpoint step for a Hamiltonian vector field, The admitted implicit midpoint branch is symplectic and second order

[F3]

Every local Hamiltonian flow considered below preserves the canonical symplectic matrix. A smooth local Hamiltonian flow preserves the canonical symplectic matrix

[F4]

A smooth finite-dimensional implicit branch remains smooth to each fixed finite order when the defining equation is smooth and its derivative in the unknown is invertible. The parametrized implicit function theorem with Ck regularity

[F5]

The Hamiltonian convention is ιXHω=dH for the canonical form specified in the Statement. Hamiltonian vector field and Hamiltonian function

[F6]

Taylor expansion along a segment gives a uniform finite-order remainder on a compact convex subset of U. Multivariable Taylor formula with a Lagrange remainder along a line segment

[F7]

A smooth Euclidean vector field has a local flow on an open time-state domain, with the variational equation and compact continuation. C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade

[F8]

Continuous coefficient and derivative norms are bounded on a nonempty compact set. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

Proof

technique · finite formal logarithm, symplectic coefficient comparison, and the Poincaré formula on a star-shaped set
1.1A1F1F2F7F8choose

Fix a∈U and ε>0 with B‾(a,4ε)⊂U. On this ball, [F8] bounds each required derivative of F=XH. Choose B≥1 bounding the norms of F and the kick and drift fields, and L≥1 bounding ∥DF∥. For centers in B‾(a,3ε) use midpoint stage radius ρ=ε. Choose h0>0 with h0B/2<ε and h0L/2≤1/2; all these balls then satisfy the uniform branch conditions of [F2]. Any other admitted midpoint ball gives the same root: its Picard iterates start at the same z and obey the same recurrence, so their limit is also the limit for the ball of radius ε. Choose T>0 with 2BT<ε and decrease h0 to at most T. Starting in B‾(a,2ε), exact trajectories stay in B‾(a,3ε) for ∣t∣≤T by the speed bound and [F7]. Numerical endpoints and kick/drift stages also stay there for n∣h∣≤T: each explicit step has total substep displacement at most 2B∣h∣, and a midpoint step has displacement at most B∣h∣. The branch balls and every comparison segment therefore lie in the compact convex ball B‾(a,4ε). All hypotheses needed for the local symplecticity and order conclusions of [F1] and [F2] hold on these smaller neighborhoods. No single convex tube covering all of U is needed.

2.1F1F2F4F6step 1.1

Fix N. Smooth kick and drift formulas give smooth step germs at h=0 throughout U. For midpoint apply [F4] to G(z,Z,h)=Z−z−(h/2)F(Z) at (z,z,0), where DZG=I. Its smooth solution germ is the exact root in step 1.1, and uniqueness identifies these germs on overlaps. Thus the Taylor coefficients dk are smooth on all of U, and on any fixed compact subset a finite cover by the neighborhoods of step 1.1 gives Φh(z)=z+∑k=1N+1hkdk(z)+O(hN+2), also with a uniform first-state-derivative remainder by smoothness. Consistency gives d1=XH; the verified local order estimates of [F1] and [F2] identify the coefficients through degree r with those of the exact flow.

3.1F6F7step 2.1algebra

Seek Yh=XH+∑m=1NhmXm. The time-h flow expansion is z+∑k=1N+1hkk!(Yh⋅∇)k−1Yh(z)+O(hN+2). At coefficient hm+1, the first term hYh contributes Xm; every term with k≥2 can involve only X1,…,Xm−1 at that degree. Thus set Xm=dm+1−Pm, where Pm is the already determined coefficient from those higher flow terms. This finite recursion gives smooth fields on U and matches coefficients through degree N+1. Since step 2.1 identifies the exact-flow coefficients through degree r, it gives X1=⋯=Xr−1=0.

4.1F6step 3.1algebra

For fixed parameter h, the pullback Qh,t of the time-t flow of Yh obeys ∂t(Qh,tf)=Qh,t(LYhf) and Qh,0=I. Coefficient recursion in t therefore gives Qh,t=∑k=0N+1tkLYhk/k! modulo terms of total order N+2; at t=h, this is exp⁡(hLYh). Step 3.1 gives Φh and its comparison flow equal Taylor coefficients through degree N+1, so [F6] makes their pullbacks equal modulo hN+2. Since Ph−I=O(h), the finite polynomial logarithm in the Statement is valid modulo hN+2. The formal identity log⁡(exp⁡A)=A in the truncated algebra then gives log⁡N(Ph)=hLYh modulo hN+2.

4.2F3step 3.1

Fix m∈{r,…,N} and assume Xr,…,Xm−1 are Hamiltonian. The truncated field Yh[m−1]=XH+∑j=rm−1hjXj is Hamiltonian, so by [F3] its time-h flow ψh is symplectic. Step 3.1 gives Φh−ψh=hm+1Xm+O(hm+2) and, after differentiating the smooth expansions, DΦh−Dψh=hm+1DXm+O(hm+2).

5.1F1F2F3step 4.2algebra

The symplectic matrix identity for both maps and Dψh=I+O(h) imply 0=hm+1(DXmTJ+JDXm)+O(hm+2). Divide by hm+1 and take h→0 to obtain DXmTJ+JDXm=0.

6.1A1F5step 5.1construct

The one-form αm=ιXmω has coefficient column −JXm, so its derivative matrix is −JDXm. Step 5.1 says this matrix is symmetric; hence αm is closed. Fix a star center z∗ and define Hm(z)=∫01αm(z∗+t(z−z∗))[z−z∗]dt. For any direction v, differentiation under the integral gives t(Dαm(z∗+t(z−z∗))[v])[z−z∗]+αm(z∗+t(z−z∗))[v]. Closedness swaps the two arguments in the first term, making the integrand ddt(tαm(z∗+t(z−z∗))[v]). Integration yields DHm(z)[v]=αm(z)[v]. Thus dHm=αm and [F5] makes Xm Hamiltonian on all of U.

7.1step 3.1step 4.1step 4.2step 5.1step 6.1∎

Applying the coefficient induction in step 4.2, the matrix consequence in step 5.1, and the primitive construction in step 6.1 successively for m=r,…,N supplies all finite Hamiltonians Hj. Step 4.1 identifies the resulting vector-field coefficients with the truncated formal logarithm. The construction makes no assertion about convergence as N→∞.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A fixed finite modified Hamiltonian is close to the original energy

Statement

For a fixed N≥r and compact K⋐U, let Hh[N]=H+∑j=rNhjHj be the finite modified Hamiltonian constructed in A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain. Define Mj=0 if K=∅, and otherwise Mj:=max⁡z∈K∣Hj(z)∣. Put C0:=∑j=rNMj. Then C0 is finite and nonnegative, and for 0<h≤1, ∣Hh[N](z)−H(z)∣≤C0hr(z∈K). The least nonnegative upper bound for these pointwise errors is also at most C0hr. If K≠∅, this is exactly sup⁡z∈K∣Hh[N](z)−H(z)∣≤C0hr,C0=∑j=rNsup⁡z∈K∣Hj(z)∣. If K=∅, the pointwise assertion is vacuous and its least nonnegative upper bound is 0=C0; no real supremum of an empty set is used.

Facts & Assumptions

Given: A fixed finite truncation and compact K⋐U.

[F1]

The coefficients Hj are smooth on U and the modified Hamiltonian is the finite polynomial H+∑j=rNhjHj. A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain

[F2]

A continuous real-valued function on a nonempty compact metric space attains a finite 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 · separate the empty set and bound the finite coefficient sum
1.1F1F2givenalgebra

If K=∅, every Mj=0 and hence C0=0. The pointwise estimate has no instances, and every nonnegative real is a uniform upper bound for the empty error family, so its least such bound is 0. Assume henceforth K≠∅. By [F1], every Hj is continuous; [F2] applied to ∣Hj∣ gives its finite nonnegative maximum Mj on K, equal to the corresponding supremum. Their finite sum C0 is therefore finite and nonnegative.

2.1F1F2step 1.1givenalgebra∎

For z∈K, [F1] and step 1.1 give ∣Hh[N](z)−H(z)∣≤∑j=rNhjMj≤hr∑j=rNMj=C0hr for 0<h≤1, since every j≥r has hj≤hr. The error function is continuous on nonempty compact K, so [F2] also gives its attained maximum and ordinary real supremum, both bounded by this same right-hand side. Its nonnegative maximum is its least nonnegative upper bound. Together with the empty branch in step 1.1, this proves every stated case without an empty real supremum.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

The finite modified Hamiltonian has a bounded one-step defect

Statement

Fix N≥r and a compact comparison tube K′⋐U. Let Hh[N] be the finite modified Hamiltonian from A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain. Suppose z, Φh(z), the exact time-h flow of XHh[N] from z, and the line segment joining those two endpoints all lie in K′. For sufficiently small 0<h≤1, there is a constant C1 independent of z,h such that ∣Hh[N](Φh(z))−Hh[N](z)∣≤C1hN+1.

Facts & Assumptions

Given: The fixed finite modified Hamiltonian, an admitted numerical step, and the compact comparison tube and segment.

[A1]

The method endpoint, modified-flow endpoint, and comparison segment lie in K′⋐U.

[F1]

On a compact initial set with method branches defined on a neighborhood and a compact tube containing the comparison flows and Taylor segments, the one-step map and time-h modified flow differ by at most CNhN+2. The needed neighborhood and tube will be constructed in step 1.1. A fixed finite modified flow matches its method map to the stated Taylor order

[F2]

A Hamiltonian is constant along every integral curve of its own Hamiltonian vector field, without a completeness assumption. A Hamiltonian is conserved along its own flow

[F4]

Use the Euclidean norm and its induced operator norm. Each Hj and H is smooth, so each derivative norm ∥DHj∥op and ∥DH∥op is continuous and bounded on compact K′ by the extreme-value theorem. For 0<h≤h0≤1, the finite sum DHh[N]=DH+∑j=rNhjDHj is therefore bounded there by one constant GN independent of h. A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

[F6]

The derivative of a composition is given by the total-derivative chain rule. The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

Proof

technique · compare one step with its energy-preserving modified flow
1.1A1F1F3F4givenchoose

Since an instance has z∈K′, assume K′≠∅; otherwise the estimate is vacuous. Set K=K′. The local method construction in A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain gives smooth step branches on a neighborhood of K for uniformly small ∣h∣: cover K by finitely many smaller convex balls whose enlarged closed balls lie in U, and take the minimum of their positive step bounds. For midpoint, the construction identifies every admitted ball with the same local branch by its common Picard sequence. The enlarged balls control all method stages and spatial Taylor segments. For the modified flow, apply [F3] to the smooth augmented field (w,s)↦(XHs[N](w),0) on U×R. Its open flow domain contains {0}×K×[−1,1]; compactness gives a common interval [−δ,δ] of existence, with δ>0. The projected flow image of this compact time-state-parameter product is a compact subset of U. Together with the finitely many enlarged balls it gives a compact tube K′′⋐U containing the trajectories and all Taylor segments; the latter are taken within individual convex balls, without assuming K′ convex. After decreasing the common step bound to at most min⁡(δ,1), [F1] applies with initial set K and control tube K′′, giving one CN independent of z∈K′ and h. The stipulated endpoint segment in [A1] remains in the original K′ for the scalar energy comparison.

1.2F2F3given

By [F3], the modified Hamiltonian vector field has a local flow from z. By [F2], that flow preserves Hh[N], so Hh[N](φh[N](z))=Hh[N](z).

2.1A1F1F4F5F6step 1.1step 1.2algebra∎

Parameterize the segment in [A1] by γ(t)=Hh[N](φh[N](z)+t(Φh(z)−φh[N](z))). By [F4] and [F6], ∣γ′(t)∣≤GN∥Φh(z)−φh[N](z)∥; [F5] then bounds the endpoint difference by the same quantity. Thus ∣Hh[N](Φh(z))−Hh[N](φh[N](z))∣≤GN∥Φh(z)−φh[N](z)∥≤GNCNhN+2 by [F1]. For h≤1 this is at most GNCNhN+1. Substituting the equality from step 1.2 proves the statement with C1=GNCN.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite-order modified energy control on a compact tube

Statement

Let Q⊆Rd be open and star-shaped about a point q∗∈Q, meaning q∗+t(q−q∗)∈Q for every q∈Q and t∈[0,1]. Let M be real symmetric positive-definite, U=Q×Rd, and H(q,p)=12pTM−1p+V(q) with V∈C∞(Q). Choose one of this page's fixed-step methods: kick-then-drift symplectic Euler with r=1, or local leapfrog or an admitted implicit midpoint branch with r=2. Fix a finite truncation order N≥r and choose h0∈(0,1] small enough for the selected map and comparison flow branches. For one step size 0<h≤h0, let zk+1=Φh(zk) for k=0,…,n−1, with n∈N0. Assume every numerical endpoint, every method stage, every truncated modified-flow comparison segment, and every segment used to compare H with Hh[N] lies in one compact tube K⋐U. Then there are constants C0,C1, independent of h,n, such that ∣H(zn)−H(z0)∣≤2C0hr+C1nhN+1. The bound holds only while the stated compact-tube and domain hypotheses hold; if nh≤T, its accumulated defect term is at most C1ThN. It asserts neither exact conservation of H by the numerical method nor convergence of an infinite modified series.

Facts & Assumptions

Given: A smooth Hamiltonian, one selected page method and its order r, a fixed N≥r, a fixed step 0<h≤h0≤1, and a trajectory satisfying the compact-tube hypotheses.

[A1]

The finite modified Hamiltonian exists globally on the star-shaped phase domain. A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain

[F1]

On the compact tube, ∣Hh[N]−H∣≤C0hr. A fixed finite modified Hamiltonian is close to the original energy

[F2]

Each numerical step changes the finite modified Hamiltonian by at most C1hN+1. The finite modified Hamiltonian has a bounded one-step defect

[F3]

Symplectic Euler has order one, while leapfrog and the admitted implicit midpoint branch have order two under their respective tube and branch conditions. Local and finite-time trajectory error for symplectic Euler and leapfrog, The admitted implicit midpoint branch is symplectic and second order

Proof

technique · telescope the modified energy and compare its endpoints with the original energy
1.1A1F2F3givenalgebra

For the selected method, [F3] fixes the order r of the finite modification. For each k<n, [A1] and [F2] then give ∣Hh[N](zk+1)−Hh[N](zk)∣≤C1hN+1. The triangle inequality over the n consecutive increments yields ∣Hh[N](zn)−Hh[N](z0)∣≤C1nhN+1.

2.1F1step 1.1algebra∎

Add and subtract the modified Hamiltonian at both endpoints: H(zn)−H(z0)=(H−Hh[N])(zn)+(Hh[N](zn)−Hh[N](z0))+(Hh[N]−H)(z0). Applying [F1] to the first and third terms and step 1.1 to the middle term gives the stated bound.

Remarks

Symplecticity, reversibility, exact invariants, and modified-energy control are separate properties. This result concerns only the unconstrained maps specified above. Lie and Strang splitting are treated at the exact split-flow compositions ↗, while constrained integration is treated at the classical RATTLE step ↗; no claim here transfers to those methods.

5 · Examples, counterexamples and false statements

None yet.

Sources