Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 12 — f(S) ≥ f(S ∪ OPT) − Σ_{u∈𝒩} |O_u ∖ S| · f(u | S_u) for the final sets of Algorithm 2

Proved
SubsampleSubmod.SampleGreedy.lemma_6

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

greedy-algorithmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-maximization

Let fff be submodular, (N,I)(\mathcal N, \mathcal I)(N,I) an independence system, T∈IT \in \mathcal IT∈I (playing the role of OPT) and BBB any outcome of the coins. For the final sets SSS, OuO_uOu​ and SuS_uSu​ of Algorithm 2 run from O=TO = TO=T,

f(S)  ≥  f(S∪T)  −  ∑u∈N∣Ou∖S∣⋅f(u∣Su).f(S) \;\ge\; f(S \cup T) \;-\; \sum_{u \in \mathcal N} |O_u \setminus S| \cdot f(u \mid S_u).f(S)≥f(S∪T)−u∈N∑​∣Ou​∖S∣⋅f(u∣Su​).

This is the deterministic half of the analysis of SampleGreedy: it charges the loss relative to S∪OPTS \cup \mathrm{OPT}S∪OPT to the marginal gains of considered elements.

Formalization Note No non-negativity of fff and no ppp-extendibility are assumed; the statement holds for every outcome of the coins.

Preamble
import Mathlib
import Definitions.Def_SubsampleSubmod_SampleGreedy_Analysis
Formal statement
namespace SubsampleSubmod.SampleGreedy

/-- Lemma 6 (p. 12). For the final sets of Algorithm 2 run from an independent `T` (OPT) and any coin
flips `B`: `f(S) ≥ f(S ∪ T) − ∑_{u ∈ 𝒩} |O_u \ S| · f(u | S_u)`, for submodular `f`. -/
theorem lemma_6 {α : Type} [Fintype α] [LinearOrder α] (f : Finset α → ℝ)
    (I : Finset α → Prop) (hsub : NonmonotoneSubmod.Shared.Submodular f) (hI : IsIndepSystem I)
    (T : Finset α) (hT : I T) (B : Finset α) :
    f ((alg2 f I T B).S ∪ T) -
        ∑ u : α, (((alg2 f I T B).Ou u \ (alg2 f I T B).S).card : ℝ) *
          marg f u ((alg2 f I T B).Su u) ≤
      f (alg2 f I T B).S := by sorry

end SubsampleSubmod.SampleGreedy
Source
Harshaw et al., arXiv:2104.02772v1, p. 12, Lemma 6 (proof pp. 12–13)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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