Skip to content
Tutorials Center
My learning

Topics

Lesson 12 of 36 ยท Topological Spaces

Closed Sets, Closure and Interior

Define closed sets, closure, interior, boundary and dense sets in any topological space, compute them on a finite space, and explore Kuratowski's 14-set problem.

With a topology in hand, we can describe how any subset sits inside the space. Three operations do most of the work: the interior (the part of a set that is safely inside), the closure (the set plus everything it touches), and the boundary (the thin layer between inside and outside). These generalize the intuition from intervals to any topological space.

Closed sets

Let (X, ฯ„) be a topological space. A subset F is closed if X \ F is open. By De Morgan's laws:

  • โˆ… and X are closed;
  • any intersection of closed sets is closed;
  • any finite union of closed sets is closed.

A topology can be described just as well by listing its closed sets. A set may be open, closed, both ("clopen"), or neither. In a finite topology the closed sets are simply the complements of the open ones.

Interior and closure

For A โІ X:

  • The interior int(A) is the largest open set contained in A: the union of all open subsets of A.
  • The closure cl(A) (also written ฤ€) is the smallest closed set containing A: the intersection of all closed sets that contain A.
  • The boundary โˆ‚A = cl(A) \ int(A).

Some useful facts, all straightforward from the definitions:

  • int(A) โІ A โІ cl(A).
  • A is open if and only if A = int(A); closed if and only if A = cl(A).
  • cl(X \ A) = X \ int(A) and int(X \ A) = X \ cl(A): closure and interior are two views of the same thing seen through complements.
  • cl(A โˆช B) = cl(A) โˆช cl(B), but cl(A โˆฉ B) may be smaller than cl(A) โˆฉ cl(B).

In โ„, cl((0, 1)) = [0, 1] and int([0, 1]) = (0, 1). For the rationals, cl(โ„š) = โ„ and int(โ„š) = โˆ…: every interval contains both rational and irrational numbers.

A subset A is dense in X if cl(A) = X: it comes arbitrarily close to every point. The rationals are dense in the reals, which is why you can approximate any real number by fractions.

Computing on a finite space

Here is a topology on X = {1, 2, 3, 4}: ฯ„ = { โˆ…, {1}, {1, 2}, {3, 4}, {1, 3, 4}, X }. The code computes interior, closure and boundary of every subset.

Python Interior, closure and boundary on four points

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Read two rows as a check. The set is open, so its interior is ; the closed sets containing 1 are {1, 2} and X, so its closure is {1, 2} and its boundary is . The set has empty interior: the smallest open set containing 2 is {1, 2}, which is bigger than .

Kuratowski's closure axioms

The closure operator determines the topology. A map A โ†ฆ cl(A) on subsets is the closure operator of a topology exactly when it satisfies four rules, the Kuratowski closure axioms:

  1. cl(โˆ…) = โˆ….
  2. A โІ cl(A).
  3. cl(cl(A)) = cl(A) (taking closure twice does nothing new).
  4. cl(A โˆช B) = cl(A) โˆช cl(B).

This gives an alternative way to define a topology: choose a closure operator and declare closed sets to be those with cl(A) = A.

The 14-set theorem

A classic puzzle: start with any subset A of any topological space and repeatedly apply two operations, closure and complement. Kuratowski proved that you can never get more than 14 distinct sets. The key identities are cl(cl(A)) = cl(A) and X \ (X \ A) = A, plus the fact that cl(int(cl(int(cl(A))))) collapses to cl(int(cl(A))).

The code explores this on all 355 topologies on four points: for each topology and each subset, it applies closure and complement repeatedly and records how many distinct sets appear.

Python At most 14 sets from closure and complement

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The bound 14 is sharp in โ„ for a suitably crafted subset, but small finite spaces usually stay below it. The code shows what happens for four points.

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. In the real line, what is the closure of the open interval (0, 1)?

    The closure adds the limit points 0 and 1.
  2. 2. What is the interior of the rational numbers Q in the real line?

    Every interval contains irrational numbers, so no interval fits inside Q.
  3. 3. Which statement is always true?

    Closure adds points to A, never removes them.
  4. 4. What does it mean for A to be dense in X?

    Dense means cl(A) = X: every nonempty open set meets A.

Summary

  • A set is closed when its complement is open; closed sets are closed under intersections and finite unions.
  • int(A) is the largest open subset, cl(A) the smallest closed superset, and โˆ‚A = cl(A) \ int(A).
  • A is dense when cl(A) = X; the rationals are dense in the reals.
  • Closure satisfies the Kuratowski axioms and determines the topology.
  • Repeated closure and complement produce at most 14 different sets from one starting set.

Next: Bases and Subbases