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

Neighborhoods and Local Properties

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
120topics build on this
352prerequisites beneath it
See this on the map →
Basis for a TopologyNeighborhoods and Open Sets→→Continuity in Topological SpacesLimit Points and Convergence
neighborhoods local-properties topology

Core Idea

A neighborhood of a point x is any set containing an open set that contains x. Neighborhoods allow us to study local behavior in a topological space—properties that depend only on what happens near a particular point, not on the space globally. Convergence and continuity are fundamentally local concepts expressed via neighborhoods.

Explainer

The concept of a neighborhood formalizes the intuitive idea of "near a point." You already know that a topology on a set X is a collection of open sets satisfying certain axioms, and that a basis generates all open sets. A neighborhood of a point x is simply any set N that contains some open set U with x ∈ U ⊆ N. The neighborhood need not itself be open — what matters is that there is an open "cushion" around x sitting inside N. In metric spaces, the familiar open balls B(x, ε) are the prototypical neighborhoods, and every metric topology can be understood entirely in terms of them.

Why introduce neighborhoods at all, rather than working directly with open sets? Because many key concepts in topology are fundamentally local — they describe behavior near a single point, not behavior across the whole space. Convergence is the clearest example. A sequence (x₁, x₂, …) converges to x if every neighborhood of x eventually contains all terms of the sequence: for every N containing an open set around x, there exists some index M such that xₙ ∈ N for all n > M. This is exactly the topological generalization of the familiar ε-N definition from metric spaces, where ε-balls play the role of neighborhoods.

Continuity at a point has an equally clean neighborhood formulation. A function f: X → Y is continuous at x if for every neighborhood V of f(x) in Y, there exists a neighborhood U of x in X such that f(U) ⊆ V — the image of a small region around x lands inside any prescribed region around f(x). This phrasing makes the local character of continuity explicit: whether f is continuous at x depends only on what f does near x, not on the global structure of X or Y.

Because a basis generates all opens, it suffices to check neighborhoods against basis elements. If B is a basis for the topology on X, then N is a neighborhood of x if and only if some basis element B ∈ B with x ∈ B is contained in N. This means neighborhood arguments can often be reduced to checking finitely describable basic sets — a practical simplification that carries through to all the local concepts built on neighborhoods.

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 → Open Sets in Topological Spaces → Basis for a Topology → Neighborhoods and Local Properties

Longest path: 77 steps · 352 total prerequisite topics

Prerequisites (2)

Leads To (2)