Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

50 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