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.
Nearly dependent constraints make the multiplier solve ill conditioned
Example
For , take and The Jacobian has full row rank for every fixed , but has smallest eigenvalue . Thus the inverse multiplier bound in the RATTLE residual estimate is not uniform as the constraints approach dependence. At the rank hypothesis fails.
Facts & Assumptions
Given: The family , , and the RATTLE multiplier matrix in the Example.
Regular holonomic phase space and constrained dynamics: regularity requires full row rank of and invertibility of .
Scaled RATTLE residuals bound the finite solve trajectory error: on a fixed compact phase tube, residual-to-state constants depend in particular on uniform inverse bounds for the multiplier matrices; each fixed is regular, but these inverse bounds are not uniform as .
Verification
The two rows and of are linearly independent exactly when . Their Gram matrix is the displayed , whose trace is and determinant is .
The quadratic formula gives its eigenvalues . Rationalizing the smaller one gives , so and .
Consequently no single residual-to-multiplier constant works for this family as ; this is consistent with [F2], whose uniform estimates assume a fixed compact chart with uniformly bounded . At the two rows coincide, so [F1]'s full-rank hypothesis fails.
Depends on
Used by
Nothing in the library uses this result yet.
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–247 (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, §5.2 (standard reference, not scraped)