Documentation

BGW.ContinuumTrees.CodingStability

Stability of continuously coded measured trees #

Uniform distance between coding functions bounds the distance between their interval minima and the distortion between the quotient projections. Gluing the two coded spaces along their common time parameter bounds Hausdorff distance, Lévy–Prokhorov distance and root distance simultaneously. With the project's sum convention, the resulting bounds are four times the uniform norm in GHP and six times that norm in rooted GHP.

The map to rooted measured isometry classes is therefore Lipschitz, continuous and measurable. All results hold for arbitrary continuous real coding functions, without sign or endpoint conditions. The common-source GHP bound uses Mathlib's approximate metric gluing; no measurable choice of time representatives is needed.

The interval minimum changes by at most the uniform norm of the change in coding function.

The correspondence given by common times has distortion at most four uniform norms.

Stability in the summed GHP distance, with the entire coded carriers retained.

Stability in rooted GHP, using the sum of root, Hausdorff and Lévy–Prokhorov costs.