Existence of endo-rigid Boolean algebras

Abstract

In [Sh:89] we, answering a question of Monk, have explicated the notion of ``a Boolean algebra with no endomorphisms except the ones induced by ultrafilters on it'' (see section 2 here) and proved the existence of one with character density aleph0, assuming first diamondsuitaleph1 and then only CH. The idea was that if h is an endomorphism of B, not among the ``trivial'' ones, then there are pairwise disjoint Dn in B with h(dn) not subset dn. Then we can, for some S subset omega, add an element x such that d <= x for n in S, x cap dn=0 for n not in S while forbidding a solution for y cap h(dn):n in S cup y cap h(dn)=0:n not in S. Further analysis showed that the point is that we are omitting positive quantifier free types. Continuing this Monk succeeded to prove in ZFC, the existence of such Boolean algebras of cardinality 2aleph0. We prove (in ZFC) the existence of such B of density character lambda and cardinality lambdaaleph0 whenever lambda > aleph0. We can conclude answers to some questions from Monk's list. We use a combinatorial method from [Sh:45],[Sh:172], that is represented in Section 1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…