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

Neighborhoods and Neighborhood Bases

College Depth 75 in the knowledge graph ☐ I know this ☆ Set as goal
127topics build on this
328prerequisites beneath it
See this on the map →
Open Sets in Topological Spaces→→Continuity in Topological SpacesFirst Countability and Bases+2 more
neighborhoods local-structure

Core Idea

A neighborhood of a point x is any set N containing an open set U with x ∈ U. A neighborhood base at x is a collection {Bᵢ} of neighborhoods such that every neighborhood of x contains some Bᵢ. Neighborhoods encode local topological structure; a set is open iff it is a neighborhood of each of its points.

Explainer

Open sets, from your prerequisite, are defined globally: a set is either in the topology or it isn't. Neighborhoods reframe the same information locally — they let you talk about "what the space looks like near this particular point" without specifying the whole topology at once. A neighborhood of x is any set N that contains an open set U with x ∈ U ⊆ N. The key flexibility is that N itself need not be open: the closed interval [0.9, 1.1] is a neighborhood of 1 in ℝ, because the open interval (0.95, 1.05) sits inside it and contains 1. Neighborhoods are "open sets with wiggle room" — they absorb boundaries without losing the local information.

The equivalence "U is open iff U is a neighborhood of each of its points" is not a definition but a theorem, and it repackages the definition of open sets in local terms. If U is open and x ∈ U, then U itself witnesses that U is a neighborhood of x. Conversely, if every point of U has some open set around it inside U, you can take the union of all these open sets to reconstruct U itself — so U is open. This local characterization is useful because it lets you prove openness point by point, which is often easier than verifying the global condition directly.

A neighborhood base (local base) at x is a collection {Bᵢ} of neighborhoods of x such that every neighborhood of x contains some Bᵢ. In a metric space, the open balls {B(x, 1/n) : n ∈ ℕ} form a countable neighborhood base at every point: any neighborhood of x must contain some ball, and you only need to check ball-sized neighborhoods to understand the local structure completely. Spaces where every point has a *countable* neighborhood base are called first-countable; all metric spaces are first-countable. This property is important because first-countability is exactly what allows sequences to detect topological structure — a point x is in the closure of A if and only if some sequence in A converges to x. In spaces that fail first-countability, sequences are insufficient and the more general tools of nets or filters are required.

Neighborhoods provide the sharpest formulation of continuity at a point. A function f: X → Y is continuous at x if and only if for every neighborhood V of f(x), there is a neighborhood U of x with f(U) ⊆ V. Compare this to the ε-δ definition from calculus: ε defines a neighborhood (x − ε, x + ε) of the output, and δ defines a neighborhood (x − δ, x + δ) of the input. The neighborhood version is identical in structure but works in any topological space with no distance function needed. This is how the intuition from calculus carries over wholesale into the abstract setting.

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

Longest path: 76 steps · 328 total prerequisite topics

Prerequisites (1)

Leads To (4)