On computability and disintegration

DOI10.1017/S0960129516000098zbMATH Open1423.03251arXiv1509.02992MaRDI QIDQ4593233FDOQ4593233

Authors: Daniel M. Roy, Nathanael Ackerman, Cameron E. Freer 

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Abstract: We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim. When a measure does not have a unique continuous disintegration, we may still obtain a disintegration when some basis of continuity sets has the Vitali covering property with respect to the measure; the disintegration, however, may depend on the choice of sets. We show that, when the basis is computable, the resulting disintegration is strongly Weihrauch reducible to Lim, and further exhibit a single distribution realizing this upper bound.

Full work available at URL: https://arxiv.org/abs/1509.02992

Recommendations

• scientific article; zbMATH DE number 1104171
• Conditional measures and conditional expectation; Rohlin's disintegration theorem
• scientific article; zbMATH DE number 816114
• Publication:3202346

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Computation over the reals, computable analysis (03D78) Integration and disintegration of measures (28A50) Constructive and recursive analysis (03F60)

Cites Work

• Title not available (Why is that?)
• Conditional distributions as derivatives
• Title not available (Why is that?)
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Weihrauch degrees, omniscience principles and weak computability
• Synthetic topology: of data types and classical spaces
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective Borel measurability and reducibility of functions
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Uniform test of algorithmic randomness over a general space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Admissible representations for probability measures
• Probabilistic computability and choice
• On the topological aspects of the theory of represented spaces
• Effectivity in Spaces with Admissible Multirepresentations
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Discrete-type approximations for non-Markovian optimal stopping problems. II
• Title not available (Why is that?)
• Disintegration of projective measures
• Lipschitz continuity of probability kernels in the optimal transport framework
• Computable Measure Theory and Algorithmic Randomness
• Bayesian Probabilistic Numerical Methods
• On uniform continuity of posterior distributions
• Warsaw discs and semicomputability

This page was built for publication: On computability and disintegration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593233)