Introduction to Point-Set Topology Foundations

Point-set topology provides the abstract language for discussing continuity, convergence, and connectedness, freeing these fundamental ideas from their dependency on distance. While calculus and analysis live comfortably in the familiar world of metric spaces, topology asks: what are the essential properties of open sets that make these concepts work? By studying the foundations of topological spaces, you learn to reason in a vastly more general setting, which becomes indispensable for advanced mathematics, from functional analysis to geometry. This article builds a rigorous understanding by moving from the concrete axioms of a topology to the powerful operators and set constructions that define its structure.

From Metric Spaces to Topological Spaces

The journey begins by generalizing the notion of open sets from metric spaces. In a metric space $(X, d)$, a set $U$ is open if for every point $x \in U$, there exists an $\epsilon > 0$ such that the open ball $B_\epsilon(x) = \{ y \in X : d(x,y) < \epsilon \}$ is entirely contained in $U$. The collection of all such open sets has three critical properties: the entire space $X$ and the empty set $\emptyset$ are open; the union of any collection of open sets is open; and the intersection of any finite collection of open sets is open.

A topological space $(X, \tau)$ abstracts these properties into a definition. Here, $X$ is a set and $\tau$ is a collection of subsets of $X$, called the open sets, which must satisfy precisely those three axioms: (1) $X \in \tau$ and $\emptyset \in \tau$; (2) The union of any subcollection of sets in $\tau$ is in $\tau$; (3) The intersection of any finite subcollection of sets in $\tau$ is in $\tau$. The collection $\tau$ is called a topology on $X$. This definition deliberately forgets the metric, retaining only the set-theoretic relationships between "open" sets. Continuity is then defined purely in these terms: a function $f: X \to Y$ between topological spaces is continuous if the preimage $f^{-1}(V)$ of every open set $V \subseteq Y$ is open in $X$.

Bases and Subbases: Efficient Descriptions of a Topology

Specifying every single open set in a topology can be cumbersome. A base (or basis) $\mathcal{B}$ for a topology $\tau$ is a smaller collection of open sets such that every open set in $\tau$ can be written as a union of sets from $\mathcal{B}$. For example, the collection of all open balls forms a base for the standard topology on a metric space. For $\mathcal{B}$ to be a base, it must satisfy: (1) It covers $X$ (i.e., $\bigcup_{B \in \mathcal{B}} B = X$); (2) For any $B_1, B_2 \in \mathcal{B}$ and any $x \in B_1 \cap B_2$, there exists a $B_3 \in \mathcal{B}$ such that $x \in B_3 \subseteq B_1 \cap B_2$. This second condition ensures that the collection of all unions of base elements actually satisfies the topology axioms, particularly the finite intersection property.

An even more economical tool is a subbase $\mathcal{S}$. This is simply any collection of subsets whose finite intersections form a base $\mathcal{B}$. That is, you take all finite intersections of sets in $\mathcal{S}$; this resulting collection $\mathcal{B}$ is a base for some topology, called the topology generated by $\mathcal{S}$. Subbases are incredibly useful for defining topologies by specifying only a minimal set of "prototype" open sets. For instance, the standard topology on $\mathbb{R}$ can be generated by the subbase of all infinite open intervals $(-\infty, b)$ and $(a, \infty)$.

Interior, Closure, and the "Closeness" Operators

Given a subset $A$ of a topological space, two derived sets are fundamental. The interior of $A$, denoted $A^\circ$ or $\text{Int}(A)$, is the union of all open sets contained in $A$. It is the largest open set contained in $A$. A point is in the interior if there exists an open neighborhood of the point entirely within $A$.

Dual to the interior is the closure of $A$, denoted $\overline{A}$ or $\text{Cl}(A)$. It is the intersection of all closed sets containing $A$. It is the smallest closed set containing $A$. A point $x$ is in the closure of $A$ if every open neighborhood of $x$ intersects $A$. The closure operator formally captures the idea of "points arbitrarily close to" the set $A$.

These operators are connected by complementation: $\overline{A} = ( (A^c)^\circ )^c$, where $A^c$ is the complement of $A$. In other words, the closure is the complement of the interior of the complement.

Limit Points and the Boundary

The concept of "closeness" is refined by the idea of a limit point (or accumulation point). A point $x$ is a limit point of a set $A$ if every open neighborhood of $x$ contains at least one point of $A$ different from $x$ itself. The set of all limit points of $A$ is called the derived set, denoted $A'$. Crucially, the closure of $A$ is the union of $A$ and its limit points: $\overline{A} = A \cup A'$. A set is closed if and only if it contains all its limit points.

Finally, the boundary (or frontier) of $A$, denoted $\partial A$, is the set of points that are "neither fully inside nor fully outside" $A$. Formally, $\partial A = \overline{A} \setminus A^\circ = \overline{A} \cap \overline{A^c}$. A point is in the boundary if every one of its open neighborhoods intersects both $A$ and its complement. The boundary is always a closed set.

Proving Topological Properties Using Open Sets

The power of point-set topology lies in proving statements using only the language of open sets, bases, and the operators defined above. For example, to prove a set $F$ is closed, you can show its complement is open, or you can demonstrate it contains all its limit points. To prove a function is continuous, you can show the preimage of every basic open set is open, which is often simpler than checking all open sets.

Consider proving that in any topological space, the closure of a finite union is the union of the closures: $\overline{A \cup B} = \overline{A} \cup \overline{B}$. A standard proof uses the limit point definition: take a limit point $x$ of $A \cup B$. Every neighborhood of $x$ intersects $(A \cup B) \setminus \{x\}$. If there were a neighborhood $U$ missing $A \setminus \{x\}$ and a neighborhood $V$ missing $B \setminus \{x\}$, then $U \cap V$ would miss both, contradicting that $x$ is a limit point of the union. Therefore, $x$ must be a limit point of at least one of $A$ or $B$, proving the inclusion $\overline{A \cup B} \subseteq \overline{A} \cup \overline{B}$. The reverse inclusion is straightforward from set properties.

Common Pitfalls

1. Confusing "open" with "not closed": In topology, "open" and "closed" are not opposites. A set can be both (e.g., the entire space $X$ and the empty set $\emptyset$ are always both open and closed, or clopen). A set can also be neither open nor closed (e.g., the half-open interval $[0, 1)$ in the standard topology on $\mathbb{R}$).
2. Misidentifying limit points: A point in $A$ is not automatically a limit point of $A$. For a point $x \in A$ to be a limit point, every neighborhood must contain another point of $A$. Isolated points—points $x \in A$ for which there exists an open neighborhood containing only $x$ from $A$—are in $A$ but are not limit points.
3. Assuming properties from metric spaces: In a general topology, sequences are inadequate. A point can be in the closure of a set without being the limit of any sequence from that set. Proofs must rely on open sets and neighborhoods, not sequential convergence, unless the space is known to be first-countable.
4. Incorrect base or subbase verification: When checking if a collection $\mathcal{B}$ is a base, ensure it satisfies the two conditions: coverage and the intersection property. For a subbase $\mathcal{S}$, remember you must take all finite intersections of its elements to get the generated base.

Summary

• Topological spaces generalize continuity by axiomatizing the properties of open sets, moving beyond the concept of distance defined in metric spaces.
• Bases and subbases provide efficient ways to describe a topology; a base allows any open set to be built from unions, while a subbase uses finite intersections to first generate a base.
• The interior $A^\circ$ is the largest open set inside $A$, and the closure $\overline{A}$ is the smallest closed set containing $A$, with $\overline{A} = A \cup A'$.
• A limit point $x$ of a set $A$ has every neighborhood intersect $A$ in a point other than $x$ itself. A set is closed if and only if it contains all its limit points.
• The boundary $\partial A = \overline{A} \setminus A^\circ$ consists of points whose neighborhoods always intersect both $A$ and its complement.
• Proofs in topology fundamentally rely on manipulating open sets and their properties, requiring a deliberate shift from the sequential intuition fostered by calculus.