MATH 5345H --- Week 4: The order topology and the finite product topology

← Back to Lecture Notes

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

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

    ={U×VU open in X,V open in Y}.

    Proof. Basis axiom (2) from (U1×V1)(U2×V2)=(U1U2)×(V1V2). 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×CB,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. π11(U)=U×Y and π21(V)=X×V; (U×Y)(X×V)=U×V.

  •  Lem. Hence 𝒮={π11(U)}{π21(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 YX:   𝒯Y={YUU𝒯}. A topology on Y; (Y,𝒯Y) is a subspace.

    Proof. All three axioms come from distributivity: (YUα)=YUα, likewise for finite .

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

  • Lem.  a basis for X Y={YB} is a basis for 𝒯Y.

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

  • Ex. (X,d) metric, YX with d=d|Y×Y. Then Bd(x,ε)=YBd(x,ε) and 𝒯d=(𝒯d)Y: the subspace metric induces the subspace topology.

  • Lem. Y open in X (VY open in Y open in X).

  •  Thm. AX, BY subspaces. On A×B the product topology = the subspace topology from X×Y.

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

0.3  (§17) Closed sets and limit points

  • Def. AX is closed iff XA 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 AYX. Say closed in Y (i.e. YA open in Y) or closed in X.

  • Thm. YX subspace, AY. Then A closed in Y A=YB for some B closed in X.

  • Lem. Y closed in X (AY closed in Y closed in X).

  •  Def. ClA=A¯={K closedAK}; IntA={U openUA}.

  • Lem. A¯ closed, AA¯, and AK closed A¯K. Dually IntA open, IntAA, and UA open UIntA.

  • Ex. A=[a,b): A¯=[a,b], IntA=(a,b).

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

  • Lem. XA¯=Int(XA)  and  XIntA=XA¯.

  • Ex. A=: A¯=, IntA= (and same for ).

  •  Thm. (Closure in a subspace.) AYX. The closure of A in Y equals YA¯, 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 xU and U is open. A meets B if AB.

  •  Thm. xA¯ every neighborhood of x meets A. It suffices to test basis elements containing x.

    Proof. Contrapositive of xInt(XA); negate twice on the board and the statement falls out.

  • Ex. A={1/nn}: every basis element (a,b)0 contains (ε,ε), hence 1/n for n>1/ε. So 0A¯ 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 xA{x}¯. Derived set A.

  • Ex. A={1/nn}: A={0}, A¯=A{0}.

  •  Thm. A¯=AA. Cor. A closed AA.

  • Def. xny: every neighborhood of y contains xn for all nN, 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 xy there are neighborhoods Ux, Vy with UV=.

  • 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=limnxn.

    Proof. If xny and xnz with yz, then xnUV= for large n.

  • Thm. X Hausdorff every finite subset is closed.

    Proof. Enough for {x}: any yx has Vy missing x.

  • Thm. X Hausdorff, AX: xA every neighborhood of x meets A in infinitely many points.

  • Lem. X,Y Hausdorff X×Y Hausdorff.