Diamond principles in Cichoń's diagram (Q1778067)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Diamond principles in Cichoń's diagram |
scientific article |
Statements
Diamond principles in Cichoń's diagram (English)
0 references
26 May 2005
0 references
Let \(A\), \(B\), and \(E \subseteq A \times B\) be Borel sets in some Polish space such that for all \(a \in A\) there is \(b\in B\) with \((a,b) \in E\) and for all \(b \in B\) there is \(a \in A\) with \((a,b) \notin E\). Call \(F: 2^{< \omega_1} \to A\) Borel if its restrictions to \(2^\delta\), \(\delta < \omega_1\), are Borel. The parametrized diamond \(\diamondsuit (A,B,E)\), introduced by \textit{J. T. Moore, M. Hrusák} and \textit{M. Dzamonja} [Trans. Am. Math. Soc. 356, 2281--2306 (2004; Zbl 1053.03027)], asserts that for all Borel \(F: 2^{< \omega_1} \to A\) there is \(g: \omega_1 \to B\) such that for all \(f: \omega_1 \to 2\) the set \(\{ \alpha : F(f \upharpoonright \alpha) E g(\alpha) \}\) is stationary. \(\diamondsuit (A,B,E)\) is weaker than \(\diamondsuit\) and implies that the cardinal invariant \((A,B,E)\) is at most \(\aleph_1\). Using countable support iteration of proper forcing, Moore et al. built models in which \(\diamondsuit (A_1,B_1,E_1)\) holds while \((A_2,B_2,E_2) = \aleph_2\), for a number of pairs \((A_1,B_1,E_1), (A_2,B_2,E_2)\). For several such pairs, the author shows that the conjunction of \(\diamondsuit (A_1,B_1,E_1)\), \(\neg \diamondsuit (A_2,B_2,E_2)\) and CH is consistent as well. For example, \(\diamondsuit({\text{cof}}({\mathcal M})) + \neg \diamondsuit({\text{non}}({\mathcal N})) + \text{CH}\) is consistent. Such results are obtained by an \(\omega_1\)-stage finite support iteration of a forcing notion which canonically forces \(\diamondsuit (A_1,B_1,E_1)\) over a model for CH in which all parametrized diamonds fail. A general preservation result for \(\neg \diamondsuit (A_2,B_2,E_2)\) in such iterations is proved as well.
0 references
diamond principle
0 references
parametrized diamond
0 references
cardinal invariant
0 references
iterated forcing
0 references
finite support iteration
0 references
Borel sets
0 references