Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2: top component, ∣C0∣≤1+L|C_0|\le1+L∣C0​∣≤1+L w.p. ≥1−e−L\ge1-e^{-L}≥1−e−L, and S0(Ta0)=∣V(Ta0)∣≤1+LS_0(T_{a_0})=|V(T_{a_0})|\le1+LS0​(Ta0​​)=∣V(Ta0​​)∣≤1+L

Proved
RGMISFast.lemma_3_2

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

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

Let GGG be a finite simple graph with root u∗u^*u∗ and i.i.d. Exp(1) ranks, and let LLL be a real number (the source's deviation parameter of §3 has L≥8L\ge8L≥8). With probability at least 1−e−L1-e^{-L}1−e−L,

∣C0∣≤1+L.(11)|C_0|\le 1+L. \tag{11}∣C0​∣≤1+L.(11)

Conditioned on this event, every admissible tree satisfies

S0(Ta0)=∣V(Ta0)∣≤1+L.S_0(T_{a_0})=|V(T_{a_0})|\le 1+L .S0​(Ta0​​)=∣V(Ta0​​)∣≤1+L.

This initializes the recurrence of Proposition 4.1 at the top interval [a0,∞)[a_0,\infty)[a0​,∞).

Formalization Note The second clause is deterministic: for every rank vector with distinct nonnegative ranks satisfying (11), and every admissible tree. LLL is any real number; the source's case is L≥8L\ge8L≥8.

Differences from the source:

  • encoding: with probability at least 1 − e^{−L} → the (outer) measure of {|C₀| > 1 + L} is at most e^{−L}; reason: equivalent for a probability measure
  • encoding: conditioned on this event (ranks distinct, in [0, ∞), standing assumption of §2) → for every injective nonnegative rank vector satisfying (11); reason: a deterministic statement on the event; the standing assumption holds almost surely
  • generalization: L the deviation parameter of §3, L ≥ 8 (fixed in Lemma 3.1) → every real L; reason: the proof (k = ⌊L⌋ + 1, §6.3) works for every L ≥ 0, the probability bound is trivial for L < 0 (e^{−L} > 1), and the deterministic clause holds for every L since V(T_{a₀}) ⊆ C₀; L ≥ 8 is a special case
Preamble
import Mathlib
import Definitions.Def_RGMISFast_AdmissibleTree
import Definitions.Def_RGMISFast_GoodEvent
import Definitions.Def_RGMISFast_rankLaw

set_option autoImplicit false

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace RGMISFast

/-- Lemma 3.2 (Top Component; Dalirrooyfard, Makarychev, Mitrović, Ramachandran, *Randomized Greedy MIS Is Fast at Every Node*,
STOC 2027 submission (manuscript sha256 e93cdfec…), p.14, proof in §6.3): with probability at least `1 − e^{−L}`,
`|C₀| ≤ 1 + L` (11); conditioned on this event, every admissible tree satisfies
`S₀(T_{a₀}) = |V(T_{a₀})| ≤ 1 + L`.

**Formalization Note** `L` is any real number: §3 fixes the deviation parameter `L ≥ 8` in
Lemma 3.1, and the proof of Lemma 3.2 (`k = ⌊L⌋ + 1`, §6.3) works for every `L ≥ 0`, while for
`L < 0` the bound `e^{−L} > 1` is trivial; the case `L ≥ 8` is the source's. The first clause bounds the
(outer) measure of `{|C₀| > 1 + L}` under the i.i.d. Exp(1) rank law; the second is
deterministic, for every rank vector with distinct nonnegative ranks (standing assumption of §2)
satisfying (11). `T_{a₀}` is `T.prefix (am 0)` (`a_0 = a₀`). No degree bound is involved. -/
theorem lemma_3_2 {V : Type*} [Fintype V] [LinearOrder V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (u : V) (L : ℝ) :
    rankLaw V {r | ¬ TopEvent G u L r} ≤ ENNReal.ofReal (Real.exp (-L)) ∧
    ∀ r : V → ℝ, Function.Injective r → (∀ v, 0 ≤ r v) → TopEvent G u L r →
      ∀ T : AdmissibleTree G r u,
        Sm r (T.prefix (am 0)) 0 = ((T.prefix (am 0)).card : ℝ) ∧
        ((T.prefix (am 0)).card : ℝ) ≤ 1 + L := by sorry

end RGMISFast
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, STOC 2027 submission (manuscript sha256 e93cdfecc03618969d5f2ecf8171c6f84c528edcc473b2f864299e555f823664), Lemma 3.2, eq. (11), p.14 (PDF p.16); proof in §6.3, pp.25–26
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