Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Laplace transform of the Riemann–Liouville fractional derivative (Eq. 21)

Open
FractionalCalc.laplace_rlDeriv

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisfractional-calculuslaplace-transformriemann-liouville

Let ν>0\nu>0ν>0, n=⌊ν⌋+1n=\lfloor\nu\rfloor+1n=⌊ν⌋+1, and g=I0+ n−νfg=I_{0+}^{\,n-\nu}fg=I0+n−ν​f. Suppose fff is continuous on [0,∞)[0,\infty)[0,∞) and of exponential order α\alphaα, that each g(k)g^{(k)}g(k) (0≤k<n0\le k<n0≤k<n) has a finite right limit g(k)(0+)=Lkg^{(k)}(0+)=L_kg(k)(0+)=Lk​ at 000, and that D0+νfD_{0+}^{\nu}fD0+ν​f is of exponential order α\alphaα. For Re⁡s>max⁡(α,0)\operatorname{Re}s>\max(\alpha,0)Res>max(α,0),

L[D0+νf](s)=sνL[f](s)−∑k=0n−1s n−k−1 g(k)(0+).\mathcal L\big[D_{0+}^{\nu}f\big](s)=s^{\nu}\mathcal L[f](s)-\sum_{k=0}^{n-1}s^{\,n-k-1}\,g^{(k)}(0+).L[D0+ν​f](s)=sνL[f](s)−k=0∑n−1​sn−k−1g(k)(0+).

This is Eq. (21) of the source; the initial terms involve the auxiliary function g=In−νfg=I^{n-\nu}fg=In−νf, not fff itself.

Formalization Note The right limits g(k)(0+)g^{(k)}(0+)g(k)(0+) are given as a family LkL_kLk​ with explicit Tendsto hypotheses at 000 within (0,∞)(0,\infty)(0,∞). Contrast with the Caputo formula (Eq. 24), whose initial terms are f(k)(0+)f^{(k)}(0+)f(k)(0+).

Preamble
import Mathlib
import Definitions.Def_FractionalCalc_rlIntegral
import Definitions.Def_FractionalCalc_rlDeriv
import Definitions.Def_QueueingFundamentals_Transient_laplace
open MeasureTheory Set Classical QueueingFundamentals.Transient Filter
Formal statement
namespace FractionalCalc
theorem laplace_rlDeriv (ν α : ℝ) (f : ℝ → ℝ) (s : ℂ)
    (hν : 0 < ν) (n : ℕ) (hn : n = Nat.floor ν + 1)
    (hf : ContinuousOn f (Ici 0))
    (hexp : ∃ M T : ℝ, 0 < M ∧ 0 < T ∧ ∀ t ≥ T, |f t| ≤ M * Real.exp (α * t))
    (L : ℕ → ℝ)
    (hL : ∀ k ∈ Finset.range n,
      Tendsto (iteratedDeriv k (rlIntegral 0 ((n : ℝ) - ν) f)) (nhdsWithin (0 : ℝ) (Ioi 0)) (nhds (L k)))
    (hexpn : ∃ M T : ℝ, 0 < M ∧ 0 < T ∧ ∀ t ≥ T, |rlDeriv 0 ν f t| ≤ M * Real.exp (α * t))
    (hsα : α < s.re) (hs0 : 0 < s.re) :
    laplace (rlDeriv 0 ν f) s =
      s ^ (ν : ℂ) * laplace f s -
        Finset.sum (Finset.range n) (fun k => s ^ (n - k - 1 : ℂ) * (L k : ℂ)) := by sorry
end FractionalCalc
Source
F. G. Rodrigues & E. C. de Oliveira, Rev. Bras. Ens. Fís. 37(3), 3305 (2015), https://doi.org/10.1590/S1806-11173731842, §4, Eq. (21), g(k)(0+)=lim⁡t→0+DkI0+n−νf(t)g^{(k)}(0+)=\lim_{t\to0+}D^k I_{0+}^{n-\nu}f(t)g(k)(0+)=limt→0+​DkI0+n−ν​f(t).
Read-back

What the Lean code literally says, in plain math · glm

For real ν,α\nu,\alphaν,α, f:R→Rf:\mathbb R\to\mathbb Rf:R→R, complex sss, a natural nnn with n=⌊ν⌋+1n=\lfloor\nu\rfloor+1n=⌊ν⌋+1, and a family L:N→RL:\mathbb N\to\mathbb RL:N→R: assume ν>0\nu>0ν>0, fff continuous on [0,∞)[0,\infty)[0,∞) and of exponential order α\alphaα; for each k<nk<nk<n, the kkk-th iterated derivative of I0+ n−νfI_{0+}^{\,n-\nu}fI0+n−ν​f tends to LkL_kLk​ as t→0t\to0t→0 within (0,∞)(0,\infty)(0,∞); D0+νfD_{0+}^{\nu}fD0+ν​f is of exponential order α\alphaα; and α<Re⁡s\alpha<\operatorname{Re}sα<Res, 0<Re⁡s0<\operatorname{Re}s0<Res. Then L[D0+νf](s)=sνL[f](s)−∑k=0n−1sn−k−1Lk\mathcal L[D_{0+}^{\nu}f](s)=s^\nu\mathcal L[f](s)-\sum_{k=0}^{n-1}s^{n-k-1}L_kL[D0+ν​f](s)=sνL[f](s)−∑k=0n−1​sn−k−1Lk​.

Human review
  • Endorsed by LG · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Flagged by Shuze Chen · Nov 21, 2026

    Milestone, Open. False as stated: no hypothesis makes g = I^(n-ν) f differentiable n times, so rlDeriv can be the junk value 0 of iteratedDeriv (take ν = 1/2 and f the half derivative of a nowhere differentiable Hölder function vanishing at 0); the left side is then 0 and the right side is s^(1/2) Lf. Replaced by laplace_rlDeriv_of_contDiffOn, which adds regularity of g on (0, ∞) and local integrability of its n-th derivative.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me