Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Undamped nonlinear RKC2 has fixed-stage order two on an admitted tube

Statement

Fix s≥2 and T>0. Let f(t,y) be C2 on an open time-state domain, and let the exact IVP solution y be defined on [0,T]. Assume its derivatives through order three and the derivatives of f through order two are bounded on a compact convex tube K contained in the domain. Assume the stage recursion of Second-order nonlinear stabilized Runge–Kutta–Chebyshev step is admitted from every starting state in K for sufficiently small uniform steps and that every stage and output remains in K. Assume all line segments used in Taylor expansions stay in K, and that on each state slice of K, f is Lipschitz in its state argument with one common constant Lf. Evaluation failures and domain failures are absent. The global-error claim additionally assumes the exact and numerical trajectories stay in K.

Then the nonlinear RKC2 method has a uniform one-step defect bound Csh3 and one-step stability bound (1+Lsh) on that tube, for constants Cs,Ls independent of the step index and h (but allowed to depend on fixed s and the tube bounds).

For h=T/N, start the method at y(0) and suppose its numerical stages and states remain in the same tube for all N steps. Then the global grid error is at most max⁡0≤n≤N∥yn−y(tn)∥2≤{Csexp⁡(LsT)−1Lsh2,Ls>0,CsTh2,Ls=0. The statement is fixed-stage and fixed-time. It gives no uniform-in-s accuracy, nonlinear stability, positivity, or stiffness-uniform accuracy.

Facts & Assumptions

Given: A fixed stage count s≥2, a C2 time-dependent vector field and exact solution on a fixed finite interval, the common compact convex tube and bounded-derivative hypotheses, state-Lipschitz constant Lf, admitted method stages, and exact stage evaluations.

[F1]

Second-order nonlinear stabilized Runge–Kutta–Chebyshev step: b1=1/4, w1=3/(s2−1), Y1=y+b1w1hf(t,y), and for j≥2, Yj=(1−μj−νj)y+μjYj−1+νjYj−2+mjhf(t+cj−1h,Yj−1)+gjhf(t,y) with the stated coefficients.

[F2]

RKC stability polynomials and certified negative-real intervals: the scalar linear specialization has R2,s(z)=1+z+z2/2+O(z3).

[F3]

One-step ODE methods, local defect, uniform order, and step stability: local defect is the exact-start method output minus exact next state; order two requires a uniform O(h3) defect, and one-step stability has the form 1+Lh.

[F4]

Multivariable Taylor formula with a Lagrange remainder along a line segment and Ck maps and multi-index derivative notation in Euclidean space: a C2 vector field has a first-order Taylor expansion on each admitted segment with a uniformly bounded quadratic remainder; apply the scalar theorem to each component.

[F6]

Global error from uniform one-step defect and stability: on a common compact tube, initial error C0hp, local defect Chp+1, and one-step bound 1+Lh imply the stated fixed-time global estimate.

[F8]

The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0 and Every finite-dimensional normed space is Banach: the standard coordinate lists are finite bases of R and Rd, so these Euclidean spaces are real Banach spaces. This supplies the Banach-space hypotheses when [F5] is applied to the ODE solution and vector field.

[A1]

All exact states, numerical states, stage inputs, and Taylor segments used below lie in the stated compact convex tube, where the derivative and state-Lipschitz bounds are uniform.

Proof

1.1F1algebrainduction

Apply the recurrence of [F1] to the time component of the augmented field (t,y)′=(1,f(t,y)). Its stage abscissae satisfy c0=0, c1=b1w1, and for j≥2, cj=μjcj−1+νjcj−2+2bjw1, because mj+gj=mjbj−1=2bjw1. At j=2, μ2=2, ν2=−1, and 2b2w1=w1/2, so c2=2c1+w1/2=w1. At j=3 (when s≥3), b3=8/27, μ3=64/27, ν3=−32/27, and 2b3w1=16w1/27, so c3=8w1/3. For every j≥4, the previous two values are cj−1=((j−1)2−1)/(s2−1) and cj−2=((j−2)2−1)/(s2−1). Using w1=3/(s2−1) and 3bkk2=k2−1 for k=j,j−1,j−2 gives μjcj−1+νjcj−2+2bjw1=bjs2−1(6(j−1)2−3(j−2)2+6)=3bjj2s2−1=j2−1s2−1. Thus induction gives cj=bjw1j2=(j2−1)/(s2−1) for j≥2, so cs=1. The actual nonautonomous stage times are the declared t+cjh.

2.1A1F1F4step 1.1inductionalgebra

For fixed s, stage increments Zj:=Yj−y are uniformly O(h). The base is Z0=0, Z1=b1w1hf(t,y); for j≥2, the coefficient sum (1−μj−νj)+μj+νj=1 rewrites [F1] as Zj=μjZj−1+νjZj−2+mjhf(t+cj−1h,Yj−1)+gjhf(t,y). Boundedness of f, the fixed finite number of stages, and induction give a uniform O(h) bound. Refine the same induction: Z1=c1hf(t,y), and Taylor to first order gives f(t+cj−1h,Yj−1)=f(t,y)+O(h), so the recurrence for its h coefficient is cj=μjcj−1+νjcj−2+mj+gj, the abscissa recurrence in step 1.1. Thus Zj=cjhf(t,y)+O(h2) for every stage.

3.1A1F1F4step 2.1inductionalgebra

Write q:=∂tf(t,y)+Dyf(t,y)f(t,y). From step 2.1 and [F4], uniformly at every stage, f(t+cj−1h,Yj−1)=f(t,y)+cj−1hq+O(h2). A second induction in [F1] therefore gives Yj=y+cjhf(t,y)+djh2q+O(h3), where d0=d1=0 and dj=μjdj−1+νjdj−2+mjcj−1. The remainders are uniform because s is fixed and the derivatives are bounded on K.

3.2A1F1F3F7step 2.1algebrainduction

For stability, fix two admitted initial states u,v in the same convex state slice and let D0=∥u−v∥2. The finite recurrence [F1], the triangle inequality, and the state-Lipschitz assumption imply by induction a finite constant Mj with ∥Yj(u)−Yj(v)∥2≤MjD0 for every j≤s and h≤h0: take M0=1, M1=1+b1w1h0Lf, and for j≥2 take Mj=∣1−μj−νj∣+∣μj∣Mj−1+∣νj∣Mj−2+∣mj∣h0LfMj−1+∣gj∣h0Lf. Writing Zj(y)=Yj(y)−y, the same recurrence after the constant base-state coefficients cancel gives ∥Zj(u)−Zj(v)∥2≤KjhD0: use K0=0, K1=b1w1Lf, and Kj=∣μj∣Kj−1+∣νj∣Kj−2+∣mj∣LfMj−1+∣gj∣Lf. All constants are finite because s is fixed. Hence ∥Ys(u)−Ys(v)∥2≤∥u−v∥2+∥Zs(u)−Zs(v)∥2≤(1+Ksh)∥u−v∥2. This proves one-step stability with Ls=Ks.

4.1A1F1F2F4F5F8step 3.1algebra

For the scalar linear equation y′=y at starting value 1, the coefficient of h2 in the same recurrence is exactly ds. By [F2], the scalar stability polynomial is 1+z+z2/2+O(z3), so ds=1/2. Since [F1] and the recurrence defining dj are independent of the choice of f, step 3.1 yields Ys=y+hf(t,y)+h22(∂tf(t,y)+Dyf(t,y)f(t,y))+O(h3). By [F5], whose Banach-space hypotheses hold by [F8], the exact solution has the same expansion through degree two, with a uniform O(h3) remainder on the tube. The method-minus-exact defect is therefore bounded by Csh3.

5.1A1F3F6step 4.1step 3.2∎

Apply [F6] with p=2, C0=0, C=Cs, and L=Ls, using the local-defect and step-stability bounds from steps 4.1 and 3.2. It gives exactly the two global-error cases in the Statement.

Remarks

The imported global theorem is conditional: tube admissibility, local defect, and one-step stability are proved here for fixed s. Its use does not establish a uniform error constant as the stage count changes.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

105 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