Continuum cardinals generalized to Boolean algebras (Q4328845)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1735305
Language Label Description Also known as
default for all languages
No label defined
    English
    Continuum cardinals generalized to Boolean algebras
    scientific article; zbMATH DE number 1735305

      Statements

      Continuum cardinals generalized to Boolean algebras (English)
      0 references
      0 references
      31 March 2003
      0 references
      Boolean algebra
      0 references
      cardinal invariant
      0 references
      \textit{J. D. Monk}, in his book [Cardinal invariants on Boolean algebras, Progr. Math. 142, Birkhäuser, Basel (1996; Zbl 0849.03038)] gives an encyclopedic generalization of topological cardinal invariants in the context of Boolean algebras. This paper continues the project of exploring cardinal invariants of Boolean algebras by generalizing cardinal invariants associated with the continuum, for example, the size of the smallest infinite maximal almost disjoint family of subsets of \(\omega\). The Boolean algebraic versions (where \(A\) is the Boolean algebra) of the invariants are: \({\mathfrak a}(A) = \min\{|X|: X\) is an infinite partition of unity of \(A\}\), \({\mathfrak p}(A) = \min\{|X|:\sum X=1\) and \(\sum Y\neq 1\) for all \(Y \in [X]^{\omega}\}\), \({\mathfrak s}(A) = \min\{|X|: X\) a splitting set for \(A\}\), \({\mathfrak t}(A) = \min\{|X|: X\) is a tower in \(A\}\), \({\mathfrak h}(A) = \min\{\kappa: A\) is not \((\kappa,\infty)\)-distributive\(\}\), \({\mathfrak r}(A) = \min\{|X|: X\) is weakly dense in \(A\}\), and \({\mathfrak i}(A) = \min\{|X|: X \subset A, X\) maximal independent\(\}\). The paper diagrams the relationships among these cardinals for four classes of Boolean algebras: atomless, complete, atomless interval, and superatomic. It also gives counterexamples to show that the diagrams capture (almost) all relationships provable from ZFC. A few open problems remain.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references