Alphabeta Math
Pipeline-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.

✓ 14 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Nonlinear Boundary-Value Solvers

1 · Prerequisites

2 · Summary

This page defines square nonlinear two-point boundary-value problems and exact shooting residuals, then separates exact flow sensitivity from the derivative and error contract of a numerical IVP evaluator. Single and multiple shooting are formulated as finite-budget residual solvers, with their exact residual Jacobians and solution correspondences proved locally. The implicit-midpoint section defines the normalized collocation residual, proves its discrete linearized inverse from a bounded inverse for the continuous BVP, and derives a local second-order branch estimate with an algebraic residual budget. Newton claims remain local and finite-budget, and the estimates keep IVP error, mesh error, residual error, and BVP conditioning distinct.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Square nonlinear two-point boundary-value problems and endpoint residuals

Definition

Fix a<b, an integer d≥1, an open set Ω⊆R×Rd containing [a,b]× the states under consideration, and a vector field f:Ω→Rd. Let DB⊆Rd×Rd be open and let B:DB→Rd. A square nonlinear two-point boundary-value problem (BVP) is

y′(t)=f(t,y(t))(a≤t≤b),B(y(a),y(b))=0,

where y is a continuously differentiable curve whose graph lies in Ω, whose endpoint pair lies in DB, and where the d scalar components of B give exactly d boundary equations. A BVP solution is such a curve satisfying both the differential equation and endpoint equation. No existence or uniqueness is part of this definition.

If the IVP from initial state s∈Rd has a unique solution ϕ(⋅;s) on [a,b], the exact shooting residual is R(s):=B(s,ϕ(b;s)) whenever (s,ϕ(b;s))∈DB. For a mesh a=t0<⋯<tN=b and segment initial states s0,…,sN, the exact multiple-shooting residual has rows ϕi(ti+1;si)−si+1 for 0≤i<N and final row B(s0,sN), where ϕi denotes the unique segment IVP solution when it exists. These residuals are defined only on their admissible IVP and boundary domains.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Initial-data sensitivity of an ODE flow on a common compact tube

Statement

Let a<b, let Ω⊆R×Rd be open, and let f:Ω→Rd be C1. Let K⊆Ω be compact and convex, and let U⊆Rd be open. Assume that for every s∈U the unique IVP solution ϕ(⋅;s) from ϕ(a;s)=s exists on [a,b] and (t,ϕ(t;s))∈K for every t. Then s↦ϕ(t;s) is C1 on U for each t∈[a,b]. Its derivative matrix S(t;s):=Dsϕ(t;s) is the unique solution of

S(t;s)=Id+∫atDyf(r,ϕ(r;s))S(r;s) dr,

and hence satisfies ∂tS=Dyf(t,ϕ(t;s))S, S(a;s)=Id. The claim is local to the stated common compact tube; it does not assert differentiability beyond it.

Facts & Assumptions

Given: a<b, the open state-time domain Ω, the C1 vector field f, compact convex K⊆Ω, open U, and the stated common existence and tube assumptions.

[F1]

Continuously differentiable maps, local inverses, and local diffeomorphisms: C1 means total differentiability at every point and continuity of the derivative entries.

[F2]

A first-order initial value problem is equivalent to its Volterra integral equation: each continuous IVP solution satisfies ϕ(t;s)=s+∫atf(r,ϕ(r;s)) dr.

[F3]

Gronwall's integral inequality with variable and constant coefficients: if u(t)≤A+L∫atu(r)dr for nonnegative continuous u and constants A,L≥0, then u(t)≤AeL(t−a).

[F4]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous map on a compact metric space is uniformly continuous; its proof uses no choice principle.

[F5]

For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable: for an integrable vector-valued function on [a,b], ∥∫abg∥2≤∫ab∥g∥2.

[F6]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of a composition is the composition of the derivatives.

[F7]

The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a): a vector curve continuous on a closed interval with derivative norm at most M in its interior changes by at most M times the interval length.

[F8]

Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous vector field locally Lipschitz in the state has a unique local IVP solution; any two solutions through the same data agree on their common interval.

[F9]

Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: every Picard-Lindelöf IVP has a unique maximal solution, and every other solution through the data is its restriction.

Proof technique: Uniform continuity of Dyf on the common compact tube controls the difference-quotient remainder; Gronwall controls both the flow difference and its linearized remainder.

Proof

1.1F1F2F3F4F5F7given

Compactness of K and continuity of Dyf give a finite constant L bounding ∥Dyf∥op and a modulus ω(η)→0 such that ∥Dyf(z)−Dyf(w)∥op≤ω(∥z−w∥2) for z,w∈K; this uses [F1] and [F4]. For fixed s∈U and sufficiently small h with s+h∈U, set Δh(t)=ϕ(t;s+h)−ϕ(t;s). The two Volterra equations, convexity of K, and [F7] applied to the line segment between the two state values give ∥f(t,ϕ(t;s+h))−f(t,ϕ(t;s))∥2≤L∥Δh(t)∥2. Applying [F3] to the norm inequality from the integral equations yields sup⁡t∥Δh(t)∥2≤eL(b−a)∥h∥2.

1.2F3F8F9given

For each fixed s, the matrix equation S′=A(t)S, S(a)=Id, with A(t)=Dyf(t,ϕ(t;s)) has a unique solution on [a,b]. View matrices as vectors in Rd2 with the Frobenius norm and extend A continuously by its endpoint values to an open interval containing [a,b]. The extended linear vector field is locally Lipschitz in the matrix state, so the linear IVP has a unique maximal solution by [F8] and [F9]. Gronwall bounds ∥S(t)∥F on every finite subinterval. If its maximal interval ended at a finite time at or before b, then S′=AS would be bounded there, making S(t) Cauchy with a finite limit; local existence from that limit extends the solution, a contradiction. Its integral equation is unique by [F3].

2.1F1F4F6F7step 1.1

Uniform continuity of Dyf on K implies, with z=(t,ϕ(t;s)) and v=Δh(t), that ∥f(t,ϕ(t;s)+v)−f(t,ϕ(t;s))−Dyf(z)v∥2≤ω(∥v∥2)∥v∥2. The line segment remains in K by convexity. For g(θ)=f(t,ϕ(t;s)+θv)−f(t,ϕ(t;s))−θDyf(z)v, the chain rule [F6] gives g′(θ)=[Dyf(z+θ(0,v))−Dyf(z)]v, whose norm is at most ω(∥v∥2)∥v∥2; applying [F7] on [0,1] gives the claimed remainder bound.

3.1F1F2F3F5step 1.1step 1.2step 2.1

Put Eh(t)=Δh(t)−S(t;s)h. Subtract the integral equations for ϕ(t;s+h), ϕ(t;s), and S(t;s)h. The result is Eh(t)=∫atA(r)Eh(r)dr+∫atqh(r)dr, where ∥qh(r)∥2≤ω(eL(b−a)∥h∥2)eL(b−a)∥h∥2 by steps 1.1 and 2.1. Applying [F3] gives sup⁡t∥Eh(t)∥2/∥h∥2≤(b−a)e2L(b−a)ω(eL(b−a)∥h∥2)→0. Thus Dsϕ(t;s)=S(t;s) in the total-derivative definition [F1].

4.1F1F3F4step 1.1step 1.2∎

If sn→s in U, step 1.1 gives uniform convergence ϕ(⋅;sn)→ϕ(⋅;s). Uniform continuity of Dyf on K then gives uniform convergence A(⋅;sn)→A(⋅;s). Subtract the two integral equations for S(⋅;sn) and S(⋅;s); [F3], together with the uniform bound on S obtained from its integral equation, implies sup⁡t∥S(t;sn)−S(t;s)∥F→0; equivalence of matrix norms gives the same convergence in operator norm. The derivative is continuous, so the flow is C1 on U.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Certified differentiable IVP approximation interface for shooting

Definition

Fix an interval [a,b] and an open set U⊆Rd on which each exact IVP flow ϕ(t;s) exists for all t∈[a,b]. A certified differentiable IVP evaluator on U declares a C1 approximate endpoint map (here C1 means total differentiability with continuous derivative entries) Φ~:U→Rd and a stated number δIVP≥0. A call at s∈U either returns failure or supplies a continuous approximate trajectory ϕ~(⋅;s), the endpoint Φ~(s) and the exact derivative DΦ~(s) for that numerical map, satisfying

sup⁡t∈[a,b]∥ϕ~(t;s)−ϕ(t;s)∥2≤δIVP,Φ~(s)=ϕ~(b;s).

The same δIVP bounds every successful call, uniformly in its initial state; no approximate trajectory or error bound is required at a failed call. The declared endpoint map remains C1 on U even when some calls fail. The returned derivative is not asserted to equal the derivative of the exact flow. This is an interface contract for a supplied method; it does not assert that any particular integrator satisfies the contract.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Continuous linearized BVP operator and its conditioning

Definition

Let y∗∈C1([a,b],Rd) solve a square BVP, with f and B continuously differentiable on open neighborhoods of the trajectory and endpoint pair. Put A(t)=Dyf(t,y∗(t)), B1=D1B(y∗(a),y∗(b)), and B2=D2B(y∗(a),y∗(b)). Let

X=C1([a,b],Rd),∥v∥X=∥v∥∞+∥v′∥∞,

and

Z=C([a,b],Rd)×Rd,∥(g,q)∥Z=max⁡{∥g∥∞,∥q∥2}.

The continuous linearized BVP operator is the bounded linear map L:X→Z given by

Lv=(v′−Av, B1v(a)+B2v(b)).

It is boundedly invertible when it is bijective and its inverse L−1:Z→X has finite operator norm. That norm is the conditioning constant for the linearized BVP used in the local discretization theorem.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Normalized implicit-midpoint collocation residual for a two-point BVP

Definition

For a d-dimensional BVP on [a,b], an integer N≥1, uniform mesh width h=(b−a)/N, mesh nodes ti=a+ih, and node vector Y=(Y0,…,YN)∈(Rd)N+1, let Dh be the open set of node vectors for which every midpoint pair (ti+h/2,(Yi+Yi+1)/2) lies in the vector-field domain and (Y0,YN) lies in the boundary-map domain. Define Gh:Dh→(Rd)N+1 by

Gh,i(Y)=Yi+1−Yih−f ⁣(ti+h2,Yi+Yi+12)(0≤i<N),Gh,N(Y)=B(Y0,YN).

Use the maximum of the Euclidean block norms for both node and residual vectors. The interior rows are normalized by h; consequently an unscaled increment row has size h times its normalized row.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Zeros of the exact shooting residual are exactly BVP solutions

Statement

On an open set U of initial states, suppose each IVP has a unique solution ϕ(⋅;s) on [a,b] that is a C1 curve, and (s,ϕ(b;s))∈DB for every s∈U. Define the exact shooting residual by R(s)=B(s,ϕ(b;s)). Then R(s)=0 if and only if ϕ(⋅;s) is a BVP solution. Any BVP solution with initial state s equals this shot.

Facts & Assumptions

Given: The BVP data and an initial state s whose unique IVP solution exists on [a,b].

[F1]

Square nonlinear two-point boundary-value problems and endpoint residuals: a BVP solution is a continuously differentiable IVP curve satisfying B(y(a),y(b))=0, and R(s)=B(s,ϕ(b;s)).

Proof

1.1givenF1

If R(s)=0, then ϕ(⋅;s) already solves the IVP with initial state s and satisfies B(s,ϕ(b;s))=0 by the definition of R. It is continuously differentiable and lies in the BVP domain, so [F1] makes it a BVP solution.

1.2givenF1

Conversely, let y be any BVP solution with y(a)=s. It solves the same IVP as ϕ(⋅;s); the assumed uniqueness implies y(t)=ϕ(t;s) throughout [a,b]. The boundary equation then gives R(s)=B(s,ϕ(b;s))=B(y(a),y(b))=0.

2.1step 1.1step 1.2∎

The same uniqueness argument shows that any BVP solution with initial state s is exactly this trajectory, proving both the equivalence and the asserted trajectory identity.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableprecheck pendingOpen item page →

Finite-budget implicit-midpoint collocation for a nonlinear BVP

Definition

Fix a uniform mesh and the open nodal domain Dh and normalized residual Gh from Normalized implicit-midpoint collocation residual for a two-point BVP. If f and B are C1 on the required domains (total differentiability with continuous derivative entries), then Gh is a C1 square map from the open subset Dh⊆Rd(N+1) into Rd(N+1). Given an initial node vector Y0∈Dh, tolerance τ≥0, and correction budget M∈N0, apply Finite-budget Newton for a square vector residual to Gh using its exact Jacobian. Return the last node vector and its root, singular-jacobian, invalid-trial, or iteration-budget-exhausted status as defined by that procedure. A root status means only that ∥Gh(Y)∥≤τ; it is not a branch, convergence, or error certificate.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform inverse bound for the sampled midpoint linearized BVP

Statement

Here Ck means each coordinate has continuous total derivatives through order k. Let f,B be C2 near an exact solution y∗∈C3([a,b],Rd) of a square BVP, and suppose the continuous linearized operator L in Continuous linearized BVP operator and its conditioning is boundedly invertible. For uniform meshes with h=(b−a)/N, let Yi∗=y∗(ti) and let Jh=DGh(Y∗) be the Jacobian of the normalized midpoint residual. There are h0>0 and C<∞ such that for every mesh width 0<h≤h0, Jh is invertible and

∥Jh−1∥∞→∞≤C,

where both finite-dimensional norms are the maximum of the Euclidean block norms. The bound is independent of h; this is a local linear inverse result, not a nonlinear convergence theorem.

Facts & Assumptions

Given: The square BVP, C2 data near y∗, y∗∈C3, uniform meshes, and bounded invertibility of the continuous operator L.

[F1]

Normalized implicit-midpoint collocation residual for a two-point BVP: Gh has normalized interior midpoint rows and the boundary row B(Y0,YN); differentiating its rows gives the stated midpoint Jacobian blocks.

[F2]

Continuous linearized BVP operator and its conditioning: Lv=(v′−Av,B1v(a)+B2v(b)), and bounded invertibility implies in particular that its kernel is zero.

[F3]

Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous coefficient matrix defines unique local solutions of the linear IVP X′=A(t)X.

[F4]

Gronwall's integral inequality with variable and constant coefficients: a bound u(t)≤C+M∫atu implies u(t)≤CeM(t−a).

[F5]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): differentiating a composition gives the product of its total derivatives.

[F6]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R: finite-dimensional Euclidean spaces, hence also with an equivalent maximum norm, are complete.

[F7]

Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: a Picard–Lindelöf IVP has a maximal solution and every other solution through the same data is its restriction.

[F8]

A first-order initial value problem is equivalent to its Volterra integral equation: a solution of a continuous finite-dimensional IVP on an interval satisfies its Volterra integral equation, including on closed subintervals. Apply this to each column of the fundamental matrix.

[F9]

For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable: the Euclidean norm of a vector-valued integral over an increasing interval is at most the integral of its norm. Applying this to a continuous matrix integrand acting on each unit vector gives the corresponding operator-norm bound.

Proof

1.1givenF2F3F4F7F8

Write A(t)=Dyf(t,y∗(t)) and let X(t) solve X′=A(t)X, X(a)=Id. Since A is continuous and bounded on [a,b], extend it continuously by its endpoint values to an open interval containing [a,b]. Local existence follows from [F3], and the integral equation [F8] gives the Gronwall bound for the maximal solution from [F7]; if it stopped at or before b, boundedness of X′=AX would give a finite endpoint limit from which local existence extends it, a contradiction. Thus X exists on [a,b]. Define Q=B1+B2X(b). If Qc=0, then v(t)=X(t)c satisfies Lv=(0,0); [F2] forces v=0, and v(a)=c then gives c=0. The square matrix Q is therefore invertible.

1.2F1F5F6given

For each mesh let Cih=Dyf(ti+h/2,(Yi∗+Yi+1∗)/2). Uniform continuity of y∗ and Dyf on a compact neighborhood implies max⁡i∥Cih−A(ti+h/2)∥op→0. Also sup⁡h,i∥Cih∥op<∞. Applying the chain rule [F5] to the rows in [F1], the interior equation Jhz=(r0,…,rN−1,q) is (I−hCih/2)zi+1=(I+hCih/2)zi+hri. For small h, I−hCih/2 is invertible by its convergent geometric series; its inverse norm is at most 2, and the induced transition matrices Mih=(I−hCih/2)−1(I+hCih/2) satisfy ∥Mih∥≤1+C0h for a constant independent of i,h.

2.1F3F4F7F8F9step 1.2algebra

Let Mh=MN−1h⋯M0h, the discrete homogeneous transfer from z0 to zN. By [F8] on each column, the exact fundamental matrix X satisfies X(ti+1)−X(ti)=∫titi+1A(t)X(t)dt. The integrand is uniformly continuous, so its average over each cell differs from its midpoint value by a quantity tending uniformly to zero as h→0. Explicitly, put mi=ti+h/2, H(t)=A(t)X(t) and ωG(ρ)=sup⁡∣s−t∣≤ρ∥G(s)−G(t)∥op for s,t∈[a,b] and G=H,X. Write SX=sup⁡t∥X(t)∥op, SA=sup⁡t∥A(t)∥op, and δh=max⁡i∥Cih−A(mi)∥op→0 by step 1.2. By [F9], ∥h−1∫titi+1H(t)dt−H(mi)∥op≤ωH(h/2). Define the normalized midpoint defect by ηih=(X(ti+1)−X(ti))/h−Cih(X(ti)+X(ti+1))/2. Adding and subtracting H(mi) and A(mi)(X(ti)+X(ti+1))/2 therefore gives max⁡i∥ηih∥op≤ωH(h/2)+δhSX+SAωX(h/2)→0, since H and X are uniformly continuous on [a,b]. The transition bound in step 1.2 propagates the increment defects hηih with total bound at most C1(b−a)max⁡i∥ηih∥; hence Mh→X(b).

3.1F1step 1.2step 2.1algebra

Put Qh=B1+B2Mh. By step 2.1, Qh→Q. Since Q is invertible, determinant continuity makes Qh invertible for all sufficiently small h, and the adjugate formula gives a uniform bound on ∥Qh−1∥. For arbitrary forcing blocks ri, the recurrence in step 1.2 and its transition bound give zN=Mhz0+wh and max⁡i∥zi∥2≤C2(∥z0∥2+max⁡i∥ri∥2), with ∥wh∥2≤C2max⁡i∥ri∥2. The boundary row B1z0+B2zN=q becomes Qhz0=q−B2wh, so z0 and then every zi are bounded by C3max⁡(max⁡i∥ri∥2,∥q∥2) uniformly in h.

4.1givenstep 3.1algebra∎

For every right-hand side (r0,…,rN−1,q), step 3.1 constructs a unique solution of the square linear system Jhz=(r0,…,rN−1,q) and gives the asserted uniform operator bound. Therefore Jh is onto and one-to-one, hence invertible, with the stated estimate.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Zeros of the normalized midpoint residual are precisely midpoint collocation solutions

Statement

For any Y∈Dh, Gh(Y)=0 if and only if

Yi+1−Yi=hf ⁣(ti+h2,Yi+Yi+12)(0≤i<N),B(Y0,YN)=0.

Equivalently, the piecewise-linear interpolant has on each segment a constant slope equal to the vector field at the segment midpoint state and satisfies the endpoint residual.

Facts & Assumptions

Given: The BVP data, uniform mesh, admissible node vector, and normalized residual from Normalized implicit-midpoint collocation residual for a two-point BVP.

[F1]

Normalized implicit-midpoint collocation residual for a two-point BVP: every interior block is the increment divided by h>0 minus the midpoint vector field, and the last block is B(Y0,YN).

[F2]

Square nonlinear two-point boundary-value problems and endpoint residuals: the endpoint equation in the BVP is B(y(a),y(b))=0.

Proof

1.1givenF1F2algebra

If Gh(Y)=0, each block is zero. For i<N, multiply the normalized row by the positive scalar h to get the stated increment equation; the last block gives B(Y0,YN)=0, the BVP endpoint equation by [F2].

1.2givenF1F2algebra

Conversely, if all displayed increment equations and the endpoint equation hold, dividing each increment equation by h>0 makes every interior block zero, and the endpoint equation makes the last block zero; by [F2] it is the BVP boundary condition. Thus Gh(Y)=0.

2.1step 1.1step 1.2algebra∎

The piecewise-linear interpolant changes by Yi+1−Yi over an interval of width h, so its slope is the quotient on the left of each increment equation. This proves the equivalent slope wording without adding another condition.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

The multiple-shooting Jacobian is bordered block-bidiagonal

Statement

Fix a mesh a=t0<⋯<tN=b, N≥1, and an open product domain of segment starts (s0,…,sN) on which B and each exact or certified approximate segment endpoint map Ψi:Ui→Rd are C1. Here C1 means total differentiability with continuous derivative matrix entries. Define F by rows Fi=Ψi(si)−si+1 for 0≤i<N and FN=B(s0,sN). Its Jacobian block row i<N has DΨi(si) in column i, −Id in column i+1, and zero in every other column. Its boundary row has D1B and D2B in columns 0 and N and zero elsewhere. When N=1, columns 0 and N are distinct.

Facts & Assumptions

Given: The mesh, open product domain, C1 maps B,Ψi, and residual F.

[F1]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): for totally differentiable maps g,f, D(g∘f)(a)=Dg(f(a))∘Df(a).

[F2]

Initial-data sensitivity of an ODE flow on a common compact tube: an exact segment endpoint map is C1 when its solutions remain in a common compact convex tube.

[F3]

Certified differentiable IVP approximation interface for shooting: a certified approximate segment endpoint map is C1 and supplies its own exact derivative.

[F4]

Square nonlinear two-point boundary-value problems and endpoint residuals: the exact multiple-shooting rows are the segment endpoint minus next segment start, followed by B(s0,sN).

Proof

1.1givenF1F4algebra

For an interior row Fi(s0,…,sN)=Ψi(si)−si+1, varying only block si changes that row by DΨi(si), varying only block si+1 changes it by −Id, and varying any other block leaves it unchanged. These are precisely the stated nonzero and zero blocks.

1.2givenF1F2F3algebra

For the boundary row FN=B(s0,sN), the chain rule gives derivatives D1B and D2B with respect to the first and last blocks; all intermediate blocks are absent from its formula, so their derivatives are zero. The differentiability assertions for exact and approximate segment maps follow from [F2] and [F3].

2.1givenstep 1.1step 1.2algebra∎

The residual has (N+1)d scalar rows and (N+1)d scalar variables, so the displayed block matrix is square.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Derivative of the nonlinear shooting residual

Statement

Let Ψ:U→Rd be a C1 endpoint map (total differentiability with continuous derivative entries) on an open set U⊆Rd, and let B be C1 on an open neighborhood of {(s,Ψ(s)):s∈U}. Define RΨ(s)=B(s,Ψ(s)). Then RΨ is C1 and

DRΨ(s)=D1B(s,Ψ(s))+D2B(s,Ψ(s))DΨ(s).

This applies to the exact flow endpoint map under Initial-data sensitivity of an ODE flow on a common compact tube and to the approximate endpoint map in Certified differentiable IVP approximation interface for shooting; in the latter case the derivative is exact for the numerical map, not the exact flow.

Facts & Assumptions

Given: U, Ψ, B, and their stated C1 properties.

[F1]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): for totally differentiable maps g,f, D(g∘f)(a)=Dg(f(a))∘Df(a).

[F2]

The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: the Jacobian matrix represents the total derivative in standard coordinates.

[F3]

Initial-data sensitivity of an ODE flow on a common compact tube: the exact endpoint map s↦ϕ(b;s) is C1 on its open initial-state domain.

[F4]

Certified differentiable IVP approximation interface for shooting: the approximate endpoint map is C1 and its supplied derivative is its derivative as a map on initial states.

Proof

1.1givenF2algebra

Define G:U→Rd×Rd by G(s)=(s,Ψ(s)). The coordinate product map is totally differentiable and DG(s)v=(v,DΨ(s)v).

2.1givenF1step 1.1algebra

The residual is the composition RΨ=B∘G. Applying [F1] at each s gives DRΨ(s)v=D1B(s,Ψ(s))v+D2B(s,Ψ(s))DΨ(s)v for every v∈Rd, hence the displayed matrix identity.

3.1F1F3F4step 2.1∎

Since both component maps and their derivatives are continuous, the derivative in step 2.1 varies continuously with s; therefore RΨ is C1. Facts [F3] and [F4] verify the two stated choices of Ψ under their respective hypotheses.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableprecheck pendingOpen item page →

Finite-budget multiple shooting for a nonlinear two-point BVP

Definition

Fix a mesh a=t0<⋯<tN=b, N≥1, and an open product domain of segment starts (s0,…,sN) on which B and every certified segment endpoint map are C1, meaning they are totally differentiable with continuous derivative entries. Inputs are an initial tuple in this domain, a residual tolerance τ≥0, and a correction budget M∈N0. Each evaluator supplies an approximate endpoint map Φ~i and its derivative. Form the computed square residual with rows Φ~i(si)−si+1 for 0≤i<N and B(s0,sN); its block Jacobian is the matrix in The multiple-shooting Jacobian is bordered block-bidiagonal. For k=0,1,…,M, in this order:

  1. Evaluate the residual, its Jacobian, and the approximate segment trajectories. If any evaluator fails, return the last valid tuple with status evaluator-failure and no residual certificate.
  2. If the Euclidean norm of the residual is at most τ, return the tuple and trajectories with status root-tolerance-met.
  3. If k=M, return status iteration-budget-exhausted.
  4. Solve the Newton correction equation with the displayed square Jacobian using Newton correction for a square vector residual. A singular Jacobian returns status singular-jacobian.
  5. If the proposed tuple is outside the open product domain, return the last tuple with status invalid-trial; otherwise accept it as the next iterate.

The procedure applies the finite-budget Newton checks to the (N+1)d variables. Its residual-tolerance status concerns the approximate map that was evaluated. It does not certify that the segment approximations join, that an exact BVP solution exists, or that the procedure converges from arbitrary starts.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableprecheck pendingOpen item page →

Finite-budget single shooting for a nonlinear two-point BVP

Definition

Let U⊆Rd be the open trial-initial-state set. Let DB⊆Rd×Rd be the open domain of the C1 boundary map B, where C1 means total differentiability with continuous derivative entries. Inputs are a certified evaluator from Certified differentiable IVP approximation interface for shooting, an initial trial s0∈U, residual tolerance τ≥0, and a correction budget M∈N0. The evaluator may return failure on a queried trial. Every successful response must supply the approximate trajectory, the endpoint Φ~(s) and the exact derivative DΦ~(s) of the declared C1 numerical endpoint map, with the interface's stated uniform trajectory-error bound. Success on every queried trial is not an input assumption.

For k=0,1,…,M, in this order:

  1. Query the evaluator at sk. If it fails, return the last accepted trial with status evaluator-failure and no residual certificate. Before evaluating B, check (sk,Φ~(sk))∈DB; if this fails or cannot be established, return the last accepted trial with status invalid-endpoint-pair and no residual certificate. On success form R~(sk)=B(sk,Φ~(sk)) and DR~(sk)=D1B(sk,Φ~(sk))+D2B(sk,Φ~(sk))DΦ~(sk) using Derivative of the nonlinear shooting residual. A failure to evaluate these quantities returns evaluator-failure without a residual certificate.
  2. If ∥R~(sk)∥2≤τ, return sk, its approximate trajectory, and status root-tolerance-met. This status asserts only the displayed residual tolerance.
  3. If k=M, return the last trial and status iteration-budget-exhausted.
  4. Call Newton correction for a square vector residual with A=DR~(sk) and r=R~(sk). If it reports singular-jacobian, stop with that status. Otherwise let uk be its returned correction.
  5. If the proposed trial sk+uk is outside U or its membership cannot be established, return the last accepted trial with status invalid-trial; otherwise accept sk+1=sk+uk. Initially the last accepted trial is s0; accepting a trial supplies no boundary residual certificate until step 1 succeeds there.

On a sequence of successful evaluations with endpoint pairs in DB, this has the same residual, singularity, trial-domain and budget checks as Finite-budget Newton for a square vector residual. It makes no global-start, exact-root, or discretization-error claim. The numerical residual is C1 on the open subset of U where (s,Φ~(s))∈DB; no boundary value is evaluated outside that subset.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Local second-order midpoint collocation error with an algebraic residual budget

Statement

Here C2 means continuously differentiable with continuous second total derivatives, and C3 means the same through third derivatives. Let f,B be C2 on open neighborhoods of an exact solution y∗∈C3([a,b],Rd) of the square BVP, and suppose its continuous linearized BVP operator is boundedly invertible. For all sufficiently fine uniform meshes, the normalized midpoint residual Gh has a unique zero Yh in a fixed-radius maximum-norm ball about the sampled vector Y∗=(y∗(ti)). Its Jacobian at Yh is invertible with an inverse bound independent of h. For every candidate Y in that ball with ∥Gh(Y)∥∞≤εalg, its piecewise-linear interpolant PhY satisfies

∥PhY−y∗∥∞≤C(h2+εalg),

where C is independent of h and the candidate. This is a local branch result only; it asserts no branch selection outside the ball and no global Newton convergence.

Facts & Assumptions

Given: The square BVP, f,B∈C2 near the solution, y∗∈C3, bounded invertibility of the continuous linearized BVP operator, and a uniform mesh.

[F1]

Normalized implicit-midpoint collocation residual for a two-point BVP: Gh consists of normalized midpoint ODE rows and the boundary row, with maximum Euclidean block norms.

[F2]

Continuous linearized BVP operator and its conditioning: the continuous linearized operator is Lv=(v′−Av,B1v(a)+B2v(b)); the theorem assumes it is boundedly invertible.

[F3]

Uniform inverse bound for the sampled midpoint linearized BVP: at the sampled vector Y∗, Jh=DGh(Y∗) is invertible with ∥Jh−1∥∞→∞≤K uniformly for small h.

[F4]
[F5]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R: a closed ball in a finite-dimensional normed Euclidean space is complete.

[F6]

Multivariable Taylor formula with a Lagrange remainder along a line segment: the scalar Taylor formula with remainder applies to each coordinate of a vector-valued curve or residual block.

Proof

1.1givenF1F2F6algebra

Let Yi∗=y∗(ti). Applying scalar Taylor's formula coordinatewise to the d components of the C3 curve y∗ on each cell gives (Yi+1∗−Yi∗)/h=y∗′(ti+h/2)+O(h2) and (Yi∗+Yi+1∗)/2=y∗(ti+h/2)+O(h2). Since y∗′=f(t,y∗(t)), bounded first derivatives of f make each normalized interior residual O(h2) uniformly. The exact endpoint pair makes the boundary block zero; [F2] names the boundedly invertible continuous linearized operator assumed here, and thus ∥Gh(Y∗)∥∞≤C0h2. The Taylor remainder bounds are uniform because the derivatives are bounded on a compact neighborhood of the trajectory.

1.2givenF1F2F6algebra

On a fixed-radius ball about Y∗, all midpoint states and endpoint pairs stay in compact subsets of the domains for sufficiently small radius. Bounded second derivatives of f and B imply a constant LG, independent of h,N, such that ∥DGh(Y)−DGh(Z)∥∞→∞≤LG∥Y−Z∥∞ on this ball: every interior row depends on only two node blocks and its nonlinear part is f evaluated at their average, while the linear increment term has constant derivative; the boundary row depends only on the two endpoint blocks. The bounds on each row therefore do not grow with the number of mesh cells.

2.1F3F4F5step 1.1step 1.2given

Choose r>0 small enough that the closed ball B‾∞(Y∗,r) lies in the nodal domain and KLGr≤1/2. Define Th(Y)=Y−Jh−1Gh(Y). The mean-value bound from step 1.2 gives ∥Th(Y)−Th(Z)∥∞≤KLGr∥Y−Z∥∞≤12∥Y−Z∥∞ on the ball. Also ∥Th(Y∗)−Y∗∥∞≤KC0h2, so for small enough h this is at most r/2; then Th maps the ball into itself. It is a contraction on a nonempty complete ball by [F4] and [F5].

3.1F3step 1.2step 2.1algebra

The contraction theorem gives a unique fixed point Yh in the ball. Since Jh is invertible, Th(Y)=Y is equivalent to Gh(Y)=0, so this is the unique residual zero there. The fixed-point estimate gives ∥Yh−Y∗∥∞≤2KC0h2. Further, ∥DGh(Yh)−Jh∥≤LG∥Yh−Y∗∥∞=O(h2). For small h, ∥Jh−1(DGh(Yh)−Jh)∥<1/2; the geometric-series inverse of I+Jh−1(DGh(Yh)−Jh) shows DGh(Yh) invertible with inverse norm at most 2K.

4.1F3F6step 3.1givenalgebra∎

For any candidate Y in the ball, put e=Y−Yh. Each interior residual block depends only on two node blocks, and the boundary block only on the two endpoint blocks. Apply [F6] to each scalar component of Gh(Yh+te) for 0≤t≤1; the segment lies in the open nodal domain. The uniform second-derivative bounds from step 1.2, row locality, and fixed d give a constant CG, independent of h and N, such that Gh(Y)=DGh(Yh)e+q with ∥q∥∞≤CG∥e∥∞2. Since both points lie in the radius-r ball, ∥e∥∞≤2r; reduce r initially if needed so 4KCGr≤1/2. Using [step 3.1], ∥e∥∞≤2K∥Gh(Y)∥∞+2KCG∥e∥∞2≤2Kεalg+12∥e∥∞, so ∥e∥∞≤4Kεalg. The piecewise-linear interpolant is a convex combination of adjacent nodes, hence ∥Ph(Y−Yh)∥∞≤∥e∥∞. The linear interpolant of Y∗ differs from y∗ by at most h2∥y∗′′∥∞/8 on each cell, and ∥Ph(Yh−Y∗)∥∞≤∥Yh−Y∗∥∞=O(h2) by step 3.1. Adding these bounds proves the stated estimate.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Local Newton convergence on the selected midpoint collocation branch

Statement

For each sufficiently fine mesh, let Yh be the local root of the normalized midpoint residual supplied by Local second-order midpoint collocation error with an algebraic residual budget. On a sufficiently small ball about Yh, the exact-Jacobian finite-budget Newton procedure in Finite-budget implicit-midpoint collocation for a nonlinear BVP has a basin in which every attempted update is valid, remains in the ball, and satisfies a quadratic error estimate. The radius may depend on h; a finite budget may stop early, and arbitrary initial node vectors receive no convergence guarantee.

Facts & Assumptions

Given: A sufficiently fine fixed mesh, the local root Yh, the C2 data and conditioning assumptions of the midpoint branch theorem, tolerance τ≥0, budget M∈N0, and an initial vector in the local Newton ball.

[F1]

Local second-order midpoint collocation error with an algebraic residual budget: Gh(Yh)=0 and DGh(Yh) is invertible; the theorem defines C2 as continuously differentiable with continuous second total derivatives.

[F2]

Normalized implicit-midpoint collocation residual for a two-point BVP: Gh is the normalized square collocation residual.

[F3]

Finite-budget implicit-midpoint collocation for a nonlinear BVP: the procedure applies the finite exact-Jacobian Newton method to Gh on its open nodal domain.

[F4]

Updated-Jacobian Newton has local quadratic convergence at a simple root: a C2 square map with an invertible derivative at a root and locally Lipschitz Jacobian has a local quadratic Newton basin.

Proof

1.1givenF1F2algebra

By [F1], the branch theorem’s C2 convention means continuous second total derivatives. For this fixed mesh, Gh maps the open nodal domain in Rd(N+1) to the same-dimensional residual space. Since f and B are C2, composition with the affine midpoint maps shows that Gh is C2; on a closed ball around Yh inside the domain its continuous second derivatives are bounded, so its Jacobian is Lipschitz there.

2.1givenF1F3F4step 1.1∎

Fact [F1] gives the zero and invertible derivative required by [F4]. Applying [F4] to this fixed finite-dimensional map yields a positive local radius and quadratic estimate. By [F3] the prescribed algorithm follows those exact Newton updates while the iterates remain in the ball; its finite budget can stop early and imposes no assertion for starts outside the basin.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Local Newton convergence for a simple nonlinear shooting root

Statement

Here C2 means twice continuously differentiable. Let the exact shooting residual R(s)=B(s,ϕ(b;s)) be C2 on an open neighborhood of a root s∗, with R(s∗)=0, DR(s∗) invertible, and DR Lipschitz on a closed ball about s∗. Assume there is an open neighborhood U of s∗ on which the exact IVP flow is an evaluator satisfying Certified differentiable IVP approximation interface for shooting with ϕ~(⋅;s)=ϕ(⋅;s), Φ~(s)=ϕ(b;s), and δIVP=0. Also assume B is C1 on an open neighborhood of {(s,ϕ(b;s)):s∈U}, as required by Finite-budget single shooting for a nonlinear two-point BVP. Then there are ρ>0 and C>0 such that, for every initial trial s0∈B‾2(s∗,ρ), every attempted exact-Jacobian Newton update is defined, remains in this ball, and satisfies

∥sk+1−s∗∥2≤C∥sk−s∗∥22.

A finite budget may stop before the residual tolerance is met. No arbitrary-start or global-convergence guarantee follows.

Facts & Assumptions

Given: The exact shooting residual, its simple root and local regularity, the exact evaluator, a residual tolerance, a finite update budget, and an initial state in the local ball below.

[F1]

Certified differentiable IVP approximation interface for shooting: the exact flow is an allowed evaluator with zero trajectory error and endpoint map equal to the exact flow endpoint map.

[F2]

Derivative of the nonlinear shooting residual: the residual Jacobian is D1B+D2B DΦ for the exact endpoint map.

[F3]

Finite-budget single shooting for a nonlinear two-point BVP: with the exact evaluator, the method applies the finite exact-Jacobian Newton steps to R and has the stated stopping statuses.

[F4]

Updated-Jacobian Newton has local quadratic convergence at a simple root: a C2 square map with a simple root and Lipschitz Jacobian has a ball where its exact-Jacobian Newton updates remain valid and satisfy a quadratic error estimate; a finite budget may stop early.

Proof

1.1givenF4

The residual is a square map from an open subset of Rd to Rd. Intersect its C2 neighborhood with the exact-evaluator neighborhood U; this is still open and contains s∗. The stated root, invertible derivative, and Lipschitz bound give the map hypotheses of [F4] on a closed ball inside that intersection.

2.1givenF1F2F3F4step 1.1∎

The exact evaluator in [F1] makes the computed residual in [F3] equal to R, and [F2] supplies its exact Jacobian. Applying [F4] therefore gives a radius and constant for which every attempted update is defined, remains in the ball, and obeys the quadratic estimate. Procedure [F3] can stop earlier on residual tolerance or budget; neither stopping status changes the update conclusion, and [F4] supplies no global-start claim.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Shooting error separates IVP integration and nonlinear residual error

Statement

Let the exact shooting residual R(s)=B(s,ϕ(b;s)) have a root s∗ whose trajectory is a BVP solution. For some r>0, suppose R is C2 on an open neighborhood of B‾2(s∗,r) (twice continuously differentiable), DR(s∗) is invertible, and DR is LR-Lipschitz on this ball, where σ:=∥DR(s∗)−1∥op−1>0 and (LR/2)r≤σ/2. Assume a certified evaluator from Certified differentiable IVP approximation interface for shooting succeeds on this ball with uniform trajectory error δIVP, and that B is LB-Lipschitz in its terminal-state argument between the exact and approximate endpoints there. For any candidate s^∈B‾2(s∗,r) with computed residual ∥B(s^,Φ~(s^))∥2≤τroot,

∥s^−s∗∥2≤2σ(τroot+LBδIVP).

If, in addition, f is C1 on an open field domain Ω, and there are an open neighborhood U⊇B‾2(s∗,r) and a compact convex K⊆Ω such that for every s∈U the IVP has a unique solution ϕ(⋅;s) on [a,b] with graph in K, and

∥f(t,y)−f(t,z)∥2≤L∥y−z∥2whenever (t,y),(t,z)∈K,

then the approximate trajectory from s^ differs uniformly from the exact BVP trajectory by at most

δIVP+eL(b−a)∥s^−s∗∥2.

The integration and root-residual terms remain separate; the theorem makes no global solver-success claim.

Facts & Assumptions

Given: The BVP, exact shooting root s∗, regularity and inverse bound, radius r, certified evaluator with error δIVP, terminal Lipschitz constant LB, candidate s^ and computed residual tolerance τroot, and, when the trajectory estimate is used, the open set U, common compact convex tube K, C1 field, and state-Lipschitz bound L from the Statement.

[F1]

Square nonlinear two-point boundary-value problems and endpoint residuals: R(s)=B(s,ϕ(b;s)) is the exact endpoint residual.

[F2]

Certified differentiable IVP approximation interface for shooting: Φ~(s)=ϕ~(b;s) and sup⁡t∥ϕ~(t;s)−ϕ(t;s)∥2≤δIVP.

[F3]

Finite-budget single shooting for a nonlinear two-point BVP: the computed root-tolerance status is only the residual bound for B(s,Φ~(s)).

[F4]

Vector Newton remainder under a Lipschitz Jacobian: apply its estimate on the convex ball with its evaluation point x=s∗ and its other point x∗=s. Since R(s∗)=0, this gives R(s)=DR(s∗)(s−s∗)+q with ∥q∥2≤(LR/2)∥s−s∗∥22.

[F5]

Gronwall's integral inequality with variable and constant coefficients: a difference bound u(t)≤u(a)+L∫atu yields u(t)≤eL(t−a)u(a).

[F6]

Initial-data sensitivity of an ODE flow on a common compact tube: under the common-tube hypotheses in the Statement, exact solutions satisfy their Volterra integral equations.

Proof

1.1givenF1F4algebra

Put e=s^−s∗. The vector remainder estimate [F4] and R(s∗)=0 give R(s^)=DR(s∗)e+q with ∥q∥2≤(LR/2)∥e∥22. Since ∥e∥2≤r and ∥DR(s∗)e∥2≥σ∥e∥2, the radius condition yields ∥R(s^)∥2≥σ∥e∥2−(σ/2)∥e∥2=(σ/2)∥e∥2.

2.1givenF2F3step 1.1algebra

The exact and computed residuals have the same first boundary argument. By the stated terminal-state Lipschitz bound and [F2], ∥R(s^)−B(s^,Φ~(s^))∥2≤LBδIVP. The computed residual assumption therefore gives ∥R(s^)∥2≤τroot+LBδIVP. Combining with step 1.1 proves the initial-state estimate. If the candidate is the algorithm's root-tolerance output, [F3] supplies exactly the needed residual premise; other statuses supply no such premise.

3.1givenF2F5F6step 2.1algebra∎

Let u(t)=∥ϕ(t;s^)−ϕ(t;s∗)∥2. The common-tube C1 hypothesis makes the flows satisfy the Volterra equations by [F6], and the tube's Lipschitz bound gives u(t)≤∥e∥2+L∫atu(r)dr. Applying [F5] yields u(t)≤eL(b−a)∥e∥2 for every t∈[a,b]. The evaluator error [F2] and the triangle inequality add at most δIVP, giving the displayed trajectory estimate. The given root trajectory is the exact BVP trajectory.

5 · Examples, counterexamples and false statements

None yet.

Sources