|
|
|
|
partial ordering in a topological space
|
(Definition)
|
|
|
Let be a T0 space. For any , we define a binary relation on as follows:
 iff 
Proposition. The binary relation just defined is a partial order.
Proof. Clearly  . Suppose next that  and  . If  , then there is an open set  such that  and  . So  , the complement of  , which is a closed set. But then  since it is in the closure of
 . So
 , a contradition. Thus  . Finally, suppose  and  . Let  be a closed set containing  . Since  is in the closure of
 ,  . Since  is in the closure of
 ,  also. So  . 
This turns the topological space into a poset.
is called the specialization order of . We have the following
iff implies for any open set in 
Proof.
 if  and  , then  . Since  , we have  , a contradiction.
 if
 , then for some closed set  , we have  and  . But then  , so that  , a contradiction. 
Remarks.
|
"partial ordering in a topological space" is owned by CWoo.
|
|
(view preamble | get metadata)
Cross-references: proof, antisymmetry, closed, singletons, diagonal, Hausdorff space, lower set, preorder, contradiction, implies, iff, poset, topological space, closure, closed set, complement, open set, partial order, proposition, binary relation, T0 space
There is 1 reference to this entry.
This is version 5 of partial ordering in a topological space, born on 2007-01-16, modified 2007-01-18.
Object id is 8775, canonical name is PartialOrderingInATopologicalSpace.
Accessed 832 times total.
Classification:
| AMS MSC: | 54F99 (General topology :: Special properties :: Miscellaneous) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|