Large normal ideals concentrating on a fixed small cardinality

DOI10.1007/S001530050049MaRDI QIDQ1354350zbMATH OpenOpenAlexFDO

Authors S. Shelah

Publication date 5 November 1997

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9406219

zbMATH Keywords

consistencycut-and-choose gamesforcinginfinite gamelarge cardinalsmeasurable cardinalultrafilterwinning strategy

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Games involving topology, set theory, or logic (91A44)

Abstract: A property of a filter, a kind of large cardinal property, suffices for the proof in Liu Shelah [LiSh:484] and is proved consistent as required there. A natural property which looks better, not only is not obtained here, but is shown to be false. On earlier related theorems see Gitik Shelah [GiSh310].

Review text

The author considers the following cut-and-choose games: Let \(\kappa\), \(\mu\) and \(\xi\) be cardinal numbers and \(\theta\) an ordinal number such that \(2\leq\mu<\xi\leq\kappa\) and \(\theta\leq\kappa\), and let \(\mathcal D\) be a filter on \(\kappa\). The game has \(\theta\) innings. In the \(\nu\)th inning ONE first cuts \(\kappa\) into fewer than \(\xi\) pieces -- let \(O_\nu\) be the set of these pieces. Then TWO responds by choosing fewer than \(\mu\) of these pieces, say \(T_\nu\subset O_\nu\). A play \[ O_0, T_0,O_1,T_1,\dots, O_\nu,T_\nu,\dots\quad (\nu<\theta) \] is won by TWO if for each \(\nu<\theta\) the set \(\bigcap_{\gamma\leq\nu}(\bigcup T_\gamma)\) has nonempty intersection with each element of the filter \({\mathcal D}\); otherwise, ONE wins. Let the symbol \(G_{\kappa,\xi,\mu,\theta}({\mathcal D})\) denote this game. For fixed \(\kappa\), \(\xi\), \(\mu\) and \(\theta\), the author then defines a class \(K_{\kappa,\xi,\mu,\theta}\) of partially ordered sets by specifying five qualifying properties. The main result of the paper is as follows: If \(\kappa\) is a measurable cardinal number and \(\mathcal D\) is a \(\kappa\)-complete ultrafilter on \(\kappa\), then for every partially ordered set \({\mathbf P}\) from the class \(K_{\kappa,\xi,\mu,\theta}\), in any generic extension by \({\mathbf P}\) player TWO has a winning strategy in the game \(G_{\kappa,\xi,\mu,\theta}({\mathcal D})\). As one of the applications of the result, the author shows that the consistency of a hypothesis is an earlier paper by Liu and himself can be derived using large cardinals and the main result.

Recommendations

• Game ideals
• Some properties of \(\kappa\)-complete ideals defined in terms of infinite games
• Games and Ramsey-like cardinals
• On ideals and stationary reflection
• A game on partial orderings

Cited in

(10)

• Game sentences and ultrapowers
• On ideals and stationary reflection
• The PCF conjecture and large cardinals
• scientific article; zbMATH DE number 4066872 (Why is no real title available?)
• scientific article; zbMATH DE number 50958 (Why is no real title available?)
• Filter games on ω and the dual ideal
• Winning the pressing down game but not Banach-Mazur
• A game on partial orderings
• Classical namba forcing can have the weak countable approximation property
• Models with second order properties. V: A general principle

This page was built for publication: Large normal ideals concentrating on a fixed small cardinality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354350)