Limit Points and the Setting for Function Limits

Before we can write lim⁡x→cf(x)=L\lim_{x \to c} f(x) = L, we must answer a quieter question. For which points cc does it even make sense to ask about the behavior of ff "near cc"? If cc sits alone in the domain of ff, isolated from every other point, there is no way to approach cc through other domain points. The entire apparatus of approximation that limits are built on then collapses. The concept that rescues us is the limit point (also called an accumulation point or cluster point) of a set. This is a point every neighborhood of which contains domain points other than itself, arbitrarily close by. This matters because the definition of a function limit is not merely a formula to memorize. It is a statement whose logical content depends on a genuine possibility of approach. Calculus textbooks often suppress this subtlety by working only with intervals. There, every point is automatically a limit point. But real analysis demands we build the definition on solid ground. It must work correctly for arbitrary subsets of R\mathbb{R} — punctured domains, sequences converging to a boundary value, fractal-like sets, and beyond. The big picture is this: limit points are a purely set-theoretic and topological notion. They are built only from neighborhoods and the completeness of R\mathbb{R}, with no reference to functions at all. Once we understand which points of a set D⊆RD \subseteq \mathbb{R} are limit points of DD, we know something important. We know exactly at which points cc it is meaningful to ask for lim⁡x→cf(x)\lim_{x\to c} f(x) when f:D→Rf: D \to \mathbb{R}. This article isolates that notion. It proves the central characterization theorem (limit points via sequences). It also shows precisely how it sets the stage for the ε\varepsilon–δ\delta definition of a limit. By the end, you will have a rigorous definition of limit point. You will see a full proof of the sequential characterization theorem. There are worked examples distinguishing limit points from isolated points. A counterexample shows why the "punctured neighborhood" clause is essential. Finally, you get a clear map of how this single idea underlies every limit computation you will ever perform.

Key takeaways
  • A limit point of a set D⊆RD \subseteq \mathbb{R} is a point cc such that every neighborhood of cc contains a point of DD other than cc itself.
  • cc need not belong to DD; and points of DD that are not limit points of DD are called isolated points.
  • The sequential characterization: cc is a limit point of DD iff there is a sequence in D∖{c}D \setminus \{c\} converging to cc.
  • Function limits lim⁡x→cf(x)\lim_{x\to c} f(x) are only meaningfully defined when cc is a limit point of the domain of ff.
  • The Bolzano–Weierstrass theorem guarantees limit points exist for every bounded infinite subset of R\mathbb{R}.
  • Limit points generalize immediately to Rn\mathbb{R}^n and metric spaces, underlying the definitions of closed sets, closures, and continuity.
  • Key idea: a limit point is a location that domain points can approach arbitrarily closely without ever landing on, or being forced to land on — and this "approachability" is exactly what a function limit interrogates.

Where this lives today

The notion of limit point is the quiet backbone underneath nearly every rigorous statement about limits, continuity, and convergence in mathematics.

  • Real analysis proper: the ε\varepsilon–δ\delta definition of lim⁡x→cf(x)\lim_{x\to c} f(x) is stated with the explicit hypothesis that cc is a limit point of the domain — this is exactly the concept this article was built to supply.
  • Topology: limit points generalize verbatim to metric spaces and topological spaces, where a set is defined to be closed precisely when it contains all its limit points, giving the modern definition of closure D‾=D∪D′\overline{D} = D \cup D'.
  • Differential equations and dynamical systems: fixed points and limit cycles of dynamical systems are analyzed via accumulation behavior of trajectories, a direct descendant of limit-point reasoning applied to orbits rather than static sets.
  • Numerical analysis and optimization: convergence proofs for iterative algorithms (Newton's method, gradient descent) show that generated sequences accumulate at a fixed point, invoking Bolzano–Weierstrass-style compactness arguments.
  • Probability and statistics: the theory of limit points of sequences of random variables underlies almost-sure convergence and the study of accumulation points of empirical distributions.
  • Computer science and cryptography: discretized approximation algorithms (e.g., in computational geometry or numerical root-finding) rely on the existence of accumulation points of bounded search sequences to guarantee termination or correctness bounds.

Ask the tutor: How does the requirement that cc be a limit point of the domain get built explicitly into the ε\varepsilon–δ\delta definition of lim⁡x→cf(x)\lim_{x\to c} f(x), and what would go wrong in the uniqueness-of-limits proof if we dropped it?

DefinitionLimit point of a set

Let D⊆RD \subseteq \mathbb{R}. A point c∈Rc \in \mathbb{R} is a limit point (or accumulation point, or cluster point) of DD if for every ε>0\varepsilon > 0, the punctured neighborhood

(c−ε, c+ε)∖{c}(c - \varepsilon, \, c + \varepsilon) \setminus \{c\}

contains at least one point of DD. Equivalently, every neighborhood Vε(c)=(c−ε,c+ε)V_\varepsilon(c) = (c-\varepsilon, c+\varepsilon) satisfies

(Vε(c)∖{c})∩D≠∅.\big(V_\varepsilon(c) \setminus \{c\}\big) \cap D \neq \emptyset .

A point c∈Dc \in D that is not a limit point of DD is called an isolated point of DD: there exists ε>0\varepsilon > 0 such that Vε(c)∩D={c}V_\varepsilon(c) \cap D = \{c\}. The set of all limit points of DD is denoted D′D' and is called the derived set of DD. Note that cc need not be an element of DD to be a limit point of DD.

Intuition

Think of DD as a scattering of points, or a continuum, laid out on the real line. A limit point cc is a place where DD "piles up": no matter how tightly you zoom in around cc, you keep finding other points of DD nearby — never running out. This is a strictly stronger requirement than merely containing cc itself: the definition explicitly discards cc from consideration by removing it via the "∖{c}\setminus \{c\}." That single set-subtraction is the entire subtlety of the definition, and it is what makes limit points the right foundation for function limits — a limit describes behavior near cc, deliberately excluding what happens at cc. Contrast this with an isolated point: a point of DD that has some breathing room, some neighborhood entirely to itself (within DD). If D={1,2,3}D = \{1, 2, 3\}, every point is isolated — you can draw a small disk around 11 containing no other point of DD. But if D={1/n:n∈N}D = \{1/n : n \in \mathbb{N}\}, the point 00 is a limit point of DD even though 0∉D0 \notin D: every neighborhood of 00, however small, contains infinitely many terms 1/n1/n. Meanwhile every point 1/n∈D1/n \in D is isolated in DD, since consecutive terms 1/n1/n and 1/(n+1)1/(n+1) are bounded away from each other.

Figure
The set D={1/n}D = \{1/n\} piling up at the limit point 00, versus isolated points of DD
0 1 limit point 0 ∉ D points 1/n ∈ D, each isolated 1/2

The upshot for calculus: when we later define lim⁡x→cf(x)\lim_{x \to c} f(x), we are asking "as xx ranges over D∖{c}D \setminus \{c\} and approaches cc, does f(x)f(x) approach some value LL?" This question is vacuous or ill-posed unless DD actually has points other than cc arbitrarily close to cc — precisely the condition that cc is a limit point of DD. This is why every honest statement of the ε\varepsilon–δ\delta definition includes the hypothesis that cc is a limit point of the domain.

TheoremSequential Characterization of Limit Points

Let D⊆RD \subseteq \mathbb{R} and c∈Rc \in \mathbb{R}. Then cc is a limit point of DD if and only if there exists a sequence (xn)n=1∞(x_n)_{n=1}^{\infty} with

xn∈D∖{c}  for every n,andlim⁡n→∞xn=c.x_n \in D \setminus \{c\} \ \text{ for every } n, \qquad \text{and} \qquad \lim_{n \to \infty} x_n = c.
Proof

We prove both directions. The technique is constructive for the forward direction (building a sequence via the Archimedean property) and a direct neighborhood argument for the reverse direction.

(⇒\Rightarrow) Suppose cc is a limit point of DD. We construct the desired sequence by choosing one point from D∖{c}D \setminus \{c\} inside each neighborhood V1/n(c)V_{1/n}(c). Fix n∈Nn \in \mathbb{N}. By definition of limit point, applied with ε=1/n>0\varepsilon = 1/n > 0, the punctured neighborhood

V1/n(c)∖{c}=(c−1n, c+1n)∖{c}V_{1/n}(c) \setminus \{c\} = \left(c - \tfrac{1}{n},\, c+\tfrac1n\right) \setminus \{c\}

has nonempty intersection with DD. Choose (this uses the Axiom of Choice, or more concretely, well-ordering of a chosen witness for each nn; in an elementary course we simply pick, for each nn, some element) a point

xn∈D∖{c}  with  ∣xn−c∣<1n.x_n \in D \setminus \{c\} \ \text{ with } \ |x_n - c| < \tfrac{1}{n}.

This defines a sequence (xn)(x_n) with xn∈D∖{c}x_n \in D \setminus \{c\} for every nn, by construction. We claim xn→cx_n \to c. Let ε>0\varepsilon > 0 be given. By the Archimedean property of R\mathbb{R} (a consequence of completeness), there exists N∈NN \in \mathbb{N} with 1/N<ε1/N < \varepsilon. Then for all n≥Nn \geq N,

∣xn−c∣<1n≤1N<ε.|x_n - c| < \frac{1}{n} \le \frac{1}{N} < \varepsilon.

Since ε>0\varepsilon > 0 was arbitrary, lim⁡n→∞xn=c\lim_{n\to\infty} x_n = c by the definition of sequential convergence. This proves the forward direction.

(⇐\Leftarrow) Suppose there exists a sequence (xn)(x_n) with xn∈D∖{c}x_n \in D\setminus\{c\} for all nn and xn→cx_n \to c. We must show cc is a limit point of DD: that is, for every ε>0\varepsilon > 0, the set Vε(c)∖{c}V_\varepsilon(c)\setminus\{c\} meets DD. Let ε>0\varepsilon > 0 be arbitrary. Since xn→cx_n \to c, by the definition of convergence there exists N∈NN \in \mathbb{N} such that

∣xN−c∣<ε.|x_N - c| < \varepsilon.

(We may take any single index n≥Nn \ge N from the definition of convergence; take n=Nn = N for concreteness.) Since xN∈D∖{c}x_N \in D \setminus \{c\} by hypothesis, we have exhibited a point xN∈Dx_N \in D with xN≠cx_N \neq c and ∣xN−c∣<ε|x_N - c| < \varepsilon, i.e.

xN∈(Vε(c)∖{c})∩D.x_N \in \big(V_\varepsilon(c) \setminus \{c\}\big) \cap D.

Hence this intersection is nonempty. As ε>0\varepsilon>0 was arbitrary, cc is a limit point of DD by definition. Both directions are established, so the biconditional holds. ■\blacksquare

∎
CorollaryExistence of limit points for bounded infinite sets

Every bounded infinite subset D⊆RD \subseteq \mathbb{R} has at least one limit point (not necessarily in DD).

Proof

Since DD is infinite, we may choose a sequence (xn)(x_n) of distinct points of DD (formally: enumerate a countably infinite subset of DD, possible since DD is infinite). Since DD is bounded, (xn)(x_n) is a bounded sequence in R\mathbb{R}. By the Bolzano–Weierstrass theorem (itself a consequence of the completeness axiom, proved independently of the present theorem), (xn)(x_n) has a convergent subsequence (xnk)(x_{n_k}) with xnk→cx_{n_k} \to c for some c∈Rc \in \mathbb{R}. Because the xnx_n were chosen distinct, at most one term of the subsequence equals cc; discard it if necessary and relabel — this leaves a sequence in D∖{c}D \setminus \{c\} converging to cc (convergence of a sequence is unaffected by discarding finitely many terms). By the sequential characterization theorem just proved, cc is a limit point of DD. ■\blacksquare

∎

This corollary is not circular: it invokes Bolzano–Weierstrass, a prior and independent consequence of completeness (via nested intervals or monotone subsequences), not the theorem being proved here.

Worked examples

Example 1 — A mixed set with an interval, isolated points, and an "almost missed" limit point. Let

D=(0,1) ∪ {2} ∪ {3+1n:n∈N}.D = (0,1) \ \cup \ \{2\} \ \cup \ \left\{3 + \frac{1}{n} : n \in \mathbb{N}\right\}.

Determine the derived set D′D' and identify the isolated points of DD. Solution. We examine each piece. The interval (0,1)(0,1). Take any c∈[0,1]c \in [0,1]. We claim cc is a limit point of DD. If c∈(0,1)c \in (0,1), then for small enough ε\varepsilon the whole neighborhood Vε(c)V_\varepsilon(c) lies in (0,1)⊆D(0,1) \subseteq D, and certainly contains points of (0,1)(0,1) other than cc (e.g. c+ε/2c + \varepsilon/2 when ε\varepsilon small enough that c+ε/2<1c+\varepsilon/2 <1; more simply, (0,1)(0,1) has no isolated points because between any two reals there is another real — density of R\mathbb{R}). If c=0c = 0 or c=1c=1 (the endpoints, not in DD), every neighborhood of cc still meets (0,1)(0,1): e.g. for c=0c=0, the sequence xn=1/(n+2)∈(0,1)⊆Dx_n = 1/(n+2) \in (0,1)\subseteq D satisfies xn→0x_n \to 0, xn≠0x_n \ne 0, so by the sequential characterization, 0∈D′0 \in D'. Similarly 1∈D′1 \in D'. For cc outside [0,1][0,1], sufficiently small neighborhoods of cc miss (0,1)(0,1) entirely (since (0,1)(0,1) is bounded and cc is not in its closure), so such cc contributes no limit points from this piece. Hence this piece contributes exactly [0,1][0,1] to D′D'. The isolated point {2}\{2\}. Choose ε=1/2\varepsilon = 1/2. Then V1/2(2)=(1.5,2.5)V_{1/2}(2) = (1.5, 2.5). Does this meet D∖{2}D \setminus \{2\}? It does not meet (0,1)(0,1) (since 1.5>11.5 > 1), and 3+1/n≥43 + 1/n \geq 4 for all n≥1n\ge1 so none of those points lie in (1.5,2.5)(1.5,2.5) either. Hence V1/2(2)∩D={2}V_{1/2}(2) \cap D = \{2\}, confirming 22 is an isolated point of DD, not a limit point. The sequence {3+1/n}\{3 + 1/n\}. As n→∞n \to \infty, 3+1/n→33 + 1/n \to 3, and each term is in D∖{3}D\setminus\{3\} (note 3∉D3 \notin D, since the sequence never actually equals 33). By the sequential characterization, 33 is a limit point of DD. Is 33 the only limit point contributed here? Each individual term 3+1/n3 + 1/n (for fixed nn) is isolated in DD: the gap to its neighbors 3+1n−13+\frac{1}{n-1} and 3+1n+13+\frac{1}{n+1} is strictly positive (a short computation: the gap to the next term is 1n−1n+1=1n(n+1)>0\frac{1}{n} - \frac{1}{n+1} = \frac{1}{n(n+1)} > 0), so a small enough ε\varepsilon isolates it. So this piece contributes only {3}\{3\} to D′D', while every 3+1/n3+1/n is an isolated point of DD.

Conclusion:

D′=[0,1]∪{3},isolated points of D={2}∪{3+1n:n∈N}.D' = [0,1] \cup \{3\}, \qquad \text{isolated points of } D = \{2\} \cup \left\{3+\tfrac1n : n\in\mathbb{N}\right\}.

Notice D′⊈DD' \not\subseteq D (since 0,1,3∉D0,1,3 \notin D) and D⊈D′D \not\subseteq D' (since 2∉D′2 \notin D', and none of 3+1/n∈D′3+1/n \in D'): limit points and domain membership are logically independent notions.

Example 2 — Why Q\mathbb{Q} has every real number as a limit point. Let D=QD = \mathbb{Q}, the rational numbers. Show that D′=RD' = \mathbb{R}, i.e., every real number is a limit point of Q\mathbb{Q} — including irrational numbers, which are not even in Q\mathbb{Q}. Solution. Let c∈Rc \in \mathbb{R} be arbitrary (rational or irrational). We must produce, for every ε>0\varepsilon>0, a rational number qq with 0<∣q−c∣<ε0 < |q-c| < \varepsilon. We use the density of Q\mathbb{Q} in R\mathbb{R}, itself a standard consequence of the Archimedean property: between any two distinct real numbers there lies a rational number. Concretely: fix n∈Nn \in \mathbb{N}. Apply density of Q\mathbb{Q} to the two distinct reals cc and c+1/nc + 1/n (distinct since 1/n≠01/n \ne 0) to obtain a rational qnq_n with

c<qn<c+1n(or, to guarantee qn≠c, we may instead pick qn strictly between c and c+1/n).c < q_n < c + \frac1n \qquad \text{(or, to guarantee } q_n \ne c\text{, we may instead pick } q_n \text{ strictly between } c \text{ and } c+1/n).

Then qn∈Q∖{c}q_n \in \mathbb{Q}\setminus\{c\} (since qn>cq_n > c strictly) and

∣qn−c∣<1n→0.|q_n - c| < \frac1n \to 0.

By the squeeze theorem for sequences, qn→cq_n \to c. This is exactly a sequence in D∖{c}=Q∖{c}D \setminus \{c\} = \mathbb{Q}\setminus\{c\} converging to cc, so by the sequential characterization theorem, c∈D′=Q′c \in D' = \mathbb{Q}'. Since c∈Rc \in \mathbb{R} was arbitrary, Q′=R\mathbb{Q}' = \mathbb{R}. This is a striking illustration that a limit point of DD need not lie in DD: no irrational number is in Q\mathbb{Q}, yet every irrational number is a limit point of Q\mathbb{Q}. It also shows D′D' can be a strictly larger, "denser" set than DD itself.

CounterexampleWhy the point must be removed: what breaks without the "punctured" clause

Suppose we (incorrectly) redefine: "cc is a pseudo-limit-point of DD if every neighborhood Vε(c)V_\varepsilon(c) meets DD" — omitting the ∖{c}\setminus\{c\} used in the true definition. Take D={5}D = \{5\}, a single point, and c=5c = 5. Under the flawed definition, every neighborhood Vε(5)=(5−ε,5+ε)V_\varepsilon(5) = (5-\varepsilon, 5+\varepsilon) trivially contains the point 5∈D5 \in D, so 55 would qualify as a "pseudo-limit-point" of DD. But D={5}D=\{5\} is a single isolated point with no other elements at all — there is no sense in which DD "accumulates" near 55, and no sequence of points of DD other than 55 can possibly converge to 55, because no such points exist. This is exactly the failure mode the true definition is designed to prevent: every point of every nonempty set would trivially become a "limit point" of that set (just use cc itself to satisfy the flawed condition), rendering the notion completely useless — it would fail to distinguish a discrete set like {1,2,3}\{1,2,3\} from a continuum like (0,1)(0,1). Consequently, the sequential characterization theorem would also fail: with the flawed definition, c=5c=5 would be a "limit point" of D={5}D=\{5\}, yet no sequence in D∖{c}=∅D\setminus\{c\} = \emptyset converges to cc (there are no sequences of elements of the empty set at all). The biconditional breaks down entirely. This shows the "∖{c}\setminus\{c\}" clause is not a cosmetic refinement — it is the load-bearing piece of the definition that makes limit points meaningfully different from mere "closure points," and it is precisely what makes the definition compatible with the later ε\varepsilon–δ\delta limit definition, where we always consider f(x)f(x) for xx near but not equal to cc.

Scope, edge cases & common traps

SituationWhat holds
c∈Dc \in D, cc a limit point of DDEvery neighborhood of cc contains points of DD other than cc; cc is called a non-isolated point of DD
c∈Dc \in D, cc not a limit pointcc is an isolated point; some neighborhood of cc meets DD only in {c}\{c\}
c∉Dc \notin D, cc a limit point of DDPerfectly allowed and common (e.g. c=0c=0 for D={1/n}D=\{1/n\}, or cc irrational for D=QD=\mathbb{Q})
DD finiteD′=∅D' = \emptyset: a finite set has no limit points at all
DD infinite but unboundedMay or may not have limit points in R\mathbb{R} (e.g. D=ND = \mathbb{N} has D′=∅D' = \emptyset despite being infinite)
DD infinite and boundedMust have at least one limit point, by Bolzano–Weierstrass

The mathematician behind it

Origins · 1 minBernard Bolzano and how this was discovered
BB
Bernard Bolzano
1781–1848 · Prague, Bohemia (Austrian Empire)

Bernard Bolzano was a philosopher, mathematician, and Catholic priest working in Prague during the early nineteenth century, decades before the rigorous foundations of real analysis were widely accepted. Long before Cauchy and Weierstrass popularized ε\varepsilon–δ\delta style arguments in Western Europe, Bolzano had already articulated remarkably modern ideas about continuity, limits, and the structure of infinite sets of real numbers, partly in unpublished manuscripts that only came to light long after his death. His work on what we now call the Bolzano–Weierstrass theorem — that every bounded infinite set of reals has an accumulation point — anticipated by decades the general theory of limit points that Weierstrass and Cantor would later develop into the modern topological vocabulary of derived sets, closures, and completeness.

History
- 1817 — Bolzano publishes a proof of the Intermediate Value Theorem using purely arithmetic (non-geometric) reasoning, an early landmark in rigorous analysis.
- 1830s — Bolzano develops, in largely unpublished manuscripts, ideas about bounded infinite sets of reals possessing points of accumulation.
- 1860s — Karl Weierstrass, working independently in Berlin, rediscovers and rigorously establishes the theorem that bounded infinite sets have limit points, cementing ε\varepsilon–δ\delta style analysis.
- 1872 — Georg Cantor introduces the derived set D′D' in his foundational work on trigonometric series, formalizing limit points set-theoretically.
- 1880s–1890s — Cantor's language of derived sets becomes the seed of general point-set topology, later abstracted to metric and topological spaces.
Does a limit point of a set have to belong to that set?

No. Membership in DD and being a limit point of DD are logically independent properties. The classic example is D={1/n:n∈N}D = \{1/n : n \in \mathbb{N}\}: the point 00 is a limit point of DD because every neighborhood of 00 contains infinitely many terms 1/n1/n, yet 00 itself is never one of the terms 1/n1/n, so 0∉D0 \notin D. Conversely, a point can belong to DD without being a limit point of DD — such a point is called isolated. The set D′D' of all limit points, called the derived set, can overlap DD partially, entirely, or hardly at all (as with Q′=R⊋Q\mathbb{Q}' = \mathbb{R} \supsetneq \mathbb{Q}), and there is no general containment relation between DD and D′D' that holds for all sets.

Why does the definition of function limit require cc to be a limit point of the domain?

The definition lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L asserts that for every ε>0\varepsilon>0 there is δ>0\delta>0 such that 0<∣x−c∣<δ0<|x-c|<\delta and x∈Dx \in D together imply ∣f(x)−L∣<ε|f(x)-L|<\varepsilon. If cc were an isolated point of DD, then for small enough δ\delta, no x∈Dx \in D satisfies 0<∣x−c∣<δ0 < |x-c| < \delta at all — the hypothesis "0<∣x−c∣<δ0<|x-c|<\delta and x∈Dx\in D" would be vacuously true of no xx, so the implication would be vacuously satisfied for every real number LL simultaneously. This would make limits nonunique and meaningless. Requiring cc to be a limit point of DD guarantees that domain points genuinely exist arbitrarily close to cc (other than cc itself), so the condition is testable and the resulting limit, if it exists, is provably unique.

Is every point of an interval a limit point of that interval?

Yes. If D=(a,b)D = (a,b), [a,b][a,b], (a,b](a,b], or [a,b)[a,b) with a<ba<b, then every point of the closed interval [a,b][a,b] is a limit point of DD, including the endpoints even when they are excluded from DD. This follows from the density of R\mathbb{R}: between cc and c+εc+\varepsilon (or c−εc-\varepsilon) there are always infinitely many other reals belonging to DD, for any ε>0\varepsilon>0 small enough to stay within the interval's span. This is exactly why calculus courses can safely gloss over limit points when working with intervals — the condition is automatically satisfied everywhere, so it never becomes an active constraint until you leave the world of intervals.

Can a set have infinitely many limit points but no elements of its own?

A set with no elements (the empty set) has no limit points, since the punctured-neighborhood condition can never be satisfied by an empty set — vacuously, D=∅D=\emptyset gives D′=∅D'=\emptyset. But a nonempty set can certainly have limit points nowhere related in cardinality to itself: Q\mathbb{Q} is countably infinite yet Q′=R\mathbb{Q}' = \mathbb{R} is uncountable. So a set's derived set can be vastly "larger" than the set itself in cardinality, though the set must be nonempty (indeed infinite, if bounded, by Bolzano–Weierstrass) to guarantee any limit points exist at all.

What is the difference between a limit point and a boundary point?

They are related but distinct concepts. A boundary point of DD is a point every neighborhood of which meets both DD and its complement R∖D\mathbb{R}\setminus D. A limit point of DD is a point every neighborhood of which meets DD at points other than itself, with no reference to the complement at all. For an open interval D=(0,1)D=(0,1), the point 0.50.5 is a limit point of DD but not a boundary point (small neighborhoods of 0.50.5 lie entirely inside DD), while the endpoints 0,10,1 are both limit points of DD and boundary points of DD. The two notions coincide more often than not for "nice" sets but are conceptually independent in general (e.g. every point of Q\mathbb{Q} is a boundary point of Q\mathbb{Q} since irrationals are dense too, and also a limit point).

How does the derived set relate to closed sets?

A set D⊆RD \subseteq \mathbb{R} is defined to be closed precisely when it contains all of its own limit points, i.e. D′⊆DD' \subseteq D. Equivalently, the closure of any set DD is defined as D‾=D∪D′\overline{D} = D \cup D', the smallest closed set containing DD. For example, (0,1)(0,1) is not closed since 0,1∈(0,1)′0,1 \in (0,1)' but 0,1∉(0,1)0,1 \notin (0,1); its closure is (0,1)‾=[0,1]\overline{(0,1)} = [0,1]. This is the direct bridge from the elementary notion developed here to the general topological theory of open and closed sets, continuity, and compactness.

Does every infinite set of real numbers have a limit point?

No — boundedness is essential. The set D=N={1,2,3,… }D = \mathbb{N} = \{1,2,3,\dots\} is infinite but has D′=∅D' = \emptyset: no real number has infinitely many natural numbers arbitrarily close to it, since consecutive naturals are always exactly distance 11 apart, so any neighborhood of radius less than 1/21/2 around a candidate point can contain at most one natural number. The corollary proved in this article requires both infinite and bounded; dropping boundedness, as N\mathbb{N} shows, can eliminate all limit points entirely.

Where this leads