Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generated
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 RATTLE residuals bound the finite solve trajectory error

Statement

Let C be a compact subset of the regular phase manifold, contained in a convex phase-coordinate chart whose closure lies inside a regular chart. Let (q,p)∈C, let (q1,p1) be its exact RATTLE step, and let (q~1,p~1) be a successful output of Finite budget RATTLE solve with scaled constraint residuals whose multiplier iterates remain in the chosen convex branch balls over C. Define εq=∥h−2c(q~1)∥2,εp=∥h−1J(q~1)M−1p~1∥2. For sufficiently small 0<∣h∣, there is a constant C uniform over C such that ∥q~1−q1∥≤Ch2εq,∥p~1−p1∥≤C∣h∣(εq+εp). For the repeated-trajectory claim, choose compact phase tubes C0⊂relint⁡(C1) in such a chart, with the coordinate image of C1 contained in a convex coordinate neighborhood with compact closure inside the regular chart. Suppose the exact-solve RATTLE iterates from a common initial state in C0 remain in C0 on the fixed-time grids under consideration. Restore each successful finite-solve output using a local retraction from Holonomic phase residuals control distance to the consistent phase manifold before using it as the next input. If both scaled residuals are bounded by a fixed sufficiently small ε at each step, then for sufficiently small h the restored trajectory remains in C1 and differs from the exact-solve RATTLE trajectory by O(ε) uniformly on the grid. If instead both residuals are at most C0h2, the difference is O(h2), and the unscaled position and tangency residuals of each unprojected solver output are respectively O(h4) and O(h3). The finite solver's raw output need not be consistent, so the global estimate is for the restored trajectory.

Facts & Assumptions

Given: A compact phase subset C, a consistent input (q,p)∈C, exact and approximate multiplier iterates in the selected branch neighborhoods over C, and the scaled residuals in the Statement.

[F1]

Scaled classical RATTLE step map: the exact updates use the impulses hJ(q)Tλ, hJ(q1)Tμ, and impose c(q1)=0, J(q1)M−1p1=0.

[F2]

Scaled RATTLE equations have unique local multiplier branches: the scaled equations have unique smooth local roots, with a common step range and uniform derivative and inverse-Jacobian bounds on each compact phase subset.

[F3]

Finite budget RATTLE solve with scaled constraint residuals: on its success status the algorithm returns the state, both multiplier iterates, and the scaled residual norms εq,εp defined above.

[F4]

Implicit residuals and their update and derivative units: a residual norm is not a forward-error bound without a separate inverse or stability estimate.

[F6]

Holonomic phase residuals control distance to the consistent phase manifold: finitely many local smooth retractions cover a compact regular phase set, and all satisfy the uniform bound ∥Πj(q,p)−(q,p)∥≤C(∥c(q)∥2+∥J(q)M−1p∥2) on their domains.

Proof

1.1F2F3F4F5givenalgebra

For Fq(λ)=h−2c(q1(λ)), [F2] gives DλFq=−A(q)+o(1) uniformly on the branch ball. Shrink it so ∥A(q)−1(DλFq+A(q))∥≤12. The derivative of G(λ)=A(q)−1Fq(λ)+λ is then bounded by 1/2. Since Fq(λ)=0 at the exact root λ, [F5] along the segment to λ~ gives ∥G(λ~)−G(λ)∥≤12∥λ~−λ∥. As A−1Fq(λ~)=G(λ~)−G(λ)−(λ~−λ), it follows that ∥λ~−λ∥≤2∥A(q)−1∥εq. This inverse estimate is needed because [F4] alone does not convert residual size to state error.

2.1F1step 1.1algebra

The position formula gives q~1−q1=−h2M−1J(q)T(λ~−λ) and p~1/2−p1/2=−hJ(q)T(λ~−λ). The uniform matrix bounds and step 1.1 yield ∥q~1−q1∥≤Ch2εq and ∥p~1/2−p1/2∥≤C∣h∣εq.

2.2F2F3F5step 1.1

For fixed λ~, the final scaled tangency residual is affine in μ with derivative exactly −A(q~1). Uniform invertibility bounds the distance from μ~ to the exact momentum root for this λ~ by Cεp. The smooth momentum branch in [F2] changes that exact root by at most Cεq when λ~ replaces λ, using step 1.1 and the uniform branch derivative bound.

3.1F1step 1.1step 2.1step 2.2algebra

In the final momentum formula, the initial half-momentum difference contributes O(∣h∣εq) by step 2.1; changing the position in the smooth force and constraint Jacobian contributes O(∣h∣3εq); changing the final multiplier contributes O(∣h∣(εq+εp)) by step 2.2. Their sum proves ∥p~1−p1∥≤C∣h∣(εq+εp) and hence the one-step estimates.

4.1F1F2F3F6step 3.1algebra

The residual definitions give ∥c(q~1)∥=∣h∣2εq and ∥J(q~1)M−1p~1∥=∣h∣εp. Whenever the output lies in a neighborhood Uj from [F6], its local retraction changes it by at most C(∣h∣2εq+∣h∣εp)≤C∣h∣(εq+εp) for ∣h∣≤1. For the repeated-trajectory claim, choose a compact phase neighborhood D of C1 with closure inside the regular chart. The compact branch bounds and Ψ0=id imply Ψh(C1)⊂D for sufficiently small ∣h∣. Apply [F6] to D and choose its finite retraction cover with a common distance constant. The union of these open domains contains the compact set D, hence contains some uniform ambient neighborhood of it. For every restored input in C1, step 3.1 puts its raw output within O(∣h∣(εq+εp)) of the exact step from that same input in D. Bounded scaled residuals and sufficiently small ∣h∣ therefore place the raw output in this union. The same-input exact step need not belong to the reference tube C0. Thus the retraction is defined, and the restored update differs from the exact RATTLE update by at most C∣h∣(εq+εp).

5.1F2F5F6step 4.1algebra∎

Work in the phase coordinates of the Statement and choose a slightly larger compact convex coordinate neighborhood on which the branches and their first derivatives are bounded by [F2]. Since Ψ0 is the identity, DzΨh=I+O(h) uniformly there, so [F5] gives a Lipschitz factor 1+Lh for small positive h. The one-step estimate and the retraction bound, with equivalence of ambient and chart norms on the compact tube, bound each restored solver perturbation by Kh(εq+εp). Starting with the same initial state, the error therefore obeys en+1≤(1+Lh)en+Kh(εq+εp) until a first exit from C1. Iteration gives en≤KTε for fixed residual bound and en≤KTh2 when each residual is at most C0h2. Choose ε small enough, or h small enough in the second case, that this bound is less than the positive coordinate distance from C0 to the boundary of C1; then no first exit occurs. Step 4.1, applied until this first-exit argument closes, places every raw output in a retraction neighborhood for small h. Finally, the unscaled residuals are exactly h2εq and hεp, hence O(h4) and O(h3) in the second case.

Depends on

Used by

Dependency tree · two levels

18 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