Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, p. 14 — q · Σ_{u∈𝒩} E[X_u f(u | S_u)] ≤ E[f(S)]

Proved
SubsampleSubmod.SampleGreedy.lemma_8

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithmssubmodular-maximization

Let fff be non-negative, I\mathcal II any family of sets, TTT any set, and q∈[0,1]q \in [0,1]q∈[0,1]. Run Algorithm 2 from O=TO = TO=T with every coin showing 111 independently with probability qqq, and let XuX_uXu​ indicate that uuu is considered. Then

q⋅∑u∈NE[Xu f(u∣Su)]  ≤  E[f(S)].q \cdot \sum_{u \in \mathcal N} \mathbb E\big[X_u\, f(u \mid S_u)\big] \;\le\; \mathbb E[f(S)].q⋅u∈N∑​E[Xu​f(u∣Su​)]≤E[f(S)].

Each considered element is kept with probability qqq, and the value of SSS is f(∅)f(\emptyset)f(∅) plus the gains of the kept elements; this lemma converts the right-hand sides of Lemmas 7 and 10 back into the expected value of the output.

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

/-- Lemma 8 (p. 14). For non-negative `f` and sampling probability `q ∈ [0, 1]`:
`q · ∑_{u ∈ 𝒩} E[X_u f(u | S_u)] ≤ E[f(S)]` for Algorithm 2 (any comparison set `T`). -/
theorem lemma_8 {α : Type} [Fintype α] [LinearOrder α] (f : Finset α → ℝ)
    (I : Finset α → Prop) (hf0 : ∀ S, 0 ≤ f S) (q : ℝ) (hq0 : 0 ≤ q) (hq1 : q ≤ 1)
    (T : Finset α) :
    q * ∑ u : α, E2 q f I T
        (fun st => (if u ∈ st.considered then (1 : ℝ) else 0) * marg f u (st.Su u)) ≤
      E2 q f I T (fun st => f st.S) := by sorry

end SubsampleSubmod.SampleGreedy
Source
Harshaw et al., arXiv:2104.02772v1, p. 14, Lemma 8
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