0.1 (§15) The product topology on
- •
Def. Product topology on : generated by the basis
Proof. Basis axiom (2) from . 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 and for , then is a basis for the product topology.
Proof. Recognition criterion: given , shrink twice — first to , then to .
- •
Ex. Open rectangles form a basis for ; this is the Euclidean topology.
- •
Def. Projections , .
- •
Lem. and ; .
- •
Lem. Hence 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 : . A topology on ; is a subspace.
Proof. All three axioms come from distributivity: , likewise for finite .
- •
Caution. “ is open” is ambiguous when . Always say open in or open in .
- •
Lem. a basis for is a basis for .
- •
Ex. , : subspace basis consists of and , . So is open in .
- •
Ex. metric, with . Then and : the subspace metric induces the subspace topology.
- •
Lem. open in ( open in open in ).
- •
Thm. , subspaces. On the product topology the subspace topology from .
Proof. — the two bases coincide, not merely generate the same topology.
0.3 (§17) Closed sets and limit points
- •
Def. is closed iff is open.
- •
Ex. closed in . Discrete: all subsets closed. Trivial: only . Cofinite: the finite sets, and .
- •
Thm. In any : (1) 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 “ is closed” is ambiguous when . Say closed in (i.e. open in ) or closed in .
- •
Thm. subspace, . Then closed in for some closed in .
- •
Lem. closed in ( closed in closed in ).
- •
Def. ; .
- •
Lem. closed, , and closed . Dually open, , and open .
- •
Ex. : , .
- •
Ex. Discrete: . Trivial, proper nonempty: , . Sierpiński : but .
- •
Lem. and .
- •
Ex. : , (and same for ).
- •
Thm. (Closure in a subspace.) . The closure of in equals , where is the closure in .
- •
Ex. , , . Closure in is ; closure in is itself. So is closed in .
- •
Def. is a neighborhood of if and is open. meets if .
- •
Thm. every neighborhood of meets . It suffices to test basis elements containing .
Proof. Contrapositive of ; negate twice on the board and the statement falls out.
- •
Ex. : every basis element contains , hence for . So and .
Proof. is closed because its complement is the union of the open sets , for , and .
- •
Def. is a limit point of if every neighborhood of meets ; equivalently . Derived set .
- •
Ex. : , .
- •
Thm. . Cor. closed .
- •
Def. : every neighborhood of contains for all , some . Enough to test basis elements.
- •
Caution. Ex. Sierpiński with : the constant sequence converges to both and . Limits need not be unique.
- •
Def. is Hausdorff if for all there are neighborhoods , with .
- •
Ex. discrete is Hausdorff: are disjoint neighborhoods. with is not: the only neighborhood of is , which meets every neighborhood of .
- •
Lem. Every metric space is Hausdorff
Proof. take and use the triangle inequality.
- •
Rmk. Hausdorff is inherited by finer topologies — “enough open sets locally”.
- •
Thm. Hausdorff every convergent sequence has exactly one limit; write .
Proof. If and with , then for large .
- •
Thm. Hausdorff every finite subset is closed.
Proof. Enough for : any has missing .
- •
Thm. Hausdorff, : every neighborhood of meets in infinitely many points.
- •
Lem. Hausdorff Hausdorff.