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.
Local domain restriction for kick, drift, and leapfrog maps
Definition
Let be open, let , and let be a real symmetric positive-definite matrix. Use the force-kick and drift already defined in One-step leapfrog map as force and drift shears, with there replaced by . The local kick is the restriction of to . The local drift is the restriction of to
For a signed step , the local leapfrog map is the restriction of to the states for which all three intermediate configurations lie in . 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.
Depends on
Used by
- Local implicit midpoint step for a Hamiltonian vector field Algorithm
- Local kick-then-drift symplectic Euler step Algorithm
- Separable regularized vortex-inspired Hamiltonian comparison system Definition
- A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain Lemma
- Canonical kick and drift shears satisfy the symplectic Jacobian identity Lemma
- Local leapfrog and kick-then-drift symplectic Euler are symplectic Proposition
- Leapfrog geometry and finite-time order for the matched periodic PIC Hamiltonian Theorem
- Local and finite-time trajectory error for symplectic Euler and leapfrog Theorem
- Local geometric properties and second-order error of the separable regularized vortex-inspired leapfrog Theorem
Dependency tree · two levels
3 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 2: Symplectic integrators (standard reference, not scraped)
- Nikolaj Nordkvist and Poul G. Hjorth, Classical Mechanics and Symplectic Integration (standard reference, not scraped)