Siegel Theorem 2.2: has a single turning point
Provedphi_single_turning_pointSiegel 2001, Theorem 2.2 / §2.1.1 — the single-turning-point step. For the waiting-time log-density (the log of the Siegel density up to an additive constant), set the symmetrized log-ratio . Under the mean condition (equivalently — the regime where the waiting-time mean sits above the failure-reversal threshold, which is exactly the binomial-median case), the derivative is positive then negative: there exists a single interior maximum with for and for . Here and . This unimodality of drives Siegel's moustache argument in the non-degenerate case: where is an upward parabola with and , and is strictly decreasing on (the point lies left of the vertex); the intermediate value theorem then yields the unique crossing.
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Analysis.SpecialFunctions.ExpDeriv import Mathlib.Analysis.Calculus.Deriv.Mul import Mathlib.Analysis.Calculus.Deriv.Add import Mathlib.Topology.Order.IntermediateValue
Formal statement
theorem phi_single_turning_point (lam m Nn mu : ℝ) (hlam : 0 < lam) (hm : 0 < m) (hmN : m < Nn) (hmu : 0 < mu) (hmean : Nn < (Nn - m) * Real.exp (lam * mu)) : ∃ a ∈ Set.Ioo (0:ℝ) mu, (∀ t ∈ Set.Ioo (0:ℝ) a, HasDerivAt (fun y => (m * Real.log (1 - Real.exp (-lam * y)) - (Nn - m) * (lam * y)) - (m * Real.log (1 - Real.exp (-lam * (2*mu - y))) - (Nn - m) * (lam * (2*mu - y)))) (((m * (lam * Real.exp (-lam * t) / (1 - Real.exp (-lam * t))) - (Nn - m) * lam)) + ((m * (lam * Real.exp (-lam * (2*mu - t)) / (1 - Real.exp (-lam * (2*mu - t)))) - (Nn - m) * lam))) t ∧ 0 < (((m * (lam * Real.exp (-lam * t) / (1 - Real.exp (-lam * t))) - (Nn - m) * lam)) + ((m * (lam * Real.exp (-lam * (2*mu - t)) / (1 - Real.exp (-lam * (2*mu - t)))) - (Nn - m) * lam)))) ∧ (∀ t ∈ Set.Ioo a mu, HasDerivAt (fun y => (m * Real.log (1 - Real.exp (-lam * y)) - (Nn - m) * (lam * y)) - (m * Real.log (1 - Real.exp (-lam * (2*mu - y))) - (Nn - m) * (lam * (2*mu - y)))) (((m * (lam * Real.exp (-lam * t) / (1 - Real.exp (-lam * t))) - (Nn - m) * lam)) + ((m * (lam * Real.exp (-lam * (2*mu - t)) / (1 - Real.exp (-lam * (2*mu - t)))) - (Nn - m) * lam))) t ∧ (((m * (lam * Real.exp (-lam * t) / (1 - Real.exp (-lam * t))) - (Nn - m) * lam)) + ((m * (lam * Real.exp (-lam * (2*mu - t)) / (1 - Real.exp (-lam * (2*mu - t)))) - (Nn - m) * lam))) < 0) := by sorry
Source
A. Siegel, 'Median Bounds and their Application', J. Algorithms 38:184-236 (2001), Theorem 2.2 and §2.1.1 (the waiting-time / moustache proof of the integer-mean binomial median, after Jogdeo-Samuels 1968). This is the φ'-sign (single interior maximum) step in the non-degenerate (failure-reversal) regime e^{λμ} > N/(N-m).