\(\alpha \)-cut-complete Boolean algebras (Q1966136)

Let \(A\) be a Boolean algebra and \(\alpha \) an infinite cardinal. An \(\alpha \)-cut in \(A\) is a pair \((F,H)\) of subsets of \(A\), each of size less than \(\alpha \), with \(F\leq H\) elementwise and with 0 as the meet of differences \(h-f\) for \(h\in H\), \(f\in F\). \(A\) is \(\alpha \)-cut-complete if for each \(\alpha \)-cut \((F,H)\) there is \(a\in A\) with \(F\leq a \leq H\) elementwise. The simply constructed \(\alpha \)-cut-completion \(A^{\alpha }\) is described and it is shown that \(\alpha \)-cut-completeness solves a natural \(\alpha \)-injectivity problem. The author determines when \(A^{\alpha }\) is the \(\alpha \)-completion or the completion and interprets most of that topologically in Stone spaces. Although these considerations seem to be new for Boolean algebras, they have been used for \(\alpha = \omega _1\) for lattice-ordered groups and vector lattices.