Total boundedness characterization via ε-nets

A set is totally bounded iff it has a finite ε-net for every ε>0
Total boundedness characterization via ε-nets

Let (X,d)(X,d) be a and let EXE\subseteq X.

An ε\varepsilon-net for EE is a finite set {x1,,xN}X\{x_1,\dots,x_N\}\subseteq X such that Ej=1NHAHAHUGOSHORTCODE810s1HBHB(xj,ε). E\subseteq \bigcup_{j=1}^N (x_j,\varepsilon).

Proposition: The following are equivalent:

  • EE is , meaning: for every ε>0\varepsilon>0 there exist x1,,xNXx_1,\dots,x_N\in X such that Ej=1NB(xj,ε)E\subseteq \bigcup_{j=1}^N B(x_j,\varepsilon).
  • For every ε>0\varepsilon>0, EE admits a finite ε\varepsilon-net.

(These are the same statement in slightly different language; “ε\varepsilon-net” is the packaging.)

Total boundedness is stronger than and is one of the two metric ingredients (the other is ) that together characterize in metric spaces.

Examples:

  • The interval [0,1]R[0,1]\subset\mathbb{R} is totally bounded: cover it by finitely many intervals of length ε\varepsilon.
  • The set ZR\mathbb{Z}\subset\mathbb{R} is not totally bounded: for ε<1/2\varepsilon<1/2 the balls B(n,ε)B(n,\varepsilon) are disjoint, so no finite subcover exists.