Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(29), p. 25 — nk Σ r⁽ℓ⁾Bℓ(1 − e^{−α⁽ℓ⁾}) = (1 − e^{−α⁽¹⁾}) Σ (r⁽ℓ⁾ − r⁽ℓ⁻¹⁾)Bℓnk

Proved
MultiPriceOnline.Hardness.eq_29

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

competitive-ratiomulti-pricep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0<r(1)<⋯<r(m)0 < r^{(1)} < \dots < r^{(m)}0<r(1)<⋯<r(m) be a price set with booking limits α(1),…,α(m)\alpha^{(1)}, \dots, \alpha^{(m)}α(1),…,α(m) (Proposition 1), and recall r(0)=0r^{(0)} = 0r(0)=0. For all real numbers B1,…,BmB_1, \dots, B_mB1​,…,Bm​ and all n,k∈Nn, k \in \mathbb Nn,k∈N,

nk∑ℓ=1mr(ℓ)Bℓ(1−e−α(ℓ))=(1−e−α(1))∑ℓ=1m(r(ℓ)−r(ℓ−1))Bℓnk.nk \sum_{\ell=1}^m r^{(\ell)} B_\ell \big(1 - e^{-\alpha^{(\ell)}}\big) = \big(1 - e^{-\alpha^{(1)}}\big) \sum_{\ell=1}^m \big(r^{(\ell)} - r^{(\ell-1)}\big) B_\ell n k.nkℓ=1∑m​r(ℓ)Bℓ​(1−e−α(ℓ))=(1−e−α(1))ℓ=1∑m​(r(ℓ)−r(ℓ−1))Bℓ​nk.

The left side is the value (28) at j=1j = 1j=1, τ=1\tau = 1τ=1. The right side is F(P)F(\mathcal P)F(P) times the expression (25) for OPT. This identity is the step of the proof of Theorem 3 that produces the factor F(P)=1−e−α(1)F(\mathcal P) = 1 - e^{-\alpha^{(1)}}F(P)=1−e−α(1).

Preamble
import Mathlib
import Definitions.Def_MultiPriceOnline_Hardness_PriceSet
Formal statement
namespace MultiPriceOnline.Hardness
open Finset
theorem eq_29 {m : ℕ} {r α : ℕ → ℝ} (hr : MultiPriceOnline.Balance.IsPriceSet m r) (hα : MultiPriceOnline.Balance.IsBookingLimits m r α)
    (B : ℕ → ℝ) (n k : ℕ) :
    (n : ℝ) * k * ∑ l ∈ Icc 1 m, r l * B l * (1 - Real.exp (-α l)) =
      (1 - Real.exp (-α 1)) * ∑ l ∈ Icc 1 m, (price r l - price r (l - 1)) * B l * n * k := by sorry
end MultiPriceOnline.Hardness
Source
Ma, Simchi-Levi, Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios, arXiv:1905.04770v1, p. 25, eq. (29) in the proof of Theorem 3
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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