Distributing Retractions, Weak Distributive Laws and Applications to Monads of Hyperspaces, Continuous Valuations and Measures

2025-07-24

AI Summary

This paper addresses the explicit characterization and verification of composite monads $U$ formed from two monads $S$ and $T$ via weak distributive laws. We introduce the novel notion of *distribution contractions*, establishing a bijective correspondence with weak distributive laws—yielding a computationally tractable, structural tool for identifying and constructing composite monads. Applying this framework to compact Hausdorff spaces, we derive the normalization fork monad and, for the first time, uncover its intrinsic connections to premetrics, smash products, and hyper/sublinear algebraic structures. Leveraging monad theory, split idempotent morphisms, and 2-categorical techniques, we uniformly treat Smyth, Hoare, and Plotkin hyperspace monads alongside the monad of continuous valuations, successfully constructing three semantically meaningful composite monads whose algebraic structures are explicitly characterized. This work strengthens the mathematical foundations of program semantics and nondeterministic analysis.

Technology Category

• Knowledge Representation and Reasoning: Nonmonotonic Reasoning
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Multiagent Systems: Other Foundations of Multi Agent Systems

Application Category

• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Systems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterization
• Web Mining and Content Analysis: Models for Web evolution

Abstract

Given two monads $S$, $T$ on a category where idempotents split, and a weak distributive law between them, one can build a combined monad $U$. Making explicit what this monad $U$ is requires some effort. When we already have an idea what $U$ should be, we show how to recognize that $U$ is indeed the combined monad obtained from $S$ and $T$: it suffices to exhibit what we call a distributing retraction of $ST$ onto $U$. We show that distributing retractions and weak distributive laws are in one-to-one correspondence, in a 2-categorical setting. We give three applications, where $S$ is the Smyth, Hoare or Plotkin hyperspace monad, $T$ is a monad of continuous valuations, and $U$ is a monad of previsions or of forks, depending on the case. As a byproduct, this allows us to describe the algebras of monads of superlinear, resp. sublinear previsions. In the category of compact Hausdorff spaces, the Plotkin hyperspace monad is sometimes known as the Vietoris monad, the monad of probability valuations coincides with the Radon monad, and we infer that the associated combined monad is the monad of normalized forks.

Problem

• Build combined monad U from monads S and T
• Establish correspondence between retractions and weak distributive laws
• Apply theory to hyperspace, valuation, and prevision monads

Innovation

• Combining monads via weak distributive laws
• Using distributing retractions for monad verification
• Applying to hyperspace, valuation, and prevision monads