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.
Exact RATTLE preserves both constraints and is symmetric
Statement
On the local branch of Scaled classical RATTLE step map, an exact solve sends every consistent to a consistent . The signed-step maps satisfy and whenever both branch steps remain in the regular chart.
Facts & Assumptions
Given: The regular phase manifold, exact RATTLE equations, and selected local branches in the Statement.
Regular holonomic phase space and constrained dynamics: means and (hence ).
Scaled classical RATTLE step map: the exact position and momentum equations are and .
Scaled RATTLE equations have unique local multiplier branches: the force multipliers are chosen on the unique local branch for each sufficiently small signed step, and its exact position roots stay in the regular configuration region.
Proof
The exact first constraint equation gives , the exact final projection equation gives , and [F3] keeps in . By [F1], this is exactly .
Starting from the forward equations, use the reverse step size and choose its first multiplier to be the forward . Its first half-momentum is then , so its next position is .
Choose the reverse step's final multiplier to be the forward . Its final momentum is then . The reverse constraint equations hold because the endpoints are the forward consistent states. As , the swapped multipliers and the reverse input converge to the same regular-chart branch centers; after shrinking , both multipliers lie in the reverse IFT neighborhoods. By uniqueness of the selected branches [F3], this reverse solve is the defined step. Thus ; interchanging the endpoints and the multipliers proves .
Depends on
Used by
Dependency tree · two levels
8 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, Christian Lubich, and Gerhard Wanner, Geometric Numerical Integration, 2nd ed., Chapter VII.1.4, pp. 245–246 (standard reference, not scraped)
- Robert I. McLachlan, Klas Modin, Olivier Verdier, and Matt Wilkins, Geometric Generalisations of SHAKE and RATTLE, Foundations of Computational Mathematics 14 (2014), 339–370, §§4.5 and 5.1.3 (standard reference, not scraped)