MATH 5345H --- Week 6: The metric topology

← Back to Lecture Notes

0.1  (§20) The metric topology

  • •

    Def. (X,𝒯) is metrizable if 𝒯=𝒯d for some metric d.

  • •

    Def. (X,d) bounded if d≤M throughout; diam⁡(X)=sup{d⁢(x,y)}.

  • •

    ★ Thm. d¯⁢(x,y)=min⁡{d⁢(x,y),1} is a bounded metric inducing the same topology as d.

    Proof. Triangle inequality by cases. Same topology because ε-balls with ε<1 already form a basis, and there d and d¯ agree. Moral: boundedness is metric data, not topological data.

  • •

    Def. On ℝn:  ‖x‖=x12+⋯+xn2, d⁢(x,y)=‖y−x‖ (Euclidean); ‖x‖∞=maxi⁡|xi|, ρ⁢(x,y)=‖y−x‖∞ (square metric).

  • •

    Thm. d and ρ induce the same topology on ℝn.

  • •

    Def. ℝJ={x:J→ℝ};  ℝω for J=ℕ.

    Note. Neither ‖x‖ nor ‖x‖∞ is defined for all of ℝω — hence the need to truncate with d¯.

  • •

    Def. Uniform metric on XJ, (X,d) metric: ρ¯⁢(x,y)=sup{d¯⁢(xα,yα)∣α∈J}. The induced topology is the uniform topology.

  • •

    Thm. On ℝJ: uniform topology is finer than the product topology (strictly, for J infinite).

    Proof. Given a basis box B constrained at α1,…,αn, take ε=mini⁡εi; then Bρ¯⁢(x,ε)⊂B.

  • •

    ★ Thm. The product topology on ℝω is metrizable: D⁢(x,y)=sup{d¯⁢(xn,yn)/n|n∈ℕ} induces it.

    Note. The 1/n damping makes all but finitely many coordinates irrelevant at scale ε — exactly matching “Un≠ℝ for finitely many n”.

0.2  (§21) The metric topology, continued

  • •

    Def. X has a countable basis at x if there are neighborhoods {Bn}n=1∞ of x such that every neighborhood of x contains some Bn. X is first-countable if this holds at every point. May assume B1⊃B2⊃⋯ (replace Bn by B1∩⋯∩Bn).

  • •

    Lem. Every metric space is first-countable  — take Bd⁢(x,1/n).

  • •

    ★ Lem. (Sequence lemma.) If some sequence in A converges to x, then x∈A¯. If X is metrizable, the converse holds.

    Proof. Converse: pick xn∈A∩Bd⁢(x,1/n).

  • •

    ★ Thm. f continuous ⇒ (xn→x gives f⁢(xn)→f⁢(x)). If X is metrizable, the converse holds.

    Proof. Converse: show f⁢(A¯)⊂f⁢(A)¯ using the sequence lemma.

  • •

    ★ Lem. ℝJ with J uncountable is not metrizable.

    Proof. Let A={x∣xα≠1⁢ for finitely many ⁢α} and x=0. Then 0∈A¯, but no sequence in A converges to 0: the union of countably many finite “support” sets misses some β∈J, and πβ−1⁢(−12,12) separates. So the sequence lemma fails.