Hyperspace Selections Avoiding Points

Abstract

In this paper, we deal with a hyperspace selection problem in the setting of connected spaces. We present two solutions of this problem illustrating the difference between selections for the nonempty closed sets, and those for the at most two-point sets. In the first case, we obtain a characterisation of compact orderable spaces. In the latter case -- that of selections for at most two-point sets, the same selection property is equivalent to the existence of a ternary relation on the space, known as a cyclic order, and gives a characterisation of the so called weakly cyclically orderable spaces.

Theorems & Definitions (28)

• Theorem 1.1
• Theorem 1.2
• Theorem 2.1: eilenberg:41
• Theorem 2.2: eilenberg:41michael:51
• Theorem 2.3: michael:51
• Corollary 2.4
• proof
• Theorem 2.5: nogura-shakhmatov:97a
• Proposition 3.1
• proof