random_greedy_survival_prob
def
For a finite simple graph J on a finite vertex type V with decidable equality and decidable adjacency, a vertex subset A : Finset V, and time t : ℝ, the survival probability P(J, A, t) obtained by evaluating the formal polynomial random_greedy_survival_poly J A at 1 - t.
Statement
noncomputable def random_greedy_survival_prob {V : Type*} [Fintype V] [DecidableEq V] (J : SimpleGraph V) [DecidableRel J.Adj] (A : Finset V) (t : ℝ) : ℝ
- Defined in
- arXiv:2611.13571 Lemma 3.1
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- random_greedy_survival_polyFor a finite simple graph J on a finite vertex type V with decidable equality and decidable adjacency, and a vertex subset A : Finset V,…
Read back from the Lean
random_greedy_survival_prob is a definition that assigns to:
- a finite type V with decidable equality,
- a simple graph J on V with decidable adjacency,
- a finite set of vertices A : Finset V, and
- a real number t : ℝ,
the real number obtained by evaluating the polynomial random_greedy_survival_poly J A at 1 - t.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The survival probability of vertex set A at time t in random greedy matching. -/ noncomputable def random_greedy_survival_prob {V : Type*} [Fintype V] [DecidableEq V] (J : SimpleGraph V) [DecidableRel J.Adj] (A : Finset V) (t : ℝ) : ℝ := (random_greedy_survival_poly J A).eval (1 - t)