Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.1: size of admissible trees, Sm(Tam)≤3L(a0/am)3256mS_m(T_{a_m})\le 3L(a_0/a_m)^3256^mSm​(Tam​​)≤3L(a0​/am​)3256m

Proved
RGMISFast.proposition_4_1

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

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

Let GGG be a finite simple graph with all degrees at most Δ≥2\Delta\ge2Δ≥2, root u∗u^*u∗ and distinct ranks r:V→[0,∞)r:V\to[0,\infty)r:V→[0,∞); let h≥0h\ge0h≥0, L=h+8L=h+8L=h+8, and suppose the ranks lie in EhE_hEh​. Then every admissible tree TTT satisfies, for 0≤m≤M0\le m\le M0≤m≤M,

Sm(Tam)≤3L(a0am)3256m,(14)S_m(T_{a_m})\le 3L\Big(\frac{a_0}{a_m}\Big)^3256^m, \tag{14}Sm​(Tam​​)≤3L(am​a0​​)3256m,(14)

and in particular

∣V(TaM)∣≤3L(a0aM)3256M.|V(T_{a_M})|\le 3L\Big(\frac{a_0}{a_M}\Big)^3256^M .∣V(TaM​​)∣≤3L(aM​a0​​)3256M.

Since M=O(log⁡Δ)M=O(\log\Delta)M=O(logΔ), this bounds the part of the tree with settling times at least aMa_MaM​ by a polynomial in Δ\DeltaΔ.

Formalization Note TamT_{a_m}Tam​​ is the prefix of nodes vvv with am≤τ(v)a_m\le\tau(v)am​≤τ(v); MMM is defined from Δ\DeltaΔ by (6). Both clauses are stated.

Differences from the source:

  • encoding: distinct ranks r : V → [0, ∞), the paper's standing assumption (§1.1, p.2; §2, p.10) → hypotheses Function.Injective r and ∀ v, 0 ≤ r v; reason: the standing assumption written as hypotheses; it holds almost surely
  • encoding: conditioned on E_h → for every rank vector satisfying GoodEvent G Δ u (h + 8); reason: a deterministic statement on the event, as in the proof
Preamble
import Mathlib
import Definitions.Def_RGMISFast_AdmissibleTree
import Definitions.Def_RGMISFast_GoodEvent

set_option autoImplicit false

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace RGMISFast

/-- Proposition 4.1 (Size of admissible trees; Dalirrooyfard, Makarychev, Mitrović, Ramachandran, *Randomized Greedy MIS Is Fast at Every Node*,
STOC 2027 submission (manuscript sha256 e93cdfec…), p.15, proof in App. C): conditioned on
`E_h`, every admissible tree `T` satisfies, for `0 ≤ m ≤ M`,
`S_m(T_{a_m}) ≤ 3L (a₀/a_m)^3 256^m` (14), and in particular
`|V(T_{a_M})| ≤ 3L (a₀/a_M)^3 256^M`.

**Formalization Note** `L = h + 8` with `h ≥ 0` (p.15); `E_h` is `GoodEvent G Δ u (h + 8)`;
`M = Mof Δ`. Ranks are distinct and nonnegative (standing assumption of §2), degrees are at most
`∆`, `∆ ≥ 2`. Both clauses are stated. -/
theorem proposition_4_1 {V : Type*} [Fintype V] [LinearOrder V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (Δ : ℕ) (hΔ : 2 ≤ Δ) (hdeg : ∀ v, G.degree v ≤ Δ) (u : V) (h : ℝ)
    (hh : 0 ≤ h) (r : V → ℝ) (hinj : Function.Injective r) (hnn : ∀ v, 0 ≤ r v)
    (hE : GoodEvent G Δ u (h + 8) r) (T : AdmissibleTree G r u) :
    (∀ m : ℕ, m ≤ Mof Δ →
      Sm r (T.prefix (am m)) m ≤ 3 * (h + 8) * (a0 / am m) ^ 3 * 256 ^ m) ∧
    ((T.prefix (am (Mof Δ))).card : ℝ) ≤
      3 * (h + 8) * (a0 / am (Mof Δ)) ^ 3 * 256 ^ (Mof Δ) := by sorry

end RGMISFast
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, STOC 2027 submission (manuscript sha256 e93cdfecc03618969d5f2ecf8171c6f84c528edcc473b2f864299e555f823664), Proposition 4.1, eq. (14), p.15 (PDF p.17); proof in App. C, pp.30–32
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