Idempotent semigroups generated by threads. I (Q789541): Difference between revisions

The authors investigate idempotent topological semigroups S with identity 1 in which there are threads A and B with 1\(\in A\cap B\) and \(S=AB\). An idempotent semigroup admits the partial ordering \(x\leq y\) if \(yxy=x\). We say that (\(\leq)\) is monotone if \(M(x)=\{t:\quad txt=x\}\) is connected for each \(x\in S.\) Theorem: Let S be an idempotent semigroup with identity 1. The following are equivalent: (1) S is the continuous monotone image of a two-cell, and (\(\leq)\) is monotone. (2) S is a cyclic chain in which each non-degenerate cyclic element is a two-cell, and (\(\leq)\) is monotone. (3) There exist threads A and B with 1\(\in A\cap B\), \(S=AB\), S is embeddable in the plane, and \(BdS=A\cup B\cup K\) 4) There exist threads A and B with 1\(\in A\cap B\) and \(S=AB=BA\). (5) There exist threads A and B with 1\(\in A\cap B\) and \(aba=ab\) or ba, for all \(a\in A\), \(b\in B\). (6) There exist threads A and B with 1\(\in A\cap B\), \(S=AB\), and (\(\leq)\) is monotone. (7) There exist threads A and B with 1\(\in A\cap B\), \(S=AB\) and \(xyx=xy\) or yx, for all x, \(y\in S.\) Finally, the authors give some interesting examples.