Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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 a=t0<⋯<tN=b and states s0,…,sN. Suppose the unique IVP solution from each segment start si exists as a C1 curve on [ti,ti+1] for 0≤i<N, and (s0,sN)∈DB. The exact multiple-shooting residual has rows ϕi(ti+1;si)−si+1 and B(s0,sN). For this fixed tuple, it vanishes exactly when there is a BVP solution y with y(ti)=si for every 0≤i≤N; 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.

[F1]

Square nonlinear two-point boundary-value problems and endpoint residuals: the multiple-shooting residual consists of segment endpoint mismatch rows and the boundary residual B(s0,sN).

Proof

1.1givenF1

If the residual vanishes, each row gives ϕi(ti+1;si)=si+1. Define y 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 B(y(a),y(b))=0.

2.1givenstep 1.1F1

At a mesh point ti, both one-sided derivatives equal f(ti,y(ti)), since each C1 segment solves the same ODE and the joined values agree. Thus the pieces join to a C1 solution on [a,b]; the endpoint pair lies in DB and the last residual row gives its boundary equation, so it is a BVP solution.

3.1givenF1∎

Conversely, let y be a BVP solution with y(ti)=si for every 0≤i≤N, keeping the given tuple fixed. On each mesh interval its restriction and the given segment IVP solution have initial state si, so the assumed uniqueness identifies them. Thus ϕi(ti+1;si)=y(ti+1)=si+1 for 0≤i<N, and B(s0,sN)=B(y(a),y(b))=0. 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