Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1.1, p. 14 — with q = 1/(p+1), E[f(S)] ≥ E[f(S ∪ OPT)] − Σ E[|O_u∖S| f(u|S_u)] ≥ … ≥ E[f(S ∪ OPT)] − p · E[f(S)]

Proved
SubsampleSubmod.SampleGreedy.display_4_1_1

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

approximation-algorithmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithmssubmodular-maximization

Let fff be non-negative and submodular, (N,I)(\mathcal N, \mathcal I)(N,I) a ppp-extendible independence system with p≥1p \ge 1p≥1, and T∈IT \in \mathcal IT∈I. Run Algorithm 2 from O=TO = TO=T with sampling probability q=1p+1q = \frac1{p+1}q=p+11​. Then the chain of the proof of Theorem 1 for submodular objectives holds:

E[f(S)]≥E[f(S∪T)]−∑u∈NE[∣Ou∖S∣⋅f(u∣Su)]≥E[f(S∪T)]−pp+1∑u∈NE[Xu f(u∣Su)]≥E[f(S∪T)]−p E[f(S)].\begin{aligned} \mathbb E[f(S)] &\ge \mathbb E[f(S\cup T)] - \sum_{u \in \mathcal N} \mathbb E\big[|O_u \setminus S|\cdot f(u\mid S_u)\big] \\ &\ge \mathbb E[f(S\cup T)] - \frac{p}{p+1}\sum_{u\in\mathcal N} \mathbb E\big[X_u\, f(u \mid S_u)\big] \\ &\ge \mathbb E[f(S\cup T)] - p\,\mathbb E[f(S)]. \end{aligned}E[f(S)]​≥E[f(S∪T)]−u∈N∑​E[∣Ou​∖S∣⋅f(u∣Su​)]≥E[f(S∪T)]−p+1p​u∈N∑​E[Xu​f(u∣Su​)]≥E[f(S∪T)]−pE[f(S)].​

Combined with E[f(S∪OPT)]≥f(OPT)\mathbb E[f(S \cup \mathrm{OPT})] \ge f(\mathrm{OPT})E[f(S∪OPT)]≥f(OPT) (monotone case) or E[f(S∪OPT)]≥(1−q)f(OPT)\mathbb E[f(S\cup\mathrm{OPT})] \ge (1 - q) f(\mathrm{OPT})E[f(S∪OPT)]≥(1−q)f(OPT) (Lemma 3), and with Lemma 4, it yields the ratios p+1p+1p+1 and (p+1)2/p(p+1)^2/p(p+1)2/p of Theorem 1.

Formalization Note The three inequalities of the display are stated as a conjunction, in the order printed.

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

/-- The display of §4.1.1 (p. 14). With `q = 1/(p+1)`, for Algorithm 2 run from an independent `T`
(OPT), non-negative submodular `f` and a `p`-extendible system:
`E[f(S)] ≥ E[f(S ∪ T)] − ∑_u E[|O_u \ S| · f(u | S_u)]
  ≥ E[f(S ∪ T)] − p/(p+1) ∑_u E[X_u · f(u | S_u)] ≥ E[f(S ∪ T)] − p · E[f(S)]`. -/
theorem display_4_1_1 {α : Type} [Fintype α] [LinearOrder α] (f : Finset α → ℝ)
    (I : Finset α → Prop) (p : ℕ) (hp : 1 ≤ p) (hf0 : ∀ S, 0 ≤ f S)
    (hsub : NonmonotoneSubmod.Shared.Submodular f) (hI : IsIndepSystem I)
    (hext : IsPExtendible p I) (T : Finset α) (hT : I T) :
    E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f (st.S ∪ T)) -
        ∑ u : α, E2 (1 / ((p : ℝ) + 1)) f I T
          (fun st => ((st.Ou u \ st.S).card : ℝ) * marg f u (st.Su u)) ≤
      E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f st.S) ∧
    E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f (st.S ∪ T)) -
        ((p : ℝ) / ((p : ℝ) + 1)) * ∑ u : α, E2 (1 / ((p : ℝ) + 1)) f I T
          (fun st => (if u ∈ st.considered then (1 : ℝ) else 0) * marg f u (st.Su u)) ≤
      E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f (st.S ∪ T)) -
        ∑ u : α, E2 (1 / ((p : ℝ) + 1)) f I T
          (fun st => ((st.Ou u \ st.S).card : ℝ) * marg f u (st.Su u)) ∧
    E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f (st.S ∪ T)) -
        (p : ℝ) * E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f st.S) ≤
      E2 (1 / ((p : ℝ) + 1)) f I T (fun st => f (st.S ∪ T)) -
        ((p : ℝ) / ((p : ℝ) + 1)) * ∑ u : α, E2 (1 / ((p : ℝ) + 1)) f I T
          (fun st => (if u ∈ st.considered then (1 : ℝ) else 0) * marg f u (st.Su u)) := by sorry

end SubsampleSubmod.SampleGreedy
Source
Harshaw et al., arXiv:2104.02772v1, p. 14, §4.1.1 (unnumbered display in the proof of Theorem 1, submodular objectives)
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