Open Sets, Closed Sets, and Topological Spaces

Part 4, Chapter 4: Point-Set Topology Basics

Learning objectives

  • Define a topological space as a set with a designated collection of open sets
  • State the three topology axioms (empty set/full set; arbitrary unions; finite intersections)
  • Recognize closed sets as complements of open sets
  • Predict that continuity can be redefined purely in terms of open sets

Topology is the most abstract chapter you will read in this book, and the most important. It strips analysis of distance, coordinates, and even continuity's epsilontextdelta\epsilon\text{-}\delta definition, keeping only the bare minimum needed to talk about "nearness." That minimum turns out to be a designated collection of subsets called open sets. From this single concept, not from distance, not from coordinates, you can build continuity, convergence, compactness, and connectedness. The payoff: every theorem you prove using only open sets applies to wildly more general spaces (function spaces, manifolds, the Zariski topology of algebraic geometry, even finite spaces).

The definition

A topological space is a pair (X,tau)(X,\tau) where XX is a set and tau\tau is a collection of subsets of XX (called open sets) satisfying three axioms:

  • (T1) emptysetintau\emptyset\in\tau and XintauX\in\tau.
  • (T2) Any union of elements of tau\tau is in tau\tau, even an infinite union.
  • (T3) Any finite intersection of elements of tau\tau is in tau\tau.

A set CsubseteqXC\subseteq X is closed when its complement XsetminusCX\setminus C is open. Note carefully: "closed" is not the opposite of "open." A set can be open, closed, both (emptyset\emptyset and XX are always both), or neither. Topology breaks every intuition you had about "open" and "closed" from working with intervals on the real line.

Why "finite" intersections?

The asymmetry between (T2) and (T3) is the heart of the theory. If you allowed arbitrary intersections, every singleton x\{x\} would be open (intersect a shrinking sequence of intervals around xx), forcing the discrete topology on every space. The "finite" restriction is exactly what makes topology richer than that. The classical counterexample: bigcapn=1infty(1/n,1/n)=0\bigcap_{n=1}^{\infty}(-1/n,1/n)=\{0\}n=1infty(1/n,1/n)=0, an infinite intersection of open intervals that is NOT open.

Three canonical topologies on any set

  • Discrete topology: tau=mathcalP(X)\tau=\mathcal{P}(X) (every subset is open). The "finest" possible topology.
  • Indiscrete (trivial) topology: tau=emptyset,X\tau=\{\emptyset,X\}. The "coarsest" possible topology.
  • Standard topology on mathbbR\mathbb{R}: open sets are arbitrary unions of open intervals (a,b)(a,b). This is the one your calculus intuition uses.

The Venn-diagram widget above lets you experiment with intersections, unions, and complements on small finite sets. Try this: in X=a,b,cX=\{a,b,c\} with tau=emptyset,a,a,b,X\tau=\{\emptyset,\{a\},\{a,b\},X\}, what are the closed sets? Answer: complements of the open ones, so X,b,c,c,emptyset\{X,\{b,c\},\{c\},\emptyset\}. The widget helps you see the symmetry between open and closed under complementation.

Where this shows up
  • Network analysis, topological data analysis: Persistent homology computes "holes" of various dimensions in a point cloud, treating the data as a topological space. This has become standard in neuroscience (mapping brain-connectivity invariants), drug discovery (analysing molecular-conformation spaces), and materials science.
  • Molecular biology, DNA knot theory: Circular DNA forms knots and links during replication. Topoisomerase enzymes catalyse strand-passing operations to unknot the DNA, this is literally an application of knot theory, the topology of embedded 1-manifolds in 3-space. Without topology there is no way even to state what an "unknotting" operation does.
  • Distributed computing, consensus impossibility: The Herlihy-Shavit theorem uses topology to prove which distributed-computing tasks are solvable. The shape (connectedness, holes) of a task's "protocol complex" determines solvability, a result from algebraic topology with direct implications for blockchain and consensus protocols.

Pause and think: In the discrete topology on mathbbR\mathbb{R}, every set is open. So every set is also closed (its complement is open). Is the map f:mathbbRtextdiscretetomathbbRtextstandardf:\mathbb{R}_{\text{discrete}}\to\mathbb{R}_{\text{standard}}textstandard, f(x)=xf(x)=x (identity) continuous? Recall: continuous means preimages of open sets are open. (Answer: yes, because in the discrete topology every set is open, so every preimage is open trivially.)

Try it

  • Predict first: is tau=emptyset,a,b,a,b\tau=\{\emptyset,\{a\},\{b\},\{a,b\}\} a topology on X=a,bX=\{a,b\}? Check all three axioms.
  • Find a counterexample showing why (T3) requires "finite": find an infinite collection of open intervals in mathbbR\mathbb{R} whose intersection is not open.
  • In the cofinite topology on mathbbZ\mathbb{Z} (open = complement is finite, plus emptyset\emptyset), is 0,1,2,ldots\{0,1,2,\ldots\} open? closed? both? neither? (Hint: its complement is 1,2,ldots\{-1,-2,\ldots\}, infinite, so the set is NOT open. Itself is also infinite, so its complement is not in the topology, so it is NOT closed. Answer: neither.)
  • Predict: how many distinct topologies exist on the 2-element set a,b\{a,b\}? List them all. (Answer: four, the trivial, the discrete, emptyset,a,X\{\emptyset,\{a\},X\}, and emptyset,b,X\{\emptyset,\{b\},X\}.)
  • Trap: argue that the union of two closed sets is closed, but an infinite union of closed sets need not be closed. (De Morgan + (T2): finite unions of closed = closed; counterexample for infinite: \bigcup_n[1/n,1]=(0,1] which is not closed in mathbbR\mathbb{R}.)

A trap to watch for

"Open" and "closed" are NOT mutually exclusive, and they are NOT complementary. In ANY topology, the empty set and the full set XX are both open and both closed (these are called clopen sets). In the discrete topology, every set is clopen. The intuition that "open and closed are opposites" comes from the special case of intervals on the real line; it does not generalize. Always check definitions, not English.

What you now know

You can verify the three topology axioms on a finite set, identify closed sets via complementation, and recognize the discrete, indiscrete, and standard topologies. The next section specializes to mathbbRn\mathbb{R}^n, where open balls give you the standard topology and the Heine-Borel theorem characterizes compactness.

Mark section complete →

References

  • Garrity, T. (2002). All the Mathematics You Missed. Cambridge UP, ch. 4.
  • Munkres, J. R. (2000). Topology (2nd ed.). Prentice-Hall, ch. 2.
  • Willard, S. (1970). General Topology. Addison-Wesley, ch. 1-2.
  • Kelley, J. L. (1955). General Topology. Van Nostrand, ch. 1.
  • Hatcher, A. (2002). Algebraic Topology. Cambridge UP, intro.

This page is prerendered for SEO and accessibility. The interactive widgets above hydrate on JavaScript load.