Related papers: Measurable Cones and Stable, Measurable Functions
This note defines cones in homotopy probability theory and demonstrates that a cone over a space is a reasonable replacement for the space. The homotopy Gaussian distribution in one variable is revisited as a cone on the ordinary Gaussian.
Let $f \colon X \rightarrow Y$ be a resolvable-measurable mapping of a metrizable space $X$ to a regular space $Y$. Then $f$ is piecewise continuous. Additionally, for a metrizable completely Baire space $X$, it is proved that $f$ is…
This paper studies the well-posedness and regularity of safe stabilizing optimization-based controllers for control-affine systems in the presence of model uncertainty. When the system dynamics contain unknown parameters, a finite set of…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
In this paper we aim to present two general results regarding, on one hand, the openness stability of set-valued maps and, on the other hand, the metric regularity behavior of the implicit multifunction related to a generalized variational…
We develop functoriality for Morse theory, namely, to a pair of Morse-Smale systems and a generic smooth map between the underlying manifolds we associate a chain map between the corresponding Morse complexes, which descends to the correct…
A growing body of research on probabilistic programs and causal models has highlighted the need to reason compositionally about model classes that extend directed graphical models. Both probabilistic programs and causal models define a…
Quantum statistical models (i.e., families of normalized density matrices) and quantum measurements (i.e., positive operator-valued measures) can be regarded as linear maps: the former, mapping the space of effects to the space of…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
Consider the Fulton-MacPherson configuration space of $n$ points on $\P^1$, which is isomorphic to a certain moduli space of stable maps to $\P^1$. We compute the cone of effective ${\mathfrak S}_n$-invariant divisors on this space. This…
The paper concerns the probabilistic evaluation of plans in the presence of unmeasured variables, each plan consisting of several concurrent or sequential actions. We establish a graphical criterion for recognizing when the effects of a…
We define a class of multiparameter persistence modules that arise from a one-parameter family of functions on a topological space and prove that these persistence modules are stable. We show that this construction can produce…
Call graphs depict the static, caller-callee relation between "functions" in a program. With most source/target languages supporting functions as the primitive unit of composition, call graphs naturally form the fundamental control flow…
In this note we give a definition of stable maps into the classifying stack $\BGL_r$ of the general linear group. To support our belief that the definition is the correct one, we show that there are natural boundary morphisms between the…
Multivariate spatial field data are increasingly common and whose modeling typically relies on building cross-covariance functions to describe cross-process relationships. An alternative viewpoint is to model the matrix of spectral…
The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…
A measurable map between measure spaces is shown to have bounded compression if and only if its image via the measure-algebra functor is Lipschitz-continuous w.r.t. the measure-algebra distances. This provides a natural interpretation of…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
A folklore result in category theory is that a (weakly) Cartesian closed category with finite co-products is distributive. Usually, the proof of this small result is carried on using the fact that the exponential functor is right adjoint to…