Independence of Boolean algebras and forcing. (Q1412835): Difference between revisions

The author introduces the following unusual definition of independence. For an infinite cardinal \(\kappa\), a complete Boolean algebra \(B\) is \(\kappa\)-dependent iff for each sequence \(\langle b_\beta:\beta<\kappa\rangle\) of elements of \(B\) there is a partition \(P\) of unity such that each \(p\in P\) extends \(b_\beta\) or \(-b_\beta\) for \(\kappa\)-many \(\beta<\kappa\); \(\kappa\)-independent means not (\(\kappa\) dependent). There are many results about this notion, and we mention just a few. An equivalent version as a certain distributive law is given, and some forcing equivalents are given. A complete BA \(B\) is \(\kappa\) dependent if \(\text{cf} (\kappa)>\pi(B)\). The collection \(\text{Indep}(B)=\{\kappa:\kappa\) is regular and \(B\) is \(\kappa\)-independent\(\}\) is considered. The independence notion is investigated for the collapsing algebra \(\text{Col}(\kappa,\lambda)\). The behaviour at singular cardinals is described.