PCF and infinite free subsets in an algebra (Q1407545): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: math/9807177 / rank | |||
Normal rank |
Revision as of 19:23, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | PCF and infinite free subsets in an algebra |
scientific article |
Statements
PCF and infinite free subsets in an algebra (English)
0 references
16 September 2003
0 references
This paper contains several results connected with pcf theory, a powerful theory devised by the present author to obtain deep results in cardinal arithmetic [\textit{S. Shelah}, Cardinal arithmetic. Oxford University Press, Oxford (1994; Zbl 0848.03025)]. In particular, applications to the free subset property and to Boolean algebras are given. Sample results are as follows. For a singular cardinal \(\lambda\), \({\text{pp}} (\lambda)\) is the supremum of true cofinalities of \(\prod {\mathfrak{a}} / J\) where \({\mathfrak{a}}\) is a set of regular cardinals with \(| {\mathfrak a} | = \text{cf} (\lambda)\) and \(\sup ({\mathfrak a}) = \lambda\), and \(J\) is an ideal on \({\mathfrak a}\) containing all bounded subsets of \({\mathfrak a}\). The author proves that \({\text{pp}} (\aleph_\omega) > \aleph_{\omega_1}\) implies that every algebra \(M\) of cardinality \(\aleph_\omega\) with countably many functions has a countable free subset (that is, there are \(a_n \in M\), \(n \in \omega\), such that no \(a_n\) belongs to the closure of \(\{ a_m : m \neq n, m \in \omega \}\) under the functions of \(M\)). The leitmotiv here is that large pcf implies the existence of large free subsets and, conversely, the existence of large free subsets has an impact on pcf. Given cardinals \(\lambda \geq \mu\), define \({\text{stick}}_{\lambda, \mu}\) to be the minimal size of a family \({\mathcal A}\) of countable subsets of \(\lambda\) such that for every \(B \subseteq \lambda\) of size \(\mu\) there is \(A \in {\mathcal A}\) with \(A \subseteq B\). (Thus the statement \({\text{stick}}_{\aleph_1, \aleph_1} = \aleph_1\) is the usual stick principle which is a weakening of CH.) The author shows that if \({\text{stick}}_{\lambda, \mu} = \lambda\) and \(\mu\) is regular uncountable then there is a Boolean algebra \({\mathbb{B}}\) of cardinality \(\lambda\) into which the free Boolean algebra on \(\lambda\) generators embeds but such that the free Boolean algebra on \(\mu\) generators is not a homomorphic image of \({\mathbb{B}}\). A related result is proved with the free Boolean algebra on \(\kappa\) generators replaced by the Boolean algebra of finite and cofinite subsets of \(\kappa\).
0 references
pcf theory
0 references
true cofinality
0 references
pp
0 references
free subset property
0 references
stick principle
0 references
Boolean algebra
0 references
free Boolean algebra
0 references