logo

Diameter of a Set in a Metric Space 📂MetricSpace

Diameter of a Set in a Metric Space

Definition1

Let EE be a subset of the metric space (X,d)(X,d). And suppose SS is as follows.

S={d(p,q):p,qE} S=\left\{ d(p, q) : \forall p, q \in E\right\}

Then, the least upper bound supS\sup S of SS is called the diameter of EE and is denoted by diamE\operatorname{diam} E.

Explanation

Let {pn}\left\{ p_{n} \right\} be a sequence in the metric space XX, called EN={pN,pN+1,pN+2,}E_{N}=\left\{ p_{N},p_{N+1},p_{N+2},\cdots \right\}. Then, by the definition of a Cauchy sequence and the diameter, {pn}\left\{ p_{n} \right\} being a Cauchy sequence is equivalent to limNdiamEN=0 \lim \limits_{N\to\infty} \operatorname{diam} E_{N}=0 .

Theorem

(a) Let EE be a subset of the metric space XX. Then, the following holds.

diamE=diamE \operatorname{diam} \overline{E} = \operatorname{diam} E

Here, E\overline{E} is the closure of EE.

(b) Let {Kn}\left\{ K_{n} \right\} be a sequence of compact sets in a metric space. If KnKn+1K_{n}\supset K_{n+1} and

limndiamKn=0 \begin{equation} \lim \limits_{n\to\infty} \operatorname{diam}K_{n}=0 \end{equation}

then, n=1Kn\bigcap _{n=1}^{\infty}K_{n} consists of exactly one point.

Proof

(a)

Since EEE \subset \overline{E}, the following is evident.

diamEdiamE \operatorname{diam} E \le \operatorname{diam} \overline{E}

Let any positive number ε>0\varepsilon >0 be given. And choose two points p,qEp, q\in \overline{E}. By the definition of closure and limit points,

d(p,p)<εandd(q,q)<ε d(p,p^{\prime}) \lt \varepsilon \quad \text{and} \quad d(q, q^{\prime}) \lt \varepsilon

there exists p,qEp^{\prime}, q^{\prime} \in E satisfying. Thus, the following holds.

d(p,q)d(p,p)+d(p,q)+d(q,q)2ε+d(p,q)2ε+diamE \begin{align*} d(p, q) &\le d(p,p^{\prime}) +d(p^{\prime}, q^{\prime})+d(q^{\prime}, q) \\ &\le 2\varepsilon + d(p^{\prime}, q^{\prime}) \\ &\le 2\varepsilon + \operatorname{diam} E \end{align*}

Since this is true for any p,qEp, q \in \overline{E}, the following holds.

diamE2ε+diamE \operatorname{diam} \overline{E} \le 2\varepsilon + \operatorname{diam} E

Since ε\varepsilon is any positive number, the equation below holds.

diamEdiamE \operatorname{diam} \overline{E} \le \operatorname{diam} E

Therefore, diamE=diamE\operatorname{diam} \overline{E}=\operatorname{diam} E is true.

(b)

Let K=n=1KnK=\bigcap _{n=1}^{\infty}K_{n}. Then, KK is not empty. If KK contains more than two points, then diamK>0\operatorname{diam} K >0. However, since nn for each KnKK_{n} \supset K, the following holds.

diamKndiamK \operatorname{diam} K_{n} \ge \operatorname{diam} K

This is a contradiction for (1)(1), so it is wrong that KK contains more than two points. Therefore, since KK is not empty and does not contain more than two points, it consists exactly of one point.


  1. Walter Rudin, Principles of Mathmatical Analysis (3rd Edition, 1976), p52-53 ↩︎