Survey of Mathematics
Unit 4

Space and closeness

Distance, completeness, compactness: the bridge to analysis and topology.

5 chapters written · 32 definitions · 55 theorems · builds on Unit 1, Unit 2

The story

Unit 1 measured closeness with ∣x−y∣|x - y| on the number line. Here distance becomes an idea of its own: anything that satisfies three rules is a metric, and the same proofs then work for points in the plane, for functions, and for strings of bits.

The unit builds open and closed sets (4.1), completeness and the fixed point theorem that powers existence proofs (4.2), compactness, the property that makes maxima exist (4.3), connectedness (4.4), and continuity described by open sets alone (4.5), which is where topology (MATH 551) begins.

Chapters

  1. 4.1Metric and normed spaces; open and closed setsEvery ε-proof of Unit 1 used the distance |x − y| through only four properties. Any rule of distance with those four properties gives a metric space, and then open balls, open and closed sets, interior, closure and boundary make sense for vectors, functions and bit strings with the same proofs.
  2. 4.2Convergence, completeness and the contraction mapping theoremA space is complete when every sequence whose terms bunch together has a limit in the space. A map that shrinks every distance by a fixed factor below 1, run again and again in a complete space, always settles on exactly one fixed point. That is how cos x = x, Newton's method, PageRank and reinforcement-learning value iteration all work.
  3. 4.3CompactnessA set is compact when every sequence in it has a subsequence converging inside it, or equivalently when every cover by open sets can be trimmed to finitely many. In R^n that means closed and bounded (Heine–Borel), in function spaces it does not, and compactness is exactly what makes continuous functions attain extremes and have one delta for the whole set.
  4. 4.4Connectedness and path-connectednessA space is connected when it cannot be split into two separate open pieces. The connected subsets of the line are exactly the intervals, a continuous map sends connected sets to connected sets, and that one fact is the intermediate value theorem. Path-connected is stronger, and the topologist's sine curve shows the gap.
  5. 4.5Continuity between metric spacesReplace the two absolute values in the epsilon-delta definition by two distances and you have continuity for maps between any metric spaces. It is the same as continuity along sequences, and the same as 'preimages of open sets are open', which needs no distance at all and is where topology begins. Several variables bring new failures (limits that depend on the path), and homeomorphisms say when two spaces have the same shape.

The theorem chain

Every theorem in the unit, in the order it is proved. Each one is used by the ones after it. The label says whether it is on the 375/376 exams (T), an Apostol extra (A), or beyond both (B).

4.1 Metric and normed spaces; open and closed sets

  1. Theorem · B A norm gives a metric If ∥⋅∥\lVert \cdot \rVert is a norm on VV, then d(x,y)=∥x−y∥d(x, y) = \lVert x - y \rVert is a metric on VV.
  2. Theorem · B The standard norms are norms ∥⋅∥1\lVert \cdot \rVert_1, ∥⋅∥2\lVert \cdot \rVert_2 and ∥⋅∥∞\lVert \cdot \rVert_\infty are norms on Rn\mathbb R^n, and the sup norm is a norm on C[a,b]C[a, b].
  3. Theorem · B The discrete metric and the Hamming distance are metrics The discrete metric on any set, and dHd_H on bit strings of length nn, satisfy (M1), (M2) and (M3).
  4. Proposition · T Open balls are open Every open ball B(x,r)B(x, r) is an open set.
  5. Theorem · T Unions and finite intersections of open sets ∅\varnothing and XX are open; any union of open sets is open; the intersection of finitely many open sets is open.
  6. Corollary · T Intersections and finite unions of closed sets ∅\varnothing and XX are closed; any intersection of closed sets is closed; the union of finitely many closed sets is closed.
  7. Theorem · B Interior, closure and boundary int⁡A\operatorname{int} A is the largest open set inside AA; A‾\overline A is the smallest closed set containing AA and equals AA together with its limit points; ∂A=A‾∖int⁡A\partial A = \overline A \setminus \operatorname{int} A.
  8. Theorem · B A closed set contains its limit points A set AA is closed if and only if every limit point of AA belongs to AA.
  9. Theorem · B Comparing the 1-, 2- and max-norms For every x∈Rnx \in \mathbb R^n: ∥x∥∞≤∥x∥2≤∥x∥1≤n ∥x∥2≤n ∥x∥∞\lVert x \rVert_\infty \le \lVert x \rVert_2 \le \lVert x \rVert_1 \le \sqrt n\,\lVert x \rVert_2 \le n\,\lVert x \rVert_\infty.
  10. Theorem · B Equivalent norms give the same open sets If two norms on VV are equivalent, a set is open for one iff it is open for the other, so they also have the same closed sets, interiors, closures and boundaries.

4.2 Convergence, completeness and the contraction mapping theorem

  1. Theorem · B Limits in a metric space are unique A sequence in a metric space converges to at most one point.
  2. Theorem · B Convergence in R^n is coordinatewise A sequence of vectors converges in Rn\mathbb R^n (for any of the 1-, 2- or max-distances) if and only if each coordinate converges as a sequence of real numbers.
  3. Theorem · B Convergence in the sup metric is uniform convergence For continuous fnf_n and ff on [a,b][a, b]: d∞(fn,f)→0d_\infty(f_n, f) \to 0 if and only if fn→ff_n \to f uniformly on [a,b][a, b].
  4. Theorem · B Closed sets and limits of sequences A point lies in the closure of AA if and only if some sequence in AA converges to it. Hence AA is closed if and only if the limit of every convergent sequence of points of AA lies in AA.
  5. Theorem · B Convergent sequences are Cauchy If xn→xx_n \to x in a metric space, then (xn)(x_n) is Cauchy.
  6. Theorem · B R^n is complete Rn\mathbb R^n with the 1-, 2- or max-distance is complete.
  7. Theorem · B C[a, b] with the sup metric is complete Every Cauchy sequence of continuous functions on [a,b][a, b], in the sup metric, converges uniformly to a continuous function.
  8. Theorem · B Closed subsets of complete spaces are complete Inside a complete space, a subset with the same distance is complete if and only if it is closed.
  9. Theorem · B Derivative test for a contraction If gg is differentiable on an interval II and ∣g′(x)∣≤q<1\lvert g'(x) \rvert \le q < 1 for every x∈Ix \in I, then ∣g(x)−g(y)∣≤q∣x−y∣\lvert g(x) - g(y) \rvert \le q\lvert x - y \rvert for all x,y∈Ix, y \in I.
  10. Theorem · B Banach fixed point theorem A contraction TT of a non-empty complete metric space has exactly one fixed point x∗x^*; from any start x0x_0 the iterates xn+1=Txnx_{n+1} = T x_n converge to x∗x^*, with d(xn,x∗)≤qn1−q d(x1,x0)d(x_n, x^*) \le \dfrac{q^n}{1 - q}\,d(x_1, x_0).
  11. Theorem · B Newton's method is a local contraction

4.3 Compactness

  1. Theorem · B Sequentially compact sets are closed and bounded In any metric space, a sequentially compact set is closed and bounded.
  2. Theorem · B Bolzano–Weierstrass in R^n Every closed bounded subset of Rn\mathbb R^n is sequentially compact: each sequence in it has a subsequence converging to a point of it.
  3. Theorem · B Compact sets are closed and bounded In any metric space, every compact set is closed and bounded.
  4. Lemma · B Closed subsets of compact sets are compact If QQ is compact and F⊆QF \subseteq Q is closed, then FF is compact.
  5. Theorem · B Heine–Borel theorem A subset of Rn\mathbb R^n is compact if and only if it is closed and bounded.
  6. Lemma · B Sequentially compact implies totally bounded A sequentially compact metric space can be covered by finitely many balls of any given radius.
  7. Lemma · B Lebesgue number lemma
  8. Theorem · B Compact equals sequentially compact In a metric space, a set is compact if and only if it is sequentially compact.
  9. Theorem · B Compact equals complete and totally bounded A metric space is compact if and only if it is complete and totally bounded.
  10. Proposition · B The unit ball of C[0,1] is closed and bounded but not compact In C[0,1]C[0, 1] with the sup metric, the closed unit ball {f:max⁡∣f∣≤1}\{f : \max|f| \le 1\} is closed and bounded and has a sequence with no convergent subsequence, so it is not compact.
  11. Lemma · B Continuous maps send convergent sequences to convergent sequences If ff is continuous at aa and xn→ax_n \to a, then f(xn)→f(a)f(x_n) \to f(a).
  12. Theorem · B Continuous image of a compact set is compact If KK is compact and f:K→Yf : K \to Y is continuous, then f(K)f(K) is compact.
  13. Theorem · B Extreme value theorem on a compact set A continuous real function on a non-empty compact set attains a maximum and a minimum.
  14. Theorem · B Continuous on a compact set implies uniformly continuous A continuous map from a compact metric space to any metric space is uniformly continuous: one δ\delta works for the whole set.

4.4 Connectedness and path-connectedness

  1. Lemma · B Open sets inside a subset UU is open in AA if and only if U=A∩WU = A \cap W for some open set WW of XX.
  2. Proposition · B Connected means no proper clopen subset A space AA is connected if and only if the only subsets that are both open and closed in AA are ∅\varnothing and AA.
  3. Lemma · B A connected subset lies on one side of a separation If Z=P∪QZ = P \cup Q is a separation and C⊆ZC \subseteq Z is connected, then C⊆PC \subseteq P or C⊆QC \subseteq Q.
  4. Theorem · B Connected subsets of the line are the intervals A subset of R\mathbb R is connected if and only if it is an interval.
  5. Lemma · B Continuous maps pull open sets back to open sets If f:X→Yf : X \to Y is continuous and WW is open in YY, then f−1(W)={x:f(x)∈W}f^{-1}(W) = \{x : f(x) \in W\} is open in XX.
  6. Theorem · B The continuous image of a connected set is connected If XX is connected and f:X→Yf : X \to Y is continuous, then f(X)f(X) is connected.
  7. Corollary · B Intermediate value theorem from connectedness If XX is a connected metric space and f:X→Rf : X \to \mathbb R is continuous, then ff takes every value between any two of its values.
  8. Theorem · B Path-connected implies connected A path-connected space is connected.
  9. Theorem · B Open connected sets in R^n are path-connected If U⊆RnU \subseteq \mathbb R^n is open and connected, then any two points of UU can be joined by a path in UU.
  10. Lemma · B Closure of a connected set is connected If AA is connected and A⊆B⊆A‾A \subseteq B \subseteq \overline A, then BB is connected.
  11. Proposition · B The topologist's sine curve S=G∪LS = G \cup L is connected, but there is no path in SS from (0,0)(0, 0) to (1,sin⁡1)(1, \sin 1).
  12. Theorem · B Zero gradient on a connected open set means constant If U⊆RnU \subseteq \mathbb R^n is open and connected and ff is differentiable on UU with ∇f=O\nabla f = O everywhere, then ff is constant on UU.

4.5 Continuity between metric spaces

  1. Theorem · B Three faces of continuity For f:X→Yf : X \to Y between metric spaces: ff is continuous (with ε\varepsilon and δ\delta) iff xn→ax_n \to a implies f(xn)→f(a)f(x_n) \to f(a) iff the preimage of every open set is open iff the preimage of every closed set is closed.
  2. Theorem · B Building continuous maps Compositions of continuous maps are continuous; sums, multiples, products and quotients (with non-zero denominator) of continuous real functions are continuous; a map into Rm\mathbb R^m is continuous iff each of its mm coordinate functions is; coordinate projections are continuous.
  3. Theorem · B Lipschitz implies uniformly continuous A Lipschitz map is uniformly continuous, hence continuous.
  4. Theorem · B Uniform continuity between metric spaces
  5. Theorem · B Properties preserved by homeomorphisms A homeomorphism sends open sets to open sets, convergent sequences to convergent sequences, compact sets to compact sets and connected sets to connected sets, in both directions.
  6. Proposition · B A continuous bijection from a compact space is a homeomorphism If KK is compact and f:K→Yf : K \to Y is a continuous bijection onto a metric space, then f−1f^{-1} is continuous, so ff is a homeomorphism.
  7. Proposition · B Equivalent norms give the same continuous maps If two norms on VV are equivalent, the identity map between the two normed spaces is a bi-Lipschitz homeomorphism, so a map into or out of VV is continuous for one norm iff it is for the other.
  8. Theorem · B All norms on R^n are equivalent For any norm ∥⋅∥\lVert \cdot \rVert on Rn\mathbb R^n there are constants 0<m≤M0 < m \le M with m∥x∥1≤∥x∥≤M∥x∥1m\lVert x \rVert_1 \le \lVert x \rVert \le M\lVert x \rVert_1 for all xx.

Terms this unit defines

Unit review

A mixed set of 12 quick checks drawn at random from the 45 in this unit's chapters. Each one says which chapter it comes from, so a miss tells you what to reread. Press "New set" for another mix.

Where it leads

Units that build on this one: Unit 5, Differential calculus in many variables, Unit 7, Differential equations, Unit 13, Geometry and topology.