Abstract

This article investigates the weak distributivity of Boolean σ-algebras satisfying the countable chain condition. It addresses primarily the question when such algebras carry a σ-additive measure. We use as a starting point the problem of John von Neumann stated in 1937 in the Scottish Book. He asked if the countable chain condition and weak distributivity are sufficient for the existence of such a measure.Subsequent research has shown that the problem has two aspects: one set theoretic and one combinatorial. Recent results provide a complete solution of both the set theoretic and the combinatorial problems. We shall survey the history of von Neumann's Problem and outline the solution of the set theoretic problem. The technique that we describe owes much to the early work of Dorothy Maharam to whom we dedicate this article.§1. Complete Boolean algebras and weak distributivity. ABoolean algebrais a setBwith Boolean operationsa˅b,a˄b and −a, partial orderinga≤bdefined bya˄b=aand the smallest and greatest element,0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S−a, ordered by inclusion, with0= ∅ and1=S.Complete Boolean algebras and weak distributivity.A Boolean algebrais a setBwith Boolean operationsa˅b,a˄b and -a, partial orderinga≤bdefined bya˄b=aand the smallest and greatest element.0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S-a, ordered by inclusion, with0= ϕ and1=S.