Math 2.0

statement theorem

Compact iff complete and totally bounded

Statement

Let (X,d)(X, d) be a metric space and let K⊆XK \subseteq X. Then KK is compact if and only if KK, with the subspace metric, is complete and KK is totally bounded.

Remarks

Proof idea of the converse: in a totally bounded set, a diagonal argument gives a Cauchy subsequence of each sequence. Completeness gives a limit. Thus KK is sequentially compact, and so compact. In a complete space XX, a subset is compact if and only if it is closed and totally bounded. The Heine–Borel theorem follows, because bounded subsets of Rn\mathbb{R}^n are totally bounded.

Explanations

L1 human

Compactness in a metric space splits into two parts: no holes, and finitely many small pieces for each size. The interval (0,1)(0, 1) is totally bounded but has holes at its ends. The real line has no holes but is not totally bounded.

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.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Totally_bounded_space, Comparison with compact sets
  2. Web https://en.wikipedia.org/wiki/Compact_space, Metric spaces