Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 13 — with q = 1/(p+1), E[|O_u ∖ S| · f(u | S_u)] ≤ p/(p+1) · E[X_u f(u | S_u)] (5)

Proved
SubsampleSubmod.SampleGreedy.lemma_7

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

p-extendible-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithmssubmodular-maximization

Let (N,I)(\mathcal N, \mathcal I)(N,I) be a ppp-extendible independence system with p≥1p \ge 1p≥1, T∈IT \in \mathcal IT∈I and fff a set function. Run Algorithm 2 from O=TO = TO=T with every coin showing 111 independently with probability q=1p+1q = \frac{1}{p+1}q=p+11​, and let XuX_uXu​ indicate that uuu is considered. Then for every element u∈Nu \in \mathcal Nu∈N,

E[∣Ou∖S∣⋅f(u∣Su)]  ≤  pp+1 E[Xu f(u∣Su)].(5)\mathbb E\big[|O_u \setminus S| \cdot f(u \mid S_u)\big] \;\le\; \frac{p}{p+1}\,\mathbb E\big[X_u\, f(u \mid S_u)\big]. \tag{5}E[∣Ou​∖S∣⋅f(u∣Su​)]≤p+1p​E[Xu​f(u∣Su​)].(5)

This is where the choice q=1/(p+1)q = 1/(p+1)q=1/(p+1) balances the elements of OPT that may be lost against the gains of the considered elements.

Formalization Note ∣Ou∖S∣|O_u \setminus S|∣Ou​∖S∣ is a natural number cast to R\mathbb RR; the expectations are exact sums over the 2n2^n2n coin outcomes.

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

/-- Lemma 7 (p. 13), inequality (5). With sampling probability `q = 1/(p+1)`, for every element `u`:
`E[|O_u \ S| · f(u | S_u)] ≤ p/(p+1) · E[X_u f(u | S_u)]`, where `X_u` indicates that `u` is
considered by Algorithm 2 (run from an independent `T`, over a `p`-extendible system). -/
theorem lemma_7 {α : Type} [Fintype α] [LinearOrder α] (f : Finset α → ℝ)
    (I : Finset α → Prop) (p : ℕ) (hp : 1 ≤ p) (hI : IsIndepSystem I)
    (hext : IsPExtendible p I) (T : Finset α) (hT : I T) (u : α) :
    E2 (1 / ((p : ℝ) + 1)) f I T
        (fun st => ((st.Ou u \ st.S).card : ℝ) * marg f u (st.Su u)) ≤
      ((p : ℝ) / ((p : ℝ) + 1)) *
        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. 13, Lemma 7, inequality (5)
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