AFTD Auto-Formalizing Theoretical Domains

IsTerminalEmbedding

def

A map φ from a metric space X to a metric space H is a terminal embedding for a subset V of X if φ is 1-Lipschitz and for every x in V and every y in X, dist (φ x) (φ y) = dist x y.

Statement

def IsTerminalEmbedding.{u, v} {X : Type u} {H : Type v} [MetricSpace X] [MetricSpace H]
    (V : Set X) (φ : X → H) : Prop
Defined in
arXiv:2611.08546 "Bourgain's Theorem for a Union of Euclidean Metric Spaces", Definition 2.1
Verified
09 Nov 2026
Axioms
none listed
Used by 1
  • is_terminal_embedding_idFor every metric space X and every subset V of X, the identity map id on X is a terminal embedding for V.

Read back from the Lean

Given metric spaces X and H, a subset V : Set X, and a function φ : X → H, IsTerminalEmbedding V φ asserts that: 1. φ is 1-Lipschitz (LipschitzWith 1 φ); and 2. For every x ∈ V and every y : X, the metric distance dist (φ x) (φ y) in H equals dist x y in X. (Note: The knowledge-base definitions V and F for vector spaces over finite fields are shadowed by the parameter V : Set X and are not used.)

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A map φ : X → H is a terminal embedding for V ⊆ X if φ is 1-Lipschitz and preserves distances from all points in V to all points in X. -/
def IsTerminalEmbedding.{u, v} {X : Type u} {H : Type v} [MetricSpace X] [MetricSpace H]
    (V : Set X) (φ : X → H) : Prop :=
  LipschitzWith 1 φ ∧ ∀ x ∈ V, ∀ y : X, dist (φ x) (φ y) = dist x y
See it in the graphDiscuss this resultChallenge it