Fraenkel \(\cal N17\): Brunner/Howard Model II | Back to this models page

Description: \(A=\{a_{\alpha,i}:\alpha\in\omega_1\,\wedge i\in\omega\}\)

When the book was first being written, only the following form classes were known to be true in this model:

Form Howard-Rubin Number Statement
17

Ramsey's Theorem I: If \(A\) is an infinite set and the family of all 2 element subsets of \(A\) is partitioned into 2 sets \(X\) and \(Y\), then there is an infinite subset \(B\subseteq A\) such that all 2 element subsets of \(B\) belong to \(X\) or all 2 element subsets of \(B\) belong to \(Y\). (Also, see Form 325.), Jech [1973b], p 164 prob 11.20.

31

\(UT(\aleph_{0},\aleph_{0},\aleph_{0})\): The countable union theorem:  The union of a denumerable set of denumerable sets is denumerable.

37

Lebesgue measure is countably additive.

91

\(PW\):  The power set of a well ordered set can be well ordered.

130

\({\cal P}(\Bbb R)\) is well orderable.

144

Every set is almost well orderable.

191

\(SVC\): There is a set \(S\) such that for every set \(a\), there is an ordinal \(\alpha\) and a function from \(S\times\alpha\) onto \(a\).

273

There is a subset of \({\Bbb R}\) which is not Borel.

305

There are \(2^{\aleph_0}\) Vitali equivalence classes. (Vitali equivalence classes are equivalence classes of the real numbers under the relation \(x\equiv y\leftrightarrow(\exists q\in{\Bbb Q})(x-y=q)\).). \ac{Kanovei} \cite{1991}.

309

The Banach-Tarski Paradox: There are three finite partitions \(\{P_1,\ldots\), \(P_n\}\), \(\{Q_1,\ldots,Q_r\}\) and \(\{S_1,\ldots,S_n, T_1,\ldots,T_r\}\) of \(B^3 = \{x\in {\Bbb R}^3 : |x| \le 1\}\) such that \(P_i\) is congruent to \(S_i\) for \(1\le i\le n\) and \(Q_i\) is congruent to \(T_i\) for \(1\le i\le r\).

361

In \(\Bbb R\), the union of a denumerable number of analytic sets is analytic. G. Moore [1982], pp 181 and 325.

363

There are exactly \(2^{\aleph_0}\) Borel sets in \(\Bbb R\). G. Moore [1982], p 325.

368

The set of all denumerable subsets of \(\Bbb R\) has power \(2^{\aleph_0}\).

369

If \(\Bbb R\) is partitioned into two sets, at least one of them has cardinality \(2^{\aleph_0}\).

When the book was first being written, only the following form classes were known to be false in this model:

Form Howard-Rubin Number Statement
15

\(KW(\infty,\infty)\) (KW), The Kinna-Wagner Selection Principle: For every  set \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\) then \(\emptyset\neq f(A)\subsetneq A\). (See Form 81(\(n\)).  

27

\((\forall \alpha)( UT(\aleph_{0},\aleph_{\alpha}, \aleph_{\alpha}))\): The  union of denumerably many sets each of power \(\aleph_{\alpha }\) has power \(\aleph_{\alpha}\). Moore, G. [1982], p 36.

28-p

(Where \(p\) is a prime) AL20(\(\mathbb Z_p\)): Every vector space \(V\) over \(\mathbb Z_p\) has the property that every linearly independent subset can be extended to a basis.  (\(\mathbb Z_p\) is the \(p\) element field.) Rubin, H./Rubin, J. [1985], p. 119, Statement AL20

62

\(C(\infty,< \aleph_{0})\):  Every set of non-empty finite  sets  has  a choice function.

106

Baire Category Theorem for Compact Hausdorff Spaces: Every compact Hausdorff space is Baire.

131

\(MC_\omega(\aleph_0,\infty)\): For every denumerable family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\).

163

Every non-well-orderable set has an infinite, Dedekind finite subset.

165

\(C(WO,WO)\):  Every well ordered family of non-empty, well orderable sets has a choice function.

231

\(UT(WO,WO,WO)\): The union of a well ordered collection of well orderable sets is well orderable.

323

\(KW(\infty,WO)\), The Kinna-Wagner Selection Principle for a family of well orderable sets: For every set \(M\) of well orderable sets there is a function \(f\) such that for all \(A\in M\), if \(|A| > 1\) then \(\emptyset\neq f(A)\subsetneq A\).  (See Form 15.)

344

If \((E_i)_{i\in I}\) is a family of non-empty sets, then there is a family \((U_i)_{i\in I}\) such that \(\forall i\in I\), \(U_i\) is an ultrafilter on \(E_i\).

Historical background: Let \(\Gamma\) be the group of all permutations on\(\omega_1\). \(\cal G = \{g: (\forall i\in\omega)(\exists\gamma\in\Gamma)(\forall\alpha\in\omega_1)g(a_{\alpha,i})=a_{\gamma(\alpha),i}\) and for all but finitely many\(i\in\omega,(\forall \alpha\in\omega_1) g(a_{\alpha,i}) = a_{\alpha,i}\}\).\(S= \{ F\subseteq A : \{i:(\exists\alpha\in\omega_1) a_{\alpha,i}\in F\}\)is finite \(\}\). This is the model of proposition 3.1 inBrunner/Howard [1992] with \(\kappa = \aleph_0\). In this model,the union of a denumerable number of denumerable sets is denumerable (31is true), but \(C(\aleph_0,\aleph_1)\) (28) is false. If we assume that\(2^{\aleph_0} = \aleph_1\) in the ground model, then\(C(\aleph_0,2^{\aleph_0})\) is also false. \(UT(\aleph_0,\aleph_1,\aleph_1)\) (27) (which implies \(C(\aleph_0,\aleph_1)\)) is also false.Form 23 (\((\forall\alpha) UT(\aleph_\alpha,\aleph_\alpha,\aleph_\alpha)\))is false because 23 implies 27. Since 231 (\(UT(WO, WO, WO)\) implies 23 inevery FM model, it follows that 231 is false. In Note 155 we show that``every set is almost well orderable'' (form 144) is true.

Back