Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Display (5.4), p. 7 (Filmus–Ward) — ee−1g(A)≥g(B)+∑i[h(A)−h(A−ai+bi)]\frac{e}{e-1} g(A) \ge g(B) + \sum_i [h(A) - h(A - a_i + b_i)]e−1e​g(A)≥g(B)+∑i​[h(A)−h(A−ai​+bi​)]

Proved
CurvatureSubmod.LocalSearch.eq_5_4

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

local-searchmatroidp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular

Let XXX be a finite set, g:2X→R≥0g : 2^X \to \mathbb{R}_{\ge 0}g:2X→R≥0​ monotone increasing and submodular, and hhh the Filmus–Ward potential of ggg,

h(A)=∑∅≠B⊆Ag(B)∫01epe−1 p∣B∣−1(1−p)∣A∣−∣B∣ dp.h(A) = \sum_{\emptyset \ne B \subseteq A} g(B) \int_0^1 \frac{e^p}{e-1}\, p^{|B|-1}(1-p)^{|A|-|B|}\, dp.h(A)=∅=B⊆A∑​g(B)∫01​e−1ep​p∣B∣−1(1−p)∣A∣−∣B∣dp.

Let AAA and BBB be bases of a matroid M\mathcal MM on XXX and π:A→B\pi : A \to Bπ:A→B a bijection with A−a+π(a)A - a + \pi(a)A−a+π(a) a base for every a∈Aa \in Aa∈A (as in Lemma 5.1); write A={a1,…,ar}A = \{a_1, \dots, a_r\}A={a1​,…,ar​} and bi=π(ai)b_i = \pi(a_i)bi​=π(ai​). Then

ee−1 g(A) ≥ g(B)+∑i=1r[h(A)−h(A−ai+bi)].\frac{e}{e-1}\, g(A) \ \ge\ g(B) + \sum_{i=1}^r \bigl[h(A) - h(A - a_i + b_i)\bigr].e−1e​g(A) ≥ g(B)+i=1∑r​[h(A)−h(A−ai​+bi​)].

This is Filmus and Ward's inequality [17, Theorem 5.1]: the total gain available from the swaps A−ai+biA - a_i + b_iA−ai​+bi​ in the potential hhh controls how far g(A)g(A)g(A) can fall below (1−e−1) g(B)(1 - e^{-1})\, g(B)(1−e−1)g(B).

Formalization Note The page states (5.4) "for any submodular function ggg", citing [17], whose setting is monotone submodular ggg normalised by g(∅)=0g(\emptyset) = 0g(∅)=0; the paper applies it only to the monotone nonnegative ggg of Lemmas A.1 and A.2. The statement therefore assumes ggg monotone increasing and nonnegative. The B=∅B = \emptysetB=∅ term of hhh is excluded (see the Setting definition); with that convention the inequality holds for g(∅)≥0g(\emptyset) \ge 0g(∅)≥0, since the constant g(∅)g(\emptyset)g(∅) adds the same amount to h(A)h(A)h(A) and h(A−ai+bi)h(A - a_i + b_i)h(A−ai​+bi​). The indexing bi=π(ai)b_i = \pi(a_i)bi​=π(ai​) is a sum over a∈Aa \in Aa∈A.

Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_CurvatureSubmod_LocalSearch_Setting
Formal statement
namespace CurvatureSubmod.LocalSearch

/-- Display (5.4), p. 7 (Filmus–Ward [17, Theorem 5.1]):
`(e/(e − 1)) g(A) ≥ g(B) + Σ_i [h(A) − h(A − a_i + b_i)]` for bases indexed as in Lemma 5.1. -/
theorem eq_5_4 {X : Type} [Fintype X] [DecidableEq X] (g : Finset X → ℝ)
    (hg0 : ∀ A, 0 ≤ g A) (hgmono : MonoInc g) (hgsub : NonmonotoneSubmod.Shared.Submodular g)
    (M : Matroid X) (A B : Finset X)
    (hA : M.IsBase (↑A : Set X)) (hB : M.IsBase (↑B : Set X))
    (π : X → X) (hπ : Set.BijOn π (↑A : Set X) (↑B : Set X))
    (hswap : ∀ x ∈ A, M.IsBase (↑(insert (π x) (A.erase x)) : Set X)) :
    g B + ∑ a ∈ A, (hPot g A - hPot g (insert (π a) (A.erase a)))
      ≤ Real.exp 1 / (Real.exp 1 - 1) * g A := by sorry

end CurvatureSubmod.LocalSearch
Source
Sviridenko, Vondrák, Ward, Optimal approximation for submodular and supermodular optimization with bounded curvature (SODA 2015 version, Oct. 9, 2014), p. 7, display (5.4) in the proof of Lemma 5.2 (Filmus and Ward [17, Theorem 5.1, p. 526]); h defined on p. 7
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me