McDiarmid's bounded-differences inequality #
This file proves the moment-generating-function form of McDiarmid's inequality for a measurable
real-valued function on a finite product of identical probability spaces. If changing coordinate
i changes the function by at most c i, then the centered function is sub-Gaussian with variance
proxy ∑ i, (c i / 2) ^ 2.
The proof peels off one coordinate at a time. Hoeffding's lemma controls the peeled coordinate, and the induction hypothesis controls the function obtained by averaging over it.
Main results #
TauCeti.Probability.hasSubgaussianMGF_of_bounded_differencesgives the result for an arbitrary finite index type;TauCeti.Probability.hasSubgaussianMGF_of_bounded_differences_finspecializes it toFin n.
References #
- C. McDiarmid, On the method of bounded differences, Surveys in Combinatorics 141 (1989), 148–188.
- C. Freer,
cameronfreer/graphonat commit6eccca5bbe5c9df46d7129bf59575b8b9b1d6699, Apache-2.0,Graphon/McDiarmid.lean. The coordinate-peeling proof and constants are adapted from that file.
McDiarmid's bounded-differences inequality at MGF level. Let f be a measurable
real-valued function on a finite i.i.d. product. If two inputs that differ only at coordinate i
have outputs differing by at most c i, then the centered f is sub-Gaussian with variance proxy
∑ i, (c i)² / 4.
The result is stated using Mathlib's ProbabilityTheory.HasSubgaussianMGF; its
measure_ge_le theorem gives the one-sided Chernoff tail, and applying neg gives the other side.
McDiarmid's bounded-differences inequality for a product indexed by Fin n, stated in the
convenient form where one coordinate is updated explicitly.