Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5, p. 24 — a convex combination matching f(y) = y/(y+1) also matches g(y) = 1/(y+1)

Proved
ChoiceRM.MNL.lemma_5

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

discrete-choicemultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Let f(y)=yy+1f(y) = \dfrac{y}{y+1}f(y)=y+1y​ and g(y)=1y+1g(y) = \dfrac{1}{y+1}g(y)=y+11​. Suppose 0≤y1≤y2≤y30 \le y_1 \le y_2 \le y_30≤y1​≤y2​≤y3​ and θ≥0\theta \ge 0θ≥0 satisfy

θf(y1)+(1−θ)f(y3)=f(y2).\theta f(y_1) + (1-\theta) f(y_3) = f(y_2).θf(y1​)+(1−θ)f(y3​)=f(y2​).

Then

θg(y1)+(1−θ)g(y3)=g(y2).\theta g(y_1) + (1-\theta) g(y_3) = g(y_2).θg(y1​)+(1−θ)g(y3​)=g(y2​).

In the proof of Proposition 6 this transfers the choice of the weight θ\thetaθ, made to match the total purchase probability of an incomplete set (equation (15)), to the individual MNL probabilities (equation (16)).

Formalization Note The paper's λ\lambdaλ is written θ\thetaθ (λ is reserved in Lean). The page says "y1≤y2≤y3y_1 \le y_2 \le y_3y1​≤y2​≤y3​ and λ\lambdaλ are nonnegative numbers"; nonnegativity of y1y_1y1​ gives that of y2,y3y_2, y_3y2​,y3​.

Preamble
import Mathlib
Formal statement
namespace ChoiceRM.MNL

/-- Lemma 5, p. 24 (the paper's `λ` is written `θ`): with `f(y) = y/(y+1)` and `g(y) = 1/(y+1)`,
if `0 ≤ y₁ ≤ y₂ ≤ y₃`, `θ ≥ 0` and `θ f(y₁) + (1 − θ) f(y₃) = f(y₂)`, then
`θ g(y₁) + (1 − θ) g(y₃) = g(y₂)`. -/
theorem lemma_5 (y₁ y₂ y₃ θ : ℝ) (h0 : 0 ≤ y₁) (h12 : y₁ ≤ y₂) (h23 : y₂ ≤ y₃) (hθ : 0 ≤ θ)
    (h : θ * (y₁ / (y₁ + 1)) + (1 - θ) * (y₃ / (y₃ + 1)) = y₂ / (y₂ + 1)) :
    θ * (1 / (y₁ + 1)) + (1 - θ) * (1 / (y₃ + 1)) = 1 / (y₂ + 1) := by sorry

end ChoiceRM.MNL
Source
Talluri, van Ryzin, Revenue management under a general discrete choice model of consumer behavior, working paper of October 21, 2001 (UPF Economics Working Paper 533; published Management Science 50(1), 2004, DOI 10.1287/mnsc.1030.0147), p. 24, Lemma 5
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