Observation 2.2: the fresh calls of RGMIS form an admissible query tree with vertices
ProvedRGMISFast.observation_2_2graph-theorylocal-computationp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probabilityrandomized-greedy-mis
Let be a finite simple graph with distinct ranks and root , and run Procedure 1.1 from with an empty memo table. Then:
- every answer recorded in the memo table, and the answer returned for , is correct: it says whether the vertex lies in the greedy independent set ;
- (a) ranks strictly decrease along the stack of pending calls: every call made during the scan of goes to a neighbour with ;
- (b) each vertex is freshly called at most once, and the fresh calls form a tree rooted at with distinct vertices, the parent of a fresh call being the vertex whose scan made it;
- (c) if is a child of in this tree, then and .
In particular the query tree is an admissible tree with vertices, which reduces the goal theorem to bounding admissible trees.
Formalization Note The calls are the events of the trace of the run: the first event is the initial call at and every later event has a caller. Clause (b)–(c) asserts an admissible tree whose nodes are exactly the freshly called vertices and whose parent map sends each fresh callee to its caller.
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 rand∀ v, 0 ≤ r v; reason: the standing assumption written as hypotheses; it holds almost surely - encoding: the stack of pending calls and the query tree of the execution → the call trace of
run(caller, callee, fresh), the stack being the chain of callers; reason: the execution is an explicit recursion; the trace records exactly its invocations - generalization: properties (a)–(c) → (a)–(c) plus the correctness of all recorded and returned answers (App. B) and the shape of the trace (initial call first); reason: the added clauses are proved in App. B; dropping them gives the printed observation
Preamble
import Mathlib import Definitions.Def_RGMISFast_AdmissibleTree set_option autoImplicit false open MeasureTheory ProbabilityTheory open scoped ENNReal
Formal statement
namespace RGMISFast
/-- Observation 2.2 with Definition 2.3 and the correctness of the recorded answers (Dalirrooyfard, Makarychev, Mitrović, Ramachandran, *Randomized Greedy MIS Is Fast at Every Node*,
STOC 2027 submission (manuscript sha256 e93cdfec…),
Observation 2.2, p.11; proof in App. B, p.30): the execution of `RGMIS(u∗)` satisfies
(0) all recorded answers are correct, (a) ranks strictly decrease along the stack of pending
calls, (b) each vertex is freshly called at most once, and the fresh calls form a tree rooted at
`u∗` with `Q(u∗)` distinct vertices, (c) if `w` is a child of `v` in this tree, then `w ∈ N(v)`
and `r(w) ≤ τ(v)`; that is, the query tree is admissible.
**Formalization Note** Ranks are distinct and nonnegative (the paper's standing assumption,
§1.1 and §2). The calls are read off the trace of `run`: each event records its caller (the
vertex whose scan made it; `none` only for the initial call), its callee, and whether it was
fresh. The stack of pending calls is the chain of callers, so (a) is the statement that every
call goes from a vertex to a neighbour of smaller rank. The fresh calls form the admissible tree
`T` whose nodes are the freshly called vertices and whose parent map sends each fresh callee to
its caller. -/
theorem observation_2_2 {V : Type*} [Fintype V] [LinearOrder V] (G : SimpleGraph V)
[DecidableRel G.Adj] (u : V) (r : V → ℝ) (hinj : Function.Injective r)
(hnn : ∀ v, 0 ≤ r v) :
(∀ v b, (run G r u).2.memo v = some b → b = inMIS G r v) ∧
(run G r u).1 = inMIS G r u ∧
(run G r u).2.trace.head? = some ⟨none, u, true⟩ ∧
(∀ e ∈ (run G r u).2.trace.tail, e.caller.isSome) ∧
(∀ e ∈ (run G r u).2.trace, ∀ v, e.caller = some v → G.Adj v e.callee ∧ r e.callee < r v) ∧
(((run G r u).2.trace.filter (fun e => e.fresh)).map (fun e => e.callee)).Nodup ∧
(((run G r u).2.trace.filter (fun e => e.fresh)).map (fun e => e.callee)).length = Q G u r ∧
∃ T : AdmissibleTree G r u,
T.nodes = (((run G r u).2.trace.filter (fun e => e.fresh)).map (fun e => e.callee)).toFinset ∧
∀ e ∈ (run G r u).2.trace, e.fresh = true → ∀ v, e.caller = some v → T.par e.callee = v := by sorry
end RGMISFast
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, STOC 2027 submission (manuscript sha256 e93cdfecc03618969d5f2ecf8171c6f84c528edcc473b2f864299e555f823664), Observation 2.2, p.11 (PDF p.13); Definition 2.3, p.11; proof and "All recorded answers are correct", App. B, p.30 (PDF p.32)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.