Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3, p. 17 — truncated-sketch coverage is monotone submodular

Proved
CostlySeeding.EdgeQuery.submodular

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

edge-queriesindependent-cascadeinfluence-maximizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithms

For any fixed output of PROBE with positive sampling rate ρ\rhoρ, a positive number TTT of copies and positive truncation threshold τ\tauτ, the truncated-sketch objective Γρ,τ(T)\Gamma^{(T)}_{\rho,\tau}Γρ,τ(T)​ is a monotone submodular function of the seed set. In particular, for seed sets S⊆US\subseteq US⊆U and arbitrary seed sets A,BA,BA,B,

Γρ,τ(T)(S)≤Γρ,τ(T)(U),Γρ,τ(T)(A∪B)+Γρ,τ(T)(A∩B)≤Γρ,τ(T)(A)+Γρ,τ(T)(B).\Gamma^{(T)}_{\rho,\tau}(S)\le\Gamma^{(T)}_{\rho,\tau}(U),\qquad \Gamma^{(T)}_{\rho,\tau}(A\cup B)+\Gamma^{(T)}_{\rho,\tau}(A\cap B)\le\Gamma^{(T)}_{\rho,\tau}(A)+\Gamma^{(T)}_{\rho,\tau}(B).Γρ,τ(T)​(S)≤Γρ,τ(T)​(U),Γρ,τ(T)​(A∪B)+Γρ,τ(T)​(A∩B)≤Γρ,τ(T)​(A)+Γρ,τ(T)​(B).

These are the structural properties needed for the stochastic-greedy approximation guarantee.

Formalization Note The page explicitly states submodularity; monotonicity is included because the same coverage representation gives it.

Preamble
import Definitions.Def_CostlySeeding_EdgeQuery_Algorithm
Formal statement
namespace CostlySeeding.EdgeQuery

theorem submodular (n T tau : ℕ) (hT : 0 < T) (htau : 0 < tau)
    (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (Vrho : Finset (Fin n)) (rho : ℝ) (hrho : 0 < rho)
    (ss : Fin T → ProbeSeed n) :
    MonotoneSet (GamCut G Vrho rho tau ss) ∧
      SubmodularSet (GamCut G Vrho rho tau ss) := by sorry

end CostlySeeding.EdgeQuery
Source
Eckles, Esfandiari, Mossel & Rahimian, Seeding with Costly Network Information, arXiv:1905.04325v5, p. 17, §3.3 paragraph before Lemma 4
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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