Definition
Given . The weakest topology on that contains is the intersection of all the topologies that contains . This is a topology, and consists of , , and all unions of finite intersections of members from .
Example
such that .
1 min read
Given F⊂℘(X). The weakest topology on X that contains F is the intersection of all the topologies that contains F. This is a topology, and consists of ∅, X, and all unions of finite intersections of members from F.
Example
F⊂τ
\textvisiblespace∩τ∋Ui⟹Ui∈τ
⟹∩i∈FUi∈τ⟹∩Ui∈∩F∈ττxi→x
∃j such that xi=x,i≥j.