Log of the Siegel waiting-time density splits additively
Provedsiegel_logdensity_bridgeanalysislogarithmsiegel-median
For the explicit Siegel waiting-time density (with and natural-number exponents mNat, ), the logarithm splits additively on the region where :
This is the algebraic bridge between the density form used for FTC/CDF computations and the log-density whose symmetrized difference Siegel analyses. Proof: Real.log_mul to split the product, Real.log_pow for the natural powers, and Real.log_exp for . Source: Siegel, 'Median Bounds and their Application', J. Algorithms 38:184-236, 2001, Theorem 2.2 / §2.1.1 (the waiting-time density).
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
theorem siegel_logdensity_bridge (lam K : ℝ) (p : ℕ) (mNat : ℕ) (t : ℝ) (hK : 0 < K) (hpos : 0 < 1 - Real.exp (-lam * t)) : Real.log (K * (1 - Real.exp (-lam * t)) ^ mNat * (Real.exp (-lam * t)) ^ p) = ((mNat : ℝ) * Real.log (1 - Real.exp (-lam * t)) - (p : ℝ) * (lam * t)) + Real.log K := by sorry
Source
Siegel 2001, J. Algorithms 38:184-236, Thm 2.2 / §2.1.1 (waiting-time density); log algebra.