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

Neighborhoods and Open Sets

Graduate Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
234topics build on this
343prerequisites beneath it
See this on the map →
Open Sets in Topological Spaces→→Convergence in Topological SpacesLimit Points and Accumulation Points+2 more
local neighborhoods

Core Idea

A neighborhood of point x is an open set containing x. Neighborhoods capture the intuition of 'regions around x.' Every topological space is determined by the neighborhood structure: two topologies are equal iff they assign the same neighborhoods to every point. Neighborhoods enable local analysis of topological spaces.

Explainer

From your study of open sets in topology, you know that a topology on a space X is defined by specifying which subsets are "open," subject to the axioms (X and ∅ are open; arbitrary unions of open sets are open; finite intersections of open sets are open). A neighborhood of a point x is simply any open set that contains x. This seemingly minor repackaging — going from "open sets of the space" to "open sets around a point" — is a conceptual shift from global to local analysis.

Why is the local perspective useful? Because most of the properties we care about in analysis and topology are local: continuity, convergence, and limit points all depend on what happens near a point, not on the entire space at once. A function f: X → Y is continuous at x if and only if the preimage of every neighborhood of f(x) is a neighborhood of x. A sequence (xₙ) converges to x if and only if every neighborhood of x contains all but finitely many terms of the sequence. In both cases, the question reduces to: what sets contain x? The neighborhood concept focuses your attention precisely there.

The collection of all neighborhoods of x is called the neighborhood filter at x. Filters are closed under supersets (if U is a neighborhood of x and U ⊆ V, then V is a neighborhood of x) and finite intersections (the intersection of two neighborhoods of x is a neighborhood of x). These closure properties make the neighborhood filter a clean algebraic object. More importantly, the topology is completely determined by its neighborhood structure: a set U is open if and only if it is a neighborhood of every point it contains. You can verify this directly — if every point x in U has a neighborhood Nₓ ⊆ U, then U = ⋃ₓ Nₓ, a union of open sets, hence open.

The practical payoff is that local analysis decomposes complex global questions into manageable point-by-point questions. Rather than asking "is this map continuous everywhere?" you ask "does the preimage of each neighborhood at f(x) contain a neighborhood of x?" at each x. This decomposition is why neighborhoods are the natural language for the concepts you'll encounter next: limit points (which ask whether every neighborhood of x meets a set A) and convergence in topology (which asks whether sequences eventually land in every neighborhood). The neighborhood perspective is not just convenient notation — it is the right level of abstraction for doing local topology.

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 → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets

Longest path: 74 steps · 343 total prerequisite topics

Prerequisites (1)

Leads To (4)