Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 3.15 — nonzero mass under independent Bernoulli coordinates

Proved
BarelyTestable.LowerBound.bernoulli_nonzero

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

lowerboundp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1property-testingsubmodularity

Let ℓ≥1\ell\ge1ℓ≥1, let f:{0,1}ℓ→Rf:\{0,1\}^\ell\to\mathbb Rf:{0,1}ℓ→R be submodular with f(0)>0f(0)>0f(0)>0, and let WWW have independent coordinates with probabilities qi∈[0,1]q_i\in[0,1]qi​∈[0,1]. Then

Pr⁡[f(W)≠0]≥min⁡i∈[ℓ]min⁡(qi,1−qi).\Pr[f(W)\ne0]\ge\min_{i\in[\ell]}\min(q_i,1-q_i).Pr[f(W)=0]≥i∈[ℓ]min​min(qi​,1−qi​).

The probabilities may differ by coordinate, and zero and one are allowed. This gives a lower bound on the support of a real submodular function without imposing a global sign condition.

Differences from the source:

  • encoding: Boolean vectors with coordinates numbered from 1 → finite subsets of Fin n, numbered from 0; reason: the incidence-vector bijection preserves every vertex, union, intersection and coordinate square
  • encoding: the law of independent Bernoulli coordinates → the exact product-weight sum over all subsets; reason: independence determines this law uniquely, so every source random vector has precisely this probability; the finite minimum initialized at one equals the stated minimum for ℓ ≥ 1
Preamble
import Mathlib
import Definitions.Def_BarelyTestable_LowerBound_Cube

set_option autoImplicit false
Formal statement
namespace BarelyTestable.LowerBound

open NonmonotoneSubmod.Shared MeasureTheory

/-- Claim 3.15, p.19: independent, nonidentical Bernoulli probabilities, including endpoints. -/
theorem bernoulli_nonzero {ℓ : ℕ} (hℓ : 1 ≤ ℓ) (f : Oracle (Fin ℓ))
    (hf : Submodular f) (h0 : 0 < f ∅) (q : Fin ℓ → ℝ)
    (hq : ∀ i, 0 ≤ q i ∧ q i ≤ 1) :
    minBias q ≤ bernoulliProb q (fun S => f S ≠ 0) := by sorry

end BarelyTestable.LowerBound
Source
Diptaksho Palit, Yuichi Yoshida, STOC 2027 submission #722 (October 2026), Claim 3.15, p. 19 (printed = PDF page); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/722.pdf; PDF SHA256 a095e6ef801edf5b0ce3967efca977e04b7a0b4374e874116509d73837bd14f3
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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