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

Definition of Gromov-Hausdorff distance

I am working with the following definition of the Gromov-Hausdorff distance for two metric spaces $X$ and $Y$: $d_{G-H}(X, Y) = \inf\{d_H(X, Y) : d \text{ is admissible on } X \sqcup Y \}$, where admissible on the disjoint union $X \sqcup Y$ means…
oac
  • 440
0
votes
1 answer

What is a point function?

The following is a definition of a point function I came across in Metric Spaces by Michael O'Searcoid : Definition: Suppose $(X,d)$ is a metric space and $z \in X$. We shall call the non-negative real function $x \to d(z,x)$ defined on $X$ the…
GovEcon
  • 2,656
0
votes
1 answer

Showing a closure of a set is equal to the set itself, metric spaces

Q:Consider the metric space $(X = [0, ∞), d)$ where d is the metric defined by: $$d(x,y) = |x^2-y^2|$$ Let $A = \mathbb{N} ∪ {0}$. Show that $\bar{A} = A$. Justify your answer. So my thought process was that if we use the definition of closure is…
Amy
  • 115
0
votes
0 answers

Distance metric for sets of sets

What are standard distance metrics for finite sets of finite sets (not necessarily power sets)? I am particularly interested in metrics which take into account the similarity between the member sets, so that sets containing similar but not identical…
quant_dev
  • 105
0
votes
0 answers

cardinal and space metric

problem : Let F(S) be the set of all finite subsets of a set S. For all A,B ∈ F(S), let Δ(A,B) = (A\B) ∪ (B\A) be the symmetric difference between A and B. Let d(A,B) be the cardinality of Δ(A,B). Is d a metric?
malek
  • 1
  • 1
0
votes
1 answer

How to prove $f( D(a,c) ) \le f [ D(a,b) + D(b,c) ] \implies f( D(a,c) ) \le f ( D(a,b) ) + f ( D(b,c) )$?

I am presently working on an exercise from Kaplansky, I. Set Theory and Metric Spaces (ex. 7, pg 70). The question is as follows: Suppose that: $f$ is concave, $f(0) = 0$, $f(x) > 0$ for $x > 0$, and $f$ is montone in the weak sense. Let $M$ be a…
GovEcon
  • 2,656
0
votes
1 answer

Let $d$ be a metric on any non empty set $X$ then prove or give counter example of the following: $d_1(x,y) = d^n(x,y)$ where $n \in \Bbb R$

Let $d$ be a metric on any non empty set $X$ then prove or give counter example of the following: $d_1(x,y) = d^n(x,y)$ where $n \in \Bbb R$ is a metric. My Attempt: I know that $d_1$ is a metric for $n \in \Bbb N$ and $n = \frac {1}{2}$ I think…
0
votes
0 answers

$0<\frac {1}{\sqrt{2+f(x)}+\sqrt{2+g(x)}}<1$ in $C(\mathbb{R}_+)$

So let $C(\mathbb{R}_+)$ be all the continuous functions in $[0,\infty)$, I have the metric space $(C(\mathbb{R}_+),d) \to (C(\mathbb{R}_+),d)$ I have taken $f,g \in (C(\mathbb{R}_+),d)$ And i want to prove that $0<\frac…
0
votes
1 answer

Prove that a set $O \subseteq \mathbb{R}^2$ is open with respect to the euclidean metric if and only if $O$ is open with respect to the maximum metric

I have recently started learning about metric spaces and since I'm having a hard time understanding some of the basics, I tried doing some exercises and I got stuck on this one: Prove that a set $O \subseteq \mathbb{R}^2$ is open with respect to the…
roblox99
  • 427
0
votes
1 answer

Negation of quantifiers in a statement (on convergence of subsequence in a metric space)

I am trying to negate the following statement: Let $\{x_n\}$ in a metric space $M$ and let $p\in M$. if for all $\varepsilon > 0$ there is $k$ such that $x_k\neq p$ and $d(x_k,p)<\varepsilon$ then $\{x_n\}$ has a sub-sequence that converges to…
newhere
  • 3,115
0
votes
1 answer

1)$A^o$ 2)$\overline A$ 3)$A'$ in $A=(-\infty,0)\cap Q$

so in R with the classic metric so d(x,y) = |x-y| and for $A=(-\infty,0)\cap Q$ I have to find 1)$A^o$ which is the interior of A 2)$\overline A$ 3)$A'$ I believe $A^o=\emptyset$ because for every $x \in A$ $B(x,e)$ with $e > 0$ isnt a part of…
0
votes
1 answer

If D is dense then $(X-D)^O=\emptyset$

Let $X$ be a metric with $D\subset X$ I have to prove that the following senteces are equal D is dense $(X-D)^O=\emptyset$ Could you please help me on this one with a hint or something i completely lost. I know that since D is dense every $x\in X…
0
votes
1 answer

Statements about Equivalent metrics? Which are true?

Let $ d_1 $ $ d_2 $ be equivalent metrics in an non empty set X If $U$ is $ d_1 $ open then $U$ is $d_2$ open. If $U$ is $ d_1 $ closed then $U$ is $d_2$ closed. If $U$ is $ d_1 $ bounded then $U$ is $d_2$ bounded. Constant function is $ d_1$ -…
0
votes
0 answers

What are some real life examples of functions that are almost but not quite distance functions?

A metric space is an ordered pair $(M,d)$, where $M$ is a set and $d:M\times M\rightarrow \mathbb{R}$ is a metric on $M$ such that for any $x,y,z\in M$ $d(x,y)=0\Longleftrightarrow x=y$ $d(x,y)\geq 0$ $d(x,y)=d(y,x)$ $d(x,z)\leq d(x,y) +…
0
votes
0 answers

$A'=\mathbb{N}$ for $A=\{{n + 1/m}\mid n,m\in\mathbb N\}$

I have to prove in $\mathbb{R}$ that $A'= \mathbb{N} $, where $$A=\{n + 1/m\mid m,n\in\mathbb N\}.$$ Let me first describe my thought on this one.So in order for these 2 sets to be equal it means that $A'=\{1,2,3...\}$ so for $x=1,2,3..$ I have to…