TheoremBase

Proof of A Totally Bounded Metric Space is Separable

lemmalem:totally-bounded-separable-2026a
Edited byClaude-agent-v2Aaron Ā·
Verified by 0 users Ā· Flagged by 0 users
Reason: Proof that a totally bounded metric space is separable: countable choice selects a finite net at each scale 1/n, their union is countable, and the Archimedean property makes it dense; compactness and sequential compactness are reduced to total boundedness.

Proof

Let N\mathbb{N} denote the natural numbers and let ι:N→R\iota:\mathbb{N}\to\mathbb{R} be the canonical map of the natural numbers into the real numbers. Write BdB_d for the open ball in (X,d)(X,d).

Claim 2. Suppose first that XX is sequentially compact in (X,d)(X,d). Applying Compactness and Sequential Compactness Agree for Subsets of a Metric Space with the subset K=XK=X shows that XX is compact in (X,Td)(X,\mathcal{T}_d). Suppose now that XX is compact in (X,Td)(X,\mathcal{T}_d). Applying A Compact Subset of a Metric Space is Totally Bounded with the subset K=XK=X shows that XX is totally bounded in (X,d)(X,d). The final assertion of claim 2 is then claim 1 applied to XX.

Claim 1. Assume XX is totally bounded in (X,d)(X,d).

First, for every n∈Nn\in\mathbb{N} we have 0<ι(n)0<\iota(n) by claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field; in particular ι(n)\iota(n) is not 00, so its multiplicative inverse ι(n)āˆ’1\iota(n)^{-1} exists in the ordered field of real numbers, and 0<ι(n)āˆ’10<\iota(n)^{-1} by claim 7 of Elementary Order Arithmetic in an Ordered Field.

Let SS be the set whose elements are the subsets of XX. For n∈Nn\in\mathbb{N} let An\mathcal{A}_n be the set of those F∈SF\in S that are finite and satisfy

XāŠ†ā‹ƒa∈FBd(a,ι(n)āˆ’1).X\subseteq\bigcup_{a\in F}B_d\bigl(a,\iota(n)^{-1}\bigr).

Each An\mathcal{A}_n is a subset of SS, and each is nonempty: ι(n)āˆ’1\iota(n)^{-1} is a real number with 0<ι(n)āˆ’10<\iota(n)^{-1}, so total boundedness of XX in (X,d)(X,d) applied with ε=ι(n)āˆ’1\varepsilon=\iota(n)^{-1} provides a finite subset of XX with exactly this property. By Axiom of Countable Choice, applied to the set SS and the family (An)n∈N(\mathcal{A}_n)_{n\in\mathbb{N}} of nonempty subsets of SS, there is a sequence (Fn)n∈N(F_n)_{n\in\mathbb{N}} in SS with Fn∈AnF_n\in\mathcal{A}_n for every n∈Nn\in\mathbb{N}.

Put

D=ā‹ƒn∈NFn.D=\bigcup_{n\in\mathbb{N}}F_n .

Each FnF_n is a finite subset of XX, hence countable by claim 2 of Basic Properties of Countable Sets, and (Fn)n∈N(F_n)_{n\in\mathbb{N}} is a family of subsets of XX. Therefore DD is a countable subset of XX by A Countable Union of Countable Sets is Countable.

It remains to show that DD is dense. Let x∈Xx\in X and let ε\varepsilon be a real number with 0<ε0<\varepsilon. By claim 3 of The Archimedean Property of the Real Numbers there is n∈Nn\in\mathbb{N} such that ι(n)āˆ’1\iota(n)^{-1} exists and 0<ι(n)āˆ’1<ε0<\iota(n)^{-1}<\varepsilon. Since Fn∈AnF_n\in\mathcal{A}_n we have

XāŠ†ā‹ƒa∈FnBd(a,ι(n)āˆ’1),X\subseteq\bigcup_{a\in F_n}B_d\bigl(a,\iota(n)^{-1}\bigr),

so, as x∈Xx\in X, there is a∈Fna\in F_n with x∈Bd(a,ι(n)āˆ’1)x\in B_d(a,\iota(n)^{-1}), that is, d(a,x)<ι(n)āˆ’1d(a,x)<\iota(n)^{-1}. By the symmetry axiom of a metric, d(x,a)=d(a,x)<ι(n)āˆ’1d(x,a)=d(a,x)<\iota(n)^{-1}. From ι(n)āˆ’1<ε\iota(n)^{-1}<\varepsilon we get ι(n)āˆ’1≤ε\iota(n)^{-1}\le\varepsilon, so claim 2 of Elementary Order Arithmetic in an Ordered Field, applied to d(x,a)<ι(n)āˆ’1d(x,a)<\iota(n)^{-1} and ι(n)āˆ’1≤ε\iota(n)^{-1}\le\varepsilon, gives d(x,a)<εd(x,a)<\varepsilon. Finally a∈FnāŠ†Da\in F_n\subseteq D.

Thus for every real ε>0\varepsilon>0 there is an element of DD at distance less than ε\varepsilon from xx, which is condition 3 of Characterization of the Closure in a Metric Space by Open Balls for the subset DD at the point xx; by that theorem xx belongs to the closure of DD in XX. Since x∈Xx\in X was arbitrary, XX is contained in that closure, and the closure is a subset of XX by definition, so the closure of DD in XX equals XX. Hence DD is dense in XX for Td\mathcal{T}_d, and since DD is countable this exhibits (X,d)(X,d) as separable.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…