Documentation

BGW.StableTrees.ExcursionHeightCancellation

Exact cancellation of the occupation before an excursion start #

A valid excursion cut adds no new minimum before its start. Splitting the occupation at the start therefore gives an exact additive identity for every cutoff, including zero.

theorem BGW.StableTrees.futureInf_eq_before_cut {g d : NNReal} {f : Skorokhod.DLoc} (hcut : cutValid g d f) {u s : NNReal} (hu : u ≤ d - g) (hs : s ≤ g) :
futureInf f (g + u) s = futureInf f g s

Extending a horizon inside a valid cut leaves all pre-start future infima unchanged.

Exact finite-cutoff cancellation (deterministic): if the cut of (T(x-), T(x)) is valid, then for every cutoff ε and every age u ≤ T(x) - T(x-), the host approximation at T(x-) + u is the host approximation at T(x-) plus the approximation of the jump excursion at age u (no correction term: the pre-start integrands coincide).

The chosen cutoffs approach zero from above, including the fallback parameter branch.

Raw height of a jump excursion (deterministic): with a valid cut and a vanishing pre-start approximation at T(x-), the universal raw height of the excursion at age u ≤ T(x) - T(x-) is the host's universal raw height at T(x-) + u.