Generalized path-connectedness in proximity spaces

Importance: Medium ✭✭
Author(s): Porton, Victor
Subject: Topology
Recomm. for undergrads: no
Posted by: porton
on: February 1st, 2014

Let $\delta$ be a proximity.

A set $A$ is connected regarding $\delta$ iff $\forall X,Y \in \mathscr{P} A \setminus \{ \emptyset \} : \left( X \cup Y = A \Rightarrow X \mathrel{\delta} Y \right)$.

\begin{conjecture} The following statements are equivalent for every endofuncoid $\mu$ and a set $U$: \begin{enumerate} \item $U$ is connected regarding $\mu$. \item For every $a, b \in U$ there exists a totally ordered set $P \subseteq U$ such that $\min P = a$, $\max P = b$, and for every partion $\{ X, Y \}$ of $P$ into two sets $X$, $Y$ such that $\forall x \in X, y \in Y : x < y$, we have $X \mathrel{[ \mu]^{\ast}} Y$. \end{enumerate} \end{conjecture}

% You may use many features of TeX, such as % arbitrary math (between $...$ and $$...$$) % \begin{theorem}...\end{theorem} environment, also works for question, problem, conjecture, ... % % Our special features: % Links to wikipedia: \Def {mathematics} or \Def[coloring]{Graph_coloring} % General web links: \href [The On-Line Encyclopedia of Integer Sequences]{}


% Example: %*[B] Claude Berge, Farbung von Graphen, deren samtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10 (1961), 114. % %[CRS] Maria Chudnovsky, Neil Robertson, Paul Seymour, Robin Thomas: \arxiv[The strong perfect graph theorem]{math.CO/0212070}, % Ann. of Math. (2) 164 (2006), no. 1, 51--229. \MRhref{MR2233847} % % (Put an empty line between individual entries)

*\href [Question at]{} by Victor Porton

* indicates original appearance(s) of problem.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.