Alphabeta Math
TheoremStatement: 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.

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.

Depends on

Used by

Cited to discharge well-definedness by Local implicit midpoint step for a Hamiltonian vector field.

Dependency tree · two levels

101 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