Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Efficient sets are ordered (Sect. 2.6.2.3): if S' is efficient and Q(S) ≤ Q(S'), then R(S) ≤ R(S')

Proved
RevenueManagement.efficient_sets_ordered

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-choiceefficient-setsoperations-researchrevenue-management

The efficient sets can be indexed so that both the purchase probabilities and the expected revenues increase with the index: for any set SSS and any efficient set S′S'S′, Q(S)≤Q(S′)Q(S) \le Q(S')Q(S)≤Q(S′) implies R(S)≤R(S′)R(S) \le R(S')R(S)≤R(S′). This is the book's ordering statement in the form that holds with ties; the strict form fails when two efficient sets have equal revenue, since Definition 2.1 does not make a set with the same revenue and larger purchase probability inefficient.

Preamble
import Definitions.Def_RevenueManagement_singleResource
Formal statement
namespace RevenueManagement

theorem efficient_sets_ordered {n : ℕ} (P : Finset (Fin n) → Fin n → ℝ) (p : Fin n → ℝ)
    (S S' : Finset (Fin n)) (hS' : IsEfficient P p S')
    (hQ : purchaseProb P S ≤ purchaseProb P S') :
    expRevenue P p S ≤ expRevenue P p S' := by sorry

end RevenueManagement
Source
Kalyan T. Talluri and Garrett J. van Ryzin, The Theory and Practice of Revenue Management, Kluwer/Springer 2004, DOI 10.1007/b139000, p. 68, Sect. 2.6.2.3 ('if the collection of m efficient sets is indexed such that Q(S1) < Q(S2) < ··· < Q(Sm), then R(S1) < R(S2) < ··· < R(Sm) as well')
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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