Documentation

BGW.StableTrees.HeightContinuityBasic

Deterministic reconstruction of continuous heights #

Rational evaluations determine a continuous height uniquely, including on a singleton horizon. Constant extension preserves the compact prefix literally.

t is a rational time.

Equations
Instances For
    noncomputable def BGW.StableTrees.heightLoc (θ : ℝ) (f : Skorokhod.DLoc) :

    The continuous height process: the continuous function agreeing with heightUniv θ f at every rational time when one exists (it is then unique), the zero function otherwise.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      Every path of heightLoc is continuous.

      Rational nonnegative times are dense.

      theorem BGW.StableTrees.heightLoc_eq_of_rational_agreement (θ : ℝ) (f : Skorokhod.DLoc) (g : C(NNReal, ℝ)) (hg : ∀ (t : NNReal), IsRationalTime t → g t = heightUniv θ f t) :
      heightLoc θ f = ⇑g

      Continuous extensions of the same rational heights coincide.

      The continuous height starts at 0 for every path (height θ f 0 = 0 surely).

      The continuous height is nonnegative for every path.

      Extension of a path on [0,T] by its terminal value (the junk branch never occurs).

      Equations
      Instances For
        noncomputable def BGW.StableTrees.heightPrefix (θ : ℝ) (T : NNReal) (g : Skorokhod.D ↑T ℝ) :
        C(↑(Set.Icc 0 ↑T), ℝ)

        Prefix height map on [0,T]: the continuous function on [0,T] agreeing with heightUniv of extendConst T g at the rational times of [0,T] when one exists, 0 otherwise.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          theorem BGW.StableTrees.isCadlag_extendConst_fun (T : NNReal) (g : Skorokhod.D ↑T ℝ) :
          IsCadlag fun (u : NNReal) => g (Set.projIcc 0 ↑T ⋯ ↑u)

          Constant extension is càdlàg, including at the terminal time.

          Restricting constant extension gives the original path.

          Constant extension is measurable for the evaluation sigma algebra.

          theorem BGW.StableTrees.height_eq_of_restrict_eq (θ : ℝ) (T : NNReal) (f g : Skorokhod.DLoc) (hfg : Skorokhod.DLoc.restrict T f = Skorokhod.DLoc.restrict T g) (t : NNReal) (ht : t ≤ T) :
          height θ f t = height θ g t

          Literal prefix locality of the raw height: height θ f t reads f only on [0,t].

          theorem BGW.StableTrees.dense_prefix_rationals (T : NNReal) :
          Dense {t : ↑(Set.Icc 0 ↑T) | ∃ (q : ℚ), ↑q = ↑t}

          Rational times are dense in a compact nonnegative interval.

          theorem BGW.StableTrees.continuousMap_ext_rational (T : NNReal) (c d : C(↑(Set.Icc 0 ↑T), ℝ)) (h : ∀ (t : ↑(Set.Icc 0 ↑T)), (∃ (q : ℚ), ↑q = ↑t) → c t = d t) :
          c = d

          Rational times in a compact nonnegative interval determine continuous functions.

          The fixed-time height is measurable.

          theorem BGW.StableTrees.heightPrefix_eq_of_rational_agreement (θ : ℝ) (T : NNReal) (f : Skorokhod.DLoc) (c : C(↑(Set.Icc 0 ↑T), ℝ)) (hc : ∀ (t : ↑(Set.Icc 0 ↑T)), IsRationalTime ⟨↑t, ⋯⟩ → c t = heightUniv θ f ⟨↑t, ⋯⟩) :

          Deterministic reconstruction: a continuous function on [0,T] agreeing with heightUniv θ f at the rational times of [0,T] is the prefix height of f (no law involved; used by H04 under the excursion measures).