A uniformly nearby image transfers four-point bounds to the ambient metric space
ProvedRayBundle.four_point_of_dense_imagegeodesicshyperbolic-geometrymetric-geometry
Let be a metric space, a map, and . Suppose every has some with . Suppose also that all satisfy
Then all satisfy
This transfers a quantitative four-point estimate from an image that is uniformly close to all ambient points. For unit-edge graphs, it allows estimates on vertices to control the entire continuous realization. The proximity assumption uses one fixed radius , rather than topological density.
Preamble
import Mathlib.Topology.MetricSpace.Basic
Formal statement
theorem RayBundle.four_point_of_dense_image {X V : Type*} [MetricSpace X] (f : V → X) (R C : ℝ)
(hnear : ∀ x, ∃ v, dist x (f v) ≤ R)
(hfour : ∀ a b c d, dist (f a) (f b) + dist (f c) (f d) ≤
max (dist (f a) (f c) + dist (f b) (f d))
(dist (f a) (f d) + dist (f b) (f c)) + C) (a b c d : X) :
dist a b + dist c d ≤
max (dist a c + dist b d) (dist a d + dist b c) + (C + 8 * R) := by sorry
Source
Source declaration: RayBundle/Thm_Cayley_four_point_of_dense_image.lean, theorem RayBundle.four_point_of_dense_image. Supporting metric estimate proved directly in this development from the triangle inequality. Unit-edge metric-graph motivation and conventions: Nicholas Touikan, On geodesic ray bundles in hyperbolic groups (2018), Section 2, https://arxiv.org/abs/1706.01979 . No numbered theorem attribution for this estimate is claimed.