Search arXivSearch

arXiv · 2503.08910

Finitely additive measures on Boolean algebras

Abstract

In this article, we conduct a detailed study of \emph{finitely additive measures} (fams) in the context of Boolean algebras, focusing on three specific topics: freeness and approximation, existence and extension criteria, and integration theory. In the first topic, we present a classification of \emph{free} finitely additive measures, that is, those for which the measure of finite sets is zero, in terms of approximation to uniform probability measures. This inspires a weaker version of this notion, which we call the \emph{uniform approximation property}, characterized in terms of freeness and another well-determined type of fams we call \emph{uniformly supported}. In the second topic, we study new criteria for the existence and extension of finitely additive measures. In particular, we provide an extension of the so-called \emph{compatibility theorem} -- which characterizes when two finitely additive measures can be extended -- yielding a precise and compact characterization of when three finitely additive measures can be simultaneously extended, under the assumption that one of them is an ultrafilter. Finally, we study a Riemann-type integration theory on fields of sets with respect to finitely additive measures, allowing us to extend and generalize some classical concepts and results from real analysis, such as Riemann integration over rectangles in $\mathbb{R}^{n}$ and the Jordan measure. We also generalize the extension criteria for fams allowing desired values of integrals of a given set of functions. At the end, we explore the connection between integration in fields of sets and the Lebesgue integration in the Stone space of the corresponding field, where we establish a characterization of integrability in the sense of the Lebesgue-Vitali theorem, which follows as a consequence of our results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miguel A. Cardona, Diego A. Mejía, Andrés F. Uribe-Zapata. 2025-12-12. Finitely additive measures on Boolean algebras. https://arxiv.org/abs/2503.08910

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

KEEP EXPLORING

Related papers

On n-dependent groups and fields III. Multilinear forms and invariant connected components

We develop some model theory of multilinear forms, generalizing Granger's work in the bilinear case. In particular, after proving a quantifier elimination result, we show that for an NIP field $K$, the theory of infinite-dimensional non-degenerate alternating $n$-linear spaces over $K$ is strictly $n$-dependent, and is NSOP$_1$ if $K$ is. These results rely on a new Composition Lemma for functions of arbitrary arity and NIP relations (which in turn relies on certain higher-arity generalizations of the Sauer--Shelah lemma). We also study the invariant connected components $G^{\infty}$ in $n$-dependent groups, demonstrating their relative absoluteness.

math.LO

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

A vector logic for intensional formal semantics

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter as vectors in high-dimensional spaces shaped by usage. This paper establishes which part of intensional formal semantics admits a linear vector-space encoding. Kripke-style intensional models, with any finite collection of index sorts collected in a compound index space, embed injectively into vector spaces: primitive domains go to free carriers; intensions and other functions go to linear operators. Semantic functions lift to unique multilinear maps on the free carriers, and composition is preserved. The operator encoding of a function domain compresses its free carrier, and we characterize the functionals: a Boolean-valued functional of a power set acts linearly on operator encodings exactly when it is constant, an ultrafilter indicator, or the complement of one, so that on finite domains the nonconstant ones are Montague's individuals and their negations. Determiners over a restrictor of two or more elements, modal operators over two or more accessible indices, and attitude operators over two or more alternatives are outside the linear regime, and take, instead, the form of a linear accumulation followed by a decision. Modality is defined uniformly over measure frames, in which counting measure recovers Kripke semantics at every cardinality, and continuous measures make necessity truth almost everywhere; we give the correspondence conditions for the axioms D, T, B, 4, and 5 under measures, the Kronecker factorization of accessibility over compound indices, and the reading of measure-based modality as graded modality.

math.LO