MATH 5345H --- Week 4: Products, subspaces, closed sets, and limit points

← Back to Lecture Notes

0.1  (§15) The product topology on X×Y

  • •

    ★ Def. Product topology on X×Y: generated by the basis

    ℬ={U×V∣U⁢ open in ⁢X,V⁢ open in ⁢Y}.

    Proof. Basis axiom (2) from (U1×V1)∩(U2×V2)=(U1∩U2)×(V1∩V2). Note a union of two rectangles is generally not a rectangle — open sets are unions of basis elements, not basis elements.

  • •

    Thm. If ℬ is a basis for X and 𝒞 for Y, then 𝒟={B×C∣B∈ℬ,C∈𝒞} is a basis for the product topology.

    Proof. Recognition criterion: given (x,y)∈W, shrink twice — first to U×V, then to B×C.

  • •

    Ex. Open rectangles form a basis for ℝ×ℝ; this is the Euclidean topology.

  • •

    Def. Projections π1⁢(x,y)=x, π2⁢(x,y)=y.

  • •

    Lem. π1−1⁢(U)=U×Y and π2−1⁢(V)=X×V; (U×Y)∩(X×V)=U×V.

  • •

    ★ Lem. Hence 𝒮={π1−1⁢(U)}∪{π2−1⁢(V)} is a subbasis for the product topology.

    Note. This is the form that generalises to infinite products; the rectangle picture does not.

0.2  (§16) The subspace topology

  • •

    ★ Def. For Y⊂X:   𝒯Y={Y∩U∣U∈𝒯}. A topology on Y; (Y,𝒯Y) is a subspace.

    Proof. All three axioms come from distributivity: ⋃(Y∩Uα)=Y∩⋃Uα, likewise for finite ∩.

  • •

    Caution. “V is open” is ambiguous when V⊂Y⊂X. Always say open in Y or open in X.

  • •

    Lem. ℬ a basis for X ⇒ ℬY={Y∩B} is a basis for 𝒯Y.

  • •

    Ex. X=ℝ, A=[0,1): subspace basis consists of [0,b) and (a,b), 0<a<b≤1. So [0,12) is open in A.

  • •

    Ex. (X,d) metric, Y⊂X with d′=d|Y×Y. Then Bd′⁢(x,ε)=Y∩Bd⁢(x,ε) and 𝒯d′=(𝒯d)Y: the subspace metric induces the subspace topology.

  • •

    Lem. Y open in X ⇒ (V⊂Y open in Y ⇔ open in X).

  • •

    ★ Thm. A⊂X, B⊂Y subspaces. On A×B the product topology = the subspace topology from X×Y.

    Proof. (A∩U)×(B∩V)=(A×B)∩(U×V) — the two bases coincide, not merely generate the same topology.

0.3  (§17) Closed sets and limit points

  • •

    Def. A⊂X is closed iff X−A is open.

  • •

    Ex. [a,b] closed in ℝ. Discrete: all subsets closed. Trivial: only ∅,X. Cofinite: the finite sets, and X.

  • •

    ★ Thm. In any X: (1) ∅,X closed; (2) arbitrary intersections of closed sets are closed; (3) finite unions of closed sets are closed.

    Proof. Pure De Morgan — the quantifiers swap. One may equally define a topology by declaring the closed sets and imposing these three.

  • •

    Caution. Not a dichotomy: sets may be both open and closed (clopen), or neither.

  • •

    Caution. As with “open”, the phrase “A is closed” is ambiguous when A⊂Y⊂X. Say closed in Y (i.e. Y−A open in Y) or closed in X.

  • •

    Thm. Y⊂X subspace, A⊂Y. Then A closed in Y ⇔ A=Y∩B for some B closed in X.

  • •

    Lem. Y closed in X ⇒ (A⊂Y closed in Y ⇔ closed in X).

  • •

    ★ Def. Cl⁡A=A¯=⋂{K⁢ closed∣A⊂K}; Int⁡A=⋃{U⁢ open∣U⊂A}.

  • •

    Lem. A¯ closed, A⊂A¯, and A⊂K closed ⇒A¯⊂K. Dually Int⁡A open, Int⁡A⊂A, and U⊂A open ⇒U⊂Int⁡A.

  • •

    Ex. A=[a,b)⊂ℝ: A¯=[a,b], Int⁡A=(a,b).

  • •

    Ex. Discrete: Int⁡A=A=A¯. Trivial, A proper nonempty: Int⁡A=∅, A¯=X. Sierpiński 𝒯a: Cl⁡{a}=X but Cl⁡{b}={b}.

  • •

    Lem. X−A¯=Int⁡(X−A)  and  X−Int⁡A=X−A¯.

  • •

    Ex. A=ℚ⊂ℝ: A¯=ℝ, Int⁡A=∅ (and same for ℝ−ℚ).

  • •

    ★ Thm. (Closure in a subspace.) A⊂Y⊂X. The closure of A in Y equals Y∩A¯, where A¯ is the closure in X.

  • •

    Ex. X=ℝ, Y=ℚ, A=ℚ∩[0,π). Closure in ℝ is [0,π]; closure in ℚ is A itself. So A is closed in ℚ.

  • •

    Def. U is a neighborhood of x if x∈U and U is open. A meets B if A∩B≠∅.

  • •

    ★ Thm. x∈A¯⇔ every neighborhood of x meets A. It suffices to test basis elements containing x.

    Proof. Contrapositive of x∈Int⁡(X−A); negate twice on the board and the statement falls out.

  • •

    Ex. A={1/n∣n∈ℕ}⊂ℝ: every basis element (a,b)∋0 contains (−ε,ε), hence 1/n for n>1/ε. So 0∈A¯ and A¯={0}∪A.

    Proof. A¯ is closed because its complement is the union of the open sets (−∞,0), (1/(n+1),1/n) for n∈ℕ, and (1,∞).

  • •

    Def. x is a limit point of A if every neighborhood of x meets A−{x}; equivalently x∈A−{x}¯. Derived set A′.

  • •

    Ex. A={1/n∣n∈ℕ}⊂ℝ: A′={0}, A¯=A∪{0}.

  • •

    ★ Thm. A¯=A∪A′. Cor. A closed ⇔A′⊂A.

  • •

    Def. xn→y: every neighborhood of y contains xn for all n≥N, some N. Enough to test basis elements.

  • •

    Caution. Ex. Sierpiński {a,b} with 𝒯a: the constant sequence (a,a,…) converges to both a and b. Limits need not be unique.

  • •

    ★ Def. X is Hausdorff if for all x≠y there are neighborhoods U∋x, V∋y with U∩V=∅.

  • •

    Ex. {a,b} discrete is Hausdorff: {a},{b} are disjoint neighborhoods. {a,b} with 𝒯a is not: the only neighborhood of b is X, which meets every neighborhood of a.

  • •

    Lem. Every metric space is Hausdorff

    Proof. take ε=d⁢(x,y)/2 and use the triangle inequality.

  • •

    Rmk. Hausdorff is inherited by finer topologies — “enough open sets locally”.

  • •

    ★ Thm. X Hausdorff ⇒ every convergent sequence has exactly one limit; write y=limn→∞xn.

    Proof. If xn→y and xn→z with y≠z, then xn∈U∩V=∅ for large n.

  • •

    Thm. X Hausdorff ⇒ every finite subset is closed.

    Proof. Enough for {x}: any y≠x has V∋y missing x.

  • •

    Thm. X Hausdorff, A⊂X: x∈A′ ⇔ every neighborhood of x meets A in infinitely many points.

  • •

    Lem. X,Y Hausdorff ⇒X×Y Hausdorff.