In \(X=\{1,2,3,4\}\) with open sets \(\varnothing, \{1\}, \{2\}, \{1,2\}, \{3,4\}, \{1,3,4\}, \{2,3,4\}, \{1,2,3,4\}\), in how many ways can \(X\) be split into two disjoint nonempty open sets (order ignored)?
We look for pairs \(\{U,V\}\) of nonempty open sets with \(U\cap V=\varnothing\) and \(U\cup V=X\): 3 pairs in total, counted by checking every pair of open sets.