laplace_rlDeriv
OpenFCTmp.laplace_rlDerivcompile probe
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_Transient_laplace open MeasureTheory Set Classical QueueingFundamentals.Transient Filter namespace FCTmp noncomputable def rlIntegral (a ν : ℝ) (f : ℝ → ℝ) (x : ℝ) : ℝ := if ν = 0 then f x else (Real.Gamma ν)⁻¹ * ∫ t in Ioo a x, (x - t) ^ (ν - 1) * f t noncomputable def rlDeriv (a ν : ℝ) (f : ℝ → ℝ) (x : ℝ) : ℝ := let n : ℕ := Nat.floor ν + 1 iteratedDeriv n (rlIntegral a ((n : ℝ) - ν) f) x end FCTmp
Formal statement
namespace FCTmp
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 FCTmp