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 be open and star-shaped about a point , meaning for every and . Let be real symmetric positive-definite, , and equip with the canonical form and matrix . Set with . Let 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 for the kick-then-drift symplectic-Euler map and 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 , define the pullback by its Taylor coefficients at . For fixed finite , its truncated logarithm is the polynomial computed modulo terms of order . There are smooth vector fields and globally defined functions on such that where . Thus is a globally defined finite modified Hamiltonian. The logarithm is a finite formal polynomial for each fixed ; 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 .
is star-shaped and method stages are admitted on a compact subset of .
Under their compact convex comparison-tube hypotheses, the local symplectic-Euler and leapfrog defects are respectively and , 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
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
Every local Hamiltonian flow considered below preserves the canonical symplectic matrix. A smooth local Hamiltonian flow preserves the canonical symplectic matrix
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 regularity
The Hamiltonian convention is for the canonical form specified in the Statement. Hamiltonian vector field and Hamiltonian function
Taylor expansion along a segment gives a uniform finite-order remainder on a compact convex subset of . Multivariable Taylor formula with a Lagrange remainder along a line segment
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
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
Fix and with . On this ball, [F8] bounds each required derivative of . Choose bounding the norms of and the kick and drift fields, and bounding . For centers in use midpoint stage radius . Choose with and ; 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 and obey the same recurrence, so their limit is also the limit for the ball of radius . Choose with and decrease to at most . Starting in , exact trajectories stay in for by the speed bound and [F7]. Numerical endpoints and kick/drift stages also stay there for : each explicit step has total substep displacement at most , and a midpoint step has displacement at most . The branch balls and every comparison segment therefore lie in the compact convex ball . 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 is needed.
Fix . Smooth kick and drift formulas give smooth step germs at throughout . For midpoint apply [F4] to at , where . Its smooth solution germ is the exact root in step 1.1, and uniqueness identifies these germs on overlaps. Thus the Taylor coefficients are smooth on all of , and on any fixed compact subset a finite cover by the neighborhoods of step 1.1 gives , also with a uniform first-state-derivative remainder by smoothness. Consistency gives ; the verified local order estimates of [F1] and [F2] identify the coefficients through degree with those of the exact flow.
Seek . The time- flow expansion is . At coefficient , the first term contributes ; every term with can involve only at that degree. Thus set , where is the already determined coefficient from those higher flow terms. This finite recursion gives smooth fields on and matches coefficients through degree . Since step 2.1 identifies the exact-flow coefficients through degree , it gives .
For fixed parameter , the pullback of the time- flow of obeys and . Coefficient recursion in therefore gives modulo terms of total order ; at , this is . Step 3.1 gives and its comparison flow equal Taylor coefficients through degree , so [F6] makes their pullbacks equal modulo . Since , the finite polynomial logarithm in the Statement is valid modulo . The formal identity in the truncated algebra then gives modulo .
Fix and assume are Hamiltonian. The truncated field is Hamiltonian, so by [F3] its time- flow is symplectic. Step 3.1 gives and, after differentiating the smooth expansions, .
The symplectic matrix identity for both maps and imply . Divide by and take to obtain .
The one-form has coefficient column , so its derivative matrix is . Step 5.1 says this matrix is symmetric; hence is closed. Fix a star center and define . For any direction , differentiation under the integral gives . Closedness swaps the two arguments in the first term, making the integrand . Integration yields . Thus and [F5] makes Hamiltonian on all of .
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 supplies all finite Hamiltonians . Step 4.1 identifies the resulting vector-field coefficients with the truncated formal logarithm. The construction makes no assertion about convergence as .
Depends on
- Local domain restriction for kick, drift, and leapfrog maps
- Hamiltonian vector field and Hamiltonian function
- Local kick-then-drift symplectic Euler step
- Local implicit midpoint step for a Hamiltonian vector field
- The admitted implicit midpoint branch is symplectic and second order
- Local leapfrog and kick-then-drift symplectic Euler are symplectic
- Local and finite-time trajectory error for symplectic Euler and leapfrog
- A smooth local Hamiltonian flow preserves the canonical symplectic matrix
- The parametrized implicit function theorem with $C^k$ regularity
- Multivariable Taylor formula with a Lagrange remainder along a line segment
- C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade
- 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
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
- 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)