Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.2 — relative clipping: (1 − 2/√K) min{1, ℓ} ≤ E min{K, N}/K ≤ min{1, ℓ}

Proved
OptimalLCA.Matching.lemma_7_2

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

local-computation-algorithmsmatchingp2o-gran-per-chapterp2o-plan-paperp2o-v1sublinear-algorithms

If NNN is a sum of independent Bernoulli variables with mean KℓK\ellKℓ, for an integer K≥1K\ge1K≥1, then

(1−2K)min⁡{1,ℓ}≤Emin⁡{K,N}K≤min⁡{1,ℓ}.\Big(1-\frac2{\sqrt K}\Big)\min\{1,\ell\}\le\frac{\mathbb E\min\{K,N\}}K\le\min\{1,\ell\}.(1−K​2​)min{1,ℓ}≤KEmin{K,N}​≤min{1,ℓ}.

It bounds the loss from capping each vertex's incoming proposals at KKK (Corollary 7.3).

Differences from the source:

  • encoding: N a sum of independent Bernoulli variables → N = Σ_{i<m} X_i with X_i measurable, {0,1}-valued and mutually independent on a probability space; reason: finitely many summands, any biases
Preamble
import Mathlib

open MeasureTheory ProbabilityTheory
Formal statement
namespace OptimalLCA.Matching

/-- Lemma 7.2 (relative clipping). If `N` is a sum of independent Bernoulli variables with
mean `Kℓ`, for an integer `K ≥ 1`, then
`(1 - 2/√K) min{1, ℓ} ≤ E min{K, N} / K ≤ min{1, ℓ}`. -/
theorem lemma_7_2 {Ω : Type*} [MeasureSpace Ω] [IsProbabilityMeasure (volume : Measure Ω)]
    (m : ℕ) (X : Fin m → Ω → ℝ) (hXm : ∀ i, Measurable (X i))
    (hX01 : ∀ i ω, X i ω = 0 ∨ X i ω = 1) (hind : iIndepFun X)
    (K : ℕ) (hK : 1 ≤ K) (ℓ : ℝ) (hmean : ∫ ω, ∑ i, X i ω = (K : ℝ) * ℓ) :
    (1 - 2 / Real.sqrt K) * min 1 ℓ ≤ (∫ ω, min (K : ℝ) (∑ i, X i ω)) / K ∧
      (∫ ω, min (K : ℝ) (∑ i, X i ω)) / K ≤ min 1 ℓ := by sorry

end OptimalLCA.Matching
Source
Cohen, Roghani, Optimal LCA and Sublinear Estimation for Bipartite Matching in Δ^O(1/ε) Queries, arXiv:2611.06024 (version not printed; PDF sha256 5a43ec12…3eb3), p. 39, Lemma 7.2
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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