A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Limit Points and Accumulation Points

College Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
111topics build on this
329prerequisites beneath it
See this on the map →
Neighborhoods and Neighborhood Bases→→Dense Sets and SeparabilityLimit Points and Convergence
limit-points accumulation

Core Idea

A point x is a limit point of A if every neighborhood of x contains a point of A different from x. The derived set A' is the set of all limit points of A. Then cl(A) = A ∪ A'. A set is closed iff A = cl(A) iff A' ⊆ A. Limit points generalize the notion of convergence to arbitrary topologies.

Explainer

A point x is a limit point (or accumulation point) of a set A in a topological space (X, τ) if every neighborhood of x contains at least one point of A that is different from x. Formally, for every open set U containing x, the intersection U ∩ (A \ {x}) is nonempty. The requirement that the point be different from x is essential: without it, every element of A would trivially be a limit point of A (since x ∈ U ∩ A whenever x ∈ A), and the concept would collapse. The "different from x" clause is what distinguishes genuine accumulation — being approached by other points of A — from mere membership.

The canonical example is the set A = {1/n : n = 1, 2, 3, ...} in ℝ. The point 0 is a limit point of A: every open interval around 0 contains 1/n for sufficiently large n. But 0 is not in A. Meanwhile, 1/2 ∈ A is not a limit point of A, because the interval (1/3, 2/3) contains 1/2 but no other element of A. A point of A that is not a limit point of A is called an isolated point — it sits alone with a neighborhood containing no other element of the set. In this example, every element of A is isolated, and the only limit point is 0.

The set of all limit points of A is called the derived set, denoted A'. The closure of A is then cl(A) = A ∪ A' — the original set together with all its limit points. This gives a characterization of closed sets: A is closed if and only if A' ⊆ A, meaning A contains all its limit points. If any limit point of A is missing from A, then A fails to be closed. This connects the abstract definition of closed (complement is open) to the intuitive notion of a set that "includes its boundary." The closure cl(A) is always closed, and it is the smallest closed set containing A.

In metric spaces and first-countable spaces, limit points can be detected by sequences: x is a limit point of A if and only if there exists a sequence of distinct points in A converging to x. But in general topological spaces, this sequential characterization can fail. A point can be a limit point of A without any sequence from A converging to it — the topology may have "too many" neighborhoods for sequences (indexed by ℕ) to probe. In such spaces, nets (generalized sequences indexed by directed sets) or filters are needed to capture all limit points. The definition via neighborhoods — every neighborhood of x meets A \ {x} — works universally, which is why it is the foundational one.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Neighborhood Bases → Limit Points and Accumulation Points

Longest path: 77 steps · 329 total prerequisite topics

Prerequisites (1)

Leads To (2)