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.
Nonlinear Boundary-Value Solvers — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonlinear Boundary-Value Solvers
- Nonlinear equations and Newton methods
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
A midpoint BVP residual can have two simple solution branches
Example
For on with scalar boundary residual , the exact BVP has two constant solutions and . 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 , the endpoint map , and a uniform mesh with .
[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 and the last row is .
[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.
Since , every BVP solution is constant; the boundary equation is , whose real roots are and . Both constant curves satisfy the equation and endpoint condition.
At a residual zero, the interior rows from [F2] force for every , so all nodes equal some ; the endpoint row then gives . Thus the only residual zeros are the two constant node vectors and , in accord with [F3].
At either root, a vector in the kernel of the residual Jacobian satisfies in every interior row, hence all . The boundary row is ; since , this forces . The square Jacobian has trivial kernel, so it is invertible and each root is simple.
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.
Single shooting amplifies an initial-slope error on a decaying-mode BVP
Example
For , consider on with and . In first-order form the state is with , , and the square boundary map is . The scalar solution component stays in , but changing the unknown initial slope by changes the terminal value by . The factor exceeds one for every and is unbounded as increases, so a small initial-slope error can be strongly amplified by single shooting.
Verification
Given: , first-order state , boundary map , 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.
The substitution gives with and . Solving this constant-coefficient equation gives , so because increases from to . Its initial slope is .
If the initial slope is while remains fixed, linearity of the equation for gives . Subtracting the exact shot yields .
Since has value zero at and derivative for , we have . Also the derivative of has numerator , where and ; hence is increasing. For , , so . The perturbed terminal boundary residual vector changes by , while [F2]–[F3] identify this as the endpoint residual evaluated by exact single shooting.
A valid shooting BVP can fail Newton at a singular initial guess
Example
For on with , the exact shooting residual is . It has simple roots , but exact-Jacobian Newton at immediately returns singular-jacobian because . 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 .
[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 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.
The exact ODE flow for is , so [F1] gives , and [F2] certifies that the exact evaluator used by the algorithm has zero IVP error. Thus and , making both roots simple.
At the initial guess , the residual is , so a zero tolerance is not met; the Jacobian is the zero map because . The linear correction therefore has no solution in the sense required by Newton and [F4] returns singular-jacobian before any update.
The roots at 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.