Homogeneous Boolean algebras may have non-simple automorphism groups (Q1076048): Difference between revisions

The article contains two major results concerning homogeneous BA's. Recall that a BA A is homogeneous if \(A\cong \{x:\) \(x\leq \alpha \}\) for every non-zero \(\alpha\in A\). It is shown that every infinite free BA (which is well-known to be homogeneous) has simple automorphism group. On the other hand, assuming CH a homogeneous BA with non-simple automorphism group is constructed. The first theorem has a surprisingly simple proof, using Anderson's criterion [\textit{R. D. Anderson}, Am. J. Math. 80, 955- 963 (1958; Zbl 0090.388)]. The proof of the second theorem starts with the observation that the finite products of transpositions form a normal subgroups N of Aut A. The construction then uses free groups with few fixed points to produce a homogeneous BA in which N is a proper subgroup of Aut A. Two related results are mentioned in the paper: Van Douwen has shown that in a model of \(ZFC+\neg CH\) constructed by Shelah, P(\(\omega)\)/fin has non-simple automorphism group; while under CH, P(\(\omega)\)/fin has simple automorphism group - since this is true for any atomless saturated BA by a result of S. Fuchino.