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.

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

Fractional evolution and convolution quadrature

1 · Prerequisites

2 · Summary

Objective

This page establishes the weak-kernel power integral, defines the Caputo derivative of order 0<α<1 on absolutely continuous functions under Countable Choice (which supplies integrability of their derivatives), proves its Volterra integral formulation under Countable Choice and Dependent Choice, and proves a local Lipschitz existence theorem for the integral solution using Picard iteration and a weakly singular Grönwall inequality, and supplies two scalar time-stepping procedures. The uniform-grid L1 method has positive weights, comparison stability, and an O(h2−α) error bound when the exact solution belongs to C2([0,T]). The same positive comparison argument gives an error decomposition on graded grids, without an optimal graded-mesh rate. Backward-Euler convolution quadrature uses the principal-branch generating function (1−z)Log⁡α on ∣z∣<1; its scalar resolvent is stable for λ≥0, and a first-order error estimate is proved for the compatible datum u(t)=u0+t2. The CQ result is scalar and supplies no sectorial-operator or contour estimate.

The planned page prerequisite composite-quadrature-rules supplies generic smooth-integrand midpoint and Simpson rules. Its current interface has no fractional-kernel error theorem; the L1 weights here are integrated exactly and the CQ weights are derived from their generating function. Startup layers and truncated-memory bias are treated as examples, not as covered by the smooth-data error theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Integral of the fractional power kernel

Statement

For β>0 and t>0, ∫0t(t−s)β−1 ds=tββ. When 0<β<1 the integral is improper at s=t; for β≥1 it is an ordinary integral. It converges in both cases because B(β,1) is defined for positive arguments.

Facts & Assumptions

Given: β>0 and t>0.

[F1]

Euler's real Beta integral: B(p,q)=∫01xp−1(1−x)q−1 dx for p,q>0.

[F2]

The real Beta--Gamma identity: B(p,q)=Γ(p)Γ(q)/Γ(p+q) for p,q>0.

[F3]

The real Gamma functional equation Γ(s+1)=sΓ(s): Γ(x+1)=xΓ(x) for x>0.

[F5]

Change of variable in an improper integral: a monotone differentiable change of variable preserves an improper integral when the transformed integral converges.

Proof

1.1givenF1F5construct

In the improper integral, set x=(t−s)/t. On every compact truncation this is a differentiable decreasing substitution with ds=−t dx, so [F5] and passage to the endpoint limits give ∫0t(t−s)β−1 ds=tβ∫01xβ−1 dx=tβB(β,1), where the last equality is [F1] because (1−x)0=1 on (0,1).

2.1step 1.1F2F3F4algebra∎

By [F2] and [F4], B(β,1)=Γ(β)/Γ(β+1). Applying [F3] gives B(β,1)=1/β. Substitution into step 1.1 proves the formula and convergence of the stated improper integral.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Fractional integral and Caputo derivative

Definition

Let T>0 and β>0. For g∈L1(0,T), its left fractional integral of order β is, for almost every t∈(0,T),

Iβg(t):=1Γ(β)∫0t(t−s)β−1g(s) ds.

The definition uses Lebesgue integration, with Indefinite Lebesgue integral on a compact interval and The class L1(μ) of integrable functions. The kernel is integrable and ∫0t(t−s)β−1 ds=tββ by Integral of the fractional power kernel. Tonelli's theorem Tonelli's theorem for nonnegative measurable functions on a sigma-finite product therefore gives ∫0T∫0t(t−s)β−1∣g(s)∣ ds dt=∫0T∣g(s)∣∫sT(t−s)β−1dt ds≤Tββ∥g∥L1(0,T)<∞, so the defining integral is finite for almost every t. For continuous g, it is finite at every t∈[0,T] and ∣Iβg(t)∣≤tββΓ(β)∥g∥∞=tβΓ(β+1)∥g∥∞, using The real Gamma functional equation Γ(s+1)=sΓ(s).

For 0<α<1 and an absolutely continuous function u:[0,T]→R whose almost-everywhere derivative belongs to L1(0,T), its Caputo derivative of order α is the almost-everywhere defined function

DCαu:=I1−αu′=1Γ(1−α)∫0t(t−s)−αu′(s) ds.

Here absolute continuity is as in Absolute continuity on a compact interval. Under Countable Choice (The Axiom of Countable Choice (ACω)), every such absolutely continuous u has u′∈L1(0,T) by Absolutely continuous functions have integrable derivatives, so the Caputo derivative is defined on the whole absolutely continuous class under that assumption. Without Countable Choice, the same formula is defined for each absolutely continuous u whose derivative is separately known to be in L1(0,T). The Gamma factors are the positive real Euler Gamma function The real Gamma function by Euler's integral.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Fractional integrals of continuous data are Hölder continuous

Statement

Let T>0, 0<β<1, and g∈C([0,T]). Then Iβg is continuous on [0,T], Iβg(0)=0, and

∥Iβg∥∞≤TβΓ(β+1)∥g∥∞,

∣Iβg(t)−Iβg(s)∣≤2∥g∥∞Γ(β+1)∣t−s∣β(s,t∈[0,T]).

Facts & Assumptions

Given: T>0, 0<β<1, and g∈C([0,T]).

[F1]

Fractional integral and Caputo derivative: for t∈[0,T], Iβg(t)=Γ(β)−1∫0t(t−r)β−1g(r) dr.

[F2]

The real Gamma functional equation Γ(s+1)=sΓ(s): for x>0, Γ(x+1)=xΓ(x).

[F4]

Integral of the fractional power kernel: ∫0t(t−r)β−1dr=tβ/β for t>0.

Proof

1.1givenF1F2F4algebra

For each t, [F1] and β>0 give ∣Iβg(t)∣≤∥g∥∞Γ(β)−1∫0t(t−r)β−1dr=∥g∥∞tβ/(βΓ(β)). By [F2] this is the first bound, and it also gives Iβg(0)=0.

1.2givenF1F3F4algebra

Suppose 0≤s≤t≤T and put δ=t−s. Since β−1<0, the kernel (t−r)β−1 is no larger than (s−r)β−1 for 0≤r<s. Thus [F1] gives Γ(β)∣Iβg(t)−Iβg(s)∣≤∥g∥∞(∫0s((s−r)β−1−(t−r)β−1)dr+∫st(t−r)β−1dr). The first integral is (sβ−tβ+δβ)/β. Its integrand is nonnegative, so the integral is nonnegative; and tβ−sβ≥0 by monotonicity of positive powers in [F3], so the same formula bounds it above by δβ/β. The second integral is δβ/β. Therefore the right side is at most 2∥g∥∞δβ/β.

2.1step 1.2F2algebra∎

Divide step 1.2 by Γ(β)>0 and use [F2]. This gives the stated Hölder bound when s≤t; interchanging s,t gives it for every pair. The bound tends to zero with ∣t−s∣, so Iβg is continuous.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Semigroup law for fractional integrals

Statement

Let T>0, a,b>0, and g∈L1(0,T). Then, almost everywhere on (0,T),

Ia(Ibg)=Ia+bg.

Moreover,

∥Iag∥L1(0,T)≤TaΓ(a+1)∥g∥L1(0,T).

If g∈C([0,T]), the semigroup identity holds at every t∈[0,T]. For every c>0 and t∈[0,T], Ic1(t)=tcΓ(c+1), where 1 is the constant function with value 1.

Facts & Assumptions

Given: T>0, positive orders a,b, and g∈L1(0,T).

[F1]

Fractional integral and Caputo derivative: Icg(t)=Γ(c)−1∫0t(t−s)c−1g(s) ds for every c>0 at almost every t where the integral is finite.

[F2]

Euler's real Beta integral: B(p,q)=∫01yp−1(1−y)q−1dy for p,q>0.

[F3]

The real Beta--Gamma identity: for p,q>0, B(p,q)=Γ(p)Γ(q)/Γ(p+q).

[F4]

The real Gamma functional equation Γ(s+1)=sΓ(s): for x>0, Γ(x+1)=xΓ(x).

[F5]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative product-measurable function on a product of sigma-finite measure spaces has equal product and iterated integrals, with either iterated order permitted.

[F6]

Integral of the fractional power kernel: ∫0txc−1dx=tc/c for c,t>0.

[F7]

The real Gamma function by Euler's integral: Γ(c)>0 for every c>0.

[F8]

Change of variable in an improper integral: a monotone differentiable change of variable preserves an improper integral when the transformed integral converges.

Proof

1.1givenF1F4F5F6F7algebra

The integrands are measurable. Applying Tonelli [F5] to their absolute values on 0≤r≤s≤t≤T, for each fixed r set x=t−s and y=s−r; the region lies in [0,T]2, so the kernel integral is at most ∫0Txa−1dx∫0Tyb−1dy=Ta+b/(ab) by [F6]. Hence ∫0T∫0t∫0s(t−s)a−1(s−r)b−1∣g(r)∣ dr ds dt≤Ta+b∥g∥1/(ab)<∞, so the double integral is absolutely integrable for almost every fixed t and Tonelli permits swapping r,s. The same theorem gives ∥Iag∥1≤Γ(a)−1∫0T∣g(r)∣∫rT(t−r)a−1dt dr≤Ta∥g∥1/Γ(a+1) using [F4]–[F6] and positivity [F7].

2.1step 1.1F2F5F6F8algebra

After swapping the order, the inner kernel integral is ∫rt(t−s)a−1(s−r)b−1ds=(t−r)a+b−1∫01(1−y)a−1yb−1dy=(t−r)a+b−1B(b,a) by the substitution y=(s−r)/(t−r) using [F8] and the definition [F2]. This applies for almost every t by step 1.1; if g is continuous, Tonelli and this formula bound the nonnegative double integral for each fixed t by ∥g∥∞B(b,a)∫0t(t−r)a+b−1dr<∞ using [F5]–[F6], so Fubini applies for every t.

3.1step 1.1step 2.1F1F3algebra

Substituting [F3] into step 2.1 cancels Γ(a)Γ(b) in [F1], leaving Ia(Ibg)(t)=Γ(a+b)−1∫0t(t−r)a+b−1g(r)dr=Ia+bg(t) almost everywhere, and everywhere for continuous g. This proves the semigroup identity and the L1 bound in step 1.1.

4.1givenF1F4F6F7algebra∎

For the constant function, [F1] and [F6] give Ic1(t)=tc/(cΓ(c)) for t>0. Positivity from [F7] makes the quotient well-defined, and [F4] rewrites it as tc/Γ(c+1); both sides vanish at t=0.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Uniform-grid and graded-grid L1 discretization

Definition

Input 0<α<1, T>0, an integer N≥1, λ≥0, an initial value U0=u0, and forcing values F1,…,FN. Choose either the uniform grid tk=kh with h=T/N, or a strictly increasing grid 0=t0<t1<⋯<tN=T. A power-graded choice is tk=T(k/N)r with a specified r≥1. Write hk=tk−tk−1 and, for 1≤k≤n≤N, define the exact kernel weight

bn,k:=(tn−tk−1)1−α−(tn−tk)1−αΓ(2−α)hk.

For a grid sequence V0,…,VN, the L1 approximation to the Caputo derivative at tn is

δTαVn:=∑k=1nbn,k(Vk−Vk−1).

For n=1,…,N in increasing order, compute the value given by the scalar recurrence

Un:=Fn+bn,1U0+∑k=1n−1(bn,k+1−bn,k)Ukbn,n+λ.

Return U0,…,UN. On a uniform grid, writing aj=(j+1)1−α−j1−α gives

δhαUn=h−αΓ(2−α)∑k=1nan−k(Uk−Uk−1).

An input outside the stated parameter or grid domain returns invalid-input. A finite-precision implementation that cannot certify a scalar solve returns solve-failed without reporting a value. The graded-grid procedure is an implementation definition only; no optimal graded-mesh rate is part of this item.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Backward-Euler convolution quadrature for a Caputo equation

Definition

Input 0<α<1, a step size h>0, an integer N≥1, λ≥0, an initial value u0, and forcing values F1,…,FN. If any admissibility condition fails, return invalid-input. Set ω0=1 and compute ω1,…,ωN in increasing order by

ωj:=j−1−αj ωj−1.

Set V0=0 and U0=u0. For n=1,…,N in increasing order, compute

Vn:=Fn−λu0−h−α∑j=1nωjVn−jh−α+λ,Un:=u0+Vn.

For any sequence V0,…,VN with V0=0, use the notation

∂ˉhαVn:=h−α∑j=0nωjVn−j.

Return U0,…,UN. A finite-precision implementation that cannot certify a scalar solve returns solve-failed without reporting a value. No FFT or truncated-memory error claim is included.

Remarks

The coefficient sequence is identified with the principal-branch backward-Euler symbol in Principal-branch generating function for backward-Euler convolution quadrature. Its sign and partial-sum bounds used for scalar stability are proved in Backward-Euler fractional weights and positive partial sums.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Principal-branch generating function for backward-Euler convolution quadrature

Statement

Let 0<α<1 and let (ωj)j≥0 be the weights defined by Backward-Euler convolution quadrature for a Caputo equation. Then the complex power series

W(z):=∑j=0∞ωjzj

converges absolutely for every z in the open unit disc D={z∈C:∣z∣<1}, and W(z)=(1−z)Log⁡α(z∈D), where the right side is the principal-branch power from Complex powers defined from a holomorphic logarithm branch. It is well-defined there because 1−z lies in the principal-logarithm slit plane.

Facts & Assumptions

Given: 0<α<1 and the backward-Euler CQ coefficient recurrence.

[F1]

Backward-Euler convolution quadrature for a Caputo equation: ω0=1 and ωj=((j−1−α)/j)ωj−1 for j≥1.

[F3]

Complex series, absolute convergence, complex power series, and radius of convergence: the radius of a complex power series is the radius of its real modulus series. Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term: inside its disc of convergence, the sum is holomorphic.

[F8]

Complex powers defined from a holomorphic logarithm branch: zLog⁡α=exp⁡(αLog⁡z) on the principal-logarithm slit plane. The principal logarithm is the normalised holomorphic branch on the slit plane: the principal logarithm is holomorphic there.

[F9]

The chain rule for complex derivatives, The complex exponential is entire and its complex derivative is itself, and Linearity, product, reciprocal, and quotient rules for complex derivatives: compositions of complex differentiable maps are complex differentiable, the exponential is entire, and affine maps are holomorphic.

[F10]

On positive reals, the principal branch power agrees with the published real power: on positive real bases, principal-branch powers agree with real powers.

[F11]

Identity theorem for holomorphic functions: two holomorphic functions on a complex domain that agree on a set with an interior accumulation point agree throughout the domain.

Proof

1.1givenF1F2F3algebra

The recurrence [F1] gives ∣ω0∣=1, ω1=−α with ∣ω1∣=α<1, and for j≥2 gives ωj=((j−1−α)/j)ωj−1 with 0<(j−1−α)/j<1, so induction yields ∣ωj∣≤1 for all j. For each 0≤r<1, [F2] bounds ∑j≥0∣ωj∣rj by a convergent geometric series; the radius definition [F3] therefore gives radius at least 1, and the complex series sum W is holomorphic on D by [F3].

1.2givenF1F4F5F6algebra

For real x∈(−1,1) the same coefficients define a real power series of radius at least 1; termwise differentiation [F4] gives W′(x)=∑j≥0(j+1)ωj+1xj. By [F1], (j+1)ωj+1=(j−α)ωj, hence W′(x)=∑j≥0(j−α)ωjxj=xW′(x)−αW(x) and (1−x)W′(x)=−αW(x). Since 1−x>0, [F5] gives H′(x)=0 for H(x):=W(x)(1−x)−α; [F6] makes H constant, and H(0)=ω0=1, so W(x)=(1−x)α throughout (−1,1).

1.3givenF8F9F12construct

Fix z∈D. If 1−z were real r≤0, then z=1−r≥1 would be positive real, so [F12] would give ∣z∣=z≥1, a contradiction. Thus 1−z is in the slit plane and P(z):=(1−z)Log⁡α is defined; [F8] makes the principal logarithm holomorphic there, and [F9] with the branch definition makes P holomorphic on D.

2.1step 1.1step 1.2step 1.3F7F10F11∎

By [F7] the unit disc is a complex domain. For every real x∈(−1,1), [F10] identifies P(x) with (1−x)α, so step 1.2 gives P(x)=W(x). The agreement set contains an interval accumulating at 0∈D; since W and P are holomorphic by steps 1.1 and 1.3, the identity theorem [F11] gives W=P throughout D, including z=0.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Caputo and Volterra formulations are equivalent for absolutely continuous solutions

Statement

Assume the Axioms of Countable Choice and Dependent Choice. Let T>0, 0<α<1, let f∈C([0,T]), and let u∈AC([0,T]). With u0=u(0) and the Caputo derivative of Fractional integral and Caputo derivative,

DCαu=falmost everywhere on (0,T)

if and only if

u(t)=u0+Iαf(t)for every t∈[0,T].

The absolute-continuity hypothesis is part of the differential-equation solution class. The equivalence does not assert that an arbitrary continuous solution of the Volterra equation is absolutely continuous.

Facts & Assumptions

Given: The Axioms of Countable Choice and Dependent Choice, T>0, 0<α<1, f∈C([0,T]), and u∈AC([0,T]).

[A1]

The Axiom of Countable Choice: every sequence of nonempty sets admits a choice function (The Axiom of Countable Choice (ACω)).

[A2]

The Axiom of Dependent Choice: every total relation on a nonempty set admits a chain from a specified starting point (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F1]

Fractional integral and Caputo derivative: for u∈AC, DCαu=I1−αu′ almost everywhere.

[F2]

Semigroup law for fractional integrals: for positive a,b and g∈L1, IaIbg=Ia+bg almost everywhere; Iag∈L1.

[F3]

Fractional integrals of continuous data are Hölder continuous: if g is continuous and 0<a<1, then Iag is continuous.

[F4]

Fundamental theorem of calculus for absolutely continuous functions: under [A1] and [A2], an absolutely continuous u has u′∈L1 and u(t)−u(0)=∫0tu′(s)ds for every t.

[F5]

The indefinite integral of an L1 function is differentiable almost everywhere: under [A1], the indefinite integral of an L1 function has derivative equal to its integrand almost everywhere.

Proof

1.1givenA1A2F1F2F3F4algebra

Suppose DCαu=f almost everywhere and put v=u′∈L1 by [F4]. Then u−u0=I1v. Applying Iα to the Caputo identity and using [F1] and [F2] gives u−u0=Iαf almost everywhere. Both sides are continuous: u is absolutely continuous and [F3] applies to f. If their continuous difference were nonzero at some point, continuity would make its absolute value bounded below by a positive constant on a relative interval of positive length (one-sided at an endpoint), contradicting equality almost everywhere. Thus the Volterra identity holds for every t∈[0,T].

2.1givenA1F1F2F4F5step 1.1algebra∎

Conversely, suppose u−u0=Iαf. Applying I1−α and using [F2] gives I1−α(u−u0)=I1f. Since u−u0=I1v by [F4], [F2] also gives I1−α(u−u0)=I1(I1−αv)=I1DCαu. Both integrands belong to L1 by [F1], [F2], and [F4], so their indefinite integrals are continuous. These primitives agree almost everywhere by the preceding identities, hence everywhere by the continuity argument in step 1.1. Applying [F5] gives f=DCαu almost everywhere.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Positive L1 weights, discrete comparison, and residual stability

Statement

Let 0<α<1, λ≥0, and let 0=t0<t1<⋯<tN=T be any finite grid with T>0. Use the weights bn,k and operator δTα from Uniform-grid and graded-grid L1 discretization. Then:

  1. For every n, 0<bn,1≤bn,2≤⋯≤bn,n.
  2. If z0≥0 and δTαzn+λzn≥0 for 1≤n≤N, then zn≥0 for every n.
  3. If R≥0, e0=0, and δTαen+λen=rn with ∣rn∣≤R, then max⁡0≤n≤N∣en∣≤TαΓ(1+α)R.
  4. For any initial value U0 and forcing values F1,…,FN, the recurrence in Uniform-grid and graded-grid L1 discretization is well-defined at every step and gives the unique Un satisfying δTαUn+λUn=Fn.

Facts & Assumptions

Given: 0<α<1, λ≥0, a finite strictly increasing grid, scalar sequences on its nodes, and R≥0 for part 3. For part 4, also an initial value U0 and forcing values F1,…,FN.

[F1]

Uniform-grid and graded-grid L1 discretization: the L1 weights are bn,k=((tn−tk−1)1−α−(tn−tk)1−α)/(Γ(2−α)(tk−tk−1)), and δTαzn=∑k=1nbn,k(zk−zk−1); its update is Un=(Fn+bn,1U0+∑k=1n−1(bn,k+1−bn,k)Uk)/(bn,n+λ).

[F2]

Fractional integral and Caputo derivative: DCαu=Γ(1−α)−1∫0t(t−s)−αu′(s)ds almost everywhere. Whenever this integral is finite at a specified point, its pointwise integral value is a representative of that a.e.-defined function there; step 1.2 uses this representative at the grid nodes.

[F3]

Euler's real Beta integral and The real Beta--Gamma identity: B(p,q)=Γ(p)Γ(q)/Γ(p+q) for p,q>0.

[F4]

The real Gamma functional equation Γ(s+1)=sΓ(s): Γ(x+1)=xΓ(x) for x>0.

[F5]

Continuity and derivatives of positive-base real powers: for every real q, (tq)′=qtq−1 for t>0.

[F6]

The indefinite integral of an L1 function is absolutely continuous: the indefinite Lebesgue integral of an L1 function is absolutely continuous, in the sense of Absolute continuity on a compact interval.

[F7]

The real Gamma function by Euler's integral: Γ(x)=∫0∞sx−1e−s ds>0 for x>0.

[F9]

Integral of the fractional power kernel: ∫0tsα−1ds=tα/α for t>0.

Proof

1.1givenF1F4F7algebra

For fixed n, the function w(s)=(tn−s)−α is positive and increasing on [0,tn), and bn,k=Γ(1−α)−1hk−1∫tk−1tkw(s)ds by [F1] and [F4]. The factor Γ(1−α)−1 is positive by [F7]. The average of an increasing function on an earlier interval is at most its value at the shared endpoint, which is at most its average on the next interval. Each integral is finite because α<1. Thus the weights are positive and nondecreasing in k.

1.2givenF2F3F4F5F6F7F8F9algebra

Put ϕ(t)=tα. By [F5], ϕ′(s)=αsα−1 for s>0, and this derivative is decreasing because its derivative is α(α−1)sα−2<0 and [F8] applies. It is in L1(0,T) by [F9], with integral Tα. Its indefinite integral is ϕ(t)−ϕ(0)=tα, so ϕ is absolutely continuous by [F6] and its Caputo derivative is defined. In this proof, DCαϕ(tn) denotes the pointwise integral representative in [F2]; the displayed Beta-kernel calculation below proves that this value is finite at every grid node. On an interval [a,b]=[tk−1,tk] its secant slope ϕˉk′ is the average of ϕ′, hence ek(s):=ϕˉk′−ϕ′(s) is increasing and ∫abek(s)ds=0. Since w(s)=(tn−s)−α is also increasing, their pairwise differences have the same sign. Expanding the double integral and using ∫abek=0 gives ∫abek(s)w(s)ds=12(b−a)∫ab∫ab(ek(s)−ek(r))(w(s)−w(r))dr ds≥0. These integrals are finite: ek,w∈L1(a,b), and the only possible singular product ϕ′(s)w(s) occurs when n=k=1; there it is the integrable Beta kernel αsα−1(t1−s)−α from [F3]. Expanding the absolute value of the double-integral integrand bounds it by the sum of products of the finite integrals ∫∣ek∣, ∫w, and ∫∣ek∣w, which justifies the expansion. Summing over intervals and using [F2] yields δTαϕ(tn)≥DCαϕ(tn). Direct substitution s=tny and [F3]–[F4] give DCα(tα)(tn)=αΓ(1−α)tn0B(α,1−α)=Γ(1+α). Thus, using Γ(1+α)>0 from [F7], qn:=tnα/Γ(1+α) satisfies q0=0 and δTαqn≥1.

2.1givenF1step 1.1algebra

Expanding [F1] by collecting coefficients gives δTαzn=bn,nzn+∑k=1n−1(bn,k−bn,k+1)zk−bn,1z0. If some zn<0, let m be the first such index. Then zk≥0 for k<m, the middle coefficients in this display are nonpositive by step 1.1, and −bm,1z0≤0. The terms (bm,m+λ)zm are strictly negative because bm,m>0 and λ≥0. Therefore δTαzm+λzm<0, contradicting the hypothesis. This proves comparison.

3.1givenstep 2.1step 1.2algebra

For the residual equation, set z±n:=Rqn±en. Then z±0=0 and δTαz±n+λz±n=R(δTαqn+λqn)±rn≥R−∣rn∣≥0. Comparison from step 2.1 gives z±n≥0, hence ∣en∣≤Rqn≤RTα/Γ(1+α) for every n. This proves residual stability.

4.1givenF1step 1.1algebrainduction∎

For each n, expanding the operator from [F1] gives δTαUn=bn,nUn+∑k=1n−1(bn,k−bn,k+1)Uk−bn,1U0. By step 1.1, bn,n>0, so with λ≥0 the coefficient bn,n+λ is positive. Rearranging δTαUn+λUn=Fn therefore gives exactly the recurrence in [F1], with a unique value at step n once the earlier values are fixed. Induction over n=1,…,N proves well-definedness and uniqueness of the full sequence and the stated equation.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Weakly singular fractional Grönwall inequality

Statement

Let T>0, 0<α<1, A,L≥0, and let y∈C([0,T]) be nonnegative. If y(t)≤A+LIαy(t)(0≤t≤T), then for every t∈[0,T], y(t)≤A∑k=0∞LktkαΓ(kα+1). The k=0 term is 1, including when L=0, and the series converges uniformly on [0,T]. In particular, if A=0 then y≡0.

Facts & Assumptions

Given: T>0, 0<α<1, A,L≥0, y∈C([0,T]), y≥0, and the stated pointwise inequality.

[F1]

Fractional integral and Caputo derivative: for continuous g, Iβg(t)=Γ(β)−1∫0t(t−s)β−1g(s) ds; its kernel is nonnegative for β>0.

[F2]

Semigroup law for fractional integrals: for continuous g, Ia(Ibg)=Ia+bg at every t, and Ic1(t)=tc/Γ(c+1) for a,b,c>0.

[F3]

The real Gamma function by Euler's integral and The real Gamma functional equation Γ(s+1)=sΓ(s): for x>0, Γ(x+1)=∫0∞e−ssx ds>0, and Γ(1)=1.

[F5]

The Cauchy-sequence reals are Archimedean: for every real R there is a natural number k≥1 with R<k.

Proof

1.1givenF3F4F5F6algebra

For x>0, restricting the Euler integral [F3] to [x,x+1] gives Γ(x+1)≥e−(x+1)xx, since the interval has length one and e−ssx≥e−(x+1)xx there. With x=kα and k≥1, this yields LkTkα/Γ(kα+1)≤e(B/kα)k, where B:=LTαeα/αα. If L=0, every term with k≥1 vanishes. Otherwise B>0; apply [F5] to R=(2B)1/α to choose k0>R. For k≥k0, [F4] gives kα≥k0α>(2B)(1/α)α=2B, so (B/kα)k<2−k. The comparison test [F6] gives convergence of the scalar majorant tail. For any p>q≥k0 and any t∈[0,T], the absolute value of the series segment from q to p is at most e∑k=qp2−k. This bound tends to zero independently of t, so the series is uniformly Cauchy on [0,T] and hence converges uniformly there.

1.2givenF1F2induction

The hypothesis is the iteration formula for m=1. If it holds for m≥1, positivity of the kernel [F1] allows applying LmImα to y≤A+LIαy in its remainder, giving LmImαy(t)≤ALmImα1(t)+Lm+1Imα(Iαy)(t)=ALmtmα/Γ(mα+1)+Lm+1I(m+1)αy(t) by [F2]. Substitution proves by induction that y(t)≤A∑k=0m−1Lktkα/Γ(kα+1)+LmImαy(t) for every m≥1.

2.1step 1.1step 1.2F1F2algebra∎

By [F1]–[F2], 0≤LmImαy(t)≤∥y∥∞LmTmα/Γ(mα+1). The last factor tends to zero as the mth term of the convergent series in step 1.1. Letting m→∞ in step 1.2 proves the claimed bound; if A=0, then 0≤y(t)≤0 for every t, so y≡0.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Backward-Euler fractional weights and positive partial sums

Statement

Let 0<α<1 and let (ωj) be the weights from Backward-Euler convolution quadrature for a Caputo equation. Then ω0=1, ωj<0 for every j≥1, and for every complex z with ∣z∣<1, ∑j=0∞ωjzj=(1−z)Log⁡α. For n≥0 define pn:=∑j=0nωj. Then pn=∏k=1n(1−αk)=Γ(n+1−α)Γ(1−α)Γ(n+1)>0, where the empty product for n=0 is 1. For every n≥1, pn≥(n+1)−αΓ(1−α).

Facts & Assumptions

Given: 0<α<1 and the coefficient recurrence in Backward-Euler convolution quadrature for a Caputo equation.

[F1]

Backward-Euler convolution quadrature for a Caputo equation: ω0=1 and ωj=((j−1−α)/j)ωj−1 for j≥1.

[F2]

The real Gamma function by Euler's integral: Γ(x)>0 for x>0 and Γ(1)=1.

[F3]

The real Gamma functional equation Γ(s+1)=sΓ(s): Γ(x+1)=xΓ(x) for x>0.

[F4]

Gautschi's inequality for the real Gamma function: for x>0 and 0≤s≤1, x1−s≤Γ(x+1)/Γ(x+s)≤(x+1)1−s.

[F8]

Inside the common radius the product of two power-series sums is represented by the Cauchy product of their coefficients: inside the common convergence radius, the product of two power-series sums has the Cauchy product coefficients.

[F9]

A power-series sum is infinitely differentiable inside its radius and satisfies an=f(n)(c)/ι(n!) at its centre: the coefficients of a power series equal to another power series near its centre agree, since they are the normalized derivatives at that centre.

[F10]

Principal-branch generating function for backward-Euler convolution quadrature: for ∣z∣<1, the coefficient series is the principal-branch power (1−z)Log⁡α.

[F11]

On positive reals, the principal branch power agrees with the published real power: when z is real and ∣z∣<1, (1−z)Log⁡α=(1−z)α with the real-power convention.

Proof

1.1givenF1F5algebra

The recurrence [F1] gives ω1=−α<0 and, for j≥2, ωj=((j−1−α)/j)ωj−1<0, since 0<(j−1−α)/j<1. It also gives ∣ωj∣≤1 for every j. Hence W(z):=∑j≥0ωjzj converges absolutely for ∣z∣<1 by [F5], and its radius is at least 1.

2.1step 1.1F10F11

By [F10], the complex generating function equals the principal-branch power for ∣z∣<1. On the real interval (−1,1), [F11] identifies it with (1−z)α in the real-power convention.

3.1step 2.1F5F6F7F8F9algebra

Since pn=∑j=0nωj, [F8] and the geometric series [F5] give P(z):=∑n≥0pnzn=W(z)/(1−z)=(1−z)α−1 for real z∈(−1,1). Differentiate this real series by [F6] and the right side by [F7]. Comparing coefficients in (1−z)P′(z)=(1−α)P(z) yields (n+1)pn+1=(n+1−α)pn for n≥0.

4.1step 3.1F2F3algebra

Iterating the recurrence from step 3.1 gives pn=∏k=1n(k−α)/k. By [F3], ∏k=1n(k−α)=Γ(n+1−α)Γ(1−α),∏k=1nk=Γ(n+1). Thus the displayed Gamma formula follows; all factors are positive, and [F2] confirms the Gamma denominator is positive. This also covers n=0 with the empty product.

5.1step 4.1F2F4algebra∎

For n≥1, apply [F4] with x=n and s=1−α. It gives nα≤Γ(n+1)/Γ(n+1−α)≤(n+1)α. Taking reciprocals and using step 4.1 yields pn≥(n+1)−α/Γ(1−α).

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A local Lipschitz existence theorem for the Caputo Volterra equation

Statement

Let T0>0, u0∈R, r>0, and 0<α<1. Suppose f:[0,T0]×[u0−r,u0+r]→R is continuous and is Lipschitz in its second variable with constant L≥0. Let M≥0 be a finite bound for ∣f(t,y)∣ on this rectangle. Choose T∈(0,T0] such that MTαΓ(α+1)≤r. Then the Volterra equation u(t)=u0+Iα(f(⋅,u(⋅)))(t),0≤t≤T, has exactly one continuous solution in the closed ball {u∈C([0,T]):∥u−u0∥∞≤r}. Such a T exists because Tα→0 as T↓0. This is a local existence theorem for the integral (mild) solution. It does not claim that this continuous solution is absolutely continuous under only the stated hypotheses.

Facts & Assumptions

Given: T0>0, u0∈R, r>0, 0<α<1, continuous f on the stated rectangle, a Lipschitz constant L≥0, a finite bound M for ∣f∣ there, and T∈(0,T0] satisfying the displayed bound.

[F1]

Fractional integral and Caputo derivative: for continuous g, Iαg(t)=Γ(α)−1∫0t(t−s)α−1g(s) ds. The kernel is nonnegative.

[F2]

Fractional integrals of continuous data are Hölder continuous: Iαg is continuous and ∥Iαg∥∞≤Tα∥g∥∞/Γ(α+1).

[F3]

Semigroup law for fractional integrals: for continuous g, Ia(Ibg)=Ia+bg pointwise and Ic1(t)=tc/Γ(c+1).

[F4]

Weakly singular fractional Grönwall inequality: for every K≥0 the series ∑n=0∞Kntnα/Γ(nα+1) converges uniformly on [0,T]; if nonnegative continuous y satisfies y≤KIαy, then y≡0.

[F5]

Heine-Borel by bisection: every closed bounded interval [a,b] is compact and Open cover, subcover, compact metric space, and compact subset of a metric space: [0,T] is a compact metric space and is nonempty since it contains 0. C(K,R) is complete in the supremum metric for every nonempty compact metric space K: C([0,T],R) is complete for d∞(v,w)=sup⁡t∈[0,T]∣v(t)−w(t)∣, which equals ∥v−w∥∞. Banach space and Complete metric space: every Cauchy sequence converges in the space identify this as completeness of its norm metric.

[F7]

Continuity and derivatives of positive-base real powers: since α>0, Tα→0 as T↓0.

Proof

1.1givenF6F7choose

By [F6]–[F7], MTα/Γ(α+1)→0 as T↓0; since T0>0 and r>0, choose T∈(0,T0] for which the displayed bound holds.

2.1givenF1F2step 1.1construct

Let B={u∈C([0,T]):∥u−u0∥∞≤r} and define Φu=u0+Iα(f(⋅,u(⋅))). For u∈B, s↦(s,u(s)) and then s↦f(s,u(s)) are continuous, with ∣f(s,u(s))∣≤M; [F1]–[F2] therefore make Φu continuous and give ∥Φu−u0∥∞≤MTα/Γ(α+1)≤r. Thus Φ maps B into itself.

3.1step 2.1givenF3construct

Set u(0)(t)=u0 and recursively u(n+1)=Φu(n); step 2.1 keeps every iterate in B. For n≥1 put dn(t)=∣u(n)(t)−u(n−1)(t)∣. The bound on f and [F3] give d1(t)≤MIα1(t)=Mtα/Γ(α+1).

4.1step 3.1givenF1F3induction

For n≥1, Lipschitz continuity and the positive kernel [F1] give dn+1≤LIαdn. Starting with step 3.1, induction and the pointwise semigroup identity [F3] yield dn(t)≤MLn−1Inα1(t)=MLn−1tnα/Γ(nα+1) for every n≥1, with the coefficient L0 at n=1 defined to be 1.

5.1step 4.1F4F5algebra

Put K=1+L; then Ln−1≤Kn for n≥1, so step 4.1 and the uniform series bound [F4] show ∑n=1∞∥dn∥∞<∞. The iterates are uniformly Cauchy; completeness [F5] gives a uniform limit u∈C([0,T]), and since every iterate lies in B, the norm limit also lies in B.

6.1givenF2step 5.1algebra

Lipschitz continuity and [F2] give ∥Φu(n)−Φu∥∞≤(LTα/Γ(α+1))∥u(n)−u∥∞→0. Since u(n+1)=Φu(n) and u(n+1)→u, it follows that u=Φu, proving existence in B.

7.1givenF1F4algebra∎

If u,v∈B are two solutions, y=∣u−v∣ is continuous and nonnegative; their equations, Lipschitz continuity, and the positive kernel [F1] give y(t)≤LIαy(t) for every t. Applying [F4] with A=0 gives y≡0, hence u=v.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

L1 stability and the smooth-data error bound

Statement

Assume Countable Choice. Let 0<α<1, λ≥0, T>0, and h=T/N for an integer N≥1, with uniform grid tn=nh. Let u∈C2([0,T]) and set U0=u(0). For 1≤n≤N, define the exact nodal forcing by its pointwise Caputo integral representative, Fn:=1Γ(1−α)∫0tn(tn−s)−αu′(s) ds+λu(tn)(1≤n≤N). The integral is finite by the kernel-power bound and boundedness of u′. We use it as the pointwise representative of DCαu for this smooth datum. Let Un be the uniform-grid L1 solution from Uniform-grid and graded-grid L1 discretization using those forcing values. The proof verifies absolute continuity of u, so its Caputo derivative is defined. Put Cα:=1Γ(1−α)(11−α+1+α2). Then max⁡0≤n≤N∣Un−u(tn)∣≤CαTαΓ(1+α)∥u′′∥∞h2−α. The estimate is only asserted under the displayed C2 hypothesis; its constant is not claimed uniform as α↑1.

Facts & Assumptions

Given: Countable Choice, 0<α<1, λ≥0, T>0, h=T/N, the uniform grid tn=nh, and u∈C2([0,T]).

[A1]

Countable Choice: every sequence of nonempty sets admits a choice function (The Axiom of Countable Choice (ACω)); it is used only in [F10].

[F1]

Uniform-grid and graded-grid L1 discretization: the discrete derivative is the integral of the piecewise-constant secant slope against (tn−s)−α/Γ(1−α) on each grid interval, and the algorithm's returned sequence satisfies its discrete equation by Positive L1 weights, discrete comparison, and residual stability.

[F2]

Positive L1 weights, discrete comparison, and residual stability: if δTαen+λen=rn, e0=0, and max⁡n∣rn∣≤R, then max⁡n∣en∣≤TαR/Γ(1+α).

[F3]

Fractional integral and Caputo derivative: DCαu(t)=Γ(1−α)−1∫0t(t−s)−αu′(s) ds.

[F4]

Higher derivatives and the classes Ck and C∞: C2([0,T]) makes u′ and u′′ continuous, with one-sided endpoint derivatives.

[F5]

Heine-Borel by bisection: every closed bounded interval [a,b] is compact, Open cover, subcover, compact metric space, and compact subset of a metric space, and A continuous real function on a compact subset of R is bounded: continuous real functions on [0,T] are bounded; in particular M1:=∥u′∥∞ and M2:=∥u′′∥∞ are finite.

[F6]

Absolute continuity on a compact interval: absolute continuity means that summed endpoint increments over any finite disjoint interval family are small whenever the total interval length is small.

[F7]
[F8]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on a compact interval is Riemann integrable.

[F10]

A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: under [A1], a bounded Riemann-integrable function has the same Riemann and Lebesgue integrals.

[F11]

The real Gamma functional equation Γ(s+1)=sΓ(s): Γ(2−α)=(1−α)Γ(1−α).

[F12]
[F13]

Integral of the fractional power kernel: ∫0hr−αdr=h1−α/(1−α).

Proof

1.1givenF5F6F7construct

Set M1=∥u′∥∞<∞ by [F5]. For every interval [a,b]⊆[0,T], [F7] gives ∣u(b)−u(a)∣≤M1(b−a). Thus for any finite disjoint interval family, the sum of endpoint increments is at most M1 times the total interval length. Given ε>0, choose δ=ε/(M1+1); [F6] then shows u is absolutely continuous.

2.1givenA1F4F5F7F8F9F10step 1.1

Put M2=∥u′′∥∞. On each grid interval [tk−1,tk], let mk=(u(tk)−u(tk−1))/h and ek(s)=mk−u′(s). The continuous function u′ is Riemann integrable by [F8]; [F9] and [F10] give hmk=∫tk−1tku′(s) ds for the Lebesgue integral, so ∫tk−1tkek(s) ds=0. By [F7] applied to u′, for any r,s in this interval, ∣u′(r)−u′(s)∣≤M2∣r−s∣≤M2h. Averaging in r gives ∣ek(s)∣≤M2h.

3.1givenF1F3F11F13step 2.1construct

The formula [F1] and the Caputo definition [F3] now give, with dn:=Γ(1−α)−1∫0tn(tn−s)−αu′(s) ds and τn:=δhαu(tn)−dn, τn=1Γ(1−α)∑k=1n∫tk−1tkek(s)(tn−s)−α ds.

4.1step 2.1step 3.1F5F11F12F13algebra

On the last interval, [F13] and [F11] bound the absolute contribution to τn by M2hΓ(1−α)∫0hr−α dr=M2h2−αΓ(2−α). For k<n, subtract the kernel value at the interval midpoint, using ∫ek=0 from step 2.1. The derivative of the kernel has magnitude at most α((n−k)h)−α−1 on that interval, so its variation from the midpoint is at most αh((n−k)h)−α−1/2. Thus the kth earlier contribution is at most αM22Γ(1−α)h2−α(n−k)−1−α. Since x−1−α is decreasing, each term with j≥2 is at most ∫j−1jx−1−αdx; hence ∑j=1n−1j−1−α≤1+∫1∞x−1−αdx=1+1/α. Summing and using [F11] yields ∣τn∣≤CαM2h2−α for every n.

4.2givenF1step 3.1algebra

Set En=Un−u(tn). By the definition of Fn, subtracting its exact nodal identity from the uniform-grid recurrence gives δhαEn+λEn=−τn, with E0=0.

5.1step 4.1step 4.2F2∎

Apply [F2] with R=CαM2h2−α from step 4.1. This gives the claimed maximum error bound.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Generating-coefficient estimate for the quadratic CQ datum

Statement

Let 0<α<1, put β=2−α, and define cm:=Γ(m+β+1)Γ(β+1)Γ(m+1)(m≥0), s1:=1,sn:=cn−1+cn−2(n≥2). There is a constant Cα<∞ such that for every n≥1, ∣sn−2nβΓ(β+1)∣≤Cαnβ−1. For n≥1, sn is the coefficient of zn in the real Taylor series about 0 of z(1+z)(1−z)α−3 on (−1,1).

Facts & Assumptions

Given: 0<α<1, β=2−α, and n≥1.

[F1]

Backward-Euler convolution quadrature for a Caputo equation: for h>0 and vn=n2, ∂ˉhαvn=h−α∑j=0nωj(n−j)2. Thus the unscaled weight convolution is hα∂ˉhαvn=∑j=0nωj(n−j)2.

[F2]

Backward-Euler fractional weights and positive partial sums and On positive reals, the principal branch power agrees with the published real power: for real z∈(−1,1), ∑j≥0ωjzj=(1−z)α in the real-power convention.

[F3]

The real Gamma functional equation Γ(s+1)=sΓ(s): Γ(x+1)=xΓ(x) for x>0.

[F4]

The real Gamma function by Euler's integral: Γ(x)>0 for x>0 and Γ(1)=1.

[F5]

Gautschi's inequality for the real Gamma function: for x>0 and 0≤q≤1, x1−q≤Γ(x+1)/Γ(x+q)≤(x+1)1−q.

[F11]

Inside the common radius the product of two power-series sums is represented by the Cauchy product of their coefficients: inside the common radius, the product of two power-series sums has the Cauchy-product coefficients.

Proof

1.1givenF3F4F6F7F8F9F12algebra

By [F3] and Γ(1)=1 in [F4], c0=1 and cm+1/cm=(m+β+1)/(m+1). These terms are positive by [F4], and for every fixed real z with 0<∣z∣<1 the ratio of successive absolute terms of ∑cmzm tends to ∣z∣. Hence [F6] gives absolute convergence there; for z=0 only the constant term remains. The coefficient recurrence yields (m+1)cm+1=(m+β+1)cm; by [F7], coefficient comparison gives (1−z)C′(z)=(β+1)C(z) for C(z):=∑m≥0cmzm. The derivative of C(z)(1−z)β+1 is therefore zero by [F8]. It equals 1 at z=0, so [F9] and [F8] give C(z)=(1−z)−(β+1) for real z∈(−1,1).

2.1F1F2F7F8F10F11F12step 1.1algebra

Starting from [F10], termwise differentiation by [F7] gives ∑m≥0mzm=z(1−z)2,∑m≥0m2zm=zddz(z(1−z)2)=z(1+z)(1−z)3 for real z∈(−1,1). Multiplying by the real symbol in [F2] and using [F8] gives z(1+z)(1−z)α−3. By [F11], its zn coefficient is the unscaled convolution ∑j=0nωj(n−j)2=hα∂ˉhαvn for vn=n2; by step 1.1 it is 1 for n=1 and cn−1+cn−2 for n≥2. This proves the coefficient assertion.

2.2step 1.1F3F5F8F9algebra

Put r=1−α=β−1∈(0,1). For n≥2, apply [F5] with x=n−α and q=α. It gives (n−α)r≤Γ(n+1−α)/Γ(n)≤(n+1−α)r. By [F3], cn−1=(n+1−α)Γ(n+1−α)Γ(β+1)Γ(n). Consequently cn−1 lies between (n+1−α)(n−α)r/Γ(β+1) and (n+1−α)r+1/Γ(β+1). For the upper endpoint, the mean value theorem gives (n+1−α)r+1−nr+1≤(r+1)(n+1)r≤Cnr. For the lower endpoint, write ∣(n+1−α)(n−α)r−nr+1∣≤(n+1−α)∣(n−α)r−nr∣+(1−α)nr. Because n≥2, n−α≥n/2; the mean value theorem bounds ∣nr−(n−α)r∣≤rα(n/2)r−1, and n+1−α≤3n/2. Thus this lower endpoint also differs from nr+1 by at most a constant depending on α times nr. Dividing by the fixed positive Γ(β+1) proves Thus ∣cn−1−nβ/Γ(β+1)∣≤Cαnβ−1 after enlarging the constant.

3.1step 2.2F8F9algebra∎

For n≥3, apply the same estimate with n−1 in place of n to cn−2. Also ∣nβ−(n−1)β∣≤βnβ−1 by the mean value theorem. Hence ∣cn−2−nβ/Γ(β+1)∣≤Cαnβ−1 after another enlargement. The cases n=1,2 have finite coefficients and are covered by enlarging Cα once more. Adding the two estimates proves the claim.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Scalar resolvent stability for backward-Euler convolution quadrature

Statement

Let 0<α<1, λ≥0, T>0, and h=T/N with integer N≥1. For any valid input (u0,F1,…,FN) to Backward-Euler convolution quadrature for a Caputo equation, its updates define a unique sequence V0=0,V1,…,VN satisfying

∂ˉhαVn+λVn=Fn−λu0(1≤n≤N).

In particular, for g1,…,gN∈R, use the algorithm with u0=0 and Fn=gn. Its output sequence V satisfies

∂ˉhαVn+λVn=gn,

where ∂ˉhα is defined in Backward-Euler convolution quadrature for a Caputo equation. Then

max⁡0≤n≤N∣Vn∣≤Γ(1−α)(2T)αmax⁡1≤n≤N∣gn∣.

The direct full-history implementation uses exactly N(N+1)/2 terms in its convolution history sums. Retaining the solution sequence V0,…,VN requires N+1 solution values; this count excludes input and weight storage.

Facts & Assumptions

Given: 0<α<1, λ≥0, h=T/N, V0=0, and forcing values gn.

[F1]

Backward-Euler convolution quadrature for a Caputo equation: for a general input (u0,F1,…,FN), the update is (h−α+λ)Vn=Fn−λu0−h−α∑j=1nωjVn−j; for the zero-initial-value input Fn=gn, this is the recurrence in the stability claim.

[F2]

Backward-Euler fractional weights and positive partial sums: ωj<0 for j≥1, ∑j=0nωj=pn>0, and pn≥(n+1)−α/Γ(1−α).

Proof

1.1givenF1F3algebrainduction

For a general valid input (u0,F1,…,FN), [F3] and λ≥0 give h−α+λ>0. Inductively, once V0,…,Vn−1 are defined, the update divides a specified real numerator by this positive denominator, so it gives a unique real Vn. Rearranging the update gives ∂ˉhαVn+λVn=Fn−λu0 by the operator definition in the algorithm. Induction proves the stated well-definedness and equation for the whole sequence.

1.2givenF1F5algebra

At update n, [F1] includes exactly n terms in the history sum. Thus the total count is S=∑n=1Nn. Reindexing by the bijection n↦N+1−n using [F5] also gives S=∑n=1N(N+1−n). Adding termwise yields 2S=∑n=1N(N+1)=N(N+1), so the total number is N(N+1)/2. The sequence V0,…,VN has exactly N+1 solution values.

1.3givenF1F2choosealgebra

Write G=max⁡1≤n≤N∣gn∣ and M=max⁡0≤n≤N∣Vn∣. If M=0 the claim is immediate. Otherwise choose the least index n≥1 with ∣Vn∣=M. Taking absolute values in [F1] and using −ωj>0 gives (h−α+λ)M≤G+h−αM∑j=1n(−ωj). The sum on the right is 1−pn by [F2], so rearranging yields (λ+h−αpn)M≤G.

2.1step 1.3F2F3F4algebra∎

Since n≤N, h(n+1)≤h(N+1)=T+h≤2T. By [F2], [F4], and [F3], h−αpn≥h−α(n+1)−αΓ(1−α)=(h(n+1))−αΓ(1−α)≥(2T)−αΓ(1−α). As λ≥0, step 1.3 gives M≤G/(h−αpn)≤Γ(1−α)(2T)αG. Since V0=0, this is the stated estimate.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

First-order CQ error for a compatible quadratic datum

Statement

Let 0<α<1, λ≥0, T>0, u0∈R, and u(t)=u0+t2 on [0,T]. Define

f(t):=2t2−αΓ(3−α)+λ(u0+t2).

Then u solves DCαu+λu=f and satisfies the compatibility condition u′(0)=0. For h=T/N and the backward-Euler CQ solution from Backward-Euler convolution quadrature for a Caputo equation with Fn=f(nh), there is a constant Cα,T independent of N, u0, and λ such that

max⁡0≤n≤N∣Un−u(nh)∣≤Cα,Th.

Facts & Assumptions

Given: 0<α<1, λ≥0, T>0, u0∈R, u(t)=u0+t2, the forcing above, and h=T/N.

[F1]

Fractional integral and Caputo derivative: DCαu=I1−αu′ almost everywhere. At points where the integral is finite, its pointwise integral value supplies the representative used here; step 2.1 verifies finiteness for this polynomial.

[F2]

Backward-Euler convolution quadrature for a Caputo equation: ∂ˉhαvn=h−α∑j=0nωjvn−j for v0=0.

[F3]

The real Beta--Gamma identity: B(p,q)=Γ(p)Γ(q)/Γ(p+q) for positive p,q.

[F4]

The real Gamma functional equation Γ(s+1)=sΓ(s): Γ(x+1)=xΓ(x) for x>0 and Γ(1)=1.

[F5]

Generating-coefficient estimate for the quadratic CQ datum: if β=2−α, the coefficient sn in the real Taylor series of z(1+z)(1−z)α−3 on (−1,1) satisfies ∣sn−2nβ/Γ(β+1)∣≤Cαnβ−1.

[F6]

Scalar resolvent stability for backward-Euler convolution quadrature: the algorithm's updates define the unique sequence satisfying the shifted CQ recurrence; for zero initial data and λ≥0, the solution driven by forcing rn is bounded by Γ(1−α)(2T)αmax⁡n∣rn∣.

[F7]

Absolute continuity on a compact interval: absolute continuity means that summed endpoint increments over any finite disjoint interval family are small whenever the total interval length is small.

[F8]

Real powers for positive bases, with the zero-base positive-exponent convention and Continuity and derivatives of positive-base real powers: 0p=0 for p>0, tp is continuous for t≥0, and (tp)′=ptp−1 for t>0.

[F9]
[F12]

Inside the common radius the product of two power-series sums is represented by the Cauchy product of their coefficients: the product of two power-series sums has the Cauchy-product coefficients inside their common radius.

Proof

1.1givenF1F7F8algebraconstruct

For any finite disjoint interval family [aj,bj]⊆[0,T], ∑j∣u(bj)−u(aj)∣=∑j(bj−aj)(aj+bj)≤2T∑j(bj−aj). Given ε>0, choosing δ=ε/(2T+1) verifies absolute continuity by [F7]. For almost every t∈(0,T), u′(t)=2t by [F8], so u′∈L1(0,T); therefore the Caputo derivative is defined by [F1].

2.1givenF1F3F4F8F9step 1.1algebra

By [F8], u′(s)=2s for s>0; at s=0 the one-sided difference quotient is s2/s=s→0, so u′(0)=0. Thus [F1] gives DCαu(t)=2Γ(1−α)∫0t(t−s)−αs ds=2t2−αΓ(1−α)B(2,1−α)=2t2−αΓ(3−α), where the substitution s=ty and [F3]–[F4] give the last two equalities. Thus the stated f makes u an exact solution, and u′(0)=0.

3.1step 2.1F2F5F10F11F12algebra

Put v(t)=t2, so v(nh)=h2n2. Starting from the geometric series [F10] and differentiating termwise by [F11] gives ∑n≥0n2zn=z(1+z)/(1−z)3. Multiplying this generating series by h−α(1−z)α and using [F12] shows that the discrete Caputo derivative of the exact nodal values is h2−αsn, with sn from [F5]. The exact derivative from step 2.1 is 2h2−αn2−α/Γ(3−α).

4.1step 3.1F5algebra

Therefore the residual τn:=∂ˉhαv(nh)−DCαv(nh) satisfies ∣τn∣≤Cαh2−αn1−α=Cαh(nh)1−α≤CαT1−αh by [F5].

5.1step 4.1F2F6algebra∎

Subtracting the exact equation from the CQ recurrence, the error En:=Un−u(nh) has E0=0 and satisfies ∂ˉhαEn+λEn=−τn. Apply [F6] and step 4.1 to obtain max⁡n∣En∣≤Γ(1−α)(2T)αCαT1−αh. The coefficient of h depends only on α and T, proving the result.

5 · Examples, counterexamples and false statements

None yet.

Sources