ACE 328/Chapter 3

Interior, Closure, and Boundary

Operations that capture the "inside," "including the edge," and the "edge itself" of a set. The interior is the largest open subset; the closure is the smallest closed superset.

Having established the frameworks of topological and metric spaces, we now develop the basic vocabulary for describing the "shape" of a subset from a topological perspective. Given any subset AA of a topological space, three canonical sets are associated with it: the interior (the largest open set inside AA), the closure (the smallest closed set containing AA), and the boundary (the set of points on the edge of AA). These operations are the workhorses of point-set topology and appear everywhere in analysis.

We also introduce the related notions of accumulation (cluster) points, isolated points, dense and nowhere dense sets, and — for metric spaces specifically — the characterization of closure via convergent sequences. The chapter culminates in the hierarchy of sets (meagre, comeagre, GδG_\delta, FσF_\sigma) that underlies the Baire Category Theorem.


Interior, Closure, and Boundary: Definitions

Throughout this chapter, (X,T)(X, \mathcal{T}) is a topological space and F\mathcal{F} denotes the family of all closed subsets.

DefinitionInterior, Closure, Boundary

Let AXA \subseteq X. We define:

  • The interior of AA: int(A)=ΩTΩAΩ.\text{int}(A) = \bigcup_{\substack{\Omega \in \mathcal{T} \\ \Omega \subseteq A}} \Omega. Also denoted AA^\circ or A˚\mathring{A}.

  • The closure of AA: A=FFAFF.\overline{A} = \bigcap_{\substack{F \in \mathcal{F} \\ A \subseteq F}} F. Also denoted cl(A)\text{cl}(A).

  • The boundary of AA: A=Aint(A).\partial A = \overline{A} \setminus \text{int}(A). Also denoted bd(A)\text{bd}(A) or fr(A)\text{fr}(A) (for frontier).

Remark.

Intuition: Think of a painted region AA on a page.

  • int(A)\text{int}(A) is the part of AA that is "safely inside" — every point has a little room around it also in AA. This is a union of open sets, so it is itself open. It is in fact the largest open set contained in AA.
  • A\overline{A} is AA together with all the points "just outside" that AA nearly touches. This is an intersection of closed sets, so it is itself closed. It is the smallest closed set containing AA.
  • A\partial A is the "edge": points that are in the closure but not in the interior — those touching both AA and its complement.

Always, int(A)AA\text{int}(A) \subseteq A \subseteq \overline{A}.

Remark.

int(A)\text{int}(A) is automatically open (as a union of open sets), and A\overline{A} is automatically closed (as an intersection of closed sets). The boundary A=Aint(A)=Aint(A)c\partial A = \overline{A} \setminus \text{int}(A) = \overline{A} \cap \text{int}(A)^c is an intersection of two closed sets, hence closed.

Remark.

Useful complement identities. For any subset BXB \subseteq X, the following identities hold and are used constantly: Xint(B)=XB,XB=int(XB).X \setminus \text{int}(B) = \overline{X \setminus B}, \qquad X \setminus \overline{B} = \text{int}(X \setminus B). In words: the complement of the interior is the closure of the complement, and the complement of the closure is the interior of the complement. Both follow directly from the definitions of interior and closure as unions/intersections of open/closed sets, together with de Morgan's laws.


Basic Characterizations

PropositionInterior and Closure Characterize Open and Closed

Let AXA \subseteq X. Then:

  1. AT    A=int(A)    AA=A \in \mathcal{T} \iff A = \text{int}(A) \iff A \cap \partial A = \emptyset.
  2. AF    A=A    AAA \in \mathcal{F} \iff A = \overline{A} \iff \partial A \subseteq A.
Remark.

Intuition: A set equals its own interior exactly when it is open; a set equals its own closure exactly when it is closed. This gives operational tests: to check whether AA is open, compute int(A)\text{int}(A) and compare with AA; to check whether AA is closed, compute A\overline{A}.

Characterization via Neighbourhoods

PropositionInterior and Closure via Neighbourhoods

Let (X,T)(X, \mathcal{T}) be a topological space and let AXA \subseteq X. Then:

  1. int(A)={xX:VUx with VA}.\text{int}(A) = \{ x \in X : \exists V \in \mathcal{U}_x \text{ with } V \subseteq A \}.
  2. A={xX:AV for every VUx}.\overline{A} = \{ x \in X : A \cap V \ne \emptyset \text{ for every } V \in \mathcal{U}_x \}.
Remark.

Intuition:

  • xint(A)x \in \text{int}(A) means "some whole neighbourhood of xx lies inside AA."
  • xAx \in \overline{A} means "every neighbourhood of xx hits AA."

In a metric space, "neighbourhood" can be replaced by "open ball of some radius," so:

  • xint(A)    ρ>0:B(x,ρ)Ax \in \text{int}(A) \iff \exists \rho > 0 : B(x, \rho) \subseteq A.
  • xA    ρ>0:AB(x,ρ)x \in \overline{A} \iff \forall \rho > 0 : A \cap B(x, \rho) \ne \emptyset.

Accumulation Points, Isolated Points, and the Derived Set

DefinitionAccumulation Point and Derived Set

Let (X,T)(X, \mathcal{T}) be a topological space, let AXA \subseteq X, and let x0Xx_0 \in X. We say x0x_0 is an accumulation point (or cluster point, or limit point) of AA if and only if (A{x0})Vfor every VUx0.(A \setminus \{x_0\}) \cap V \ne \emptyset \qquad \text{for every } V \in \mathcal{U}_{x_0}. The derived set of AA is A={xX:x is an accumulation point of A}.A' = \{ x \in X : x \text{ is an accumulation point of } A \}.

Remark.

Intuition: x0x_0 is an accumulation point of AA if every neighbourhood of x0x_0 contains some other point of AA (not just x0x_0 itself). So AA "piles up" near x0x_0. The distinction from "x0Ax_0 \in \overline{A}" is subtle but important: x0Ax_0 \in \overline{A} only requires that every neighbourhood hits AA somewhere, possibly only at x0x_0; x0Ax_0 \in A' requires that every neighbourhood hits AA at a point different from x0x_0. The notion is due to Georg Cantor (1872).

In a metric space, the definition rewrites as: x0A    (A{x0})B(x0,ρ)for every ρ>0.x_0 \in A' \iff (A \setminus \{x_0\}) \cap B(x_0, \rho) \ne \emptyset \quad \text{for every } \rho > 0.

DefinitionIsolated Point

Let AXA \subseteq X and xAx \in A. We say xx is an isolated point of AA if there exists VUxV \in \mathcal{U}_x with AV={x}A \cap V = \{x\}. In a metric space: xAx \in A is isolated if there exists ρ>0\rho > 0 with AB(x,ρ)={x}A \cap B(x, \rho) = \{x\}.

Remark.

Intuition: xx is isolated in AA if xx sits in AA with a little buffer around it containing no other points of AA. Isolated points of AA are in AA but not in AA'. Conversely, a point of AA either is isolated in AA or is an accumulation point of AA.

PropositionClosure Equals Union of the Set and its Derived Set

For any AXA \subseteq X, A=AA.\overline{A} = A \cup A'.

CorollaryClosed Sets Contain Their Limit Points

AA is closed if and only if AAA' \subseteq A.

Remark.

Intuition: "Closed" means "contains all its limit points." This is the sequential flavour of closedness we will make precise in metric spaces shortly.


Boundary: Additional Properties

CorollaryProperties of Interior, Closure, and Boundary

Let (X,T)(X, \mathcal{T}) be a topological space and AXA \subseteq X. Then:

  1. A={xX:AV and AcV for every VUx}\partial A = \{ x \in X : A \cap V \ne \emptyset \text{ and } A^c \cap V \ne \emptyset \text{ for every } V \in \mathcal{U}_x \}, where Ac=XAA^c = X \setminus A.
  2. Ac=A\partial A^c = \partial A.
  3. AAAA\overline{A} \setminus A \subseteq A' \subseteq \overline{A}.
  4. AA    A=AA' \subseteq A \iff A = \overline{A} (which is the corollary above, restated).
ExampleInterior, Closure, Boundary in R

Consider R\mathbb{R} with the Euclidean topology.

  • A=(0,1]A = (0, 1]: int(A)=(0,1)\text{int}(A) = (0, 1), A=[0,1]\overline{A} = [0, 1], A={0,1}\partial A = \{0, 1\}, A=[0,1]A' = [0, 1].
  • A=QA = \mathbb{Q}: int(A)=\text{int}(A) = \emptyset (every neighbourhood of any rational contains an irrational), A=R\overline{A} = \mathbb{R} (every neighbourhood of any real contains a rational), A=R\partial A = \mathbb{R}, A=RA' = \mathbb{R}.
  • A={1/n:nZ>0}A = \{ 1/n : n \in \mathbb{Z}_{>0} \}: int(A)=\text{int}(A) = \emptyset, A=A{0}\overline{A} = A \cup \{0\}, A=A{0}\partial A = A \cup \{0\}, A={0}A' = \{0\}. Every point of AA is isolated; only 00 is an accumulation point.
  • A=ZA = \mathbb{Z}: int(A)=\text{int}(A) = \emptyset, A=Z\overline{A} = \mathbb{Z}, A=Z\partial A = \mathbb{Z}, A=A' = \emptyset. Every integer is isolated in Z\mathbb{Z}.

Closure via Sequences in Metric Spaces

In metric spaces, closure can be characterized using convergent sequences — a tangible, operational description that we do not have in a general topological space.

TheoremSequential Characterization of Closure

Let (X,d)(X, d) be a metric space with metric topology Td\mathcal{T}_d, and let AXA \subseteq X. Then xAx \in \overline{A} if and only if there exists a sequence (an)n1(a_n)_{n \ge 1} in AA with limnan=x\lim_{n \to \infty} a_n = x.

CorollarySequential Characterization of Closed Sets

In a metric space, AA is closed if and only if for every sequence (an)(a_n) in AA converging to a point xXx \in X, one has xAx \in A.

Remark.

Intuition: In metric spaces, "closed" really does mean "closed under taking limits of sequences." This is how many textbooks first introduce closedness in Rn\mathbb{R}^n. Note that in a general topological space — one that need not be metric — this sequential characterization can fail; one needs the more abstract notions of nets or filters.

CorollarySequential Characterization of Accumulation Points

In a metric space, xAx \in A' if and only if there exists a sequence (an)(a_n) in AA with anxa_n \ne x for all nn and anxa_n \to x.


Dense Sets

DefinitionDense Set

Let (X,T)(X, \mathcal{T}) be a topological space and let SXS \subseteq X. We say SS is dense in XX if and only if S=X\overline{S} = X.

More generally, given AXA \subseteq X and SAS \subseteq A, we say SS is dense in AA if and only if FFSFFA=A.\bigcap_{\substack{F \in \mathcal{F} \\ S \subseteq F}} F \cap A = A. (Equivalently, SS is dense in AA with respect to the subspace topology on AA.)

Remark.

Intuition: SS is dense in XX if every point of XX either lies in SS or is a limit of points from SS. In a metric space, equivalently: every open ball in XX contains a point of SS. The prototypical example is QR\mathbb{Q} \subseteq \mathbb{R}: the rationals are dense in the reals because every real number can be approximated to arbitrary precision by rationals.

Remark.

Why "FS,FF(FA)=A\bigcap_{F \supseteq S, F \in \mathcal{F}} (F \cap A) = A" is the right relative-density condition. When we restrict the topology on XX to AA via the subspace topology TA\mathcal{T}_A, the closed sets according to TA\mathcal{T}_A are exactly the sets of the form FAF \cap A with FF closed in XX. Denoting by FA\mathcal{F}_A the family of closed sets of TA\mathcal{T}_A, we have FFSF(FA)=FFSFA(FA)=GFASGG,\bigcap_{\substack{F \in \mathcal{F} \\ S \subseteq F}} (F \cap A) = \bigcap_{\substack{F \in \mathcal{F} \\ S \subseteq F \cap A}} (F \cap A) = \bigcap_{\substack{G \in \mathcal{F}_A \\ S \subseteq G}} G, which is the closure of SS computed in the subspace topology TA\mathcal{T}_A. So "SS dense in AA" is really just "SS is dense in AA with respect to its own (inherited) topology."

ExampleQ is Dense in R

In (R,E)(\mathbb{R}, \mathcal{E}), Q\mathbb{Q} is dense: Q=R\overline{\mathbb{Q}} = \mathbb{R}. This is the content of the archimedean property of R\mathbb{R} (between any two reals there is a rational).

ExampleDense Subset of a Half-Open Interval

In (R,E)(\mathbb{R}, \mathcal{E}), let A=[0,1)A = [0, 1) and S=Q[0,1)S = \mathbb{Q} \cap [0, 1). Then SS is dense in AA. The closure of SS in R\mathbb{R} is [0,1][0, 1], and [0,1]A=[0,1)=A[0, 1] \cap A = [0, 1) = A, so the condition is satisfied.


Nowhere Dense Sets

DefinitionNowhere Dense

Let (X,T)(X, \mathcal{T}) be a topological space. A subset SXS \subseteq X is nowhere dense in XX if and only if its closure has empty interior: \text{int}(\overline{S}) = \emptyset. \tag{ND1}

Remark.

Intuition: Being nowhere dense is a strong form of "smallness." It's not enough for SS itself to miss open balls; even the closure of SS — the fattest version of SS — must contain no open ball. A nowhere dense set has no "fat" parts anywhere.

PropositionEquivalent Definitions of Nowhere Dense

Let (X,T)(X, \mathcal{T}) be a topological space and let SXS \subseteq X. The following are equivalent:

  1. (ND1) int(S)=\text{int}(\overline{S}) = \emptyset.
  2. (ND2) XSX \setminus S contains an open set that is dense in XX.
  3. (ND3) Every nonempty open subset of XX contains a nonempty open subset which is disjoint from SS.
ExampleNowhere Dense Sets in R

In (R,E)(\mathbb{R}, \mathcal{E}):

  • Z\mathbb{Z} is nowhere dense: Z=Z\overline{\mathbb{Z}} = \mathbb{Z} (it's closed), and int(Z)=\text{int}(\mathbb{Z}) = \emptyset (no open interval lies inside Z\mathbb{Z}).
  • A={1/n:nZ>0}A = \{1/n : n \in \mathbb{Z}_{>0}\} is nowhere dense: A=A{0}\overline{A} = A \cup \{0\}, which contains no open interval of positive length, so its interior is empty.
  • Q\mathbb{Q} is not nowhere dense: Q=R\overline{\mathbb{Q}} = \mathbb{R}, and int(R)=R\text{int}(\mathbb{R}) = \mathbb{R} \ne \emptyset.
  • B=Q(a,b)B = \mathbb{Q} \cap (a, b) is not nowhere dense: B=[a,b]\overline{B} = [a, b], and int([a,b])=(a,b)\text{int}([a,b]) = (a,b) \ne \emptyset.

The key distinction: Q\mathbb{Q} is dense (so its closure is all of R\mathbb{R}), whereas Z\mathbb{Z} is "spread out" enough that it has empty interior even after taking closure.


Meagre, Nonmeagre, and Comeagre Sets

DefinitionMeagre, Nonmeagre, Comeagre

Let (X,T)(X, \mathcal{T}) be a topological space and let SXS \subseteq X.

  • SS is meagre (or thin, or of first category) if SS can be written as a countable union of nowhere dense sets.
  • SS is nonmeagre (or of second category) if SS is not meagre.
  • SS is comeagre (or thick, or residual) if its complement XSX \setminus S is meagre.
Remark.

Intuition: Meagre sets are "topologically small" — a countable bag of nowhere-dense sets. Comeagre sets are the topologically big ones — their complements are topologically small. In a "good" space (specifically, a complete metric space), these two classes do not overlap: a set cannot be both small and big at once. This is the content of the Baire Category Theorem, which we state at the end of this chapter.

The terminology "first category" / "second category" was introduced by René Baire in 1899. Note: "residual" has nothing to do with category theory.

Remark.

Equivalent description of comeagre sets. A set SXS \subseteq X is comeagre if and only if SS can be written as a countable intersection of open dense sets. Indeed: SS comeagre means XS=n1AnX \setminus S = \bigcup_{n \ge 1} A_n with each AnA_n nowhere dense, which by (ND2) means AncA_n^c contains an open dense set SnS_n; taking complements gives Sn1SnS \supseteq \bigcap_{n \ge 1} S_n. The reverse direction is similar. This reformulation is the version of "comeagre" used in the proof of the Baire Category Theorem.

ExampleMeagre and Comeagre Sets in R

In (R,E)(\mathbb{R}, \mathcal{E}):

  • Z\mathbb{Z} is meagre (it is itself nowhere dense, hence a "countable" union — with a single element — of nowhere dense sets).
  • A={1/n:nZ>0}A = \{1/n : n \in \mathbb{Z}_{>0}\} is meagre (nowhere dense).
  • Q\mathbb{Q} is meagre: Q=qQ{q}\mathbb{Q} = \bigcup_{q \in \mathbb{Q}} \{q\}, a countable union of singletons, and each singleton is nowhere dense.
  • The irrationals RQ\mathbb{R} \setminus \mathbb{Q} are comeagre (since Q\mathbb{Q} is meagre). Moreover RQ\mathbb{R} \setminus \mathbb{Q} is nonmeagre — but proving this requires the Baire Category Theorem.

GδG_\delta and FσF_\sigma Sets

DefinitionG-delta and F-sigma Sets

Let (X,T)(X, \mathcal{T}) be a topological space. A subset SXS \subseteq X is called:

  • a GδG_\delta set (or GδG_\delta) if SS can be written as a countable intersection of open sets.
  • an FσF_\sigma set (or FσF_\sigma) if SS can be written as a countable union of closed sets.
Remark.

Intuition: The letters stand for German: GG for Gebiet (region) and δ\delta for Durchschnitt (intersection); FF for fermé (closed, French) and σ\sigma for Summe (sum/union). So GδG_\delta is "open with intersections" and FσF_\sigma is "closed with unions."

These classes sit between open and closed: every open set is trivially GδG_\delta (a single-term intersection), every closed set is trivially FσF_\sigma. But the classes are strictly larger: {0}=k=1(1k,1k)\{0\} = \bigcap_{k=1}^\infty (-\tfrac{1}{k}, \tfrac{1}{k}) is GδG_\delta but (as a closed set in R\mathbb{R}) it is certainly not open. Similarly, by complementation, Q=qQ{q}\mathbb{Q} = \bigcup_{q \in \mathbb{Q}} \{q\} is FσF_\sigma but not closed.

These classes are important in analysis and measure theory because many "natural" sets (the set of continuity points of a function, say) turn out to be GδG_\delta or FσF_\sigma even when they are neither open nor closed.

PropositionDuality Between G-delta and F-sigma

SXS \subseteq X is GδG_\delta if and only if XSX \setminus S is FσF_\sigma.

ExampleExamples of G-delta and F-sigma Sets
  • {0}\{0\} in R\mathbb{R} is GδG_\delta: {0}=k=1(1/k,1/k)\{0\} = \bigcap_{k=1}^\infty (-1/k, 1/k). It is also closed (hence FσF_\sigma).
  • Q\mathbb{Q} in R\mathbb{R} is FσF_\sigma: Q=qQ{q}\mathbb{Q} = \bigcup_{q \in \mathbb{Q}} \{q\}, a countable union of singletons (each closed). Its complement, the irrationals, is therefore GδG_\delta.
  • Every open set is GδG_\delta (one-term intersection); every closed set is FσF_\sigma (one-term union).
  • The half-open interval [0,1)[0,1) is both FσF_\sigma (it equals n1[0,11/n]\bigcup_{n \ge 1} [0, 1 - 1/n]) and GδG_\delta (it equals n1(1/n,1)\bigcap_{n \ge 1} (-1/n, 1)). So the classes of FσF_\sigma and GδG_\delta sets intersect but are not equal.
Remark.

Significance. A classical result (which we will not prove here) states that the set of points at which a function f:RRf : \mathbb{R} \to \mathbb{R} is continuous is always a GδG_\delta set. Conversely, there is no function on R\mathbb{R} whose set of continuity points is exactly Q\mathbb{Q}, because Q\mathbb{Q} is not a GδG_\delta set in R\mathbb{R} (the proof of this last fact uses the Baire Category Theorem).


Looking Ahead: The Baire Category Theorem

The machinery developed in this chapter — interior, closure, accumulation points, dense and nowhere dense sets, meagre and comeagre — culminates in one of the cornerstone results of elementary real analysis.

TheoremBaire Category Theorem

Let (X,d)(X, d) be a nonempty complete metric space, equipped with the metric topology. Then:

  1. Every comeagre subset of XX is dense in XX.
  2. XX is nonmeagre (i.e., XX cannot be written as a countable union of nowhere dense sets).
Remark.

Intuition: In a complete metric space, "topologically small" (meagre) sets really are small: they cannot exhaust the space, and their complements are dense. The Baire Category Theorem has extraordinary reach — it gives a non-constructive proof that the irrationals are uncountable (and nonmeagre), lies at the heart of functional analysis (Open Mapping, Closed Graph, and Uniform Boundedness theorems), and connects to the deep fact that "most" continuous functions are nowhere differentiable.

Remark.

Game-theoretic interpretation (Choquet's game). A beautiful reformulation of the Baire property is in terms of a two-player game due to Gustave Choquet (1969). Let (X,T)(X, \mathcal{T}) be a topological space. Two players, Alice and Bob, play as follows. Alice moves first, choosing a nonempty open set U0XU_0 \subseteq X. Then Bob chooses a nonempty open V0U0V_0 \subseteq U_0; then Alice chooses nonempty open U1V0U_1 \subseteq V_0; and so on. The nested chain XU0V0U1V1U2X \supseteq U_0 \supseteq V_0 \supseteq U_1 \supseteq V_1 \supseteq U_2 \supseteq \cdots is produced. Alice wins if j0Uj=\bigcap_{j \ge 0} U_j = \emptyset; Bob wins if j0Vj\bigcap_{j \ge 0} V_j \ne \emptyset (note Uj=Vj\bigcap U_j = \bigcap V_j).

In a nonempty complete metric space, Bob has a winning strategy (he can always shrink his ball by half and keep closure inside the previous ball, producing a Cauchy sequence that must converge by completeness). Conversely, if the space contains a nonempty meagre open set, Alice has a winning strategy. This game-theoretic dichotomy recovers the Baire Category Theorem as a corollary. John Oxtoby proved the further equivalence: every comeagre set is dense if and only if Alice has no winning strategy.

CorollaryMeagre vs. Comeagre in a Complete Metric Space

In a nonempty complete metric space, no subset is simultaneously meagre and comeagre.

Remark.

Payoff: the irrationals are nonmeagre. Since Q\mathbb{Q} is meagre in R\mathbb{R} and R\mathbb{R} itself is nonmeagre (Baire), we can deduce that RQ\mathbb{R} \setminus \mathbb{Q} must be nonmeagre: if it were meagre, R=Q(RQ)\mathbb{R} = \mathbb{Q} \cup (\mathbb{R} \setminus \mathbb{Q}) would be a union of two meagre sets, hence meagre — contradicting Baire. This also shows that there is no way to write RQ\mathbb{R} \setminus \mathbb{Q} as a countable union of closed sets, i.e., the irrationals are not FσF_\sigma.


Summary

In this chapter we built the basic vocabulary of point-set topology inside a topological space:

  • Interior, closure, boundary, defined via unions of open sets and intersections of closed sets, equivalently characterized via neighbourhoods.
  • Accumulation points and isolated points, giving the decomposition A=AA\overline{A} = A \cup A'.
  • Dense sets (closure equals the whole space) and nowhere dense sets (closure has empty interior), with three equivalent characterizations of the latter.
  • Sequential closure: in metric spaces, closure equals the set of limits of sequences from the set.
  • Meagre, nonmeagre, comeagre sets; GδG_\delta and FσF_\sigma sets.
  • The Baire Category Theorem as the culminating statement tying these ideas to the completeness of metric spaces.

These tools form the language we will use for the rest of the course, where compactness, connectedness, and continuity will be examined in metric and topological spaces.