Questions tagged [metric-spaces]

Metric spaces are sets on which a metric is defined. A metric is a generalization of the concept of "distance" in the Euclidean sense. Metric spaces arise as a special case of the more general notion of a topological space. For questions about Riemannian metrics use the tag (riemannian-geometry) instead.

A function $d: M\times M\to \mathbb R$ is called a metric if for all $x,y,z \in M$ we have

  1. $d(x,y)=0\iff x=y$
  2. $d(x,y)\geq 0$
  3. $d(x,y)=d(y,x)$
  4. $d(x,y)+d(y,z)\geq d(x,z)$.

It is a generalisation of "distance". A metric space is now defined as an ordered pair $(M,d)$, where $M$ is a set and $d:M\times M\to R$ is a metric.

An $\varepsilon$-neighbourhood of $x$ is defined as the set $$B_\epsilon(x):=\{y\in M\mid d(x,y)<\varepsilon\}.$$ $B_\varepsilon(x)$ is commonly also known as the open ball of radius $\varepsilon$ around $x$. All open balls form a base for a topology on $M$. Although all metric spaces are topological spaces, the converse is generally not true.

Some different types of metric space include

  1. Complete metric spaces (every Cauchy sequence converges)

  2. Bounded metric spaces (every metric is bounded by a finite value)

  3. Compact metric spaces (every sequence has a convergent subsequence)

  4. Locally compact metric spaces (every point has a compact neighbourhood)

  5. Separable metric spaces (it possesses a countable dense subset).

15788 questions
0
votes
1 answer

Prove that the function $e(a,b)=\frac{d(a,b)}{1+d(a,b)} \ where \ a,b\in X$, is a metric

I am looking to prove that the following function from the non empty group $X$ is a metric with $d$ already being a metric: $$e(a,b)=\frac{d(a,b)}{1+d(a,b)} \ \text{where} \ a,b\in X$$ But I am not sure how to proceed with such…
0
votes
1 answer

Metric spaces and uniform continuity

Given $(X,p)$ is a metric space, we fix $a \in X$. I wish to show $f(x)=p(x,a)$ is uniformly continuous. I think I have to work with the epsilon delta definition that is find a $\delta$ such that for every $\varepsilon$, $p(x,y)<\delta \implies…
Homaniac
  • 1,215
0
votes
1 answer

Compact Metric Space Question

Let $(X,d)$ be nonempty compact metric space and $f : X\to X$ be a function satisfying $d(f (x), f (y)) < d(x, y)$ for all distinct pair of points $x, x \in X$. Show that $f$ have a fixed point and this fixed point is unique. Hint: Define the…
user51524
  • 27
  • 3
0
votes
1 answer

Radius of a ball

It is a very basic question. Given a metric space defined by $(X,d)$ where $X$ is a set and $d$ is a metric. Let's assume $X = \{x_{1},x_{2}\}$ and mark $s=d(x_{1},x_{2})$. Can I define a ball with a radius bigger than the distance $s$? Like this…
0
votes
1 answer

Show that any subset of a metric space is open

Here's a problem: I've done the first 2 parts but I have no idea of how to approach part iii, and I'm very confused for part iv because isn't a singleton set a closed subset? Any help would be appreciated. Thanks!
0
votes
1 answer

Metric spaces on a unit sphere

I've got this question on a problem sheet all about metric spaces. My idea was to consider points on the unit sphere, so that $d(L_1, L_2)$ would equal the sine of the angle between the two vectors. How would I use this to show that this is a…
0
votes
2 answers

changing the domain to create an isometry

The diameter $D(M, d) \in \mathbb{R} \cup \{\infty\}$ of a metric space $(M, d)$ is $D(M, d) = \sup\{d(x, y) : x, y \in M\}$ if $M$ is not empty and 0 if $M = \emptyset$. Find a distance $d′$ on $\mathbb{R}$ with the same convergent sequences as the…
excalibirr
  • 2,795
0
votes
1 answer

isometry between d^2 and d^1 of euclidean space

Let $X$ be a set and $(M, d)$ be a metric space. Let $f:X\to M$ be an injective map. Then we define $f∗d := d \circ (f \times f): X \times X →(0,\infty)$, i.e. $f*d(x, y) = d(f(x), f(y))$ for $x, y \in X$. Let $d^{k}$ denote the standard euclidean…
excalibirr
  • 2,795
0
votes
1 answer

proof that f*d is an induced metric

Let X be a set and (M, d) be a metric space. Let f : X → M be an injective map. Then we define f∗d := d ◦ (f × f): X × X →(o,infinity] i.e. f∗d(x, y) = d(f(x), f(y)) for x, y ∈ X . I want to prove that f∗d is a distance function on X (“induced…
excalibirr
  • 2,795
0
votes
2 answers

Isometry from higher to lower dimensions

I was wondering if there was any isometry from $\mathbb{R^2}$ to $\mathbb{R}$, using the Euclidean metric?
excalibirr
  • 2,795
0
votes
1 answer

If $M$ is a convex subset and $f:M\rightarrow F$ is uniformly continuous, prove that $\|f(x)-f(y)\|\leq a \|x-y\|+1$

Consider: $E,F$ normed vector spaces, $M\subset E$ a convex subset and $f:M\rightarrow F$ a uniformly continuous function. Prove that there exists $a>0$ such that: $\|f(x)-f(y)\|\leq a \|x-y\|+1$ . I have only a suspicion of a way to prove this…
user2345678
  • 2,885
0
votes
2 answers

Metric space and its ball

how can it be shown that the ball $B(a,5)$ may be a proper subset of $B(b,3)$ in a metric space, but if $B(a,6)\subseteq B(b,3)$, then they are equal?
0
votes
1 answer

pick out the true statement in metric spaces?

Let {X, d} be a metric space and let E ⊂ X. For x ∈ X, define d(x, E) = inf d(x,y) where y ∈ E Pick out the true statements: (a) |d(x, E) − d(y, E)| ≤ d(x, y) for all x and y ∈ X. (b) d(x, E) = d(x, m) for some m ∈ E My attempt : i was taking X =…
user396850
0
votes
1 answer

Distance between point and set in a metric space

For all non-empty subset $A$ in a metric space $M$, let $A_* = \{x\in M:d(x,A)=0\}$. Show that $(A_*)_* = A_*$. Definition: $d(a,X) = \inf\limits_{x\in X}\{d(a,x)\} $. I've just wrote down the definitions but I can't see neither of the inclusions,…