Countability axioms, density and Lindelöfness

Try

The usual real line has a countable basis of rational-endpoint intervals, even though it has uncountably many points and open sets. This separates the size of a space from the size of a useful family of local descriptions.

At each individual point, only a countable list of shrinking intervals is needed. A countable dense set is a third condition: it requires points meeting every nonempty open set, not a list of neighborhoods.

Predict

Predict whether these three countability conditions are equivalent. A countable global basis implies the other two, but the converse fails in general.

The lower-limit line is a concrete test. Half-open neighborhoods [x,x+1/n) give a countable local base at each x, and rational numbers are dense. Nevertheless no countable global base can supply the distinct left-endpoint behavior at every real x.

Experiment

Keep the definitions separate.

Property	Countable object required
First-countable	A local base at each point
Second-countable	One basis for the whole topology
Separable	A dense subset of points
Lindelöf	A countable subcover from every open cover

Countable means finite or countably infinite. The selected family in a Lindelöf conclusion can depend on the original cover.

Understand

Second countability immediately implies first countability by retaining basis members containing a fixed point. It implies separability by choosing one point from each nonempty basis member. The chosen set is countable, and every nonempty open set contains a basis member and hence a chosen point. This uses the usual set-theoretic choice for a countable family of nonempty sets.

It also implies the Lindelöf property. Given an open cover, collect all basis members lying inside some covering set. These still cover X and form a countable family. For each, choose one original covering member containing it. Those selected cover members form a countable subcover.

For the lower-limit line, Q is dense because every nonempty interval [a,b) contains a rational. At x, the countable intervals [x,x+1/n) refine every basic neighborhood. To refute second countability, suppose B is a countable basis. For each real x choose B_x with x∈B_x⊆[x,x+1). If x<y, the same set cannot be B_x and B_y because it would contain x while lying inside [y,y+1). Thus distinct reals require distinct basis members, contradicting countability.

In metric spaces, separability does imply second countability. Balls centered in a countable dense set with positive rational radii form a countable basis. Given an ordinary ball around x, choose a dense center close enough to x and a rational radius large enough to contain x but small enough to stay inside that ball.

Apply

Write the two radius inequalities in the metric proof rather than saying “choose a nearby ball.” If B(x,ε) is available, choose d with distance below ε/3, then choose rational r strictly between d(x,d) and ε−d(x,d). The triangle inequality supplies containment.

Repair “Separable means every point is a limit of a sequence from one countable set.” Density is a neighborhood-intersection condition. Turning closure membership into a sequence requires additional hypotheses, which the next lesson identifies.

Continue

First countability is precisely the useful hypothesis in the basic sequence constructions that follow. Optional depth: prove second countability passes to subspaces by intersecting the global basis with the subset. Compare this with separability, which does not pass to arbitrary subspaces in every topological space.