Localisation for constrained transports I: theory
arXiv:2312.12281
Abstract
We investigate an analogue of the irreducible convex paving in the context of generalised convexity. Consider two Radon probability measures ordered with respect to a cone of functions on stable under maxima. Under the assumption that any -transport between and is local, we establish the existence of the finest partitioning of , depending only on and the cone , into -convex sets, called irreducible components, such that any -transport between and must adhere to this partitioning. Furthermore, we demonstrate that a set, whose sections are contained in the corresponding irreducible components, is a polar set with respect to all -transports between and if and only if it is a polar set with respect to all transports. This provides an affirmative answer to a generalisation of a conjecture proposed by Obłój and Siorpaes regarding polar sets in the martingale transport setting. Among our contributions is also a generalisation of the Strassen's theorem to the setting of generalised convexity
70 pages; title changed, minor improvements in the text