Finite exponential expansions for the root count and destruction rate
ProvedRGMISFast.root_count_arrival_expansionFix , a time horizon , and a prescribed root rank . There are a finite degree and real coefficients such that, for every ,
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 , 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.
import Mathlib import Definitions.Def_RGMISFast_Y import Definitions.Def_RGMISFast_condLaw set_option autoImplicit false open MeasureTheory ProbabilityTheory open scoped ENNReal open RGMISFast
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