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

Local Compactness

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
352prerequisites beneath it
See this on the map →
Compact Spaces and Open Covers→
local-compactness compact-neighborhoods

Core Idea

A space is locally compact if every point has a compact neighborhood. Local compactness allows one-point compactification and enables many results from classical analysis to extend. Manifolds are locally compact, and the concept bridges finite-dimensional compactness with infinite-dimensional topology.

Explainer

From your study of compact spaces and open covers, you know that compactness is a global condition: every open cover of the entire space has a finite subcover. Local compactness replaces this global demand with a pointwise one. A space X is locally compact at a point x if there exists a compact neighborhood of x — a compact set K containing an open set containing x. The space is locally compact if it is locally compact at every point.

The canonical example is ℝⁿ. The real line ℝ is not compact (the cover {(−n, n) : n ∈ ℕ} has no finite subcover), but every point x ∈ ℝ has a compact neighborhood: [x−1, x+1] is compact by the Heine-Borel theorem. So ℝ is locally compact but not compact. More generally, any open subset of ℝⁿ is locally compact, and any compact space is trivially locally compact (the whole space is a compact neighborhood of each point). An example that is neither: ℚ with the subspace topology from ℝ — it is not locally compact because no compact neighborhood of a rational number exists (compact subsets of ℚ have empty interior).

The most powerful consequence of local compactness in a Hausdorff space is the one-point compactification (Alexandroff compactification). Given a locally compact Hausdorff space X, adjoin a single extra point ∞ to form X* = X ∪ {∞}. Declare the topology on X* by keeping all the original open sets of X, and declaring a neighborhood of ∞ to be any set whose complement in X is compact. The result is compact: every open cover of X* either omits ∞ (covered by X's topology) or includes a neighborhood of ∞ whose complement is compact, reducing to a finite subcover. This construction turns ℝ into the circle S¹ and ℝ² into the 2-sphere S². Local compactness is exactly the hypothesis that ensures there are enough compact sets to build the topology around ∞ coherently — without it, the construction fails to produce a Hausdorff space.

Local compactness is also a cornerstone of integration theory beyond ℝⁿ. Haar measure — the canonical translation-invariant measure on locally compact groups — requires local compactness as an essential hypothesis; without compact neighborhoods, the averaging procedure used to construct the measure breaks down. For topological manifolds, local compactness is part of the definition: it ensures every point has a neighborhood homeomorphic to an open ball in ℝⁿ, connecting abstract topology to the finite-dimensional geometry you understand from calculus. Local compactness is the minimal condition under which the intuitions of classical analysis — that you can work locally in a small, controlled, "finite-feeling" region — remain valid in a general topological 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 → 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 → Compact Spaces and Open Covers → Local Compactness

Longest path: 77 steps · 352 total prerequisite topics

Prerequisites (1)

Leads To (0)

No topics depend on this one yet.