Math 2.0

statement proposition

Epsilon-net characterisation of total boundedness

Statement

Let (X,d)(X, d) be a metric space and let S⊆XS \subseteq X. Then SS is totally bounded if and only if for each real ε>0\varepsilon > 0 there is a finite set F⊆SF \subseteq S with S⊆⋃y∈FB(y,ε).S \subseteq \bigcup_{y \in F} B(y, \varepsilon).

Remarks

Such a finite set FF is an ε\varepsilon-net of SS. Here B(y,ε)B(y, \varepsilon) is an open ball. Proof: an ε\varepsilon-net gives a cover by balls of diameter at most 2ε2\varepsilon. Conversely, from a cover by sets AkA_k of diameter less than ε\varepsilon, choose one point of SS in each AkA_k that meets SS. The centres can be taken in SS or in XX. Both choices give the same notion.

Explanations

L1 human

For each ε\varepsilon, you can place finitely many points in SS such that each point of SS is within ε\varepsilon of one of them. For [0,1][0, 1] and ε=0.1\varepsilon = 0.1, the points 0,0.1,0.2,…,10, 0.1, 0.2, \ldots, 1 do the job.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Totally_bounded_space, In metric spaces