Two Problems of Porton on Reloids: Metamonovalued Reloids Are Monovalued, and S(S(f)) = S(f) Fails

A reloid from a set A to a set B is a filter on A × B. Reloids were introduced by V. Porton as a common generalisation of binary relations and uniformities. We settle two problems on reloids from Porton's book "General Topology as Ordered Semigroup Actions" which are also listed in the Open Problem Garden. First, every metamonovalued reloid is monovalued: if (g ⊓ h)∘f = (g∘f) ⊓ (h∘f) holds for the identity reloid g of B and the principal reloid h of the complement of the diagonal of B, then some member of the filter f is the graph of a partial function. Together with a theorem of Porton this shows that, for nonempty families, monovalued, metamonovalued and weakly metamonovalued reloids are the same. Second, for a reloid f from a set to itself let S(f) be the join of the powers f^n, n ≥ 0. We give such an f on a countable set with S(f)∘S(f) ≠ S(f) and S(S(f)) ≠ S(f). This answers Porton's question negatively and refutes two conjectures of the book. The identities do hold for principal reloids, in particular on finite sets, and for Porton's operator S*. A funcoid on the same set shows that the corresponding two conjectures for funcoids fail as well. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifiers: OPG-57403, OPG-751 (Open Problem Garden, "Every metamonovalued reloid is monovalued" and "S(S(f)) = S(f) for reloids").