Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, p. 15 — for linear f with f(∅) = 0, f(S) ≥ f(OPT) − Σ_{u∈𝒩} [|O_u| − Y_u] f(u)

Proved
SubsampleSubmod.SampleGreedy.lemma_9

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

greedy-algorithmslinear-objectivesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-maximization

Let fff be linear with f(∅)=0f(\emptyset) = 0f(∅)=0, (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 of Algorithm 2 run from O=TO = TO=T, let Yu=1Y_u = 1Yu​=1 if uuu was added to SSS and u∉Ou \notin Ou∈/O at the beginning of the iteration in which uuu was considered, and Yu=0Y_u = 0Yu​=0 otherwise. Then

f(S)  ≥  f(T)  −  ∑u∈N[ ∣Ou∣−Yu ] f({u}).f(S) \;\ge\; f(T) \;-\; \sum_{u \in \mathcal N} \big[\,|O_u| - Y_u\,\big]\, f(\{u\}).f(S)≥f(T)−u∈N∑​[∣Ou​∣−Yu​]f({u}).

This is the sharper analogue of Lemma 6 for linear objectives, used in the proof of the ppp-approximation.

Formalization Note The hypothesis f(∅)=0f(\emptyset) = 0f(∅)=0 is added. As printed, without it, the inequality is false for linear functions with f(∅)>0f(\emptyset) > 0f(∅)>0: when an element vvv leaves OOO the value drops by f({v})−f(∅)f(\{v\}) - f(\emptyset)f({v})−f(∅), not by f({v})f(\{v\})f({v}), and ∣Ou∣−Yu=−1|O_u| - Y_u = -1∣Ou​∣−Yu​=−1 is possible. A five-element instance with f(∅)=5f(\emptyset) = 5f(∅)=5 gives f(S)=10<15f(S) = 10 < 15f(S)=10<15. Theorem 1's linear clause does not carry this hypothesis. ∣Ou∣−Yu|O_u| - Y_u∣Ou​∣−Yu​ is computed in R\mathbb RR.

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

/-- Lemma 9 (p. 15), with `f(∅) = 0` added. For linear `f` with `f(∅) = 0` and the final sets of
Algorithm 2 run from an independent `T` (OPT) with coin flips `B`:
`f(S) ≥ f(T) − ∑_{u ∈ 𝒩} (|O_u| − Y_u) f({u})`, where `Y_u = 1` iff `u` is added to `S` and `u ∉ O`
at the beginning of the iteration in which `u` is considered. As printed (without `f(∅) = 0`) the
inequality can fail. -/
theorem lemma_9 {α : Type} [Fintype α] [LinearOrder α] (f : Finset α → ℝ)
    (I : Finset α → Prop) (hlin : IsLinear f) (hf_empty : f ∅ = 0) (hI : IsIndepSystem I)
    (T : Finset α) (hT : I T) (B : Finset α) :
    f T - ∑ u : α, ((((alg2 f I T B).Ou u).card : ℝ) - (if u ∈ (alg2 f I T B).Y then (1 : ℝ) else 0)) *
        f {u} ≤
      f (alg2 f I T B).S := by sorry

end SubsampleSubmod.SampleGreedy
Source
Harshaw et al., arXiv:2104.02772v1, p. 15, Lemma 9 (definition of Y_u, p. 15; proof pp. 15–16)
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