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.

✓ 3 results · all verified · 1 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 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Nonlinear Boundary-Value Solvers — Examples

1 · Prerequisites

2 · Summary

These examples show why boundary-value solvers need local conditioning and branch information. A decaying-mode problem amplifies single-shooting slope error, a midpoint residual can have two simple branches, and Newton can stop at a singular initial guess even when the BVP has simple solutions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A midpoint BVP residual can have two simple solution branches

Example

For y′=0 on [0,1] with scalar boundary residual B(y(0),y(1))=y(0)2−1, the exact BVP has two constant solutions y≡1 and y≡−1. For every uniform mesh, the normalized implicit-midpoint collocation residual has exactly those two roots, and each root is simple.

Verification

Given: The scalar vector field f(t,y)=0, the endpoint map B(y0,y1)=y02−1, and a uniform mesh with N≥1.

[F1] Square nonlinear two-point boundary-value problems and endpoint residuals: BVP solutions satisfy the ODE and endpoint residual.

[F2] Normalized implicit-midpoint collocation residual for a two-point BVP: the interior normalized rows are (Yi+1−Yi)/h and the last row is Y02−1.

[F3] Zeros of the normalized midpoint residual are precisely midpoint collocation solutions: zeros of the residual are exactly the stated midpoint equations and boundary equation.

[F4] Finite-budget implicit-midpoint collocation for a nonlinear BVP: the algorithm applies finite-budget Newton to this square residual but does not select a global branch.

1.1givenF1algebra

Since y′=0, every BVP solution is constant; the boundary equation is y(0)2−1=0, whose real roots are 1 and −1. Both constant curves satisfy the equation and endpoint condition.

2.1F2F3step 1.1algebra

At a residual zero, the interior rows from [F2] force Yi+1=Yi for every i, so all nodes equal some c; the endpoint row then gives c2−1=0. Thus the only residual zeros are the two constant node vectors Yi=1 and Yi=−1, in accord with [F3].

3.1F2step 2.1algebra

At either root, a vector z=(z0,…,zN) in the kernel of the residual Jacobian satisfies zi+1−zi=0 in every interior row, hence all zi=c. The boundary row is 2Y0z0=0; since Y0=±1, this forces c=0. The square Jacobian has trivial kernel, so it is invertible and each root is simple.

4.1F4step 3.1∎

Fact [F4] defines a finite Newton procedure but makes no branch-selection or global-convergence claim. The existence of both roots shows directly that the BVP and its collocation residual have no unique global solution branch.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Single shooting amplifies an initial-slope error on a decaying-mode BVP

Example

For λ>0, consider u′′=λ2(u+1) on [0,1] with u(0)=−1 and u(1)=0. In first-order form the state is x=(u,v) with u′=v, v′=λ2(u+1), and the square boundary map is B(x0,x1)=(u0+1,u1). The scalar solution component u stays in [−1,0], but changing the unknown initial slope by δ changes the terminal value by δsinh⁡(λ)/λ. The factor exceeds one for every λ>0 and is unbounded as λ increases, so a small initial-slope error can be strongly amplified by single shooting.

Verification

Given: λ>0, first-order state x=(u,v), boundary map B(x0,x1)=(u0+1,u1), and an exact IVP evaluator so that the shooting residual is the exact terminal boundary residual.

[F1] Square nonlinear two-point boundary-value problems and endpoint residuals: the BVP is a first-order system with a square endpoint residual.

[F2] Certified differentiable IVP approximation interface for shooting: an exact flow can be used as an endpoint evaluator with error bound zero.

[F3] Finite-budget single shooting for a nonlinear two-point BVP: single shooting applies finite-budget Newton to the endpoint residual when this evaluator is used.

1.1givenF1algebra

The substitution w=u+1 gives w′′=λ2w with w(0)=0 and w(1)=1. Solving this constant-coefficient equation gives w(t)=sinh⁡(λt)/sinh⁡λ, so u(t)=w(t)−1∈[−1,0] because sinh⁡(λt) increases from 0 to sinh⁡λ. Its initial slope is s∗=w′(0)=λ/sinh⁡λ.

2.1step 1.1algebra

If the initial slope is s∗+δ while u(0)=−1 remains fixed, linearity of the equation for w gives wδ(t)=(s∗+δ)sinh⁡(λt)/λ. Subtracting the exact shot yields wδ(1)−w(1)=δsinh⁡λ/λ.

3.1F2F3step 2.1algebra∎

Since sinh⁡λ−λ has value zero at 0 and derivative cosh⁡λ−1>0 for λ>0, we have sinh⁡λ/λ>1. Also the derivative of q(λ)=sinh⁡λ/λ has numerator g(λ)=λcosh⁡λ−sinh⁡λ, where g(0)=0 and g′(λ)=λsinh⁡λ>0; hence q is increasing. For λ≥2, sinh⁡λ≥eλ−1/2, so q(λ)≥eλ−1/(2λ)→∞. The perturbed terminal boundary residual vector changes by (0,δsinh⁡λ/λ), while [F2]–[F3] identify this as the endpoint residual evaluated by exact single shooting.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A valid shooting BVP can fail Newton at a singular initial guess

Example

For y′=0 on [0,1] with B(y(0),y(1))=y(0)2−1, the exact shooting residual is R(s)=s2−1. It has simple roots s=±1, but exact-Jacobian Newton at s=0 immediately returns singular-jacobian because R′(0)=0. Local convergence near a simple root does not imply convergence from every initial guess.

Verification

Given: The scalar BVP, an exact flow evaluator, and a zero residual tolerance with at least one Newton correction allowed.

[F1] Square nonlinear two-point boundary-value problems and endpoint residuals: the exact shooting residual is B(s,ϕ(1;s)).

[F2] Certified differentiable IVP approximation interface for shooting: the exact flow is an allowed evaluator with zero trajectory error.

[F3] Derivative of the nonlinear shooting residual: the derivative of the shooting residual is the derivative of B(s,Φ(s)) by the chain rule.

[F4] Finite-budget single shooting for a nonlinear two-point BVP: Newton first checks the residual tolerance and then attempts the Jacobian correction; singular Jacobian is a returned status.

[F5] Local Newton convergence for a simple nonlinear shooting root: the local theorem requires an invertible derivative at the root and makes no arbitrary-start claim.

1.1givenF1F2algebra

The exact ODE flow for y′=0 is ϕ(t;s)=s, so [F1] gives R(s)=B(s,s)=s2−1, and [F2] certifies that the exact evaluator used by the algorithm has zero IVP error. Thus R(1)=R(−1)=0 and R′(s)=2s, making both roots simple.

2.1F3F4step 1.1algebra

At the initial guess s0=0, the residual is −1, so a zero tolerance is not met; the Jacobian is the zero 1×1 map because R′(0)=0. The linear correction therefore has no solution in the sense required by Newton and [F4] returns singular-jacobian before any update.

3.1F5step 1.1step 2.1algebra∎

The roots at ±1 have nonzero derivative, so the simple-root condition can hold on a sufficiently small ball around either root, where the polynomial derivative is Lipschitz. Fact [F5] then gives a local Newton basin there, while step 2.1 exhibits a valid start outside both guaranteed basins for which the method stops.

Sources