Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.14 — ∣greedyM(F′,L)∣≥∣greedyM(F,L)∣|\mathrm{greedy}_M(F',L)| \ge |\mathrm{greedy}_M(F,L)|∣greedyM​(F′,L)∣≥∣greedyM​(F,L)∣ and F∩greedyM(F′,L)⊆greedyM(F,L)F\cap\mathrm{greedy}_M(F',L)\subseteq\mathrm{greedy}_M(F,L)F∩greedyM​(F′,L)⊆greedyM​(F,L) for F⊆F′F\subseteq F'F⊆F′

Proved
RevenueOrdered.Stackelberg.greedy_card_mono_inter_subset

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

greedy-algorithmmatroidsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M=(E,X)M=(E,\mathcal X)M=(E,X) be a matroid with finite ground set EEE, and let LLL be a linear ordering of EEE. For F⊆EF\subseteq EF⊆E write greedyM(F,L)\mathrm{greedy}_M(F,L)greedyM​(F,L) for the independent subset of FFF produced by the greedy algorithm run on FFF in the order induced by LLL. Then for all F⊆F′⊆EF\subseteq F'\subseteq EF⊆F′⊆E:

  1. ∣greedyM(F′,L)∣≥∣greedyM(F,L)∣|\mathrm{greedy}_M(F',L)|\ge|\mathrm{greedy}_M(F,L)|∣greedyM​(F′,L)∣≥∣greedyM​(F,L)∣, and
F∩greedyM(F′,L)⊆greedyM(F,L).F\cap\mathrm{greedy}_M(F',L)\subseteq\mathrm{greedy}_M(F,L).F∩greedyM​(F′,L)⊆greedyM​(F,L).

Enlarging the set on which greedy runs never shrinks its output, and an element of the smaller set that greedy keeps on the larger set is also kept on the smaller set. This is the property behind the regularity axiom (iv) of the choice model of Theorem 4.16.

Preamble
import Mathlib
import Definitions.Def_RevenueOrdered_Stackelberg_Greedy

open Classical
Formal statement
namespace RevenueOrdered.Stackelberg

/-- Lemma 4.14 (Berbeglia–Joret, arXiv:1606.01371v3, p. 23). For a matroid `M` with finite
ground set `E`, a linear ordering `L` of `E`, and `F ⊆ F' ⊆ E`:
(i) `|greedy_M(F', L)| ≥ |greedy_M(F, L)|`, and (ii) `F ∩ greedy_M(F', L) ⊆ greedy_M(F, L)`. -/
theorem greedy_card_mono_inter_subset {α : Type*} (M : Matroid α) (E : Finset α)
    (hE : (E : Set α) = M.E) (L : List α) (hL : IsLinearOrderOf L E)
    (F F' : Finset α) (hFF' : F ⊆ F') (hF'E : F' ⊆ E) :
    (greedyM M L F).card ≤ (greedyM M L F').card ∧
      F ∩ greedyM M L F' ⊆ greedyM M L F := by sorry

end RevenueOrdered.Stackelberg
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, p. 23, Lemma 4.14 (proof p. 31)
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