Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0608336

Measure Recognition Problem

Mirna Džamonja
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 $Φ$ of measures one can recognize by purely combinatorial means if $\algB$ supports a strictly positive measure with property $Φ$. 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.

Explore related subjects

math.LOmath.GN

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirna Džamonja. 2006-08-14. Measure Recognition Problem. https://doi.org/10.1098/rsta.2006.1896

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO↗
arXiv2026

Scott topologies on meet-continuous domains

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous $L$-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

math.LO↗
arXiv2026

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO↗