Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5: the average solution is nearly as good as O∪AO\cup AO∪A

Proved
StreamSubmod.lemma_5

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1streaming-algorithmssubmodular-maximization

Let fff be non-negative and submodular, let τ≥0\tau\ge0τ≥0, and let S^1,…,S^p\hat S_1,\dots,\hat S_pS^1​,…,S^p​ be the final sets of Algorithm 1. Let O=OPT∖⋃i=1pS^iO=\mathrm{OPT}\setminus\bigcup_{i=1}^p\hat S_iO=OPT∖⋃i=1p​S^i​ and b=∣O∣/kb=|O|/kb=∣O∣/k. If ∣S^i∣<k|\hat S_i|<k∣S^i​∣<k for every integer 1≤i≤p1\le i\le p1≤i≤p, then for every fixed set A⊆VA\subseteq VA⊆V,

p−1∑i=1pf(S^i∪A) ≥ (1−p−1) f(O∪A)−αbτ1+α.p^{-1}\sum_{i=1}^p f(\hat S_i\cup A)\ \ge\ (1-p^{-1})\,f(O\cup A)-\frac{\alpha b\tau}{1+\alpha}.p−1i=1∑p​f(S^i​∪A) ≥ (1−p−1)f(O∪A)−1+ααbτ​.

With A=∅A=\varnothingA=∅ this bounds the average value of the solutions; with A=OPT∖OA=\mathrm{OPT}\setminus OA=OPT∖O it is an input to Lemma 6.

Differences from the source:

  • generalization: OPT is an optimal solution → OPT is an arbitrary subset of V; reason: the proof uses only that the elements of O were rejected
  • generalization: the standing assumption (1−ε/2)·f(OPT) ≤ τ ≤ f(OPT) of §3 → 0 ≤ τ; reason: the standing assumption implies this, since ε ≤ 1 and f ≥ 0, and the proof uses nothing more
  • encoding: the elements of V arrive one at a time, in an arbitrary order → a duplicate-free list σ containing every element of E, for every such list; reason: this is a single pass over V; no arrival order is excluded
  • encoding: "if there are multiple options for i, pick an arbitrary one" → the smallest admissible index i, the same rule in Algorithms 1 and 2; reason: the paper leaves the rule free, and Corollary 16 needs both algorithms to choose alike
  • encoding: k is a cardinality bound, never stated to be positive → the hypothesis 1 ≤ k; reason: this excludes only k = 0, where the threshold cτ/k is undefined
Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_StreamSubmod_optVal
import Definitions.Def_StreamSubmod_IsStream
import Definitions.Def_StreamSubmod_IsApproxOffline
import Definitions.Def_StreamSubmod_Algorithm1
Formal statement
namespace StreamSubmod

open NonmonotoneSubmod.Shared in
/-- Lemma 5 (Alaluf, Ene, Feldman, Nguyen & Suh, arXiv:1911.12959v3, p.8): with
`O = OPT \ ⋃ᵢ Ŝᵢ` and `b = |O|/k`, if `|Ŝᵢ| < k` for every `1 ≤ i ≤ p`, then for every fixed set
`A ⊆ V`, `p⁻¹ · ∑ᵢ f(Ŝᵢ ∪ A) ≥ (1 - p⁻¹) · f(O ∪ A) - αbτ/(1 + α)`.

**Formalization Note.** `OPT` is an arbitrary set here, and the only condition on the estimate is
`0 ≤ τ`. -/
theorem lemma_5 {E : Type} [Fintype E] [DecidableEq E] (f : Finset E → ℝ) (hf0 : ∀ S, 0 ≤ f S)
    (hf : Submodular f) (k : ℕ) (hk : 1 ≤ k) (α : ℝ) (hα0 : 0 < α) (hα1 : α ≤ 1) (p : ℕ)
    (hp : 1 ≤ p) (τ : ℝ) (hτ : 0 ≤ τ) (σ : List E) (hσ : IsStream σ) (OPT : Finset E)
    (hlt : ∀ i, (alg1Sets p f k α τ σ i).card < k) (A : Finset E) :
    let S := alg1Sets p f k α τ σ
    let O := OPT \ Finset.univ.biUnion S
    let b : ℝ := (O.card : ℝ) / (k : ℝ)
    (1 - (p : ℝ)⁻¹) * f (O ∪ A) - α * b * τ / (1 + α) ≤ (p : ℝ)⁻¹ * ∑ i, f (S i ∪ A) := by sorry

end StreamSubmod
Source
Alaluf, Ene, Feldman, Nguyen & Suh, An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint, arXiv:1911.12959v3, Lemma 5, p.8
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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