(3.12), p. 11 — |Λ′(t) − Λ′(s)| ≤ κ²|t − s|
ProvedSAARate.SharpLD.display_3_12large-deviationsmoment-generating-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability
Let be a real random variable on a probability space with almost surely, and let . Then for all
The derivative of the cumulant generating function of a variable bounded by is Lipschitz with constant . By convex duality this is equivalent to strong convexity of the conjugate with modulus , used for (3.13).
Formalization Note is Mathlib's cgf, is deriv; the statement is made for an arbitrary bounded measurable .
Preamble
import Mathlib open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SAARate.SharpLD
theorem display_3_12 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
[IsProbabilityMeasure P] (X : Ω → ℝ) (hX : Measurable X) (κ : ℝ)
(hXκ : ∀ᵐ ω ∂P, |X ω| ≤ κ) :
∀ t s : ℝ, |deriv (cgf X P) t - deriv (cgf X P) s| ≤ κ ^ 2 * |t - s| := by sorry
end SAARate.SharpLD
Source
Shapiro & Homem-de-Mello, On Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs, preprint (SPEPS copy, edoc.hu-berlin.de), p. 11, proof of Theorem 3.1, (3.12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.