Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1, p. 14 — g=f−ℓg = f - \ellg=f−ℓ with ℓ(A)=∑j∈AfX−j(j)\ell(A)=\sum_{j\in A} f_{X-j}(j)ℓ(A)=∑j∈A​fX−j​(j) is submodular, monotone increasing and nonnegative

Proved
CurvatureSubmod.LocalSearch.lemma_A_1

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

curvaturep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular

Let XXX be a finite set and f:2X→R≥0f : 2^X \to \mathbb{R}_{\ge 0}f:2X→R≥0​ a monotone increasing submodular function. Define the linear function and the remainder

ℓ(A)=∑j∈AfX−j(j),g(A)=f(A)−ℓ(A).\ell(A) = \sum_{j \in A} f_{X-j}(j), \qquad g(A) = f(A) - \ell(A).ℓ(A)=j∈A∑​fX−j​(j),g(A)=f(A)−ℓ(A).

Then ggg is submodular, monotone increasing, and nonnegative.

This is the decomposition f=g+ℓf = g + \ellf=g+ℓ on which the maximization algorithm of §6.1 runs: the local search is applied to the monotone submodular part ggg and the linear part ℓ\ellℓ jointly.

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

/-- Lemma A.1, p. 14: `g = f − ℓ` with `ℓ(A) = Σ_{j∈A} f_{X−j}(j)` is submodular, monotone
increasing and nonnegative. -/
theorem lemma_A_1 {X : Type} [Fintype X] [DecidableEq X] (f : Finset X → ℝ)
    (hf0 : ∀ A, 0 ≤ f A) (hmono : MonoInc f) (hsub : NonmonotoneSubmod.Shared.Submodular f) :
    NonmonotoneSubmod.Shared.Submodular (gMax f) ∧ MonoInc (gMax f) ∧
      ∀ A, 0 ≤ gMax f 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. 14, Lemma A.1
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me