Bases and subbases
The open sets of the line are far too many to list, yet the open intervals alone pin them all down. Which small families can describe a topology, and how can two descriptions be compared without listing either topology?
Where you are 6 in Topological spaces
Why this exists
In Open, closed and compact sets in R a set U \subseteq \mathbb{R} is open when each of its points x has an interval (x - \varepsilon, x + \varepsilon) inside U. So the open sets are exactly the unions of open intervals. The intervals are a small part of the topology, yet they determine all of it; in a metric space the open balls do the same.
Topologies and open sets defined a topology as a whole family \mathcal{T}; in practice one is given by a smaller family whose unions are the open sets. This lesson says which families can do that (bases), what to do with one that cannot (subbases), and how to compare topologies through their bases, and it builds the lower limit line.
Definition
Basis for a topology. Let (X, \mathcal{T}) be a topological space. A family \mathcal{B} \subseteq \mathcal{T} is a basis for \mathcal{T} if every open set is a union of members of \mathcal{B} (the empty union is \varnothing). Its members are basis elements.
Basis on a set. Let X be a set. A family \mathcal{B} of subsets of X is a basis on X if
- (B1) every x \in X lies in some B \in \mathcal{B};
- (B2) if x \in B_1 \cap B_2 with B_1, B_2 \in \mathcal{B}, then some B_3 \in \mathcal{B} has x \in B_3 \subseteq B_1 \cap B_2.
The topology generated by \mathcal{B} is
By Theorem 1 this is a topology, \mathcal{B} is a basis for it, and the two definitions describe the same families.
Subbasis. A family \mathcal{S} of subsets of X whose union is X is a subbasis on X. The topology generated by \mathcal{S}, written \mathcal{T}_{\mathcal{S}}, is the one generated by the finite intersections S_1 \cap \cdots \cap S_n, n \ge 1, of members of \mathcal{S}, a basis by Theorem 4.
The lower limit line. The topology on \mathbb{R} generated by the half-open intervals [a, b), a < b, is the lower limit topology; \mathbb{R} with it is written \mathbb{R}_{\ell}.
Second countable. A space is second countable if its topology has a countable basis (countable as in Countable and uncountable sets).
Intuition
A basis is a stock of small open sets, enough that every point of every open set has one of them around it inside the set (Theorem 2). In the plane the open disks are such a stock, and so are the countably many disks with rational centers and radii (Figure 1).
Condition (B2) makes the unions of a family closed under intersection: two basis elements may overlap in a set that is not a basis element, but only in a union of them. A subbasis drops (B2); its finite intersections are added by force.
The basis also sets how fine the topology is. The half-open intervals [x, b) fit inside every open interval about x (Figure 2), so \mathbb{R}_{\ell} has every standard open set, and more: [0, 1) is open in \mathbb{R}_{\ell}, yet no open interval about 0 fits inside it.
Results
Theorem 1 (the generated topology). Let \mathcal{B} be a basis on X. Then \mathcal{T}_{\mathcal{B}} is a topology on X, it consists of all unions of members of \mathcal{B}, and \mathcal{B} is a basis for it. Conversely, if \mathcal{B} is a basis for a topology \mathcal{T}, then \mathcal{B} satisfies (B1) and (B2), and \mathcal{T} = \mathcal{T}_{\mathcal{B}}.
Theorem 2 (recognizing a basis). Let (X, \mathcal{T}) be a topological space and \mathcal{C} \subseteq \mathcal{T}. Then \mathcal{C} is a basis for \mathcal{T} if and only if for every open U and every x \in U there is C \in \mathcal{C} with x \in C \subseteq U.
Theorem 3 (comparing topologies). Let \mathcal{B} and \mathcal{B}' be bases on X generating \mathcal{T} and \mathcal{T}'. Then \mathcal{T}' is finer than \mathcal{T} if and only if for every B \in \mathcal{B} and every x \in B there is B' \in \mathcal{B}' with x \in B' \subseteq B.
Theorem 4 (subbases). Let \mathcal{S} be a subbasis on X. The finite intersections of members of \mathcal{S} form a basis on X, and \mathcal{T}_{\mathcal{S}} is the coarsest topology on X containing \mathcal{S}.
Theorem 5 (two bases for the line). (a) The open intervals (p, q) with p < q rational form a countable basis for the standard topology on \mathbb{R}, so \mathbb{R} is second countable. (b) The half-open intervals [a, b) form a basis on \mathbb{R}, and \mathbb{R}_{\ell} is strictly finer than the standard topology. (c) \mathbb{R}_{\ell} is not second countable.
Why it is true
Theorem 1. Proof. (T1): \varnothing \in \mathcal{T}_{\mathcal{B}}, as it has no points to check, and X \in \mathcal{T}_{\mathcal{B}} by (B1). (T2): if x \in \bigcup_{i \in I} U_i with each U_i \in \mathcal{T}_{\mathcal{B}}, then x \in U_j for some j, and some B has x \in B \subseteq U_j \subseteq \bigcup_{i \in I} U_i. (T3): if x \in U \cap V, pick B_1, B_2 with x \in B_1 \subseteq U and x \in B_2 \subseteq V; (B2) gives B_3 with x \in B_3 \subseteq B_1 \cap B_2 \subseteq U \cap V.
Each B \in \mathcal{B} lies in \mathcal{T}_{\mathcal{B}} (for x \in B use B itself), so by (T2) every union of members does. Conversely, for U \in \mathcal{T}_{\mathcal{B}} choose for each x \in U some B_x with x \in B_x \subseteq U; then U = \bigcup_{x \in U} B_x.
Now let \mathcal{B} be a basis for \mathcal{T}. X is open, so a union of members: (B1). If x \in B_1 \cap B_2, this open set is a union of members, one containing x: (B2). So \mathcal{T} and \mathcal{T}_{\mathcal{B}} both consist of the unions of members of \mathcal{B}. \square
Theorem 2. Proof. If \mathcal{C} is a basis for \mathcal{T}, an open U containing x is a union of members of \mathcal{C}, one of which contains x. Conversely, given the condition, choose such a C_x for each x \in U; then U = \bigcup_{x \in U} C_x. \square
Theorem 3. Proof. Suppose the condition holds, and let U \in \mathcal{T} and x \in U. Some B \in \mathcal{B} has x \in B \subseteq U, and then some B' has x \in B' \subseteq B \subseteq U. So U \in \mathcal{T}_{\mathcal{B}'} = \mathcal{T}'. Conversely, if \mathcal{T} \subseteq \mathcal{T}' and x \in B \in \mathcal{B}, then B \in \mathcal{T}', so B is a union of members of \mathcal{B}', one of which contains x. \square
Theorem 4. Proof. Let \mathcal{B} be the family of finite intersections. (B1) holds because \mathcal{S} \subseteq \mathcal{B} covers X. For (B2), the intersection of S_1 \cap \cdots \cap S_m and S'_1 \cap \cdots \cap S'_n is again a finite intersection, so B_3 = B_1 \cap B_2 serves. So \mathcal{T}_{\mathcal{S}} is a topology containing \mathcal{S}. A topology \mathcal{T} containing \mathcal{S} contains every finite intersection of its members by Theorem 1 of Topologies and open sets, then every union of those by (T2), and by Theorem 1 these unions make up \mathcal{T}_{\mathcal{S}}. So \mathcal{T}_{\mathcal{S}} \subseteq \mathcal{T}. \square
Theorem 5. Proof. (a) Each (p, q) is open. Let U be open and x \in U, with (x - r, x + r) \subseteq U. There are rationals p \in (x - r, x) and q \in (x, x + r) by the density of the rationals, so x \in (p, q) \subseteq U, and Theorem 2 applies. Sending (p, q) to its pair of endpoints is one to one into \mathbb{Q} \times \mathbb{Q}, which is countable: list \mathbb{Q} as q_0, q_1, q_2, \dots (Countable and uncountable sets) and list the pairs (q_i, q_j) in order of i + j.
(b) (B1): x \in [x, x + 1). (B2): [a, b) and [c, d) meet in \varnothing or in [\max\{a, c\}, \min\{b, d\}), a basis element. If x \in (a, b) then x \in [x, b) \subseteq (a, b), so \mathbb{R}_{\ell} is finer by Theorem 3. The basis element [0, 1) contains no interval (-r, r), so it is not standard-open.
(c) Let \mathcal{B} be any basis for \mathbb{R}_{\ell}. For each x \in \mathbb{R} the set [x, x + 1) is open, so by Theorem 2 some B_x \in \mathcal{B} has x \in B_x \subseteq [x, x + 1), and x is the least element of B_x. If x < y, then x \in B_x but x \notin B_y, whose elements are all at least y; so B_x \ne B_y. Thus x \mapsto B_x is one to one from \mathbb{R} into \mathcal{B}, and \mathbb{R} is uncountable, so \mathcal{B} is uncountable. \square
Worked examples
A basis on six points
Let X = \{1, 2, 3, 4, 5, 6\} and let \mathcal{B} have the members \{1, 2, 3\}, \{3, 4, 5\}, \{3\}, \{5, 6\}. Is \mathcal{B} a basis on X? If \{5\} is added, find the topology generated.
SolutionThe members cover X, so (B1) holds. But 5 \in \{3, 4, 5\} \cap \{5, 6\} = \{5\}, and no member lies inside \{5\}, so (B2) fails. By Theorem 1, \mathcal{B} is not a basis for any topology on X.
With \{5\} added, overlapping members meet in the members \{3\} or \{5\}, so (B2) holds, and the open sets are the unions of members (Theorem 1). A union containing 1 or 2 contains \{1, 2, 3\}; one containing 4 contains \{3, 4, 5\}; one containing 6 contains \{5, 6\}. Sort by which blocks \{1, 2\}, \{4\}, \{6\} a union includes: none leaves 3 and 5 free (4 sets); \{1, 2\} alone leaves 5 free (2); \{4\} alone forces both (1); \{6\} alone leaves 3 free (2); each of the four larger choices forces both (1 each). The topology has 4 + 2 + 1 + 2 + 4 = 13 open sets; \{1, 3\} is not among them.
Open sets of the lower limit line
In \mathbb{R}_{\ell}, which sets are open? (a) (0, 1]; (b) [0, 1) \cup [2, 3); (c) \mathbb{Q} \cap [0, 1); (d) (-\infty, 0) and [0, \infty).
SolutionA basis element containing x has the form [a, b) with a \le x < b, and then [x, b) \subseteq [a, b). So U is open in \mathbb{R}_{\ell} exactly when each x \in U has some [x, x + \varepsilon) \subseteq U.
(a) Not open: 1 is in the set, but every [1, 1 + \varepsilon) contains \displaystyle 1 + \frac{\varepsilon}{2}, which is not.
(b) Open: a union of two basis elements.
(c) Not open: 0 is in the set, and every [0, \varepsilon) contains the irrational number \displaystyle \frac{\varepsilon}{\sqrt{2}}.
(d) Both open: (-\infty, 0) is standard-open, so open in the finer \mathbb{R}_{\ell}, and [0, \infty) = \bigcup_{n \ge 1} [0, n). So \mathbb{R}_{\ell} splits into two disjoint nonempty open pieces, which the standard line cannot do (Connectedness).
A rational disk inside an open disk
Let U = B\big((0, 0), 2\big) in \mathbb{R}^2 and \displaystyle p = \left(\sqrt{2}, \frac{1}{2}\right). Find a disk B(q, s) with q \in \mathbb{Q}^2 and s \in \mathbb{Q} such that p \in B(q, s) \subseteq U. Then prove that such disks form a countable basis for the standard topology on \mathbb{R}^2.
Solution\displaystyle \lVert p \rVert = \sqrt{2 + \frac{1}{4}} = \frac{3}{2}, so with \displaystyle r = 2 - \frac{3}{2} = \frac{1}{2} the triangle inequality gives B(p, r) \subseteq U. Take \displaystyle q = \left(\frac{13}{10}, \frac{1}{2}\right), so \displaystyle \lVert p - q \rVert = \sqrt{2} - \frac{13}{10} \approx 0.114 < \frac{r}{3} = \frac{1}{6}, and \displaystyle s = \frac{1}{4}, between \displaystyle \frac{r}{3} and \displaystyle \frac{2r}{3}. Then p \in B(q, s), and every y \in B(q, s) has
so B(q, s) \subseteq B(p, r) \subseteq U (Figure 1).
Proof of the general claim. Let V be open and x \in V, with B(x, r) \subseteq V. By density of the rationals there is q \in \mathbb{Q}^2 with \displaystyle |q_i - x_i| < \frac{r}{6} for i = 1, 2, so \displaystyle \lVert q - x \rVert < \frac{\sqrt{2}}{6} r < \frac{r}{3}, and a rational s with \displaystyle \frac{r}{3} < s < \frac{2r}{3}. Then x \in B(q, s), and as above every y \in B(q, s) has \displaystyle \lVert y - x \rVert < s + \frac{r}{3} < r, so B(q, s) \subseteq V. By Theorem 2 these open disks form a basis. Each is fixed by a triple of rationals (q_1, q_2, s), and triples (q_i, q_j, q_k) can be listed in order of i + j + k, so the basis is countable. \square
Lights along a coast
Six coves a, b, c, d, e, f lie in a row along a coast, and four lights shine on them: L_1 reaches \{a, b, c\}, L_2 reaches \{b, c, d\}, L_3 reaches \{d, e, f\} and L_4 reaches \{c, d, e\} (Figure 3). Take \mathcal{S} = \{L_1, L_2, L_3, L_4\} as a subbasis. (a) Find the smallest open set containing each cove, and count the open sets. (b) If L_4 goes dark, which coves can no open set tell apart?
(a) By Theorem 4 the basis elements are the finite intersections of lights. For a cove x, the intersection M_x of all lights reaching x is a basis element containing x. An open set containing x contains a basis element L_{i_1} \cap \cdots \cap L_{i_n} through x, each of whose lights reaches x, so it contains M_x. So M_x is the smallest open set containing x:
| Cove | Lights reaching it | M_x |
|---|---|---|
| a | L_1 | \{a, b, c\} |
| b | L_1, L_2 | \{b, c\} |
| c | L_1, L_2, L_4 | \{c\} |
| d | L_2, L_3, L_4 | \{d\} |
| e | L_3, L_4 | \{d, e\} |
| f | L_3 | \{d, e, f\} |
By Example 6 of Topologies and open sets, U is open exactly when M_x \subseteq U for every x \in U. The part of an open set among a, b, c is \varnothing, \{c\}, \{b, c\} or \{a, b, c\}; among d, e, f it is \varnothing, \{d\}, \{d, e\} or \{d, e, f\}; any two go together. There are 4 \cdot 4 = 16 open sets.
(b) Without L_4, the same lights reach b and c (L_1, L_2), and e and f (L_3). So every intersection of lights, hence every open set, contains b exactly when it contains c. No open set tells b from c, or e from f.
Intervals of length one
Let \mathcal{S} be the family of open intervals (a, a + 1), a \in \mathbb{R}. Show that \mathcal{S} is a subbasis but not a basis on \mathbb{R}, and find the topology it generates.
SolutionIt covers \mathbb{R}, since \displaystyle x \in \left(x - \frac{1}{2}, x + \frac{1}{2}\right). It is not a basis: \displaystyle \frac{3}{4} \in (0, 1) \cap \left(\frac{1}{2}, \frac{3}{2}\right) = \left(\frac{1}{2}, 1\right), an interval of length \displaystyle \frac{1}{2}, and no interval of length 1 fits inside it, so (B2) fails.
Every open interval (c, d) with 0 < d - c \le 1 is a finite intersection of members: for d - c = 1 it is a member, and for d - c < 1 we have d - 1 < c and d < c + 1, so
They form a basis for the standard topology by Theorem 2: they are open, and if x \in U with U open, some (x - r, x + r) \subseteq U, and then \displaystyle r' = \min\{r, \frac{1}{2}\} gives a short interval (x - r', x + r') \subseteq U. So every standard open set lies in \mathcal{T}_{\mathcal{S}}. Conversely the members of \mathcal{S} are standard-open, so by Theorem 4 \mathcal{T}_{\mathcal{S}} is coarser than the standard topology; hence \mathcal{T}_{\mathcal{S}} is the standard topology.
Arithmetic progressions and the primes
For integers a and b with b \ge 1 write a + b\mathbb{Z} = \{a + bk : k \in \mathbb{Z}\}. (a) Show that these sets form a basis on \mathbb{Z}, and find (2 + 6\mathbb{Z}) \cap (5 + 9\mathbb{Z}). (b) Show that in the topology generated, every nonempty open set is infinite and every \mathbb{Z} \setminus (a + b\mathbb{Z}) is open. (c) Prove that there are infinitely many primes.
Solution(a) (B1): n \in n + 1\mathbb{Z} = \mathbb{Z}. (B2): let x = a + bj lie in (a + b\mathbb{Z}) \cap (c + d\mathbb{Z}). Then x + bdk = a + b(j + dk), and likewise for c + d\mathbb{Z}, so x \in x + bd\mathbb{Z} \subseteq (a + b\mathbb{Z}) \cap (c + d\mathbb{Z}). For the numbers: 14 = 2 + 12 = 5 + 9 lies in both, and 14 + m does exactly when 6 and 9, so 18, divide m. The intersection is 14 + 18\mathbb{Z}.
(b) A nonempty open set contains some a + b\mathbb{Z}, which is infinite. By division by b, every integer lies in exactly one of the sets a + i + b\mathbb{Z}, 0 \le i \le b - 1, so
a union of basis elements (empty when b = 1), hence open.
(c) Proof. Every integer other than 1 and -1 has a prime factor p, so lies in p\mathbb{Z} = 0 + p\mathbb{Z}, while \pm 1 lie in no p\mathbb{Z}. Hence
Suppose, for contradiction, that there are only finitely many primes. By De Morgan’s law \{-1, 1\} = \bigcap_{p} (\mathbb{Z} \setminus p\mathbb{Z}), a finite intersection of sets open by (b), so open by Theorem 1 of Topologies and open sets. But it is finite and nonempty, against (b). \square
Hillel Furstenberg published this argument in 1955.
Boundaries
- Not every covering family is a basis (Examples 1 and 5), though every one is a subbasis.
- A topology has many bases. Adding open sets to a basis keeps it one (Exercise 9); a finite space has a smallest basis (Exercise 10). Second countability belongs to the topology: \mathbb{R} also has the uncountable basis of all open intervals.
- A subbasis need not tell points apart. In Example 4(b) no open set contains b without c.
Where this goes next
Closed sets, closure and limit points tests limit points with basis elements alone. Continuous maps and homeomorphisms needs only the preimages of basis or subbasis elements to be open. Subspace and product topologies gives the product topology by the basis of sets U \times V with U, V open. \mathbb{R}_{\ell} returns as a test case in Connectedness and Compactness and open covers.
Exercises
Bases and subbases on finite sets
- On X = \{1, 2, 3, 4\}, which families are bases on X? For each that is, list the topology it generates. (a) \{\{1\}, \{2, 3\}, \{3, 4\}\}; (b) \{\{1, 2\}, \{2\}, \{2, 3, 4\}, \{3\}\}; (c) \{\{1, 2, 3\}, \{2, 3, 4\}\}.
- On X = \{1, 2, 3, 4, 5\}, find the basis given by the subbasis \{\{1, 2\}, \{2, 3\}, \{3, 4, 5\}\} and list the topology it generates. Does any open set contain 4 but not 5?
- Yuna charts five coves p, q, r, s, t on another coast, lit by K_1 = \{p, q\}, K_2 = \{q, r, s\}, K_3 = \{s, t\} and K_4 = \{r, s, t\}. With the lights as a subbasis: (a) find the smallest open set containing each cove; (b) count the open sets; (c) can one light be removed without changing the topology?
Open sets from a basis
- In \mathbb{R}_{\ell}, which sets are open? (a) (-1, 3); (b) [-1, 3]; (c) (-\infty, -5) \cup [5, \infty); (d) \{0\} \cup (1, 2); (e) \displaystyle [\sqrt{2}, \pi).
- Let U = \{(x, y) \in \mathbb{R}^2 : x > 0,\ y > 0\} and \displaystyle P = \left(\frac{1}{\pi}, \sqrt{5}\right). (a) Find the largest r with B(P, r) \subseteq U. (b) Show that \displaystyle q = \left(\frac{3}{10}, \frac{9}{4}\right) and \displaystyle s = \frac{1}{8} give P \in B(q, s) \subseteq U.
- In the topology on \mathbb{Z} of Example 6: (a) is \mathbb{Z} \setminus \{0\} open? (b) is the set of even integers together with 1 open? (c) is 3\mathbb{Z} \cup 5\mathbb{Z} open?
- In \mathbb{R}^2: (a) do the open disks of radius exactly 1 form a basis on \mathbb{R}^2? (b) do the open disks of radius less than 1 form a basis for the standard topology?
Comparing topologies
- The upper limit topology on \mathbb{R} is generated by the intervals (a, b], a < b. (a) Show that these form a basis on \mathbb{R}. (b) Show that the upper limit topology and \mathbb{R}_{\ell} are not comparable. (c) Find the topology generated by the subbasis of all [a, b) and all (a, b].
Proofs
- Let \mathcal{B} be a basis for (X, \mathcal{T}) and \mathcal{B} \subseteq \mathcal{C} \subseteq \mathcal{T}. Prove that \mathcal{C} is a basis for \mathcal{T}.
- Let (X, \mathcal{T}) be a finite space and M_x the smallest open set containing x (Example 6 of Topologies and open sets). Prove that \{M_x : x \in X\} is a basis for \mathcal{T} contained in every basis for \mathcal{T}.
- Let \mathcal{S} be a subbasis on X and \mathcal{S} \subseteq \mathcal{S}' \subseteq \mathcal{T}_{\mathcal{S}}. Prove that \mathcal{T}_{\mathcal{S}'} = \mathcal{T}_{\mathcal{S}}.
- Prove that the rays (-\infty, a) and [b, \infty), a, b \in \mathbb{R}, form a subbasis generating \mathbb{R}_{\ell}, and find the topology generated by the rays (-\infty, a] and [b, \infty).
- Let (X, d) be a metric space with a countable set D \subseteq X that meets every open ball. Prove that the balls \displaystyle B\left(z, \frac{1}{n}\right), z \in D, n \ge 1 an integer, form a countable basis for the metric topology.
Answers
- (a) Not a basis: 3 \in \{2, 3\} \cap \{3, 4\} = \{3\}, and no member lies inside \{3\}. (b) A basis: the members cover X, and overlapping members meet in \{2\} or \{3\}. A union containing 1 contains \{1, 2\}, one containing 4 contains \{2, 3, 4\}, so the open sets are \varnothing, \{2\}, \{3\}, \{2, 3\}, \{1, 2\}, \{1, 2, 3\}, \{2, 3, 4\} and X, 8 in all. (c) Not a basis: the members meet in \{2, 3\}, and no member lies inside it.
- The finite intersections add \{2\}, \{3\} and \varnothing. The open sets are \varnothing, \{2\}, \{3\}, \{2, 3\}, \{1, 2\}, \{1, 2, 3\}, \{3, 4, 5\}, \{2, 3, 4, 5\} and X, 9 in all. No: every basis element containing 4 contains 5.
- (a) p: K_1 = \{p, q\}; q: K_1 \cap K_2 = \{q\}; r: K_2 \cap K_4 = \{r, s\}; s: K_2 \cap K_3 \cap K_4 = \{s\}; t: K_3 \cap K_4 = \{s, t\}. (b) Among p, q an open set holds \varnothing, \{q\} or \{p, q\}; among r, s, t it holds \varnothing, \{s\}, \{r, s\}, \{s, t\} or \{r, s, t\}: 3 \cdot 5 = 15 open sets. (c) No. Without K_1 nothing covers p; without K_2, K_3 or K_4 the smallest open set about q, t or r grows to \{p, q\}, \{r, s, t\} or \{q, r, s\}.
- (a) Open: standard-open, and \mathbb{R}_{\ell} is finer. (b) Not open: every [3, 3 + \varepsilon) leaves the set. (c) Open: (-\infty, -5) is standard-open and [5, \infty) = \bigcup_{n \ge 1} [5, 5 + n). (d) Not open: every [0, \varepsilon) contains \displaystyle \min\left\{\frac{\varepsilon}{2}, \frac{1}{2}\right\}, which is not in the set. (e) Open: a basis element.
- (a) \displaystyle r = \frac{1}{\pi} \approx 0.318, the distance to the nearer axis; a larger ball crosses the y-axis. (b) \lVert P - q \rVert^2 \approx 0.000529, so \displaystyle \lVert P - q \rVert \approx 0.023 < \frac{1}{8}, and points of \displaystyle B\left(q, \frac{1}{8}\right) have both coordinates above \displaystyle \frac{3}{10} - \frac{1}{8} > 0, so lie in U.
- (a) Open: for n \ne 0, every element n + 2|n|k = |n|(\pm 1 + 2k) of n + 2|n|\mathbb{Z} is nonzero, as \pm 1 + 2k is odd. (b) Not open: every 1 + b\mathbb{Z} contains 1 + b and 1 + 2b, both different from 1, and one of them is odd. (c) Open: the union of the basis elements 0 + 3\mathbb{Z} and 0 + 5\mathbb{Z}.
- (a) No. \displaystyle \left(\frac{1}{2}, 0\right) lies in B\big((0, 0), 1\big) \cap B\big((1, 0), 1\big), whose points have 0 < x < 1. A disk of radius 1 about c contains c \pm (0.9, 0), 1.8 apart in x, so it does not fit, and (B2) fails. (b) Yes. Each is open, and if B(x, r) \subseteq V then \displaystyle B\left(x, \min\left\{r, \frac{1}{2}\right\}\right) is a member containing x inside V; apply Theorem 2.
- (a) x \in (x - 1, x], and (a, b] \cap (c, d] is \varnothing or (\max\{a, c\}, \min\{b, d\}]. (b) [0, 1) is open in \mathbb{R}_{\ell} but not in the upper limit topology: every (a, b] containing 0 has a < 0, so contains \displaystyle \frac{a}{2} \notin [0, 1). In the same way (0, 1] is open in the upper limit topology but not in \mathbb{R}_{\ell} (Example 2(a)). (c) \{x\} = [x, x + 1) \cap (x - 1, x] is open, so the topology is discrete.
- \mathcal{C} \subseteq \mathcal{T}, and every open set is a union of members of \mathcal{B} \subseteq \mathcal{C}. \square
- Each M_x is open, and if U is open and x \in U then x \in M_x \subseteq U, so \{M_x\} is a basis by Theorem 2. Let \mathcal{B} be any basis for \mathcal{T}. Theorem 2 gives B \in \mathcal{B} with x \in B \subseteq M_x. But B is open and contains x, so M_x \subseteq B, and M_x = B \in \mathcal{B}. \square
- \mathcal{S}' covers X because \mathcal{S} does. \mathcal{T}_{\mathcal{S}} is a topology containing \mathcal{S}', so \mathcal{T}_{\mathcal{S}'} \subseteq \mathcal{T}_{\mathcal{S}} by Theorem 4. \mathcal{T}_{\mathcal{S}'} is a topology containing \mathcal{S}, so \mathcal{T}_{\mathcal{S}} \subseteq \mathcal{T}_{\mathcal{S}'}. \square
- The rays cover \mathbb{R}, since x \in [x, \infty). Each (-\infty, a) is standard-open, so open in \mathbb{R}_{\ell} (Theorem 5(b)), and so is [b, \infty) = \bigcup_{n \ge 1} [b, b + n). By Theorem 4 the topology generated is coarser than \mathbb{R}_{\ell}. It contains every [b, a) = [b, \infty) \cap (-\infty, a), hence every union of them, which is every open set of \mathbb{R}_{\ell}. The second family covers \mathbb{R} too, and \{x\} = (-\infty, x] \cap [x, \infty) is open in the topology it generates; every subset, a union of singletons, is then open, so that topology is discrete. \square
- Balls are open (Metric spaces, a first look). Let V be open and x \in V, with B(x, r) \subseteq V. Choose an integer n \ge 1 with \displaystyle \frac{2}{n} < r (The Archimedean property and density of the rationals) and \displaystyle z \in D \cap B\left(x, \frac{1}{n}\right). Then \displaystyle x \in B\left(z, \frac{1}{n}\right), and every y in this ball has \displaystyle d(x, y) \le d(x, z) + d(z, y) < \frac{2}{n} < r, so the ball lies in V. By Theorem 2 these balls form a basis. Listing D as z_0, z_1, \dots, the pairs (z_i, n) can be listed in order of i + n, so the basis is countable. \square