Documentation

LeanPool.MarkovProcess.MarkovProcess.Path.Stopping

Deterministic stopping of continuous paths #

This file defines stopping a continuous path at a fixed deterministic time. It proves only topological and Borel-measurability properties of this operation; it introduces no stopping times or stochastic laws.

Clamp nonnegative time at the fixed deterministic time T.

Equations
Instances For

    A continuous path stopped at the fixed deterministic time T.

    Equations
    Instances For
      @[simp]
      theorem MarkovProcess.ContinuousPath.stoppedPath_apply {alpha : Type u_1} [TopologicalSpace alpha] (T : NNReal) (omega : ContinuousPath alpha) (t : NNReal) :
      (stoppedPath T omega) t = omega (min t T)
      theorem MarkovProcess.ContinuousPath.stoppedPath_apply_of_le {alpha : Type u_1} [TopologicalSpace alpha] (T : NNReal) (omega : ContinuousPath alpha) (t : NNReal) (ht : t ≤ T) :
      (stoppedPath T omega) t = omega t
      theorem MarkovProcess.ContinuousPath.stoppedPath_apply_of_ge {alpha : Type u_1} [TopologicalSpace alpha] (T : NNReal) (omega : ContinuousPath alpha) (t : NNReal) (ht : T ≤ t) :
      (stoppedPath T omega) t = omega T

      Every path stopped at a deterministic time is continuous in time.

      Stopping at a fixed deterministic time is continuous in the compact-open topology.

      Stopping at a fixed deterministic time is Borel measurable.

      @[simp]
      theorem MarkovProcess.ContinuousPath.stoppedPath_stoppedPath {alpha : Type u_1} [TopologicalSpace alpha] (S T : NNReal) (omega : ContinuousPath alpha) :
      stoppedPath S (stoppedPath T omega) = stoppedPath (min S T) omega

      Successive deterministic stops combine by taking the earlier stopping time.