Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1: average neighborhood size of attached sets, 1∣S∣∑W∈Sd(W)≥ke∣S∣1/k\frac1{|S|}\sum_{W\in S}d(W)\ge\frac ke|S|^{1/k}∣S∣1​∑W∈S​d(W)≥ek​∣S∣1/k

Proved
RGMISFast.lemma_5_1

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theorylocal-computationp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandomized-greedy-mis

Let HHH be a finite graph containing u∗u^*u∗, let k≥1k\ge1k≥1, and let SSS be a nonempty family of distinct kkk-sets attached to the root. Then

1∣S∣∑W∈Sd(W)≥ke ∣S∣1/k,(18)\frac1{|S|}\sum_{W\in S}d(W)\ge\frac ke\,|S|^{1/k}, \tag{18}∣S∣1​W∈S∑​d(W)≥ek​∣S∣1/k,(18)

where d(W)d(W)d(W) counts the vertices of WWW together with all vertices adjacent to WWW or to u∗u^*u∗, not counting u∗u^*u∗.

Many attached sets force a large average neighbourhood; this is the deterministic input of Lemma 5.2.

Formalization Note SSS is a finite family of vertex sets, each of size kkk and attached to {u∗}\{u^*\}{u∗} (so it avoids u∗u^*u∗); ∣S∣1/k|S|^{1/k}∣S∣1/k is the real power.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_RGMISFast_IsRootConnected

set_option autoImplicit false

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace RGMISFast

/-- Lemma 5.1 (Average Neighborhood Size of Attached Sets; Dalirrooyfard, Makarychev, Mitrović, Ramachandran, *Randomized Greedy MIS Is Fast at Every Node*,
STOC 2027 submission (manuscript sha256 e93cdfec…), p.17, proof in §5.3): let `H` be a
finite graph containing `u∗`, let `k ≥ 1`, and let `S` be a nonempty family of distinct `k`-sets
attached to the root. Then `(1/|S|) Σ_{W∈S} d(W) ≥ (k/e) |S|^{1/k}` (18).

**Formalization Note** `H` is a simple graph on a finite vertex type containing `u`; `S` is a
finset of finsets (so its members are distinct), each of size `k` and attached to `{u}` (in
particular not containing `u`). `|S|^{1/k}` is the real power. Deterministic: no ranks. -/
theorem lemma_5_1 {V : Type*} [Fintype V] [DecidableEq V] (H : SimpleGraph V) (u : V) (k : ℕ)
    (hk : 1 ≤ k) (S : Finset (Finset V)) (hS : S.Nonempty)
    (hSk : ∀ W ∈ S, W.card = k ∧ IsAttached H {u} W) :
    (k / Real.exp 1) * (S.card : ℝ) ^ (1 / (k : ℝ)) ≤
      (1 / (S.card : ℝ)) * ∑ W ∈ S, (dW H u W : ℝ) := by sorry

end RGMISFast
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, STOC 2027 submission (manuscript sha256 e93cdfecc03618969d5f2ecf8171c6f84c528edcc473b2f864299e555f823664), Lemma 5.1, eq. (18), p.17 (PDF p.19); proof in §5.3, pp.21–22
Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 6, 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