Measure Recognition Problem

Details Measure Recognition Problem Measure Recognition Problem

2006-08-14

arxiv.org/abs/math/0608336v1

Mathematics

Logic

Scientific paper

10.1098/rsta.2006.1896

This is an article in mathematics, specifically in set theory. On the example of the Measure Recognition Problem (MRP) the article highlights the phenomenon of the utility of a multidisciplinary mathematical approach to a single mathematical problem, in particular the value of a set-theoretic analysis. MRP asks if for a given Boolean algebra $\algB$ and a property $\Phi$ of measures one can recognize by purely combinatorial means if $\algB$ supports a strictly positive measure with property $\Phi$. The most famous instance of this problem is MRP(countable additivity), and in the first part of the article we survey the known results on this and some other problems. We show how these results naturally lead to asking about two other specific instances of the problem MRP, namely MRP(nonatomic) and MRP(separable). Then we show how our recent work D\v zamonja and Plebanek (2006) gives an easy solution to the former of these problems, and gives some partial information about the latter. The long term goal of this line of research is to obtain a structure theory of Boolean algebras that support a finitely additive strictly positive measure, along the lines of Maharam theorem which gives such a structure theorem for measure algebras.

Affiliated with

Also associated with

No associations

Rating

Measure Recognition Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Measure Recognition Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Measure Recognition Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243017