A diagram about funcoids and reloids

Importance: Medium ✭✭
Author(s): Porton, Victor
Subject: Topology
Keywords: Galois connections
Recomm. for undergrads: no
Posted by: porton
on: November 26th, 2016

Define for posets with order $\sqsubseteq$:

  1. $\Phi_{\ast} f = \lambda b \in \mathfrak{B}: \bigcup \{ x \in \mathfrak{A} \mid f x \sqsubseteq b \}$;
  2. $\Phi^{\ast} f = \lambda b \in \mathfrak{A}: \bigcap \{ x \in \mathfrak{B} \mid f x \sqsupseteq b \}$.

Note that the above is a generalization of monotone Galois connections (with $\max$ and $\min$ replaced with suprema and infima).

Then we have the following diagram:

\Image{diagram2.png}

What is at the node "other" in the diagram is unknown.

\begin{conjecture} "Other" is $\lambda f\in\mathsf{FCD}: \top$. \end{conjecture}

\begin{question} What repeated applying of $\Phi_{\ast}$ and $\Phi^{\ast}$ to "other" leads to? Particularly, does repeated applying $\Phi_{\ast}$ and/or $\Phi^{\ast}$ to the node "other" lead to finite or infinite sets? \end{question}

See \href [Algebraic General Topology]{http://www.mathematics21.org/algebraic-general-topology.html} for definitions of used concepts.

The known part of the diagram is considered in \href[this file]{http://www.mathematics21.org/binaries/addons.pdf}.

% 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]{http://www.research.att.com/~njas/sequences/}

Bibliography

\href[Blog post]{https://portonmath.wordpress.com/2016/11/26/new-diagram/}

% 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)


* indicates original appearance(s) of problem.

The value of node "other"

It seems that the node "other" is not $\lambda f\in\mathsf{FCD}: \top$.

I conjecture $\langle \Phi_{\ast} (\mathsf{RLD})_{\operatorname{out}} \rangle f = (\mathsf{FCD}) f$ where $f$ is the reloid defined by the cofinite filter on $A \times B$ and thus $\langle (\mathsf{FCD}) f \rangle \{ x \} = \bot$ for all singletons $\{ x \}$ and $\langle (\mathsf{FCD}) f \rangle p = \top$ for every nontrivial atomic filter $p$.

This is my very recent thoughts and yet needs to be checked.

-- Victor Porton - http://www.mathematics21.org

The diagram was with an error

My diagram was with an error. I have uploaded a corrected version of the diagram.

--
Victor Porton - http://www.mathematics21.org

Comment viewing options

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