ProofComplete

Proof of Basis Topology Generation

We provide a detailed, self-contained proof that a collection of sets satisfying the basis conditions generates a unique topology. This proof constructs the topology explicitly and verifies all the axioms, making it a model for similar verification arguments throughout topology.


Setup and Statement

Theorem1.6Topology Generated by a Basis

Let XX be a set and B\mathcal{B} a collection of subsets of XX satisfying:

  • (B1) For each x∈Xx \in X, there exists B∈BB \in \mathcal{B} with x∈Bx \in B.
  • (B2) For each B1,B2∈BB_1, B_2 \in \mathcal{B} and each x∈B1∩B2x \in B_1 \cap B_2, there exists B3∈BB_3 \in \mathcal{B} with x∈B3⊆B1∩B2x \in B_3 \subseteq B_1 \cap B_2.

Then the collection τB={U⊆X:∀x∈U,∃B∈B,  x∈B⊆U}\tau_{\mathcal{B}} = \left\{U \subseteq X : \forall x \in U, \exists B \in \mathcal{B}, \; x \in B \subseteq U\right\} is a topology on XX, and B\mathcal{B} is a basis for τB\tau_{\mathcal{B}}. Moreover, τB\tau_{\mathcal{B}} consists precisely of all unions of subcollections of B\mathcal{B}.


Complete Proof

Proof

We verify each topology axiom in detail.

Step 1: ∅∈τB\emptyset \in \tau_{\mathcal{B}}.

The condition "∀x∈U,∃B∈B,x∈B⊆U\forall x \in U, \exists B \in \mathcal{B}, x \in B \subseteq U" is vacuously true when U=∅U = \emptyset (there is no x∈∅x \in \emptyset). Hence ∅∈τB\emptyset \in \tau_{\mathcal{B}}.

Step 2: X∈τBX \in \tau_{\mathcal{B}}.

Let x∈Xx \in X. By (B1), there exists B∈BB \in \mathcal{B} with x∈Bx \in B. Since B⊆XB \subseteq X, we have x∈B⊆Xx \in B \subseteq X. As xx was arbitrary, X∈τBX \in \tau_{\mathcal{B}}.

Step 3: τB\tau_{\mathcal{B}} is closed under arbitrary unions.

Let {Uα}α∈A\{U_\alpha\}_{\alpha \in A} be an arbitrary family with each Uα∈τBU_\alpha \in \tau_{\mathcal{B}}. Set U=⋃α∈AUαU = \bigcup_{\alpha \in A} U_\alpha. Let x∈Ux \in U. Then x∈Uαx \in U_\alpha for some α∈A\alpha \in A. Since Uα∈τBU_\alpha \in \tau_{\mathcal{B}}, there exists B∈BB \in \mathcal{B} with x∈B⊆Uα⊆Ux \in B \subseteq U_\alpha \subseteq U. Thus U∈τBU \in \tau_{\mathcal{B}}.

Step 4: τB\tau_{\mathcal{B}} is closed under finite intersections.

It suffices to show closure under binary intersections; the general case follows by induction (the base case n=0n = 0 gives the empty intersection X∈τBX \in \tau_{\mathcal{B}}).

Let U1,U2∈τBU_1, U_2 \in \tau_{\mathcal{B}} and let x∈U1∩U2x \in U_1 \cap U_2. Since U1∈τBU_1 \in \tau_{\mathcal{B}}, there exists B1∈BB_1 \in \mathcal{B} with x∈B1⊆U1x \in B_1 \subseteq U_1. Since U2∈τBU_2 \in \tau_{\mathcal{B}}, there exists B2∈BB_2 \in \mathcal{B} with x∈B2⊆U2x \in B_2 \subseteq U_2. Now x∈B1∩B2x \in B_1 \cap B_2, and by (B2), there exists B3∈BB_3 \in \mathcal{B} with x∈B3⊆B1∩B2⊆U1∩U2x \in B_3 \subseteq B_1 \cap B_2 \subseteq U_1 \cap U_2. Thus U1∩U2∈τBU_1 \cap U_2 \in \tau_{\mathcal{B}}.

Step 5: B\mathcal{B} is a basis for τB\tau_{\mathcal{B}}.

First, every B∈BB \in \mathcal{B} belongs to τB\tau_{\mathcal{B}}: for x∈Bx \in B, we have x∈B⊆Bx \in B \subseteq B, so the defining condition is satisfied with BB itself. Thus B⊆τB\mathcal{B} \subseteq \tau_{\mathcal{B}}.

Next, for every U∈τBU \in \tau_{\mathcal{B}} and every x∈Ux \in U, by definition there exists B∈BB \in \mathcal{B} with x∈B⊆Ux \in B \subseteq U. This is precisely the condition that B\mathcal{B} is a basis for τB\tau_{\mathcal{B}}.

Step 6: τB\tau_{\mathcal{B}} equals the collection of all unions of elements of B\mathcal{B}.

Let U={⋃β∈BBβ:Bβ∈B}\mathcal{U} = \left\{\bigcup_{\beta \in B} B_\beta : B_\beta \in \mathcal{B}\right\} denote the set of all unions of subcollections of B\mathcal{B}.

(U⊆τB)(\mathcal{U} \subseteq \tau_{\mathcal{B}}): Each Bβ∈B⊆τBB_\beta \in \mathcal{B} \subseteq \tau_{\mathcal{B}}, and τB\tau_{\mathcal{B}} is closed under unions, so ⋃Bβ∈τB\bigcup B_\beta \in \tau_{\mathcal{B}}.

(τB⊆U)(\tau_{\mathcal{B}} \subseteq \mathcal{U}): Let U∈τBU \in \tau_{\mathcal{B}}. For each x∈Ux \in U, choose Bx∈BB_x \in \mathcal{B} with x∈Bx⊆Ux \in B_x \subseteq U. Then U=⋃x∈UBxU = \bigcup_{x \in U} B_x, which is a union of elements of B\mathcal{B}. So U∈UU \in \mathcal{U}.

Step 7: Uniqueness.

Suppose τ\tau is any topology on XX having B\mathcal{B} as a basis. Then U∈τU \in \tau if and only if for every x∈Ux \in U, there exists B∈BB \in \mathcal{B} with x∈B⊆Ux \in B \subseteq U, which is precisely the defining condition for τB\tau_{\mathcal{B}}. Thus τ=τB\tau = \tau_{\mathcal{B}}.

■

Illustrative Verification

ExampleVerifying the Metric Topology Basis

Let (X,d)(X, d) be a metric space. The collection of open balls B={Bd(x,r):x∈X,r>0}\mathcal{B} = \{B_d(x, r) : x \in X, r > 0\} satisfies the basis conditions:

(B1): For any x∈Xx \in X, we have x∈Bd(x,1)x \in B_d(x, 1).

(B2): Let y∈Bd(x1,r1)∩Bd(x2,r2)y \in B_d(x_1, r_1) \cap B_d(x_2, r_2). Set ϵ=min⁡(r1−d(y,x1),r2−d(y,x2))>0\epsilon = \min(r_1 - d(y, x_1), r_2 - d(y, x_2)) > 0. Then Bd(y,ϵ)⊆Bd(x1,r1)∩Bd(x2,r2)B_d(y, \epsilon) \subseteq B_d(x_1, r_1) \cap B_d(x_2, r_2), since for z∈Bd(y,ϵ)z \in B_d(y, \epsilon): d(z,xi)≤d(z,y)+d(y,xi)<ϵ+d(y,xi)≤ri.d(z, x_i) \leq d(z, y) + d(y, x_i) < \epsilon + d(y, x_i) \leq r_i.

Thus, B\mathcal{B} generates a topology on XX, the metric topology.

ExampleThe K-Topology on the Reals

Let K={1/n:n∈Z+}K = \{1/n : n \in \mathbb{Z}^+\}. The collection BK={(a,b):a<b}∪{(a,b)∖K:a<b}\mathcal{B}_K = \{(a, b) : a < b\} \cup \{(a, b) \setminus K : a < b\} is a basis for a topology on R\mathbb{R} called the KK-topology.

To verify (B2), one checks all cases of intersections. The most interesting case is when x∈(a1,b1)∩((a2,b2)∖K)x \in (a_1, b_1) \cap ((a_2, b_2) \setminus K). Then x∉Kx \notin K, and the intersection (a1,b1)∩((a2,b2)∖K)=((max⁡(a1,a2),min⁡(b1,b2))∖K)(a_1, b_1) \cap ((a_2, b_2) \setminus K) = ((\max(a_1, a_2), \min(b_1, b_2)) \setminus K), which is in BK\mathcal{B}_K.

The KK-topology is strictly finer than the standard topology. It provides a Hausdorff space that is not regular, demonstrating that separation axioms form a strict hierarchy.

RemarkConstructive Nature of the Proof

This proof is fully constructive: given a specific point and specific open sets, each step provides an explicit basis element. This constructive character makes the basis criterion especially useful in practice. When defining a new topology, one specifies a basis, verifies (B1) and (B2), and immediately obtains a well-defined topological space without needing to enumerate all open sets.