Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The query counter equals the number of fresh trace events

Proved
RGMISFast.count_eq_fresh_trace

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

For every finite ordered graph, root u and real rank vector r,

Q(u)=∣{e∈trace(u):e.fresh}∣.Q(u)=|\{e\in\mathrm{trace}(u):e.\mathrm{fresh}\}|.Q(u)=∣{e∈trace(u):e.fresh}∣.

This is an equality of the operational counter with the length of the fresh-event list, including multiplicity. It does not assert distinctness of fresh callees. It supplies the counting clause of Observation 2.2.

Preamble
import Definitions.Def_RGMISFast_tau
open RGMISFast
set_option autoImplicit false
Formal statement
theorem RGMISFast.count_eq_fresh_trace {V : Type*} [Fintype V] [LinearOrder V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (u : V) (r : V → ℝ) :
    (((run G r u).2.trace.filter (fun e => e.fresh)).map (fun e => e.callee)).length = Q G u r := by sorry
Source
Randomized Greedy MIS Is Fast at Every Node, Observation 2.2 p.11, Appendix B p.30; explicit operational correctness/counting clause. Generalized by omitting unused distinctness and nonnegativity assumptions.

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