Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite exponential expansions for the root count and destruction rate

Proved
RGMISFast.root_count_arrival_expansion

by srikkanthr · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

probabilityrandomized-greedy-mis

Fix k≥1k\ge1k≥1, a time horizon t>0t>0t>0, and a prescribed root rank ρ≥t\rho\ge tρ≥t. There are a finite degree nnn and real coefficients cjc_jcj​ such that, for every s∈[0,t]s\in[0,t]s∈[0,t],

E[Yk(s)∣r(u)=ρ]=∑j=0ncje−js,\mathbb E[Y_k(s)\mid r(u)=\rho]=\sum_{j=0}^n c_j e^{-js},E[Yk​(s)∣r(u)=ρ]=j=0∑n​cj​e−js, E[∑Wds(W)∣r(u)=ρ]=∑j=0njcje−js.\mathbb E[\sum_W d_s(W)\mid r(u)=\rho]=\sum_{j=0}^n j c_j e^{-js}.E[W∑​ds​(W)∣r(u)=ρ]=j=0∑n​jcj​e−js.

The coefficients are not required to be nonnegative. Both expectations use the explicit product law with fixed root rank and independent exponential non-root ranks.

This algebraic auxiliary formulation isolates the finite-arrival-order calculation in the proof of Equation (20). The paper observes that the expected count is a polynomial in e−se^{-s}e−s, obtained by summing over arrival sets and their relative orders. The paired coefficient identity expresses the destruction-rate calculation for that same finite process. Unlike the target, this auxiliary statement contains no derivative or limiting assertion: termwise differentiation of the finite expansion is proved separately. The closed interval is appropriate because ranks equal to the checkpoint remain active there.

Preamble
import Mathlib
import Definitions.Def_RGMISFast_Y
import Definitions.Def_RGMISFast_condLaw

set_option autoImplicit false

open MeasureTheory ProbabilityTheory
open scoped ENNReal
open RGMISFast
Formal statement
theorem RGMISFast.root_count_arrival_expansion {V : Type*} [Fintype V] [LinearOrder V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (u : V) (k : ℕ) (hk : 1 ≤ k)
    (t ρ : ℝ) (ht : 0 < t) (htρ : t ≤ ρ) :
    ∃ (n : ℕ) (coeff : ℕ → ℝ),
      (∀ s ∈ Set.Icc 0 t,
        (∫ r, (Y G u k s r : ℝ) ∂(rootLaw u ρ)) =
          ∑ j ∈ Finset.range (n+1), coeff j * Real.exp (-(j:ℝ)*s)) ∧
      (∀ s ∈ Set.Icc 0 t,
        (∫ r, (dsSum G u k s r : ℝ) ∂(rootLaw u ρ)) =
          ∑ j ∈ Finset.range (n+1), (j:ℝ)*coeff j * Real.exp (-(j:ℝ)*s)) := by sorry
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, §5.1, proof of Lemma 5.2, printed pp.18–19 (PDF pp.20–21), polynomial-in-exp(-s) observation and the short-window destruction calculation yielding Equation (20). Auxiliary finite exponential-basis reformulation.

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