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.
Zeros of the exact multiple-shooting residual are exactly BVP solutions
Statement
Fix a mesh and states . Suppose the unique IVP solution from each segment start exists as a curve on for , and . The exact multiple-shooting residual has rows and . For this fixed tuple, it vanishes exactly when there is a BVP solution with for every ; that solution restricts to the given segment solutions on all mesh intervals.
Facts & Assumptions
Given: The square BVP, mesh, segment starts, and unique segment IVP solutions on all mesh intervals.
Square nonlinear two-point boundary-value problems and endpoint residuals: the multiple-shooting residual consists of segment endpoint mismatch rows and the boundary residual .
Proof
If the residual vanishes, each row gives . Define on each interval by the corresponding segment solution. At every interior mesh point, the left endpoint value equals the next initial state, so the pieces are continuous; the last residual row supplies .
At a mesh point , both one-sided derivatives equal , since each segment solves the same ODE and the joined values agree. Thus the pieces join to a solution on ; the endpoint pair lies in and the last residual row gives its boundary equation, so it is a BVP solution.
Conversely, let be a BVP solution with for every , keeping the given tuple fixed. On each mesh interval its restriction and the given segment IVP solution have initial state , so the assumed uniqueness identifies them. Thus for , and . All residual rows vanish.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- R. Verfürth, Numerical Methods and Stochastics, Part I: Numerical Methods, Lecture Notes (standard reference, not scraped)