Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — E[f(Bin(x, γ))] is nondecreasing and convex in x when f is nondecreasing and convex

Proved
AirlineYieldMgmt.BookingLimits.lemma1_binomial_convex

by mikedeng1 · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

binomial-distributionconvexityp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-orders

Let f(y)f(y)f(y), y≥0y \ge 0y≥0, be nondecreasing and convex, and let 0<γ<10 < \gamma < 10<γ<1. For each non-negative integer xxx let Y(x)Y(x)Y(x) be a binomial-(x,γ)(x,\gamma)(x,γ) random variable and

h(x)  =  E f(Y(x))  =  ∑k=0x(xk)γk(1−γ)x−kf(k).h(x) \;=\; \mathrm{E}\,f(Y(x)) \;=\; \sum_{k=0}^{x}\binom{x}{k}\gamma^k(1-\gamma)^{x-k} f(k).h(x)=Ef(Y(x))=k=0∑x​(kx​)γk(1−γ)x−kf(k).

Then hhh is nondecreasing and convex on {0,1,2,… }\{0,1,2,\dots\}{0,1,2,…}:

h(x)≤h(x+1)andh(x+1)−h(x)  ≤  h(x+2)−h(x+1)for all x≥0.h(x) \le h(x+1) \quad\text{and}\quad h(x+1) - h(x) \;\le\; h(x+2) - h(x+1)\qquad \text{for all } x \ge 0.h(x)≤h(x+1)andh(x+1)−h(x)≤h(x+2)−h(x+1)for all x≥0.

In the paper this lemma (quoted from Shaked and Shanthikumar, 1994, Example 6.A.2) is what makes the terminal value U0U_0U0​ concave and nonincreasing, which starts the induction behind the booking-limit result.

Formalization Note. f:R→Rf : \mathbb R \to \mathbb Rf:R→R with MonotoneOn f (Set.Ici 0) and ConvexOn ℝ (Set.Ici 0) f, the paper's "f(y)f(y)f(y), y≥0y \ge 0y≥0". The expectation is the finite binomial sum binomExp x γ f. Convexity in x∈{0,1,… }x \in \{0,1,\dots\}x∈{0,1,…} is stated as the discrete second-difference inequality, not as convexity of a real interpolation.

Preamble
import Mathlib
import Definitions.Def_AirlineYieldMgmt_BookingLimits_Model
Formal statement
namespace AirlineYieldMgmt.BookingLimits

/-- Lemma 1 (p. 151). If `f(y)`, `y ≥ 0`, is nondecreasing and convex and `0 < γ < 1`, then
`h(x) := E[f(Y(x))]` with `Y(x) ∼ Bin(x, γ)` is nondecreasing and (discretely) convex in
`x ∈ {0, 1, …}`. -/
theorem lemma1_binomial_convex (f : ℝ → ℝ) (hf_mono : MonotoneOn f (Set.Ici 0))
    (hf_convex : ConvexOn ℝ (Set.Ici 0) f) (γ : ℝ) (hγ0 : 0 < γ) (hγ1 : γ < 1) :
    Monotone (fun x : ℕ => binomExp x γ f) ∧
      ∀ x : ℕ, binomExp (x + 1) γ f - binomExp x γ f ≤
        binomExp (x + 2) γ f - binomExp (x + 1) γ f := by sorry

end AirlineYieldMgmt.BookingLimits
Source
Subramanian, Stidham, Lautenbacher, Airline Yield Management with Overbooking, Cancellations, and No-Shows, Transp. Sci. 33(2), 1999, p. 151, Lemma 1
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Hypotheses. Let f:R→Rf : \mathbb{R} \to \mathbb{R}f:R→R be any function that is nondecreasing on [0,∞)[0,\infty)[0,∞) and convex on [0,∞)[0,\infty)[0,∞). Its behaviour on the negative reals is unrestricted. Let γ\gammaγ be a real number with 0<γ<10 < \gamma < 10<γ<1 (both inequalities strict).

The function studied. For x∈Nx \in \mathbb{N}x∈N define

h(x)=∑k=0x(xk)γk(1−γ)x−kf(k),h(x) = \sum_{k=0}^{x} \binom{x}{k}\gamma^k(1-\gamma)^{x-k} f(k),h(x)=k=0∑x​(kx​)γk(1−γ)x−kf(k),

the expectation of f(Y)f(Y)f(Y) for Y∼Bin(x,γ)Y \sim \mathrm{Bin}(x,\gamma)Y∼Bin(x,γ).

Conclusion. The statement asserts both of the following:

  1. hhh is nondecreasing on N\mathbb{N}N:   x≤x′⇒h(x)≤h(x′)\;x \le x' \Rightarrow h(x) \le h(x')x≤x′⇒h(x)≤h(x′).
  2. For every x∈Nx \in \mathbb{N}x∈N,
h(x+1)−h(x)  ≤  h(x+2)−h(x+1).h(x+1) - h(x) \;\le\; h(x+2) - h(x+1).h(x+1)−h(x)≤h(x+2)−h(x+1).

That is, the forward differences of hhh are nondecreasing (discrete convexity) on all of N\mathbb{N}N.

Degenerate cases. Only the values f(0),f(1),f(2),…f(0), f(1), f(2), \dotsf(0),f(1),f(2),… enter hhh. At x=0x=0x=0, h(0)=f(0)h(0) = f(0)h(0)=f(0). The endpoint values γ=0\gamma = 0γ=0 and γ=1\gamma = 1γ=1 are excluded by the hypotheses. The hypotheses are satisfiable, for example by any constant fff, in which case hhh is constant and both conclusions hold with equality.

Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me