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

Depends on

Used by

Dependency tree · two levels

63 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