Open and Closed Sets
What You’ll Learn
Section titled “What You’ll Learn”In this lesson you’ll get fluent with open and closed sets, learn the dual axioms, meet limit points and the sequence criterion, and see why the four combinations of open and closed all actually occur.
The Concept
Section titled “The Concept”The two families
Section titled “The two families”Open sets are given by the topology. Closed sets are defined from them:
is closed if is open.
Applying De Morgan’s laws to the topology axioms gives the dual list, and the reversal of “arbitrary” and “finite” is the thing to remember:
| Open sets | Closed sets |
|---|---|
| and are open | and are closed |
| arbitrary unions are open | arbitrary intersections are closed |
| finite intersections are open | finite unions are closed |
The counterexample for the closed side mirrors the open one:
Each set in the union is closed, and the union is not. So infinite unions of closed sets need not be closed, which is exactly dual to infinite intersections of open sets.
All four combinations occur
Section titled “All four combinations occur”The figure tests seven subsets of endpoint by endpoint. Reading off the results:
- Open, not closed: and
- Closed, not open: and
- Both (clopen): and
- Neither:
So “not open” carries no information about closedness. This is the single most common early error in the subject, and the half-open interval is the standing cure for it.
Limit points and closure
Section titled “Limit points and closure”is a limit point of if every open set containing meets in some point other than itself.
Note that a limit point need not belong to , and a point of need not be a limit point of it. A point of that is not a limit point is called isolated.
The characterization that makes closedness workable:
is closed if and only if contains all of its limit points.
For example the limit points of are , so misses two of them and is not closed. The set has exactly one limit point, 0, which it does not contain - adding it produces a closed set.
Sequences, with a warning
Section titled “Sequences, with a warning”In a metric space there is a clean sequential test:
is closed if and only if every convergent sequence of points of has its limit in .
This is the version most people carry from real analysis, and it is exactly right there. In a general topological space the criterion is only one-directional: limits of sequences in do lie in the closure, but there are spaces where closure cannot be detected by sequences at all. Nets or filters are the general replacement.
So sequences are a metric tool. Keep the open-set definitions as primary and use sequences when a metric is available.
Interior, exterior, boundary
Section titled “Interior, exterior, boundary”Three derived notions, taken up properly in lesson 7 but worth naming now:
- Interior - the largest open set inside
- Closure - the smallest closed set containing
- Boundary
Immediately: is open iff , and closed iff . A set is clopen precisely when its boundary is empty.
The subtleties worth pre-empting
Section titled “The subtleties worth pre-empting”Openness depends on the ambient space. The interval is not open in , but it is open in the space with the subspace topology. Openness is never a property of a set alone; it is a property of a set inside a space.
Openness depends on the topology. In the discrete topology on , every set is open. In the trivial topology, only two are.
Infinite operations break things. Both counterexamples above are worth memorizing, since they are the boundary cases the axioms were designed around.
Worked Examples
Section titled “Worked Examples”Example 1: Show is neither open nor closed in .
Solution. Not open: any interval around 0 contains negative numbers, which are outside the set.
Not closed: its complement is , and any interval around 1 contains points just below 1, which lie in . So the complement is not open.
Answer: neither. ∎
Example 2: Find the limit points of in .
Solution. Every interval around 0 contains for large , so 0 is a limit point.
No other point qualifies. Each has a small interval around it containing no other member of , so all points of are isolated.
Since , the set is not closed, while is. ∎
Example 3: Show an infinite union of closed sets need not be closed.
Solution. Each is closed, and
because every satisfies for some , while 0 never does. The result is not closed. ∎
This is the exact dual of the shrinking-open-intervals example, and together they justify both halves of the axioms.
Example 4: Which sets are closed in the cofinite topology on ?
Solution. Open sets are and the cofinite sets, so complements of open sets are and the finite sets.
So is closed, and is neither open nor closed, since it is infinite with infinite complement. ∎
Example 5: In the discrete topology, which sets are closed?
Solution. Every set is open, so every complement is open too, so every set is closed.
Answer: every subset is clopen. ∎
This makes the discrete space maximally disconnected, which is the content of lesson 8.
Example 6: Show is neither open nor closed in .
Solution. Not open: every interval around a rational contains irrationals, so no interval fits inside .
Not closed: is a limit point of , since rationals are dense, and it is not rational.
Answer: neither. ∎
In fact and , so . A set can have all of as its boundary, which is a good sign that boundary is not an intuitive notion.
Example 7: Is open in the space ?
Solution. Yes. The subspace topology declares open when for some open in . Take :
∎
Openness is relative to the ambient space, and this example is the one to remember. The same set is not open in .
Real-World Applications
Section titled “Real-World Applications”Numerical tolerance. An open condition like is robust to small perturbations, while a closed condition such as an equality is not. Specifying feasible regions as open or closed determines whether a solver can hit the boundary.
Optimization feasibility. A maximum is guaranteed on a closed bounded region and can fail on an open one, which is why constraint sets in optimization are written with rather than . The theorem behind that choice is in lesson 10.
Control safety envelopes. Safe operating regions are specified as closed sets so that boundary states are included and provably safe, rather than being ambiguous limits.
Computational geometry. Point-in-polygon tests must decide boundary cases explicitly, which is a choice between the open and closed versions of a region. Inconsistent choices cause the classic cracks in rendered meshes.
Type theory and program analysis. Observable properties of programs correspond to open sets, because they can be confirmed in finite time; their negations generally cannot, which is why the open sets are not closed under complement.
Image segmentation. Morphological opening and closing operations are named after these notions and behave analogously, removing small protrusions or filling small gaps.
Retrying will remove your ✅ checkmark until you pass again.