Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 (Karamata) — x≺yx\prec yx≺y implies ∑g(xi)≤∑g(yi)\sum g(x_i)\le\sum g(y_i)∑g(xi​)≤∑g(yi​) for convex ggg

Proved
RetailVariety.Fashion.lemma_2

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

convexitymajorizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let s⊆Rs\subseteq\mathbb Rs⊆R be a convex set (an interval), g:R→Rg:\mathbb R\to\mathbb Rg:R→R convex on sss, and x,y∈Rnx,y\in\mathbb R^nx,y∈Rn with every coordinate of xxx and of yyy in sss. If x≺yx\prec yx≺y (Definition 1), then

∑i=1ng(xi)≤∑i=1ng(yi).\sum_{i=1}^{n}g(x_i)\le\sum_{i=1}^{n}g(y_i).i=1∑n​g(xi​)≤i=1∑n​g(yi​).

This is the classical inequality of Hardy, Littlewood and Pólya (Karamata's inequality), which the paper quotes from Marshall and Olkin (1979). It is the step that turns majorization of preference vectors into a comparison of profits.

Formalization Note. The paper states the lemma for ggg convex on all of R\mathbb RR, which is the case s=Rs=\mathbb Rs=R. The proof of Theorem 3 applies it to g(x)=ax−bxβg(x)=ax-bx^\betag(x)=ax−bxβ, which is convex (and defined as a real power) only on [0,∞)[0,\infty)[0,∞), so the lemma is stated for ggg convex on a convex set containing the data.

Preamble
import Mathlib
import Definitions.Def_RetailVariety_Fashion_Majorization
Formal statement
namespace RetailVariety.Fashion

/-- Lemma 2 (van Ryzin & Mahajan 1999, p. 1505; Hardy–Littlewood–Pólya / Karamata, quoted from
Marshall & Olkin 1979), for `g` convex on a convex set `s` containing every coordinate of `x` and
`y`; the paper's `g : ℝ → ℝ` convex is the case `s = univ`. -/
theorem lemma_2 {n : ℕ} {s : Set ℝ} {g : ℝ → ℝ} (hg : ConvexOn ℝ s g)
    (x y : Fin n → ℝ) (hxs : ∀ i, x i ∈ s) (hys : ∀ i, y i ∈ s) (hxy : Majorized x y) :
    ∑ i, g (x i) ≤ ∑ i, g (y i) := by sorry

end RetailVariety.Fashion
Source
van Ryzin & Mahajan, On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments, Management Science 45(11), 1999, p. 1505, Lemma 2 (citing Marshall and Olkin 1979)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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