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.
Scaled classical RATTLE step map
Definition
Use the data of Regular holonomic phase space and constrained dynamics. For a consistent input , put and For nonzero signed , form the sequential scaled residual equations where are given by the updates below. The selected multiplier pair, when it exists uniquely, is the local root branch whose limits as are and . This defines a partial exact step map; no root-existence assertion is part of this definition.
For such a selected pair , define The position and momentum equations are respectively and . At define the step to be the identity.
Here are force-level multipliers: the corresponding constraint impulses are and . This scaling keeps the limiting multiplier equations nonsingular as . The position equation is SHAKE; the final momentum equation is the RATTLE tangency correction.
Depends on
Used by
- Finite budget RATTLE solve with scaled constraint residuals Algorithm
- RATTLE gives an exact step and a cubic phase defect for a free rigid bond Example
- Scaled RATTLE equations have unique local multiplier branches Lemma
- Exact RATTLE has second order global accuracy on compact tubes Theorem
- Exact RATTLE is symplectic on the constrained phase space Theorem
- Exact RATTLE preserves both constraints and is symmetric Theorem
- Scaled RATTLE residuals bound the finite solve trajectory error Theorem
Dependency tree · two levels
4 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.1.3 (standard reference, not scraped)