is_terminal_embedding_id
For every metric space X and every subset V of X, the identity map id on X is a terminal embedding for V.
Statement
lemma is_terminal_embedding_id.{u} {X : Type u} [MetricSpace X] (V : Set X) : IsTerminalEmbedding V (id : X → X)
- Source
- arXiv:2611.08546 "Bourgain's Theorem for a Union of Euclidean Metric Spaces", Definition 2.1
- Verified
- 09 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- IsTerminalEmbeddingA 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…
Read back from the Lean
For any metric space $X$ and any subset $V \subseteq X$, the identity map $\mathrm{id} : X \to X$ is a terminal embedding with respect to $V$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
By definition, a map is a terminal embedding for a subset V ⊆ X if it is 1-Lipschitz on X and preserves distances between points in V and arbitrary points in X. The identity map on X satisfies 1-Lipschitzness via LipschitzWith.id, while distance preservation holds trivially by reflexivity since id x = x.
The identity map on X is a terminal embedding for any subset V ⊆ X.
A terminal embedding requires two conditions: the map must be 1-Lipschitz, and it must preserve the distance between any point in V and any point in X. The identity map is 1-Lipschitz by LipschitzWith.id, and distance preservation dist (id x) (id y) = dist x y holds definitionally by reflexivity.
uses
LipschitzWith.idIsTerminalEmbedding V (id : X → X) := ⟨LipschitzWith.id, fun _ _ _ => rfl⟩
LipschitzWith.id- The identity map on any pseudo-extended metric space is 1-Lipschitz.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The identity map on a metric space X is a terminal embedding for any subset V ⊆ X. -/lemma is_terminal_embedding_id.{u} {X : Type u} [MetricSpace X] (V : Set X) : IsTerminalEmbedding V (id : X → X) := ⟨LipschitzWith.id, fun _ _ _ => rfl⟩