Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 598 concerns all countably infinite subsets and witnesses of a prescribed cardinal size. The Magidor relation in Garti–Hayut Claim 1.10 instead concerns bounded countably infinite subsets of a singular cardinal. The following author-recorded argument supplies the domain bridge. It does not independently verify the forcing theorem or the other half of the proposed independence result.
Let and let be uncountable and regular. Suppose ; the domain includes all countable order types. For a coloring , restrict to bounded subsets and choose of size and a color omitted there. Choose an increasing cofinal sequence in . Some has size at least , since otherwise its countable union would have size below the uncountable regular cardinal . Take of size . Every countable subset of is bounded in , so it omits . Consequently
Color monotonicity also needs no additional set theory. If the bounded omitting relation holds with colors and , compose a -coloring with a surjection onto . Omitting a -color omits its nonempty fiber of -colors.
In Claim 1.10(a) of arXiv:1801.00239v3, take . The theorem starts from I1 and produces a Magidor with . Its proof first uses Prikry forcing at a measurable , then a countably closed Lévy collapse. Using the standard facts that these steps add no reals, and the theorem's preservation of as a limit cardinal, the final continuum is below : the unchanged reals inject into the old ordinal . Hence the final is below and at least . Monotonicity and the domain bridge give the desired negative instance at . No assumption of CH is needed for this specialization.
The source introduction and Claim 1.10's proof paragraph supply the domain convention and the two forcing steps. Preservation of Magidority, the no-new-reals facts, and the supporting forcing lemmas remain imported premises, not reconstructed proofs here. The independent scrutiny needed for the whole conclusion is separate from checking this bridge.
For the positive-in- half, Wu's existing claim uses a finite-subset coding and elementary-substructure equivalence followed by a condensation-to- theorem. Those textbook interfaces are unverified in this note. Checking their exact hypotheses, and the final cardinals in the negative model, is the next useful source test. A missing model-theoretic hypothesis or forcing-preservation clause leaves the whole independence conclusion conditional on that gap.