Here are two flat regions. In one of them, every rubber-band loop you draw can be slid and shrunk down to a single point without ever leaving the region. In the other, some loops are stuck.
$p$ $N_\delta(p)$ loop open disk
Every loop here shrinks to a point.
hole annulus
The orange loop encircles the hole. It cannot contract.

That distinction - which loops can contract, which can't - is the difference between a region where every conservative-looking field really does come from a potential, and a region where it might not. Topology was invented partly to handle exactly this: Riemann needed a clean way to talk about holes in domains so that complex integrals would be well-defined, and the modern vocabulary grew out of that. Before we can even ask the question precisely, we need a small one of our own: neighborhood, open, closed, bounded, domain, simply connected. Kaplan defines all of these in §2.2, and they recur on almost every page after.

Neighborhoods - the basic move

Topology starts with one simple idea: zoom in on a point and ask what's nearby. A neighborhood of a point $p = (x_1, y_1)$ is the set of points within some chosen distance $\delta > 0$ from $p$:

$$N_\delta(p) = \{\, (x, y) : (x - x_1)^2 + (y - y_1)^2 < \delta^2 \,\}.$$

Before we unpack the symbols, plug in numbers. If $p = (0, 0)$ and $\delta = 0.1$, this is just every point within $0.1$ of the origin. Quick check - is $(0.05, 0.03)$ in? Distance is about $0.058$, so yes. Is $(0.2, 0)$ in? Distance is $0.2 > 0.1$, so no. That's the whole game.

Geometrically, that's the open disk of radius $\delta$ centered at $p$ - the rim itself is not included (the inequality is strict). In three or more dimensions, replace the disk by a ball; the definition reads the same with more coordinates. Kaplan calls this $\delta$ the radius of the neighborhood, and the only thing we ever do with it is make it small.

$p$ $\delta$ $N_\delta(p)$
All points strictly closer than $\delta$ to $p$.

That is the entire primitive. From here on, every topological idea on this page is phrased as: "for every point in the set, some neighborhood does (or does not) do such-and-such."

Open sets

Suppose we have a set $E$ in the plane. Pick any point $p$ in $E$. Can we find a neighborhood of $p$ that lies entirely inside $E$? If yes for every point of $E$, the set is open.

$E$ is open $\iff$ for every $p \in E$, there exists $\delta > 0$ with $N_\delta(p) \subseteq E$.

The intuition, basically: every point has wiggle room. You can perturb it a little in any direction and stay in $E$.

$p$ interior point: fits
The whole orange disk is inside.
$q$ boundary point: escapes
Any neighborhood of $q$ pokes outside.

Examples of open sets: the open disk $x^2 + y^2 < 1$, the open square $|x| < 1, |y| < 1$, the right half-plane $x > 0$, the entire plane. The strict inequality is what lets us shrink $\delta$ enough to stay inside.

Non-examples: the closed disk $x^2 + y^2 \le 1$ is not open - take $q = (1, 0)$ on the rim, and any neighborhood of $q$ contains points with $x > 1$, which are outside. The same trick rules out any set that swallows a piece of its boundary.

Closed and bounded

Two more pieces of vocabulary, then the deeper notions.

A set $E$ is closed if its complement (everything in the plane that is not in $E$) is open. Equivalently - and more usefully - $E$ is closed if it contains all of its boundary points. A point $q$ is a boundary point of $E$ if every neighborhood of $q$ touches both $E$ and its complement: it sits on the edge.

$E$ is closed $\iff$ the complement of $E$ is open $\iff$ $E$ contains every one of its boundary points.

So the closed disk $x^2 + y^2 \le 1$ is closed (it contains its rim). The open disk $x^2 + y^2 < 1$ is not closed (the rim is missing). The half-open set $0 < x \le 1$ is neither open (it has the rim $x=1$ stuck on) nor closed (it's missing the rim $x=0$). To see this concretely on the line: the half-open interval $[0, 1)$ is neither open nor closed - $0$ is a boundary point that's included (so not open) and $1$ is a boundary point that isn't (so not closed). "Not open" does not mean "closed" - most sets are neither.

A set is bounded if it fits inside some neighborhood - some single ball of finite radius contains all of it. The unit square is bounded; the right half-plane $x > 0$ is open but not bounded; the punctured plane minus the origin is open and unbounded.

A set that is both closed and bounded is what later chapters call compact. The closed disk is compact; the open disk is not. It turns out that continuous functions on compact sets always attain their max and min - that's the punchline we'll cash in repeatedly.

Domain - Kaplan's specific sense

Here is where the language gets tricky. In Kaplan, a domain is a non-empty open set with one extra property: any two points in it can be joined by a polygonal path - a finite chain of line segments - that stays inside the set.

A domain $D$ is an open set such that, for every pair $P, Q \in D$, there is a broken line from $P$ to $Q$ lying entirely in $D$.

The "broken line" condition is just connectedness in disguise: a domain is one piece, not two disjoint open blobs. The set $\{x \neq 0\}$ in the plane is open, but it splits into the left and right half-planes - you cannot get from $(-1, 0)$ to $(1, 0)$ without leaving the set, so it's not a domain in Kaplan's sense.

Warning - terminology collision. The word "domain" is also used for the set of inputs of a function: "the domain of $\log(x^2+y^2-1)$." That is not what Kaplan means here. In §2.2, "domain" is a topological label for a region of the plane (open + connected). Most pages later will say "in domain $D$" meaning a connected open set on which a function is being studied. The two notions often coincide in practice - the natural region where a formula makes sense usually is a topological domain - but the words are carrying different jobs.

A region is a domain plus, possibly, some or all of its boundary. If we throw in all the boundary points, we get a closed region. So the open disk is a domain; the closed disk is a closed region; the open disk together with half its rim is a region but neither open nor closed. Kaplan often writes a closed region as $R = D \cup \partial D$.

Most domains we'll meet are described by inequalities - $x^2 + y^2 < 1$, $0 < x < 1$ and $0 < y < 1$, $xy < 1$. The boundary is the corresponding equality, and the closed region is the non-strict inequality.

Take $xy < 1$ - what region is this? Try to picture it before reading on. Test points: $(0, 0)$ gives $0 < 1$, in; $(2, 1)$ gives $2 < 1$, out; $(-3, -3)$ gives $9 < 1$, out. It turns out the set is the plane with the two hyperbolic branches of $xy = 1$ (one in the first quadrant, one in the third) carved out, along with everything beyond them. The middle strip containing both axes is the domain.

Simply connected

Connectedness says the region is one piece. Simple connectedness adds a second condition: there are no holes.

Back to the rubber band from the hook. The closed curve is a rubber band lying in $D$; if it always pulls tight to a single point without ever leaving the region, the region is simply connected. A snag - somewhere it can't go - is a hole. That's the entire idea; the formal version just says the same thing carefully.

A domain $D$ is simply connected if every closed curve in $D$ can be continuously shrunk to a point while staying entirely inside $D$.
disk: simply connected
Loop slides inward and dies at a point.
hole annulus: not simply connected
The loop catches on the hole.

Examples of simply connected planar domains: the open disk, the open square, any convex region, the whole plane, even a half-plane. Non-examples: the annulus $1 < x^2 + y^2 < 4$, the punctured disk $0 < x^2 + y^2 < 1$, the plane minus a finite set of points.

For planar regions there is a clean equivalent: $D$ is simply connected if and only if every simple closed curve $C$ in $D$ has its entire interior contained in $D$. In other words, no loop in $D$ encloses a forbidden region. That picture - "no holes" - is the one to keep in mind.

This is the missing hypothesis in Green's theorem and in the converse "curl-free implies conservative." A curl-free field on a simply connected domain has a potential. Drop the simply-connected assumption and the converse can fail - the famous example is $-y/(x^2+y^2)\,\mathbf{i} + x/(x^2+y^2)\,\mathbf{j}$ on the punctured plane.

A subtlety in three dimensions

In the plane, "simply connected" lines up with intuition: no holes. In space, the same word means the same thing - every closed curve shrinks to a point - but the geometry is more forgiving, and we have to think harder about what counts as a hole.

Take $\mathbb{R}^3$ minus a single point. Quick - is it simply connected? Most people guess no - surely a loop drawn around the missing point is stuck, just like a loop around a hole in the plane? It turns out yes, and the reason is so geometric you can almost see it. Any loop, no matter how it threads near the missing point, can be slid off in the third dimension and contracted - lift it up, away from the puncture, and pull it tight. There is no "hole" in 3D - a single missing point is a zero-dimensional defect, and a one-dimensional loop can step around it.

Now take $\mathbb{R}^3$ minus an entire line - say, the $z$-axis. A horizontal loop around the line still cannot be shrunk: any continuous deformation has to cross the $z$-axis somewhere, which is forbidden. So $\mathbb{R}^3$ minus a line is not simply connected. The line is a one-dimensional defect, and it traps two-dimensional loops the same way a missing point traps loops in the plane.

We're going to give this pattern a name - codimension. Roughly speaking, it's how many dimensions you're missing: the codimension of a thing inside an ambient space is the ambient dimension minus the thing's own dimension. A point in 2D has codimension $2 - 0 = 2$; a curve in 2D has codimension $1$; a point in 3D has codimension $3$; a line in 3D has codimension $2$. The pattern that emerges from the four examples we just walked through: loops get trapped exactly when the missing piece has codimension $2$ - one extra dimension is enough to slide around it, two extra (codimension $3$ or more) and it disappears entirely.

Rule of thumb: in $\mathbb{R}^n$, removing a piece of codimension $\geq 3$ preserves simple connectedness (a 1D loop has room to slide off); codimension $2$ traps loops (they can encircle and get stuck); codimension $1$ typically disconnects the space outright.

This distinction is exactly what separates two famous vector fields:

The topology is doing real physical work. The vocabulary on this page is what lets us state cleanly when a "locally conservative" field is also globally conservative.

Practice Problems - §2.2

From Kaplan, problems after §2.4 (covering the topology of §2.2).

13(b) Show that the set formed of a set $E$ in the plane and its boundary is closed.
Step 1: Set up.

Let $E$ be any set in the plane (it doesn't have to be open or closed) and let $\partial E$ denote its boundary. Write $\bar E = E \cup \partial E$ - this is the closure of $E$. We want to show $\bar E$ is closed.

Step 2: It turns out it's cleaner to show $\bar E^c$ is open.

A set is closed iff its complement is open. So pick $p \notin \bar E$ - that is, $p$ is neither in $E$ nor on $\partial E$. We need to find a neighborhood of $p$ that misses $\bar E$.

Step 3: Use the definition of boundary point.

Boundary points are exactly the points where every neighborhood contains both points in $E$ and points outside $E$. Since $p \notin \partial E$, there is some neighborhood $N_\delta(p)$ that fails this - it must lie entirely in $E$ or entirely outside $E$. And since $p \notin E$, that neighborhood lies entirely outside $E$.

Step 4: This neighborhood also misses $\partial E$.

If some $q \in N_\delta(p)$ were on $\partial E$, then every neighborhood of $q$ would intersect $E$. But we can shrink to get a small neighborhood of $q$ inside $N_\delta(p)$, which we just showed lies entirely outside $E$. Contradiction. So $N_\delta(p)$ misses $\partial E$ too.

Step 5: Conclude.

$N_\delta(p)$ misses $E$ and misses $\partial E$, so it misses $\bar E$. Every $p$ outside $\bar E$ has such a neighborhood, so $\bar E^c$ is open, so $\bar E$ is closed. Why this matters: closed regions in Kaplan's sense are domains plus their boundaries - this problem is the proof that calling them "closed" is consistent with the open/closed-set vocabulary.

12 Show that a set $E$ in the plane is closed if and only if for every convergent sequence $\{P_n\}$ of points in $E$, the limit $P_0$ is also in $E$.
Step 1: What we have to prove.

This is an "iff", so we need both directions. Forward: closed $\Rightarrow$ sequences-stay. Reverse: sequences-stay $\Rightarrow$ closed. The forward direction is the easy one - try it first.

Step 2: ($\Rightarrow$) Closed implies sequences stay.

Suppose $E$ is closed and $\{P_n\} \subset E$ with $P_n \to P_0$. We want $P_0 \in E$. Suppose not - then $P_0 \in E^c$. Since $E$ is closed, $E^c$ is open, so $P_0$ has a neighborhood $N_\epsilon(P_0)$ entirely inside $E^c$. But $P_n \to P_0$ means eventually all $P_n$ lie in $N_\epsilon(P_0)$ - i.e. in $E^c$. Contradiction with $P_n \in E$. So $P_0 \in E$.

Step 3: ($\Leftarrow$) Sequences stay implies closed.

This direction is the harder one. Suppose $E$ has the sequence property. We want $E$ closed - equivalently, $E^c$ open. So pick $P_0 \in E^c$ and find a neighborhood of it inside $E^c$.

Step 4: Argue by contradiction (Kaplan's hint).

Suppose no neighborhood of $P_0$ lies entirely in $E^c$. Then for every $n$, the neighborhood $N_{1/n}(P_0)$ contains some point $P_n \in E$. We've built a sequence $P_n \in E$ with $d(P_n, P_0) < 1/n$, so $P_n \to P_0$. By the sequence property, $P_0 \in E$. But we picked $P_0 \in E^c$. Contradiction.

Step 5: Why this matters.

Closed sets have two equivalent characterizations: "complement is open" and "limits of sequences stay inside." The first is what we used to define them; the second is what makes them useful - any limiting process you carry out inside $E$ won't escape. This is the content of "compactness" in disguise, and it's why closed regions are the natural setting for theorems like extreme-value.

13(a) Show that the empty set is both open and closed - and hence the whole plane is closed.
Step 1: empty set is open.

The definition says: for every point $p$ in the set, some neighborhood lies inside. The empty set has no points, so the condition is vacuously satisfied - there's nothing to check. So $\emptyset$ is open.

Step 2: empty set is closed.

The complement of $\emptyset$ is the whole plane $\mathbb{R}^2$. Pick any point $p$; the neighborhood $N_1(p)$ is contained in $\mathbb{R}^2$ trivially. So $\mathbb{R}^2$ is open, which means $\emptyset$ - its complement - is closed.

Step 3: hence the whole plane is closed.

By the same argument run in the other direction: $\mathbb{R}^2$ is closed iff its complement $\emptyset$ is open, and we just showed it is. So $\mathbb{R}^2$ is both open and closed. Topologists call sets with this property clopen; in the plane the only clopen sets are $\emptyset$ and the whole plane, and that fact is essentially the connectedness of $\mathbb{R}^2$.