Initial chain algebras on pseudotrees (Q1368662): Difference between revisions

The authors investigate a new class of Boolean algebras, called initial chain algebras on pseudotrees, and they discuss the relationship between this new class and other classes of Boolean algebras. Given a partially ordered set \((T,<)\) and an element \(t\in T\), define \(T\downarrow t= \{s\in T\mid s\leq t\}\) and \(T\uparrow t= \{s\in T\mid s\geq t\}\). A partially ordered set \((T,<)\) is a pseudotree iff the set \(T\downarrow t\) is linearly ordered for every \(t\in T\). A tree is a special case of a pseudotree in which the sets \(T\downarrow t\) are well-ordered for every \(t\in T\). For a pseudotree \(T\), define the initial chain algebra on \(T\) to be the algebra of subsets of \(T\) generated by \(\{T\downarrow t\mid t\in T\}\). Every interval algebra, and hence, every countable Boolan algebra is an initial chain algebra. The authors prove the following results about initial chain algebras. Every initial chain algebra on a tree is a superatomic Boolean algebra. Every initial chain algebra on a pseudotree is a minimally generated Boolean algebra. A free product of two infinite Boolean algebras is an initial chain algebra iff both factors are countable.