Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rounding: a fractional point of ℓ1\ell_1ℓ1​-norm at most kkk rounds to a set worth at least F(x)F(x)F(x)

Proved
StreamSubmod.rounding

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

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

Let f:2V→Rf:2^V\to\mathbb Rf:2V→R be submodular, with multilinear extension FFF, and let x∈[0,1]Vx\in[0,1]^Vx∈[0,1]V satisfy ∥x∥1≤k\|x\|_1\le k∥x∥1​≤k. Then there is a set AAA contained in the support of xxx, with ∣A∣≤k|A|\le k∣A∣≤k, such that

f(A)≥F(x).f(A)\ge F(x).f(A)≥F(x).

The proof of Lemma 6 applies this to the vector (b1S^i)∨1OPT∖O(b\mathbf 1_{\hat S_i})\vee\mathbf 1_{\mathrm{OPT}\setminus O}(b1S^i​​)∨1OPT∖O​, citing Pipage Rounding and Swap Rounding. It turns a fractional solution into a feasible input for the guarantee of OfflineAlg.

Differences from the source:

  • generalization: the vector (b1_Ŝi) ∨ 1_{OPT\O}, whose support lies in Ŝi ∪ (OPT \ O) → every x ∈ [0,1]^V with ‖x‖₁ ≤ k, and a set inside the support of x; reason: the page uses only ‖x‖₁ ≤ k and this support property, and the instance is a special case
Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_NonmonotoneSubmod_Shared_F
Formal statement
namespace StreamSubmod

open NonmonotoneSubmod.Shared in
/-- Rounding (Alaluf, Ene, Feldman, Nguyen & Suh, arXiv:1911.12959v3, proof of Lemma 6, p.9,
"standard rounding techniques such as Pipage Rounding [13] and Swap Rounding [18] can be used"):
for a submodular `f`, every fractional point `x ∈ [0,1]^E` with `‖x‖₁ ≤ k` can be rounded to a set
`A` inside the support of `x`, with `|A| ≤ k` and `f(A) ≥ F(x)`.

**Formalization Note.** The proof of Lemma 6 applies this to `x = (b𝟏_{Ŝᵢ}) ∨ 𝟏_{OPT\O}`. -/
theorem rounding {E : Type} [Fintype E] [DecidableEq E] (f : Finset E → ℝ) (hf : Submodular f)
    (k : ℕ) (x : E → ℝ) (hx0 : ∀ e, 0 ≤ x e) (hx1 : ∀ e, x e ≤ 1)
    (hxk : ∑ e, x e ≤ (k : ℝ)) :
    ∃ A : Finset E, (∀ e ∈ A, 0 < x e) ∧ A.card ≤ k ∧ F f x ≤ f 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, proof of Lemma 6, p.9, "standard rounding techniques such as Pipage Rounding [13] and Swap Rounding [18] can be used"
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