Every metamonovalued funcoid 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 funcoid $f:X\to Y$ is a pair of maps $\alpha_f:\mathcal F(X)\to\mathcal F(Y)$ and $\beta_f:\mathcal F(Y)\to\mathcal F(X)$ satisfying \[ \mathcal B\mathrel{\#}\alpha_f(\mathcal A) \quad\Longleftrightarrow\quad \mathcal A\mathrel{\#}\beta_f(\mathcal B) \qquad(\mathcal A\in\mathcal F(X),\ \mathcal B\in\mathcal F(Y)). \] Its reverse interchanges $\alpha_f,\beta_f$. Composition satisfies $\alpha_{g\circ f}=\alpha_g\circ\alpha_f$ and $\beta_{g\circ f}=\beta_f\circ\beta_g$. The identity has both maps equal to the identity. The order on $\mathsf{FCD}(X,Y)$ is pointwise order on $\alpha_f$; its meets and joins mean greatest lower bounds and least upper bounds within this complete lattice. A relation $R\subseteq X\times Y$ induces the principal funcoid $\widehat R$ with $\alpha_{\widehat R}(\mathcal A)$ the filter generated by $\{R[U]:U\in\mathcal A\}$ and the analogous inverse-image formula for $\beta$. Here $R[U]=\{y:\exists x\in U,(x,y)\in R\}$.

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 funcoid $f:X\to Y$ monovalued, for arbitrary sets $X,Y$? Here $\operatorname{Hom}(Y,Z)=\mathsf{FCD}(Y,Z)$, and the meets are taken in the corresponding complete funcoid lattices. [S2][S3]

Short English statement

Does preservation of arbitrary meets by composition on the right imply single-valuedness for funcoids? The pinned author manuscript states this implication within an equivalence theorem. [S4]

Sources

• S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 3435 (OPG-57401). CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
• S2 Open Problem Garden, Every metamonovalued funcoid is monovalued, OPG-57401. Original problem statement, full mathematical discussion, bibliography and comments. https://www.openproblemgarden.org/op/every_metamonovalued_funcoid_is_monovalued.
• S3 Victor Porton, General Topology as Ordered Semigroup Actions, author manuscript, version of 21 July 2026. Definitions of metamonovalued and monovalued morphisms. 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. Basic definitions; Monovalued and injective funcoids, equivalence theorem. https://github.com/vporton/agt-combined/blob/759e45cced7769cf3a84ce60ed6c30f4ce9ffa8e/chap-funcoids.tex.