Documentation

BGW.ContinuumTrees.CodingMeasure

Root and mass measure of a continuously coded tree #

The root is the image of time zero. The mass measure is the pushforward of Mathlib's Lebesgue probability measure on the unit interval through the continuous projection. The coding quotient receives its Borel structure once, and the actual pushforward is bundled as a probability measure and as the project's compact measured and rooted measured spaces.

These constructions are defined for every continuous real coding function. For a nonnegative function vanishing at zero, distance from the root is its value. If it also vanishes at one, the two endpoint times project to the same root. Nonnegativity is retained in this last claim: equal zero endpoint values alone do not exclude a negative interior minimum.

The distinguished point represented by time zero.

Equations
Instances For

    The mass measure is the genuine pushforward, with measurable projection.

    theorem BGW.ContinuumTrees.Coding.dist_root_projection (g : C(↑unitInterval, ℝ)) (hg : ∀ (t : ↑unitInterval), 0 ≤ g t) (h0 : g 0 = 0) (t : ↑unitInterval) :
    dist (root g) (projection g t) = g t

    A nonnegative coding function vanishing at zero gives distance from the root directly.

    theorem BGW.ContinuumTrees.Coding.projection_zero_eq_one (g : C(↑unitInterval, ℝ)) (hg : ∀ (t : ↑unitInterval), 0 ≤ g t) (h0 : g 0 = 0) (h1 : g 1 = 0) :

    The endpoint times coincide in the quotient for a nonnegative function with zero endpoints.