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

First Countability and Bases

College Depth 77 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
360prerequisites beneath it
See this on the map →
Neighborhoods and Neighborhood BasesFirst Countable Spaces→→Second Countability and Separability
first-countability countability

Core Idea

A space is first-countable if every point has a countable neighborhood base. Metric spaces are first-countable. In first-countable spaces, sequential properties determine topology: f is continuous iff it preserves sequential limits. First-countability is weaker than second-countability but sufficient for many purposes.

Explainer

From your study of neighborhoods in topology, you know that a neighborhood base at a point x is a collection of neighborhoods of x such that every neighborhood of x contains some member of the collection. Think of a neighborhood base as a set of "probes" of decreasing size around x — if you can detect everything about the local topology of x using just those probes, the base captures the full local picture. First-countability imposes one requirement: this base can be chosen to be countable.

In a metric space, the canonical example is the collection of open balls B(x, 1/n) for n = 1, 2, 3, …. These form a countable neighborhood base at x because every open set containing x contains some B(x, 1/n). This is why all metric spaces are first-countable. The intuition is that in a metric space, shrinking balls of radii 1, 1/2, 1/3, … give you enough resolution to detect all local structure — you never need uncountably many probes.

The power of first-countability is that it lets sequences do all the work of general nets or filters. In an arbitrary topological space, sequential convergence may not detect the full topology: a function can be "sequentially continuous" (preserves limits of sequences) without being truly continuous. But in a first-countable space, these notions coincide — a function is continuous if and only if it sends convergent sequences to convergent sequences. Similarly, a point is in the closure of a set A if and only if it is the limit of a sequence in A. This makes first-countable spaces feel much more like metric spaces, even when no actual metric is present.

The standard example of a space that fails first-countability is the uncountable product ℝᴵ where I is uncountable. At any point x, every basic open set is determined by restrictions on finitely many coordinates. To form a neighborhood base at x, you would need to accommodate all possible finite coordinate constraints — but since there are uncountably many coordinates, no countable collection of neighborhoods can serve as a base. In such spaces, sequences are genuinely insufficient: you must work with nets or filters to correctly describe continuity and closure.

First-countability sits between the general topological setting and the full strength of second-countability (which requires a countable base for the entire topology, not just at each point). It is the minimal condition that lets you use "sequence-based intuition" from calculus and metric space analysis in a purely topological setting. Whenever a theorem says "in a first-countable space, we can use sequences to characterize…," it is invoking the guarantee that countable probes at each point suffice to detect the 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 → Closed Sets in Topological Spaces → Limit Points and Accumulation Points → Convergence of Sequences in Topological Spaces → First Countable Spaces → First Countability and Bases

Longest path: 78 steps · 360 total prerequisite topics

Prerequisites (2)

Leads To (1)