Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 88 — E[V₀(Z(u + εeᵢ))] = E[V₀(Z(u) + Y eᵢ)] with Y ~ Zᵢ(ε) independent

Proved
SubstOverbooking.Structure.semigroup_representation

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

couplingoverbookingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semigroup

Assume every class has a semigroup family of survival laws on the parameter set PPP. Let u∈Pnu \in P^nu∈Pn, a class iii and ε∈P\varepsilon \in Pε∈P. Let Z(u)Z(u)Z(u) have the product law of the survivals and let YYY, independent of Z(u)Z(u)Z(u), have the law of Zi(ε)Z_i(\varepsilon)Zi​(ε). Then

E[V0(Z(u+εei),c)]=E[V0(Z(u)+Yei,c)],\mathbb E\big[V_0(Z(u + \varepsilon e_i), c)\big] = \mathbb E\big[V_0(Z(u) + Y e_i, c)\big],E[V0​(Z(u+εei​),c)]=E[V0​(Z(u)+Yei​,c)],

where eie_iei​ is the iii-th unit vector.

This is the coupling step of the proof of Theorem 2: increasing one overbooking level by ε\varepsilonε is the same, in law, as adding an independent block of survivors to that class, which reduces the expected-value inequalities to sample-path inequalities for V0V_0V0​.

Preamble
import Mathlib
import Definitions.Def_SubstOverbooking_Structure_Setting
Formal statement
namespace SubstOverbooking.Structure

open MeasureTheory

theorem semigroup_representation {n m : ℕ} (a : Fin n → Fin (m + 1) → ℝ) (c : Fin (m + 1) → ℝ)
    (P : Set ℝ) (L : Fin n → ℝ → PMF ℕ) (hL : ∀ i, IsSemigroupFamily P (L i))
    (u : Fin n → ℝ) (hu : ∀ k, u k ∈ P) (i : Fin n) (ε : ℝ) (hε : ε ∈ P) :
    ∫ z, V0 a c (fun k => (z k : ℝ)) ∂(survivalLaw L (Function.update u i (u i + ε))) =
      ∫ p : (Fin n → ℕ) × ℕ, V0 a c (fun k => ((p.1 + (Pi.single i p.2 : Fin n → ℕ)) k : ℝ))
        ∂((survivalLaw L u).prod (L i ε).toMeasure) := by sorry

end SubstOverbooking.Structure
Source
Karaesmen & van Ryzin, Overbooking with Substitutable Inventory Classes, Operations Research 52(1):83–104 (2004), p. 88, proof of Theorem 2, display after (8)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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