Siegel Theorem 2.1: the “moustache” value bound
Provedsiegel_moustache_value_boundanalysismatrix-completionmedianprobabilitysiegel
Siegel 2001, Theorem 2.1 (the "moustache" value bound), geometric core. Let on () be symmetric about (), valley-shaped on (antitone on then monotone on , i.e. a single interior minimum), with . If the average of over is at least (which Siegel's Lemma 2.1 supplies for a symmetrized CDF), then . This is the ordering-analysis step in Siegel's proof of the integer-mean binomial/Poisson median bound (Thm 2.2).
Preamble
import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic import Mathlib.MeasureTheory.Integral.IntervalIntegral.FundThmCalculus import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Order.Monotone.Basic set_option autoImplicit false open MeasureTheory
Formal statement
theorem siegel_moustache_value_bound
(G : ℝ → ℝ) (μ c : ℝ) (hμ : 0 < μ) (hc0 : 0 ≤ c) (hcμ : c ≤ μ)
(hleft : AntitoneOn G (Set.Icc 0 c))
(hright : MonotoneOn G (Set.Icc c μ))
(hsym : ∀ x, G (2 * μ - x) = G x)
(h0μ : G 0 ≤ G μ)
(hint : IntervalIntegrable G volume 0 (2 * μ))
(havg : (1 / 2 : ℝ) ≤ (1 / (2 * μ)) * ∫ x in (0:ℝ)..(2 * μ), G x) :
(1 / 2 : ℝ) ≤ G μ := by sorrySource
A. Siegel, "Median Bounds and their Application", Journal of Algorithms 38 (2001) 184-236, Theorem 2.1, p.5 (the moustache-CDF value bound). Geometric core abstracted as pure real analysis; the average>=1/2 hypothesis is supplied by Siegel Lemma 2.1 (already proved on platform as siegel_cdf_average_ge_mean).