Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5(a): x↦(1−x)/(2−x−Ψ(x))x\mapsto(1-x)/(2-x-\Psi(x))x↦(1−x)/(2−x−Ψ(x)) is increasing

Proved
PersonalizedAssortment.IB.lemma5_ratio_monotone

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

competitive-ratiop2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1penalty-functionreal-analysis

Let Ψ\PsiΨ be a penalty function, i.e. Ψ:[0,1]→[0,1]\Psi:[0,1]\to[0,1]Ψ:[0,1]→[0,1] increasing with Ψ(0)=0\Psi(0)=0Ψ(0)=0 and Ψ(1)=1\Psi(1)=1Ψ(1)=1. Suppose that Ψ\PsiΨ is also concave and twice differentiable on [0,1][0,1][0,1]. Then the function

x  ⟼  1−x2−x−Ψ(x)x\;\longmapsto\;\frac{1-x}{2-x-\Psi(x)}x⟼2−x−Ψ(x)1−x​

is (non-strictly) increasing on [0,1)[0,1)[0,1).

This is the first half of Lemma 5. It is used in the second case of the final step of the proof of Theorem 1, where x>1−1/cmin⁡x>1-1/c_{\min}x>1−1/cmin​.

Formalization Note The paper says "increases on [0,1][0,1][0,1]". At x=1x=1x=1 the expression is 0/00/00/0, and Lean would give it the value 000, which would make the statement false on the closed interval. The domain is therefore [0,1)[0,1)[0,1). Twice differentiability is encoded as differentiability of Ψ\PsiΨ on [0,1][0,1][0,1] together with differentiability of its derivative within [0,1][0,1][0,1].

Preamble
import Mathlib
import Definitions.Def_PersonalizedAssortment_IB_PenaltyFunction
Formal statement
namespace PersonalizedAssortment.IB

/-- Lemma 5, first part (p. 1548): for an increasing, concave, twice-differentiable penalty function
`Ψ`, the map `x ↦ (1 - x)/(2 - x - Ψ(x))` is increasing (non-strictly). Stated on `[0, 1)`: at
`x = 1` the expression is `0/0`. -/
theorem lemma5_ratio_monotone (Ψ : ℝ → ℝ) (hΨ : IsPenaltyFunction Ψ)
    (hconc : ConcaveOn ℝ (Set.Icc 0 1) Ψ) (hdiff : DifferentiableOn ℝ Ψ (Set.Icc 0 1))
    (hdiff2 : DifferentiableOn ℝ (derivWithin Ψ (Set.Icc 0 1)) (Set.Icc 0 1)) :
    MonotoneOn (fun x : ℝ => (1 - x) / (2 - x - Ψ x)) (Set.Ico 0 1) := by sorry

end PersonalizedAssortment.IB
Source
Golrezaei, Nazerzadeh, Rusmevichientong, Real-Time Optimization of Personalized Assortments, Management Sci. 60(6), 2014, https://doi.org/10.1287/mnsc.2014.1939, p. 1548, Lemma 5 (first part)
Read-back

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

Let Ψ:R→R\Psi : \mathbb R \to \mathbb RΨ:R→R satisfy all of the following:

  • Ψ\PsiΨ maps [0,1][0,1][0,1] into [0,1][0,1][0,1];
  • Ψ\PsiΨ is nondecreasing on [0,1][0,1][0,1];
  • Ψ(0)=0\Psi(0)=0Ψ(0)=0 and Ψ(1)=1\Psi(1)=1Ψ(1)=1;
  • Ψ\PsiΨ is concave on [0,1][0,1][0,1]: Ψ(λx+(1−λ)y)≥λΨ(x)+(1−λ)Ψ(y)\Psi(\lambda x + (1-\lambda)y) \ge \lambda\Psi(x) + (1-\lambda)\Psi(y)Ψ(λx+(1−λ)y)≥λΨ(x)+(1−λ)Ψ(y) for all x,y,λ∈[0,1]x, y, \lambda \in [0,1]x,y,λ∈[0,1];
  • Ψ\PsiΨ is differentiable relative to [0,1][0,1][0,1] at every point of [0,1][0,1][0,1] (one-sided at the endpoints);
  • the derivative of Ψ\PsiΨ within [0,1][0,1][0,1], viewed as a function, is itself differentiable relative to [0,1][0,1][0,1] at every point of [0,1][0,1][0,1].

Nothing is assumed about Ψ\PsiΨ outside [0,1][0,1][0,1]. The statement asserts that the function

x↦1−x2−x−Ψ(x)x \mapsto \frac{1 - x}{2 - x - \Psi(x)}x↦2−x−Ψ(x)1−x​

is nondecreasing (non-strictly) on the half-open interval [0,1)[0, 1)[0,1): if 0≤x≤x′<10 \le x \le x' < 10≤x≤x′<1, then the value at xxx is at most the value at x′x'x′. Nothing is asserted at x=1x = 1x=1 or outside [0,1)[0,1)[0,1).

Degenerate cases. For x∈[0,1)x \in [0,1)x∈[0,1) the hypotheses give Ψ(x)≤1\Psi(x) \le 1Ψ(x)≤1, so the denominator is at least 1−x>01 - x > 01−x>0 and no division-by-zero convention is triggered. The hypotheses are jointly satisfiable, for example by Ψ(x)=x\Psi(x) = xΨ(x)=x.

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