Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma EC.4 — ordered-weights mediant inequality

Proved
StaticCalendar.lemma_EC_4

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationdynamic-pricingp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Let ai,bi>0a_i,b_i>0ai​,bi​>0 for i∈[n]i\in[n]i∈[n] with a1/b1≥a2/b2≥⋯≥an/bna_1/b_1\ge a_2/b_2\ge\dots\ge a_n/b_na1​/b1​≥a2​/b2​≥⋯≥an​/bn​, and let β1≥β2≥⋯≥βn≥0\beta_1\ge\beta_2\ge\dots\ge\beta_n\ge0β1​≥β2​≥⋯≥βn​≥0. Then

∑i∈[n]βiai∑i∈[n]βibi ≥ ∑i∈[n]ai∑i∈[n]bi.\frac{\sum_{i\in[n]}\beta_ia_i}{\sum_{i\in[n]}\beta_ib_i}\ \ge\ \frac{\sum_{i\in[n]}a_i}{\sum_{i\in[n]}b_i}.∑i∈[n]​βi​bi​∑i∈[n]​βi​ai​​ ≥ ∑i∈[n]​bi​∑i∈[n]​ai​​.

Weights that decrease together with the ratios can only raise the mediant. It is the tool behind (EC.5).

Differences from the source:

  • encoding: no condition that some βi\beta_iβi​ is positive → hypothesis ∃i, βi>0\exists i,\ \beta_i>0∃i, βi​>0; reason: it excludes only the case in which the left side is 0/00/00/0
Preamble
import Mathlib
Formal statement
namespace StaticCalendar

/-- Lemma EC.4, arXiv:1811.01077v5, p.ec4: for `aᵢ, bᵢ > 0` with `a₁/b₁ ≥ ⋯ ≥ aₙ/bₙ` and
`β₁ ≥ ⋯ ≥ βₙ ≥ 0`, `Σ βᵢaᵢ / Σ βᵢbᵢ ≥ Σ aᵢ / Σ bᵢ`.

**Formalization Note.** The hypothesis `∃ i, 0 < β i` excludes only the case in which the printed
left side is `0/0`. -/
theorem lemma_EC_4 {n : ℕ} (a b β : Fin n → ℝ) (ha : ∀ i, 0 < a i) (hb : ∀ i, 0 < b i)
    (hratio : Antitone fun i => a i / b i) (hβ : Antitone β) (hβ0 : ∀ i, 0 ≤ β i)
    (hβpos : ∃ i, 0 < β i) :
    (∑ i, a i) / (∑ i, b i) ≤ (∑ i, β i * a i) / (∑ i, β i * b i) := by sorry

end StaticCalendar
Source
Ma, Simchi-Levi & Zhao, Dynamic Pricing (and Assortment) under a Static Calendar, arXiv:1811.01077v5, Lemma EC.4, p.ec4
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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