Publication | Open Access
A Structure Theorem for Topological Lattices
11
Citations
6
References
1961
Year
Lattice (Order)Graph TheoryCompact Hausdorff SpaceComputational TopologyTopological LatticesSet-theoretic TopologyOrdered SubsetsTopological PropertyTopological CombinatoricsDiscrete MathematicsLattice TheoryPartial Order
In the study of connected partially ordered spaces a problem of fundamental interest is to determine sufficient conditions to ensure the existence of chains (i.e., simply ordered subsets) which are connected. Recently [5] R. J. Koch proved that, if X is a compact Hausdorff space with continuous partial order (i.e., the partial order has a closed graph), if L ( x ) = { y : y ≦ x } is connected for each x ∈ X , and if X has a zero (i.e., an element 0 such that 0 ≦ x for all x ∈ X ), then each element of X lies in a connected chain containing zero. It is easy to find simple examples which show that this result is false if X is assumed only to be locally compact. However, if it is assumed that the partial order is that of a topological lattice then the existence of such chains can be shown by elementary methods. This solves a problem which was proposed in [3].
| Year | Citations | |
|---|---|---|
Page 1
Page 1