An \(\aleph_1\)-dense ideal on \(\aleph_2\) (Q1282279)

In this significant paper, the author proves the following theorem. Suppose there is a huge cardinal. Then there is a partial ordering \(\mathbb P\) such that in \(V^{\mathbb P}\) there is an \(\aleph_1\)-dense countably complete, weakly normal, uniform ideal on \(\aleph_2\). Most of the work of the paper is in section 2, where the author proves a ``transfer theorem'' which says (roughly) that if there is a certain type of layered ideal \(I\) on \(\omega_2\), then there is a \(\sigma\)-complete uniform ideal \(K\supset I\) on \(\omega_2\) such that \(P(\omega_2)/K \cong P(\omega_1)/ \{\text{countable sets}\}\). The main theorem enables the author to settle a number of longstanding open problems. (1) It solves ``Ulam's Problem'' for \(\aleph_2\), by showing that it is consistent that there is a collection of \(\aleph_1\) countably complete uniform measures on \(\aleph_2\) such that every subset of \(\aleph_2\) is measured by one of the measures. (2) It implies that it is consistent that there is an ultrafilter \(D\) on \(\omega_2\) such that the ultrapower \(\omega^{\omega_2}/D\) has cardinality \(\aleph_1\). (3) \textit{P. Erdős} and \textit{A. Hajnal} [Theory of graphs, Proc. Colloq. Tihany, Hungary 1966, 83-98 (1968; Zbl 0164.24803)] defined the graph \({\mathcal G}_{\omega_2,\omega}\) whose vertices are all the functions mapping from \(\omega_2\) to \(\omega\) with two vertices \(f,g\) adjacent if \(| \{\alpha<\omega_2 : f(\alpha)=g(\alpha)\}| <\aleph_2\). (This graph has a certain universal property.) Erdős and Hajnal asked about its chromatic number. The main result of the present paper implies that it is consistent that its chromatic number is \(\aleph_1\).