Every metamonovalued reloid is monovalued

Definitions and mathematical statement

Shared notation.

$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

For a set $X$, let $\mathcal F(X)$ be all filters on $\mathcal P(X)$, including the improper filter $\bot_X=\mathcal P(X)$. A filter is a nonempty family closed under finite intersections and supersets. Order filters by $\mathcal A\sqsubseteq\mathcal B$ when $\mathcal A\supseteq\mathcal B$ as families. Thus $\bigsqcup$ is intersection of filter families and $\bigsqcap$ is the filter generated by their union; the empty join is $\bot_X$ and the empty meet is $\top_X=\{X\}$. For $E\subseteq X$, $\uparrow E=\{U\subseteq X:E\subseteq U\}$ is its principal filter. Write $\mathcal A\mathrel{\#}\mathcal B$ when every $U\in\mathcal A$ and $V\in\mathcal B$ have $U\cap V\ne\varnothing$, equivalently $\mathcal A\sqcap\mathcal B\ne\bot_X$.

A reloid $f:X\to Y$ is a filter on $X\times Y$, ordered by reverse inclusion of filter families. For a relation $R\subseteq X\times Y$, its principal reloid is $\uparrow R$. The reloid $g\circ f:X\to Z$ is generated by $G\circ F$ for $F\in f,G\in g$, where $G\circ F=\{(x,z):\exists y,(x,y)\in F,(y,z)\in G\}$. The reverse $f^{-1}$ is generated by $F^{-1}=\{(y,x):(x,y)\in F\}$ for $F\in f$. The identity $1_X$ is $\uparrow\Delta_X$, where $\Delta_X=\{(x,x):x\in X\}$.

A morphism $f:X\to Y$ in the indicated category is metamonovalued if, for every set $Z$ and every family $\mathcal G\subseteq\operatorname{Hom}(Y,Z)$, including the empty family, \[ \left(\bigsqcap\mathcal G\right)\circ f =\bigsqcap_{g\in\mathcal G}(g\circ f). \] It is monovalued if $f\circ f^{-1}\sqsubseteq1_Y$.

Statement recorded in the supplied source.

Is every metamonovalued reloid $f:X\to Y$ monovalued? In the displayed definition $\operatorname{Hom}(Y,Z)=\mathsf{RLD}(Y,Z)$, with reverse-inclusion filter order and its complete-lattice meets. Equivalently, must $f$ contain a relation that is the graph of a partial function $X\to Y$? [S2][S3]

Short English statement

Does preservation of arbitrary meets by composition on the right force a reloid to have a single-valued relation among its filter members?

Sources

• S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 3436 (OPG-57403). CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
• S2 Open Problem Garden, Every metamonovalued reloid is monovalued, OPG-57403. Original problem statement, full mathematical discussion, bibliography and comments. https://www.openproblemgarden.org/op/every_metamonovalued_reloid_is_monovalued.
• S3 Victor Porton, General Topology as Ordered Semigroup Actions, author manuscript, version of 21 July 2026. Definition of metamonovalued morphism. https://github.com/vporton/agt-combined/blob/759e45cced7769cf3a84ce60ed6c30f4ce9ffa8e/chap-order-more.tex.
• S4 Victor Porton, General Topology as Ordered Semigroup Actions, author manuscript, version of 21 July 2026. Monovalued and injective reloids; metamonovalued converse conjecture. https://github.com/vporton/agt-combined/blob/759e45cced7769cf3a84ce60ed6c30f4ce9ffa8e/chap-reloids.tex.