_{1}

^{*}

Let
χ=x-p
be a metric space and let
ε be a positive real number. Then a function
f: X
→Y is defined to be an
ε-map if and only if for all y
∈Y, the diameter of
f
^{-1}(y) is at most
ε. In Theorem 10 we will give a new proof for the following well known fact: if
χ is totally bounded, then for all
ε there exists a finite number
n and a continuous
ε-map
f_{ε}: X→R^{n} (here
R^{n} is the usual
n-dimensional Euclidean space endowed with the Euclidean metric). If
ε is “small”, then
f_{ε} is “almost injective”; and still exists even if
χ has infinite covering dimension (in this case,
n depends on
ε, of course). Contrary to the known proofs, our proof technique is effective in the sense, that it allows establishing estimations for
n in terms of
ε and structural properties of
χ.

It is a classical question in topology, that what kind of topological spaces X can be embedded into finite dimensional Euclidean spaces (endowed with the usual Euclidean topology). To motivate the present paper, first we recall some well known results in related investigations.

A classical characterization theorem can be recalled as follows. The covering dimension of X is finite if and only if there exists n ∈ ℕ such that for every open covering C of X there exists an open covering C ′ that refines C and each point of X belongs to at most n + 1 elements of C ′ (the smallest n satisfying this property is defined to be the dimension of X ; if there are no such n, then X is defined to be infinite dimensional). Clearly, if X can be embedded into a finite dimensional Euclidean space, then X is metrizable. By a classical theorem, for a compact, metrizable space X the followings are equivalent:

(1) X is finite dimensional (say, its dimension is n);

(2) X is homeomorphic to a subspace of a finite dimensional (more concretely, 2 n + 1 -dimensional) Euclidean space

(for a proof we refer to e.g. Corollary 50.9 of [

Further, as explained in Theorem 2.2 of [

(3) for all positive ε , X admits an ε -map to an n-dimensional simplicial complex.

In fact, Theorem 2.2 of [

Recall e.g. from [

The main result of the present paper is Theorem 10 where we show, that

(i) if X is totally bounded, then for all ε > 0 , there exists a continuous ε -mapping of X into a finite dimensional Euclidean space ℝ n , further

(ii) estimations for n are also provided in terms of ε and structural properties of X .

We should make the following remarks: item (i) above is well known. Thus, “almost injective” functions still exist, even if X is infinite dimensional—of course, if X is infinite dimensional, then n depends on ε . The known proofs are existential, they cannot provide any upper bound for n. However our proof for (i) is effective in the sense, that (as stated in (ii) above), based on it, one can establish estimations on n in terms of ε and structural properties of X .

The structure of the paper is rather simple: we close this section by fixing our notation and Section 2 contains the proofs. As we mentioned, our main goal is to prove Theorem 10.

Notation

Our notation is mostly standard, but the following list may help.

Throughout ℕ denotes the set of natural numbers. In addition, ℝ and ℝ + denotes the set of real numbers, and the set of positive real numbers, respectively.

Let X = 〈 X , ϱ 〉 be a metric space, a ∈ X and let γ be a non-negative real number. As usual, the open γ -ball B ( γ , a ) at a is the set

B ( γ , a ) = { x ∈ X : ϱ ( a , x ) < γ } .

Definition 1 A family { B i : i ∈ I } of γ -balls is defined to be a γ -net if and only if it covers X, that is,

X = ∪ i ∈ I B i . (1)

Thus, X is a completely bounded metric space if and only if for all positive γ ∈ ℝ there exists a finite γ -net in X . In addition, as it is well known, X is compact if and only if it’s metric is totally bounded and complete (i.e. every Cauchy sequence is convergent in X ). For further details we refer to [

If X is a completely bounded metric space, then ν ( X , γ ) denotes the smallest cardinality κ for which there exists a κ -sized γ -net of X .

Definition 2 Let X = 〈 X , ϱ 〉 be a metric space, let A ⊆ X and let b ∈ X . Then the Δ -type of b over A in X is defined to be the function t p Δ X ( b / A ) : A → ℝ , such that for all a ∈ A we have

t p Δ X ( b / A ) ( a ) = ϱ ( a , b ) . (2)

Thus, the Δ -type of b is just the function describing the distances of b from elements of A.

By a Δ -type over A we mean a function p : A → ℝ which is of the form t p Δ X ( b / A ) for some b ∈ X .

Keeping the notation introduced so far, we say, that c ∈ X realizes the Δ -type p in X if and only if p = t p X ( c / A ) .

Remark 3 We motivate and explain the above terminology as follows. Let X = 〈 X , ϱ 〉 be a metric space. One can associate a relational structure to X in the following way. If d is a distance of X , that is, d ∈ r a n ( ϱ ) then the binary relation R d is defined to be

R d = { 〈 a , b 〉 ∈ X 2 : ϱ ( a , b ) ≤ d } . (3)

Thus, the relational structure 〈 X , R d 〉 d ∈ r a n ( ϱ ) completely describes X and, at the same time, it can be treated as a model for an appropriate first order language. Then our definition of Δ -types is essentially the same, as atomic types of the first order relational structure 〈 X , R d 〉 d ∈ r a n ( ϱ ) in the usual, model theoretic sense.

Lemma 1 Let X = 〈 X , ϱ 〉 be a metric space, let A ⊆ X be finite and let n = | A | . Then for the function f : X → ℝ n , f ( x ) = t p Δ X ( x / A ) we have

( ∀ x , y ∈ X ) ( ‖ f ( x ) − f ( y ) ‖ ≤ n ϱ ( x , y ) ) , (4)

particularly, f is continuous.

Proof. Enumerate A = { a 0 , ⋯ , a n − 1 } and for each i < n let f i : X → ℝ , f i ( x ) = ϱ ( a i , x ) . By a slight abuse of notation, we have

f ( x ) = t p Δ X ( x / A ) = 〈 f 0 ( x ) , ⋯ , f n − 1 ( x ) 〉 (5)

for all x ∈ X .

Let i < n be fixed in this paragraph. Then for any x , y ∈ X the triangle inequality yields

ϱ ( a i , x ) ≤ ϱ ( a i , y ) + ϱ ( y , x ) (6)

so we have

ϱ ( a i , x ) − ϱ ( a i , y ) ≤ ϱ ( y , x ) . (7)

Similarly, interchanging x and y in the previous estimations, we obtain

ϱ ( a i , y ) − ϱ ( a i , x ) ≤ ϱ ( x , y ) (8)

and hence

| f i ( x ) − f i ( y ) | = | ϱ ( a i , x ) − ϱ ( a i , y ) | ≤ ϱ ( x , y ) . (9)

Consequently, for all x , y ∈ X we have

‖ f ( x ) − f ( y ) ‖ = ∑ i = 0 n − 1 ( f i ( x ) − f i ( y ) ) 2 ≤ by ( 9 ) ∑ i = 0 n − 1 ( ρ ( x , y ) ) 2 = n ( ϱ ( x , y ) ) 2 = n ϱ ( x , y ) , (10)

as desired. □

The following notion is an approximate version of splitting introduced in [

Definition 4 Let X = 〈 X , ϱ 〉 be a metric space, let B ⊆ A ⊆ X , let p be a Δ -type over A in X and let ε , δ be non-negative real numbers. Then we say, that p is ( ε , δ ) -splitting over B if and only if there exist c 0 , c 1 ∈ A such that for all b ∈ B we have

| ϱ ( b , c 0 ) − ϱ ( b , c 1 ) | < δ (11)

but whenever a realizes p, we have

| ϱ ( a , c 0 ) − ϱ ( a , c 1 ) | ≥ ε . (12)

Keeping the notation introduced in the above definition, intuitively p = t p Δ X ( a / A ) is ( ε , δ ) -splitting over B if and only if there exist c 0 , c 1 ∈ A such that c 0 and c 1 are “indiscernible from the viewpoint of B modulo δ ”, but a “distinguishes them modulo ε ”.

The following theorems will be essential in this paper. Some variants of them (in different contexts) had been utilized e.g. in [

Theorem 5 Let X = 〈 X , ϱ 〉 be a totally bounded metric space, let a ∈ X ,

let ε ∈ ℝ + and let 0 < δ ≤ ε 5 be arbitrary. Suppose

A 0 ⊆ A 1 ⊆ ⋯ ⊆ A M (13)

is a strictly increasing sequence of subsets of X − { a } such that for all n < M the type t p Δ X ( a / A n + 1 ) is ( ε , δ ) -splitting over A n . Then M ≤ ν ( X , δ ) .

Proof. Let { B i : i < ν ( X , δ ) } be a δ -net of X with smallest possible cardinality. By our assumption on splitting, for each n < M there exist c n , d n ∈ A n + 1 − A n such that for all b ∈ A n we have

| ϱ ( b , c n ) − ϱ ( b , d n ) | < δ (14)

but

| ϱ ( a , c n ) − ϱ ( a , d n ) | ≥ ε . (15)

Assume, seeking a contradiction, that M > ν ( X , δ ) . By the pigeonhole principle, there exists N ≤ ν ( X , δ ) such that B N (the N t h δ -ball in our net) contains at least two c n 's; more precisely, there exist n 0 < n 1 ≤ 1 + ν ( X , δ ) with c n 0 , c n 1 ∈ B N . Since B N is a δ -ball, it follows, that ϱ ( c n 0 , c n 1 ) < 2 δ . Therefore, by the triangle inequality,

ϱ ( a , c n 1 ) ≤ ϱ ( a , c n 0 ) + ϱ ( c n 0 , c n 1 ) < ϱ ( a , c n 0 ) + 2 δ , (16)

and by symmetry,

ϱ ( a , c n 0 ) < ϱ ( a , c n 1 ) + 2 δ . (17)

It follows, that

| ϱ ( a , c n 0 ) − ϱ ( a , c n 1 ) | < 2 δ . (18)

By construction,

| ϱ ( c n 0 , c n 1 ) − ϱ ( c n 0 , d n 1 ) | < δ , (19)

particularly,

ϱ ( c n 0 , d n 1 ) < 3 δ . (20)

Therefore,

ϱ ( a , c n 0 ) ≤ ϱ ( a , d n 1 ) + ϱ ( d n 1 , c n 0 ) < ϱ ( a , d n 1 ) + 3 δ (21)

and similarly,

ϱ ( a , d n 1 ) ≤ ϱ ( a , c n 0 ) + ϱ ( c n 0 , d n 1 ) < ϱ ( a , c n 0 ) + 3 δ . (22)

It follows, that

| ϱ ( a , c n 0 ) − ϱ ( a , d n 1 ) | < 3 δ . (23)

Combining these, we get

| ϱ ( a , c n 1 ) − ϱ ( a , d n 1 ) | ≤ | ϱ ( a , c n 1 ) − ϱ ( a , c n 0 ) | + | ϱ ( a , c n 0 ) − ϱ ( a , d n 1 ) | < 5 δ . (24)

Since 5 δ ≤ ε , this contradicts to (15) above, and the proof is complete. □

Definition 6 Let X = 〈 X , ϱ 〉 be a metric space, let a ∈ X and let ε , δ ∈ ℝ + . Then A ⊆ X is defined to be an ( ε , δ ) -basis for a if and only if for any B ⊆ X − { a } with A ⊆ B , the type

t p X ( a / B )

does not ( ε , δ ) -split over A.

Remark 7

1) Clearly, if A is an ( ε , δ ) -basis for a and ε ≤ γ , then A is a ( γ , δ ) -basis for a, as well.

2) In addition, if A is an ( ε , δ ) -basis for a and A ⊆ B ⊆ X then B is an ( ε , δ ) -basis for a , as well.

Theorem 8 Let X = 〈 X , ϱ 〉 be a totally bounded metric space, let a ∈ X and let ε ∈ ℝ + . Then there exist δ ∈ ℝ + and A ( a ) ⊆ X − { a } such that A ( a ) is an ( ε , δ ) -basis for a.

In fact, arbitrary δ ≤ ε 5 is suitable and A ( a ) can be chosen so, that | A ( a ) | ≤ 2 ( ν ( X , δ ) ) is satisfied, as well.

Proof. Let δ ≤ ε 5 be an arbitrary positive real number.

Suppose, seeking a contradiction, that the consequence of the theorem is not true. By recursion, we define finite subsets A n ⊆ X − { a } for every natural number n, such that the following stipulations are satisfied:

(i) A n ⊆ A n + 1 , in fact, A n + 1 − A n = { c n , d n } ;

(ii) t p Δ X ( a / A n + 1 ) is ( ε , δ ) -splitting over A n .

Let A 0 = ∅ and suppose A m has already been defined for all m ≤ n such that stipulations (i) and (ii) are satisfied. Then, by our indirect assumption, there exists B ⊆ X − { a } with A n ⊆ B such that t p Δ X ( a / B ) is ( ε , δ ) -splitting over A n . This means, that there exist c n , d n ∈ B such that for all b ∈ A n we have

| ϱ ( b , c n ) − ϱ ( b , d n ) | < δ (25)

but

| ϱ ( a , c n ) − ϱ ( a , d n ) | ≥ ε . (26)

Let A n + 1 = A n ∪ { c n , d n } . Then stipulations (i), (ii) remain true. In this way, one can define A n , c n , d n for all n ≤ 1 + ν ( X , δ ) ; this contradicts to Theorem 5. Thus, the proof is complete: A ( a ) can be chosen to be some A n (note, that an inspection shows, that each A n has cardinality at most 2n and 2 n ≤ 2 ν ( X , δ ) ). □

Lemma 2 Let X = 〈 X , ϱ 〉 be a totally bounded metric space, let a 0 , a 1 , a 2 , b ∈ X and let ε , δ ∈ ℝ + . If A is an ( ε 3 , δ ) -basis for a 0 , a 1 and a 2 , moreover a 0 , a 1 and a 2 are pairwise distinct and ϱ ( a i , b ) < ε 3 for all i ∈ { 0,1,2 } , then A is an ( ε , δ ) -basis for b.

Proof. Assume, seeking a contradiction, that A is an ( ε 3 , δ ) -basis for a 0 , a 1 and a 2 , but not an ( ε , δ ) -basis for b. Then there exist c , d ∈ X − { b } such that for all u ∈ A we have

| ϱ ( u , c ) − ϱ ( u , d ) | < δ (27)

but

| ϱ ( b , c ) − ϱ ( b , d ) | ≥ ε . (28)

By assumption, a 0 , a 1 and a 2 are pairwise distinct. It follows, that there exists i ∈ { 0,1,2 } such that a i ∉ { c , d } , that is, c , d ∈ X − { a i } .

Observe, that

ϱ ( a i , c ) ≤ ϱ ( a i , b ) + ϱ ( b , c ) (29)

and hence

ϱ ( a i , c ) − ϱ ( b , c ) ≤ ϱ ( a i , b ) < ε 3 . (30)

Similarly,

ϱ ( b , c ) ≤ ϱ ( b , a i ) + ϱ ( a i , c ) (31)

and hence

ϱ ( b , c ) − ϱ ( a i , c ) ≤ ϱ ( b , a i ) < ε 3 . (32)

Combining these estimations, we get

| ϱ ( a i , c ) − ϱ ( b , c ) | < ε 3 . (33)

Completely similarly, one also can conclude, that

| ϱ ( a i , d ) − ϱ ( b , d ) | < ε 3 . (34)

Observe moreover, that | ϱ ( a i , c ) − ϱ ( a i , d ) | < ε 3 because A is an ( ε 3 , δ ) -basis for a i . But then,

| ϱ ( b , c ) − ϱ ( b , d ) | ≤ | ϱ ( b , c ) − ϱ ( a i , c ) | + | ϱ ( a i , c ) − ϱ ( a i , d ) | + | ϱ ( a i , d ) − ϱ ( b , d ) | < 3 ⋅ ε 3 (35)

contradicting to (28). □

Theorem 9 Let X = 〈 X , ϱ 〉 be a totally bounded metric space. Then for each

ε ∈ ℝ + there exists a finite set A ⊆ X such that A is an ( ε , ε 15 ) -basis for all a ∈ X .

In fact, we have | A | ≤ 6 ⋅ ν ( X , ε 15 ) ⋅ ν ( X , ε 6 ) .

Proof. Let C ⊆ X be an ε 6 -net of X with | C | = ν ( X , ε 6 ) . Let

C 0 = { b ∈ C : | B ( b , ε 6 ) − { b } | ≤ 2 } (36)

and let C 1 = C − C 0 . Enumerate C 1 as C 1 = { B ( b i , ε 6 ) : i < | C 1 | } . For each i < | C 1 | there exist pairwise different a b i ,0 , a b i ,1 , a b i ,2 ∈ B ( b i , ε 6 ) . By Theorem 8, for each i < | C 1 | and j < 3 there exists an ( ε 3 , ε 15 ) -basis A ( a b i , j ) for a b i , j with | A ( a b i , j ) | ≤ 2 ν ( X , ε 15 ) . Similarly, again by Theorem 8, for each b ∈ C 0 and for each a ∈ B ( b , ε 6 ) there exists an ( ε 3 , ε 15 ) -basis A ( a ) for a with | A ( a ) | ≤ 2 ν ( X , ε 15 ) . Finally, let

A = ∪ b ∈ C 0 , a ∈ B ( b , ε 6 ) A ( a ) ∪ ∪ i < | C 1 | , j < 3 A ( a b i , j ) . (37)

We claim, that A satisfies the conclusion of the theorem. By construction, clearly

| A | ≤ 2 ⋅ ν ( X , ε 15 ) ⋅ 3 ⋅ ν ( X , ε 6 ) , (38)

as desired. In addition, let b ∈ A be arbitrary. Then there exists b ′ ∈ C such that b ∈ B ( b ′ , ε 6 ) .

If b ′ ∈ C 0 then by construction, A contains an ( ε 3 , ε 15 ) -basis A ( b ) for b, which is also an ( ε , ε 15 ) -basis for b because of Remark 7 (1). Hence, by Remark 7 (2), A is an ( ε , ε 15 ) -basis for b.

If b ′ ∈ C 1 , then b ′ = b i for some i < | C 1 | . By construction, for all j < 3 we

have ϱ ( b i , a b i , j ) < ε 6 . Therefore, by the triangle inequality, for all j < 3 we have

ϱ ( b , a b i , j ) ≤ ϱ ( b , b i ) + ϱ ( b i , a b i , j ) ≤ ε 6 + ε 6 = ε 3 . (39)

Hence, by Lemma 2, ∪ j < 3 A ( a b i , j ) is an ( ε , ε 15 ) -basis for b. Since A ⊇ ∪ j < 3 A ( a b i , j ) , it follows from Remark 7 (2), that A is an ( ε , ε 15 ) -basis for

b, as well. Since b was arbitrary, the proof is complete. □

Lemma 3 Let 〈 X , ϱ 〉 be a metric space and let ε , δ ∈ ℝ + be arbitrary.

Assume A ⊆ X is an ( ε 2 , δ ) -basis for all a ∈ X . If x ∈ X is not isolated,

then for all y ∈ X

t p Δ X ( x / A ) = t p Δ X ( y / A ) implies ρ ( x , y ) ≤ ε .

Proof. Since x is not an isolated point of X , there exists z ∈ B ( x , ε 4 ) − { x } . By assumption, A is an ( ε 2 , δ ) -basis for z, hence

| ϱ ( z , x ) − ϱ ( z , y ) | < ε 2 . (40)

But ϱ ( z , x ) < ε 4 , so it follows, that ϱ ( z , y ) ≤ 3 ε 4 . Hence, by the triangle inequality,

ϱ ( x , y ) ≤ ϱ ( x , z ) + ϱ ( z , y ) < ε 4 + 3 ε 4 = ε , (41)

as desired. □

Let X = 〈 X , ϱ 〉 be a metric space, let ε ∈ ℝ + and let Y be any set. As we mentioned in the introduction, according to the terminology of e.g. [

sup { ρ ( x , y ) : x , y ∈ X , f ( x ) = f ( y ) } ≤ ε .

Now we are able to state and prove the main result of the paper: we give a new proof for the fact, that each totally bounded metric space admits a continuous ε -map into some finite dimensional Euclidean space ℝ n (endowed with the usual Euclidean metric). Further, we provide upper bounds for n.

Theorem 10 Let X = 〈 X , ϱ 〉 be a totally bounded metric space, let ε ∈ ℝ +

and let N = 6 ⋅ ν ( X , ε 30 ) ⋅ ν ( X , ε 12 ) .

1) if X does not contain isolated points, then there exist n ≤ N and an ε -map f : X → ℝ n such that, for all x , y ∈ X we have ‖ f ( x ) − f ( y ) ‖ ≤ n ρ ( x , y ) , particularly f is continuous.

2) if X has countably many isolated points, then there exist n ≤ 1 + N and a continuous ε -map f : X → ℝ n .

3) if X is compact, then there exist n ≤ 1 + N and a continuous ε -map f : X → ℝ n .

Proof. First we show (1). By Theorem 9, there exists A ⊆ X such that A is an

( ε 2 , ε 30 ) -basis for all a ∈ X and | A | ≤ N . Let n = | A | and let f : X → ℝ n ,

f ( x ) = t p Δ X ( x / A ) (42)

for all x ∈ X . Then, by Lemma 1, for all x , y ∈ X we have

‖ f ( x ) − f ( y ) ‖ ≤ n ρ ( x , y ) . (43)

Further, by assumption, X does not contain isolated points. Hence, by Lemma 3 f is an ε -map, as desired.

To show (2), enumerate all the isolated points of X as { p k : k ∈ ℕ } . As in (1),

by Theorem 9 there exists A ⊆ X such that A is an ( ε 2 , ε 30 ) -basis for all

a ∈ X and | A | ≤ N . Let n ′ = | A | and let f ′ : X → ℝ n ,

f ′ ( x ) = t p Δ X ( x / A ) (44)

for all x ∈ X . Then, by Lemma 1, for all x , y ∈ X we have

‖ f ′ ( x ) − f ′ ( y ) ‖ ≤ n ′ ρ ( x , y ) . (45)

Let n = 1 + n ′ , let h : ℝ n ′ → ℝ n be the function

h ( x 0 , ⋯ , x n ′ − 1 ) = 〈 x 0 , ⋯ , x n ′ − 1 ,0 〉 (46)

and let f : X → ℝ n ,

f ( x ) = { h ( f ′ ( x ) ) if x is not an isolated point of X , h ( f ′ ( x ) ) + 〈 0, ⋯ , 0, 1 1 + k 〉 if x = p k .

First we show, that f is continuous. To do so, let x ∈ X and let γ ∈ ℝ + be arbitrary. We shall show, that there exists δ ∈ ℝ + such that for all y ∈ B ( x , δ ) we have ‖ f ( x ) − f ( y ) ‖ < γ .

Case 1: x is isolated in X . Then there exists δ ∈ ℝ + such that { x } = B ( x , δ ) , hence, for all y ∈ B ( x , δ ) we have ‖ f ( x ) − f ( y ) ‖ < γ .

Case 2: x is not isolated in X . Then, by 45, there exists δ ′ such that for all y ∈ B ( x , δ ′ ) we have ‖ f ′ ( x ) − f ′ ( y ) ‖ < γ / 2 . In addition, there exists k ∈ ℕ

with 1 k + 1 < γ / 2 . Choose δ ″ ∈ ℝ + such that if l < k then p l ∉ B ( x , δ ′ ″ )

and finally let δ = min { δ ′ , δ ″ } . Now let y ∈ B ( x , δ ) .

If y is not isolated, then

‖ f ( x ) − f ( y ) ‖ = ‖ f ′ ( x ) − f ′ ( y ) ‖ < by δ ≤ δ ′ γ ; (47)

If y is isolated, then y = p l for some l ≥ k and hence

‖ f ( x ) − f ( y ) ‖ ≤ ‖ f ′ ( x ) − f ′ ( y ) ‖ 2 + 1 ( l + 1 ) 2 < γ 2 2 + γ 2 2 = γ , (48)

thus, f is continuous, as desired.

Next we show, that f is an ε -map. To do so, assume x ≠ y ∈ X are such, that f ( x ) = f ( y ) . Observe, that by construction, for any k ∈ ℕ , the k t h isolated point p k is the unique element z ∈ X such that the last coordinate of

f ( z ) is equal to 1 k + 1 . Hence neither x nor y are isolated. Therefore

0 = ‖ f ( x ) − f ( y ) ‖ = ‖ f ′ ( x ) − f ′ ( y ) ‖ , (49)

hence f ′ ( x ) = f ′ ( y ) . Combining this with the definition of f ′ , we obtain t p Δ X ( x / A ) = t p Δ X ( y / A ) . But then, Lemma 3 implies ρ ( x , y ) ≤ ε .

To show (3), we note, that (e.g. by Corollary 4.1.16 of [

In Theorem 10 we have given a new proof for the fact, that each totally bounded metric space X admits a continuous ε -map into some finite dimensional Euclidean space ℝ n (endowed with the usual Euclidean metric). Further, we provided upper bounds for n in terms of ε and structural properties of X . Our proof had been obtained as follows:

• As recalled in Remark 3, there is a well known method that associates a first order structure A ( X ) to a metric space X ;

• if X is totally bounded, then A ( X ) has nice properties inspired by (model theoretic) stability theory, more concretely, as shown in Theorem 5, if

ε ∈ ℝ + , then each increasing chain of ( ε , ε 5 ) -splitting Δ -types in A (X)

should have finite length;

• as shown in Theorem 10, using the above observation one can construct an appropriate continuous ε -map from X to a finite dimensional Euclidean space.

The second item of the above list motivates the following problem which may serve as a starting point of a further investigation.

Open problem 11 Is the converse of Theorem 5 true, as well? That is, if X is a metric space such that, for all ε ∈ ℝ + the length of any increasing chain of

( ε , ε 5 ) -splitting Δ -types in A ( X ) is finite, then does it follow, that X is

totally bounded?

This work has been supported by Hungarian National Foundation for Scientific Research grant K129211.

The author declares no conflicts of interest regarding the publication of this paper.

Sági, G. (2019) Almost Injective Mappings of Totally Bounded Metric Spaces into Finite Dimensional Euclidean Spaces. Advances in Pure Mathematics, 9, 555-566. https://doi.org/10.4236/apm.2019.96028