There are a few ways of saying the above, such as the set is open, another being that can separate two different points with an open set.
If it interestects in infinitely many points then there is a point not equal to where it intersects so that
Suppose that so that now take ; a neighborhood of therefore so take a point in there and consider , since is then we know that is open and still a neighborhood of and so by induction we will construct an all of which are elements of so that it contains infinitely many points of
We will show that is closed by showing
Suppose that and , since was Hausdorff, we get disjoint neighborhoods. Since , and , then therefore . Note that we've just shown that for any point in which is not it cannot be in the closure.
Now we show that is actually in there. Since , then we know , so therefore as needed.
Suppose that is closed in , now let , if we consider the point then we know that , therefore , since was closed, then we know that is open, and therefore since is in there, then there exists a basis element where are open in which contains and is a subset of . To show that the space is hausdorff it remains to show that , so suppose for the sake of contradiction that there was an element which implies that since but which shows that such an element is impossible to exist, and therefore we must have
Now suppose that is hausdorff, let's prove that is closed in , so we will prove that is open, so let , we have where therefore since is hausdorff then we get open neighborhoods of respectively that are disjoint, so that this shows that as if it was not empty, then would no longer be disjoint, therefore we know that , so that is open and thus is closed, as needed.
For the base case of it follows directly from the definition of a hausdorff space, now let and suppose that the statement holds true on elements, now we'll show that it holds true on elements. Let be the elements, let , which produces a set of size on which we know the induction hypothesis holds true, and therefore we obtain disjoint open sets such that for all and lets call the family of these sets by the mask of
By iterating over then we can form smaller open sets around each by taking , they are open as they are finite intersections of open sets, and we can show that they pairwise disjoint, for consider any and consider and , since then we can consider some such that and then consider the -th mask, of as noted in the previous paragraph the induction hypothesis shows these are pairwise disjoint, additionally we know that and that (this is because they are part of the intersection), now since and are disjoint then are the intersections in question, thus we've shown that the sets are pairwise disjoint and cover , as needed, therefore by the principle of induction this holds true for all
Let and assume that .
Case 1: contains no smallest or largest element, then there exists some such that and now if there is no such that then consider , we can see that and that , also consider any this implies that or and that or in any case we know that . If there was some between then we let .
Case 2: contains a smallest element but no largest element, if it turns out that is not the smallest element, then suppose that is, since there is no largest element then we know that there is an element such that , if there is no between then the sets , if there is a we take . If it turned out that was the smallest element, we adjust the above with syntactically replacing with .
Case 3: contains a largest and smallest element if neither of are the largest or smallest element then we obtain which are and follow the case 1 construction, if exactly one of is the largest or smallest element, then we proceed with the case 2 construction, finally when are the smallest and largest element respectively, then again if there is some between then we can use otherwise we use .
Thus we've proven that in any case had open sets containing them that were disjoint.