New separation axioms in topological ordered spaces (Q1178975)

In this paper, the authors introduced the new separation axioms (i.e. semi \(T_ i\)-ordered for \(i=1,2)\) and studied some of their basic properties. Furthermore, the implications of these new separation axioms among themselves and with the semi-\(T_ i (i=1,2)\) and \(T_ i\)-ordered (\(i=1,2)\) are obtained. A topological ordered space \((X,{\mathcal T},\leq)\) is said to be \(T_ 1\)- ordered (resp. \(T_ 2\)-ordered) if for each pair of elements \(a\nleq b\) in \(X\), there exist open sets \(U\) and \(V\) containing \(a\) and \(b\) respectively, \(U\) is increasing and \(V\) is decreasing such that \(b\notin U\), \(a\notin V\) (resp. \(U\cap V=\emptyset)\). A subset \(W\) of a topological space \(X\) is said to be semi-open if there exists an open set \(U\) in \(X\) such that \(U\subset W\subset \text{cl} U\). A subset \(F\) of \(X\) is said to be semi-closed if \(X-F\) is semi-open. Maheshwari and Prasad defined semi-\(T_ 1\) and semi-\(T_ 2\) by replacing the word ``open'' in the definitions of \(T_ 1\) and \(T_ 2\) by ``semi-open'', respectively. In this paper, semi \(T_ i\)-ordered \((i=1,2)\) are defined by replacing the word ``open'' in the definitions of \(T_ i\)-ordered \((i=1,2)\) by ``semi-open'', respectively. Some basic properties of semi \(T_ i\)-ordered spaces \((i=1,2)\) are the following: Theorem 1. For a topological ordered space \((X,{\mathcal T}\leq)\), the following are equivalent. (1) \(X\) is semi \(T_ 1\)-ordered. (2) For each \(x\in X\), \([\leftarrow,x]\) and \([x,\to]\) are semi-closed. --- Theorem 2. If \(X\) is semi \(T_ 2\)-ordered, then the graph of the order of \(X\) is a semi-closed subset of \(X^ 2\). --- Theorem 3. The product of a family of semi \(T_ i\)-ordered spaces is also semi \(T_ i\)-ordered \((i=1,2)\). The following diagram indicates the implications between the separation axioms that the authors have come across in this paper and examples show that no other implications hold between them, \[ \begin{matrix} \text{\(T_ 2\)- ordered} & \Longrightarrow & \text{\(T_ 1\)-ordered} \\ \Downarrow && \Downarrow \\ \text{Semi \(T_ 2\)-ordered} & \Longrightarrow & \text{Semi \(T_ 1\)-ordered} \\ \Downarrow && \Downarrow \\ \text{Semi \(T_ 2\)} & \Longrightarrow & \text{Semi \(T_ 1\)} \end{matrix}. \]