On \(\sigma\)-saturations of a Boolean algebra (Q760449)

The author introduces the following concept. A \(\sigma\)-saturation of a Boolean algebra A is a couple (B,i) such that: (1) B is a Boolean algebra such that every \(\sigma\)-complete maximal ideal of B is closed with respect to arbitrary joins, (2) i:A\(\to B\) is a complete monomorphism (i.e., the monomorphism i preserves all existing joins), and (3) every element of B is a join of elements from i(A). A \(\sigma\)-saturation (B,i) is said to be minimal provided for every \(\sigma\)-saturation (C,j) there is a complete monomorphism h:B\(\to C\) such that \(j=hi.\) Then a Boolean algebra need not have a minimal \(\sigma\)-saturation and two saturations need not be isomorphic. Every complete Boolean algebra of cardinality less than the first Ulam-measurable cardinal has the above property (1). Every field of sets having property (1) is \(\sigma\)-perfect in the sense of Sikorski, but the converse does not hold. Several open problems are stated.