Searcharxiv⌕ Search

arXiv · math/0406530

Almost isometric embeddings of metric spaces

Abstract

We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum separable metric spaces on aleph_1 so that every separable metric space is almost isometrically embedded into one of them when the continuum hypothesis fails. (3) There is no collection of fewer than continuum metric spaces of cardinality aleph_2 so that every ultra-metric space of cardinality aleph_2 is almost isometrically embedded into one of them if aleph_2<2^{aleph_0}. We also prove that various spaces X satisfy that if a space X is almost isometric to X than Y is isometric to X.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Menachem Kojman, Saharon Shelah. 2004-06-25. Almost isometric embeddings of metric spaces. https://arxiv.org/abs/math/0406530

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Amenable C-sequences and ineffability in L

We give a relative consistency counterexample to the conjecture of Inamdar and Rinot that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in the constructible universe L. The existence of a $Π^2_1$-indescribable cardinal is equiconsistent with the existence of a $Π^2_1$-indescribable cardinal carrying no amenable C-sequence and not ineffable in L. For every ground-model C-sequence on a weakly compact cardinal $κ$, generalized Hechler forcing adds a club D with $D\capβ\subseteq C_β$ at stationarily many inaccessible indices. We use this capture theorem in an iteration of length $κ^+$ after Johnstone's local lottery preparation.

math.LO↗

Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective

For countable vocabularies, we extend the omitting types theorem for countable fragments of infinitary logic to Keisler's general real-valued structures by proving that the space of Henkin types of each such fragment is Čech-complete. The structures interpret function symbols arbitrarily and predicate symbols by bounded real-valued functions, while each formula carries a bound of its own. This extends the setting of Eagle's theorem from metric structures with a prescribed master metric to general structures whose vocabulary prescribes the sorts and bounds of the symbols. Following Keisler and Miller's treatment of logic without equality, we build models from closed terms. Morley's Baire category method then gives every satisfiable theory on a countable fragment a model with countable sorts omitting any countable family of types whose closed-term instances have empty interior in the space of Henkin types satisfying the theory.

math.LO↗

Friedman--Stanley cofinality without Borel completeness

Friedman and Stanley asked whether an invariant Borel class of countable structures must be Borel complete whenever every countable level of their hierarchy reduces to it. We construct a counterexample in one fixed countable language. The structural counterexample and its principal supporting results have been formalized in Lean~4 and it is available on github.

math.LO↗