Uniform positive-mesh rounding finds a grid point less than one step above any time
ProvedKyprianou.Ch01.uniformGridCeilingWithinMeshPublicfirst-passagekyprianou-ch01mesh-refinementstopping-timeuniform-grid
For a nonnegative real time t and a strictly positive uniform grid spacing delta, there exists an integer grid index n with t ≤ n delta < t+delta. This deterministic approximation is a necessary ingredient for proving continuous first strict crossing is approached by discrete grid crossing times as the mesh tends to zero.
Preamble
import Mathlib.Data.Real.Archimedean import Mathlib.Tactic.Linarith set_option autoImplicit false
Formal statement
theorem Kyprianou.Ch01.uniformGridCeilingWithinMeshPublic
(delta t : ℝ) (hdelta : 0 < delta) (ht : 0 ≤ t) :
∃ n : ℕ, t ≤ (n : ℝ) * delta ∧
(n : ℝ) * delta < t + delta := by sorrySource
Kyprianou (2006), Exercise 1.10(ii), passage-grid convergence step, printed page 306.