Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5, p. 11 — throughout Algorithm 2, O is independent, S ⊆ O, and O ∖ S consists of unconsidered elements

Proved
SubsampleSubmod.SampleGreedy.lemma_5

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

greedy-algorithmsindependence-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-maximization

Let (N,I)(\mathcal N, \mathcal I)(N,I) be an independence system, T∈IT \in \mathcal IT∈I, fff any set function and BBB any outcome of the coins. Run Algorithm 2 from O=TO = TO=T. After every number j≥0j \ge 0j≥0 of iterations the following hold:

  1. (P1) O∈IO \in \mathcal IO∈I;
  2. (P2) S⊆OS \subseteq OS⊆O;
  3. (P3) every element of O∖SO \setminus SO∖S has not yet been considered by Algorithm 2.

These invariants are what make the removal step of line 6 well defined and drive the deterministic bound of Lemma 6.

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

/-- Lemma 5 (p. 11). Throughout Algorithm 2 (after every number `j` of iterations), started from an
independent `T`: (P1) `O` is independent; (P2) `S ⊆ O`; (P3) every element of `O \ S` has not yet
been considered. -/
theorem lemma_5 {α : Type} [Fintype α] [LinearOrder α] (f : Finset α → ℝ)
    (I : Finset α → Prop) (hI : IsIndepSystem I) (T : Finset α) (hT : I T) (B : Finset α)
    (j : ℕ) :
    I ((alg2Step f I B)^[j] (alg2Init T)).O ∧
    ((alg2Step f I B)^[j] (alg2Init T)).S ⊆ ((alg2Step f I B)^[j] (alg2Init T)).O ∧
    ∀ v ∈ ((alg2Step f I B)^[j] (alg2Init T)).O \ ((alg2Step f I B)^[j] (alg2Init T)).S,
      v ∉ ((alg2Step f I B)^[j] (alg2Init T)).considered := by sorry

end SubsampleSubmod.SampleGreedy
Source
Harshaw et al., arXiv:2104.02772v1, p. 11, Lemma 5 (properties P1–P3)
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