Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§5.1, p. 7 — a swap-local optimum SSS of ψ\psiψ has g(S)+ℓ(S)≥(1−e−1)g(O)+ℓ(O)g(S)+\ell(S) \ge (1-e^{-1})g(O)+\ell(O)g(S)+ℓ(S)≥(1−e−1)g(O)+ℓ(O) for every base OOO

Proved
CurvatureSubmod.LocalSearch.local_opt_bound

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, ℓ(A)=∑j∈Aw(j)\ell(A) = \sum_{j \in A} w(j)ℓ(A)=∑j∈A​w(j) linear with arbitrary real weights, and ψ=(1−e−1)h+ℓ\psi = (1 - e^{-1}) h + \ellψ=(1−e−1)h+ℓ with hhh the Filmus–Ward potential of ggg. Let M\mathcal MM be a matroid on XXX and SSS a base of M\mathcal MM that is locally optimal for ψ\psiψ under single-element exchanges: ψ(S−a+b)≤ψ(S)\psi(S - a + b) \le \psi(S)ψ(S−a+b)≤ψ(S) whenever a∈Sa \in Sa∈S, b∉Sb \notin Sb∈/S and S−a+bS - a + bS−a+b is a base. Then for every base OOO of M\mathcal MM,

g(S)+ℓ(S) ≥ (1−e−1) g(O)+ℓ(O).g(S) + \ell(S) \ \ge\ (1 - e^{-1})\, g(O) + \ell(O).g(S)+ℓ(S) ≥ (1−e−1)g(O)+ℓ(O).

This is the exact (δ=0\delta = 0δ=0) form of the guarantee required by Theorem 3.1, obtained from the local search of §5.

Formalization Note "Locally optimal" is Figure 4's stopping rule with δ=0\delta = 0δ=0 (IsSwapLocalOpt). As in Lemma 5.2, ggg is monotone and nonnegative.

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

/-- §5.1, p. 7 (paragraph after the proof of Lemma 5.2): a swap-local optimum `S` of `ψ`
satisfies `g(S) + ℓ(S) ≥ (1 − e^{−1}) g(O) + ℓ(O)` for every base `O`. -/
theorem local_opt_bound {X : Type} [Fintype X] [DecidableEq X] (g : Finset X → ℝ)
    (hg0 : ∀ A, 0 ≤ g A) (hgmono : MonoInc g) (hgsub : NonmonotoneSubmod.Shared.Submodular g)
    (w : X → ℝ) (M : Matroid X) (S : Finset X) (hS : IsSwapLocalOpt M (psi g w) S)
    (O : Finset X) (hO : M.IsBase (↑O : Set X)) :
    (1 - Real.exp (-1)) * g O + linFun w O ≤ g S + linFun w S := 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, §5.1, paragraph after the proof of Lemma 5.2
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