Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Collocation polynomial derivatives scale with the step size

Statement

Fix M distinct nodes in [0,1], a time t, and an exact IVP solution y on an interval [t,t+h0] for some h0>0, with initial state u=y(t). Let D⊆R×Rd be open and let f:D→Rd be defined on a neighborhood of a compact tube containing this exact trajectory and the collocation stages. Assume each scalar coordinate of f has continuous partial derivatives through total order 2M+1, all bounded on the tube. Smoothness of vector-valued functions and their derivative bounds here and below are componentwise; the scalar Taylor supplier is applied to each coordinate, and finite-dimensional coordinate bounds give the stated Euclidean norm bounds. Assume the collocation stage branch exists and is locally unique in this tube for all sufficiently small h≤h0. Let uh be the collocation polynomial from Collocation tableau from distinct quadrature nodes, and set gh(τ)=f(t+hτ,uh(τ)),rh(τ)=uh′(τ)−hgh(τ). For 1≤j≤M, ∥uh(j)∥∞≤Cjhj; for j>M, uh(j)=0. For 0≤j≤2M, ∥gh(j)∥∞≤Cjhj (with h0=1), and ∥rh(j)∥∞≤Cjhj+1. The constants depend on the fixed node set and its cardinal-basis derivative bounds; no uniformity in M is asserted.

Facts & Assumptions

Given: The collocation tableau and polynomial, a small-step branch in the stated compact tube, and a vector field with the stated bounded smoothness.

[F1]

Collocation tableau from distinct quadrature nodes: uh(0)=u, uh′(τ)=hIMgh(τ), and uh(ci)=Ui, where IM is interpolation at the M fixed nodes.

[F2]

Cardinal interpolation functions are polynomials of the stated degrees supplies the finite cardinal sum IMv=∑jv(cj)ℓj, its degree bound M−1, and the nodal values; Existence and uniqueness of the cardinal-polynomial interpolant, with n=M−1, makes it the unique polynomial of degree at most M−1 with those data.

[F3]

Multivariable Taylor formula with a Lagrange remainder along a line segment and Chain sum product and composition rules for Banach derivatives: scalar Taylor expansion with bounded remainder applies to each coordinate, and repeated differentiation of finite compositions obeys the chain and product rules on the common tube.

[F4]

Higher derivatives and the classes Ck and C∞: for scalar functions on time and normalized-time intervals, Ck means derivatives through order k exist and are continuous; this applies to coordinates of the paths and composites used below. Smoothness of f itself is the componentwise partial-derivative assumption in the Statement.

[F5]

First-order systems, initial value problems, and solutions on intervals: the exact path satisfies y′=f(t,y) on its interval.

[A1]

The nodes and tube are fixed as h↓0; the exact path, all stages, and the collocation polynomial stay in the tube, and the small-step branch of [F2] is used.

Proof

1.1A1F1F2F3F4F5chooseinductionalgebra

For each real component polynomial p of degree at most M−1, p and IMp have the same M nodal data and degree bound, so uniqueness in [F2] gives IMp=p; all reproduction uses below are componentwise. The stage equations in [F1] and boundedness of f on the tube first give Ui−u=O(h). Since D is open and the finitely many partial derivatives used in [F3] are continuous at (t,u), choose a convex open ball about (t,u) contained in D and shrink it so those derivatives are bounded there. For sufficiently small h, every stage point (t+cjh,Uj) and its segment to (t,u) lie in this ball, so [F3] applies with uniform Taylor remainders. The exact path satisfies y′=f(t,y) by [F5]. We prove by induction on s=1,…,M that there are vector polynomials Ps of degree at most s such that Ui=u+∑r=1shrPr(ci)+O(hs+1) uniformly over the finite node set. For the induction step, substitute the expansion through order s into each scalar coordinate of f(t+hcj,Uj) and apply the scalar Taylor supplier [F3] at (t,u). Each coefficient of hm is a polynomial in cj of degree at most m, because every time increment contributes one factor cjh and each state coefficient at order r has degree at most r. For m≤M−1, [F2] makes interpolation exact on that coefficient; the row identity Qij=∫0ciℓj then integrates it to a polynomial in ci of degree at most m+1. Multiplication by the outer h gives the next Pm+1. Taylor remainders are uniform on the chosen ball for sufficiently small h, and the stated local branch supplies the stage solution.

2.1step 1.1F1F2F3F4algebra

The coefficient construction in step 1.1 and its Taylor expansion give vector polynomials Rm of degree at most m with f(t+hcj,Uj)=∑m=0M−1hmRm(cj)+δj(h), where max⁡j∥δj(h)∥=O(hM). Apply componentwise reproduction from [F2] and define eh(τ)=∑jℓj(τ)δj(h). Then IMgh(τ)=∑m=0M−1hmRm(τ)+eh(τ) and every derivative of eh through order M−1 is O(hM), because its basis is fixed. Substituting into the defining integral in [F1], rather than identifying a degree-M polynomial from only its M stage values, gives uh(τ)=u+∑s=1MhsPs(τ)+Rh(τ) with Ps(τ)=∫0τRs−1(a) da and Rh(τ)=h∫0τeh(a) da. These are the same integrated coefficients used in step 1.1 through the row integrals Qij. Thus deg⁡Ps≤s, Ps(0)=0, ∥Rh∥∞=O(hM+1), and for 1≤j≤M, Rh(j)=heh(j−1)=O(hM+1). Differentiating the expansion annihilates every term with s<j and bounds the remaining terms by O(hj). Hence ∥uh(j)∥∞=O(hj) for 1≤j≤M; derivatives above M vanish by the defining integrated cardinal sum. This argument also covers M=1 and a node at zero.

3.1A1F3F4step 2.1algebra

Repeated chain and product rules from [F3] express each coordinate of gh(j) as a finite sum of derivatives of that coordinate of f applied to derivatives of (t+hτ,uh(τ)) whose orders add to j. Each argument derivative of order s≤M is O(hs) by step 2.1; higher derivatives vanish for the polynomial state and affine time coordinate. The bounded derivatives in [F4] therefore give ∥gh(j)∥∞≤Cjhj through j=2M.

4.1F2F3step 3.1algebra∎

For j<M, subtract from each coordinate of gh its Taylor polynomial of degree M−1 at 0. Its remainder and its first j derivatives are O(hM) by step 3.1 and the one-variable Taylor remainder in [F3]. Interpolation reproduces that Taylor polynomial by [F2]; derivatives of the interpolated remainder are bounded by the fixed constants max⁡τ∑i∣ℓi(j)(τ)∣, so (IMgh−gh)(j)=O(hM) coordinatewise. Multiplying by h gives rh(j)=O(hM+1)≤O(hj+1) for j<M and h≤1. For M≤j≤2M, IMgh has degree at most M−1, so its jth derivative vanishes and rh(j)=−hgh(j)=O(hj+1) by step 3.1.

Depends on

Used by

Dependency tree · two levels

42 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