ΘρϵηΠατπ

T1 Space
A space X is called T1 iff for every xyX there exists U𝒯X such that xU and yU

There are a few ways of saying the above, such as the set X{x} is open, another being that X can separate two different points with an open set.

Limit Point Iff Every Neighborhood Contains Infinitely Many Points
Suppose AX where X is a T1 space then xA if and only if every neighborhood U of x contains infinitely many points of A

If it interestects in infinitely many points then there is a point not equal to x where it intersects so that xA

Suppose that xA so that xA{x} now take U; a neighborhood of x therefore U(A{x}) so take a point a1 in there and consider U1=U{a1}, since X is T1 then we know that U1 is open and still a neighborhood of x and so by induction we will construct an a2,a3, all of which are elements of UA so that it contains infinitely many points of A

Convergence
Suppose that (𝒯,X) is a topological space, then a sequence of points (xn) in X is said to converge to the point cX provided that for each neighborhood of c, there exists some N1 such that for all nN, we have xnU
Convergence Iff All but Finitely Many
xnx iff every neighbhorhood U of x contains all but finitely many elements of the sequence
TODO
Hausdorff Space
A topological space X is called a Hausdorff space if for each pair of points x1,x2 of distinct points of X, there exist neighborhoods U1,U2 of x1,x2 respectively that are disjoint
T2 Space
A T2 space is a hausdorff space
A Subspace of a T2 Space Remains T2
Suppose that X is T2 and that AX then A is also T2
Suppose that abA then a,bX and therefore there exists Ua,Ub disjoint neighborhoods containing a,b respectively, then AUa,AUb are disjoint neighborhoods of a,b respectively in A as needed.
Unique Limits in a Hausdorff Space
In a hausdorff space a sequenc has at most one limit.
Suppose that xna and xnb for abX then we obtain neighborhoods Ua,Ub such that aUa and bUB and that UaUb=, but now Ua contains all but finitely many elements in the sequence, therefore there are only finitely many elements of the sequence in XUaUb which is a contradiction because Ub also contains all bute finitely many elements of the sequence.
Every one point set is Closed in a Hausdorff Space
Suppose that pX where X is a Hausdorff space, then {p} is closed

We will show that {p} is closed by showing {p}={p}

Suppose that yX and yp, since X was Hausdorff, we get Up,Uy disjoint neighborhoods. Since UyUp= , and Up{p}, then Uy{p}= therefore y{p}. Note that we've just shown that for any point in X which is not p it cannot be in the closure.

Now we show that p is actually in there. Since {p}{p}, then we know p{p}, so therefore {p}={p} as needed.

Every Finite Set is Closed in a Hausdorff Space
A Topological Space Is Hausdorff Iff the Diagonal Is Closed
Suppose that X is a topological space, then X is hausdorff iff Δ={(x,x):xX} is closed in X×X

Suppose that Δ is closed in X×X, now let xyX, if we consider the point p=(x,y)X×X then we know that pΔ, therefore pX×XΔ, since Δ was closed, then we know that X×XΔ is open, and therefore since p is in there, then there exists a basis element U×V where U,V are open in X which contains p and is a subset of X×XΔ. To show that the space is hausdorff it remains to show that UV=, so suppose for the sake of contradiction that there was an element dUV which implies that since (d,d)U×V but U×VX×XΔ which shows that such an element d is impossible to exist, and therefore we must have UV=

Now suppose that X is hausdorff, let's prove that Δ is closed in X×X, so we will prove that X×XΔ is open, so let pX×XΔ, we have p=(x,y) where xyX therefore since X is hausdorff then we get open neighborhoods U,V of x,y respectively that are disjoint, so that UV= this shows that (U×V)Δ= as if it was not empty, then U,V would no longer be disjoint, therefore we know that pU×VX×XΔ, so that X×XΔ is open and thus Δ is closed, as needed.

Pairwise Disjoint Sets for a Collection of Points in a Hausdorff Space
Suppose that X is a hausdorff space, and that x1,,xn are distinct elements of X then there exists open sets U1,,Un in X that are pairwise disjoint where xiUi

For the base case of n=2 it follows directly from the definition of a hausdorff space, now let k2 and suppose that the statement holds true on k elements, now we'll show that it holds true on k+1 elements. Let C=x1,,xk+1 be the k+1 elements, let Ci=C{xi}, which produces a set of size k on which we know the induction hypothesis holds true, and therefore we obtain U1,i,,Uk,i disjoint open sets such that xjUj,i for all ji and lets call the family of these sets by the mask of Ci

By iterating i over 1,k+1 then we can form smaller open sets around each xj by taking iUj,i, they are open as they are finite intersections of open sets, and we can show that they pairwise disjoint, for consider any ab[1,,n] and consider iUa,i and iUb,i, since k+13 then we can consider some m[1,,k+1] such that ma and mb then consider the m-th mask, U1,m,Uk,m of Cm as noted in the previous paragraph the induction hypothesis shows these are pairwise disjoint, additionally we know that iUa,iUa,m and that iUb,iUb,m (this is because they are part of the intersection), now since Ua,m and Ub,m are disjoint then are the intersections in question, thus we've shown that the sets {x[1,,k+1]:iUx,i} are pairwise disjoint and cover x1,,xk+1, as needed, therefore by the principle of induction this holds true for all n2

A Subspace of a T2 Space Is T2
As per title.
Separate in the parent space, then intersect the separation in the subspace.
Product of T2 Spaces Is T2
As per title.
Suppose a=(xa,ya) and b=(xb,yb) and assume that ab so without loss of generality assume that xaxb therefore we obtain disjoint neighborhoods of each Ua,Ub then Ua×Y and Ub×Y are disjoint neighborhoods of a,b respectively.
Every Ordered Set With the Order Topology Is Hausdorff
Suppose that Y< is the order topology, then Y is hausdorff, moreover given a,bY and their disjoint neihborhoods, U,V then we have that for any u,vU,V respectively that u<v

Let a,bY and assume that a<b.

Case 1: Y contains no smallest or largest element, then there exists some j,kY such that j<a and b<k now if there is no yY such that a<y<b then consider U=(j,b),V=(a,k), we can see that aU,bV and that UV=, also consider any u,vU,V this implies that u=a or u<a and that v=b or v>b in any case we know that u<v. If there was some y between a,b then we let U=(j,y),V=(y,k).

Case 2: Y contains a smallest element but no largest element, if it turns out that a is not the smallest element, then suppose that s<a is, since there is no largest element then we know that there is an element k such that b<k, if there is no y between a,b then the sets U=[s,b) V=(a,k), if there is a y we take U=[s,y],V=(y,b). If it turned out that a was the smallest element, we adjust the above with syntactically replacing s with a.

Case 3: Y contains a largest and smallest element if neither of a,b are the largest or smallest element then we obtain j,k which are and follow the case 1 construction, if exactly one of a,b is the largest or smallest element, then we proceed with the case 2 construction, finally when a,b are the smallest and largest element respectively, then again if there is some y between a,b then we can use U=[a,y),V=(y,b] otherwise we use U=[a,b),V=(a,b] .

Thus we've proven that in any case a,b had open sets containing them that were disjoint.