我们描述了一种从Souslin ccc力迫概念中构造“好”σ-理想的方法。[这些笔记是在1992年写下来的，但没有提交给任何期刊。在一个稍微修改的形式，他们被纳入：T。Bartoszynski和H. Judah，集合论：关于实数线的结构，A K Peters，Wellesley，MA，1995;第193-203页。
英文摘要：
We describe a method of building ``nice'' sigma-ideals from Souslin ccc forcing notions.
[These notes were written down in 1992, but were not submitted to any journal. In a slightly modified form, they were incorporated to: T. Bartoszynski and H. Judah, Set Theory: on the structure of the real line, A K Peters, Wellesley, MA, 1995; pages 193-203.]
An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion --- Cohen forcing --- adds an $\aleph_1$-Souslin tree. In this paper, we identify a rather large class of notions of forcing that, assuming a GCH-type assumption, add a $λ^+$-Souslin tree. This class includes Prikry, Magidor and Radin forcing.
We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $λ$, if $λ^{++}$ is not a Mahlo cardinal in Gödel's constructible universe, then $2^λ= λ^+$ entails the existence of a $λ^+$-complete $λ^{++}$-Souslin tree.
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support interations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting of models of two types, and a preservation theorem for such iterations. The consistency of this axiom was previously known by the standard countable support iteration, using a preservation theorem due to Miyamoto.
It is consistent that there exists a Souslin tree $T$ such that after forcing with it, $T$ becomes an almost Souslin Kurepa tree. This answers a question of Zakrzewski.
Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[κ]$, from which we confirm that $κ$-Souslin trees exist in various models of interest. As a corollary we get that for every integer $n$ such that $\mathfrak b<2^{\aleph_n}=\aleph_{n+1}$, if $\square(\aleph_{n+1})$ holds, then there exists an $\aleph_{n+1}$-Souslin tree.
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_θ$. We show that forcing with this poset adds a Kurepa tree $T$. Moreover, if $\mathcal P_c$ is a suborder of $\mathcal P$ containing only continuous matrices, then the Kurepa tree $T$ is almost Souslin, i.e. the level set of any antichain in $T$ is not stationary in $ω_1$.
We show that for $Π_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal axioms). Among such $Π_2$-properties we mention: the negation of the Continuum hypothesis, Souslin Hypothesis, the negation of Whitehead's conjecture on free groups, the non-existence of outer automorphisms for the Calkin algebra, etc... In particular this gives an a posteriori explanation of the success forcing (and forcing axioms) met in producing models of su…
With every $σ$-ideal $I$ on a Polish space we associate the $σ$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $σ$-ideals $I$ and $I^*$ and find connections between their forcing properties. To this end, we associate to a $σ$-ideal on a Polish space an ideal on a countable set and show how forcing properties of the forcing depend on combinatorial properties of the ideal. For $σ$-ideals generated by closed sets we also study the degrees of reals added in the forcing extensions. Among corollaries of our results, we get necessary …
We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias--Prikry forcings with summable ideals are all mutually bi-embeddable. We show that Mathias forcing associated with the complement of an analytic ideal always adds a dominating real. We also characterize filters for which the associated Mathias--Prikry forcing does not add eventually different reals, and show that they are countably generated provided they are Borel. We give a characterization of $ω$-hitting and $ω$-s…
We propose a new, game-theoretic, approach to the idealized forcing, in terms of fusion games. This generalizes the classical approach to the Sacks and the Miller forcing. For definable ($\mathbfΠ^1_1$ on $\mathbfΣ^1_1) $σ$-ideals we show that if a $σ$-ideal is generated by closed sets, then it is generated by closed sets in all forcing extensions. We also prove an infinite-dimensional version of the Solecki dichotomy for analytic sets. Among examples, we investigate the $σ$-ideal $\E$ generated by closed null sets and $σ$-ideals connected with not piecewise continuous functions.
It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a forcing notion similar to the random real forcing, replacing aleph_0 by lambda, so requiring it to be (<lambda)-complete. Of course, we would welcome additional properties generalizing the ones of the random real forcing. Returning to the ideal (instead forcing) we may look at the Boolean Algebra of lambda-Borel sets modulo the ideal. Surprisingly we get an posi…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or antichains. This allows us to prove some consequences of the Boolean Prime Ideal theorem using arguments in the style of those that use Zorn's Lemma, or Martin's Axiom.
Properties of Laver forcing associated with a co-ideal expressed via the Katetov order
Centro de Ciencias Matemáticas Universidad Nacional Autónoma de México（墨西哥国立自治大学数学科学中心）；Posgrado Conjunto en Ciencias Matemáticas UNAM-UMSNH（墨西哥国立自治大学-米却肯自治大学联合数学研究生项目）
We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $ω_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not decide whether the restriction of the non-stationary ideal on $ω_2$ to sets of ordinals of countable cofinality is $Δ_1$-definable by formulas with parameters in $H(ω_3)$. The techniques developed in the proof of this result also allow us to prove analogous results for the full non-stationary ideal on $ω_2$ and strong forcing axioms that are compatible with CH. Fin…
In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special (but important) case where the infinite sets $S$ are computable were thoroughly explored by Cholak, Dzhafarov, Hirst, and Slaman~\cite{CDHS-2014}. In this paper, we undertake a similar investigation for the case where the sets $S$ are members of general countable Turing ideals, and give conditions under which generics for Mathias forcing over one ideal compute…
We show that the cofinalities of both the Miller ideal m^0 (the sigma-ideal naturally related to Miller forcing) and the Laver ideal ell^0 (related to Laver forcing) are larger than the size of the continuum in ZFC.
In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of the generalised Cantor space and study its associated ideal of null sets and notion of measurability. This issue was also addressed by Shelah ([11, Problem 0.5]) and concerns the definition of a forcing which is $κ^kappa$-bounding, $< κ$-closed and $κ^+$-cc, for $κ$ inaccessible.
We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously adding partial square sequences on multiple stationary sets. We show that certain quotients of such forcings have the $ω_1$-approximation property. We apply these ideas to prove, assuming the consistency of a greatly Mahlo cardinal, that it is consistent that the approachability ideal $I[ω_2]$ does not have a maximal set modulo clubs.
We provide solutions to several problems of Foreman about ideals, several of which are closely related to Mitchell's notion of \emph{strongly proper} forcing. We prove: 1) Presaturation of a normal ideal implies projective antichain catching, enabling us to provide a solution to a problem from Foreman~\cite{MR2768692} about ideal projections which is more comprehensive and simpler than the solution obtained in \cite{MR3343538}. 2) We solve an older question from Foreman~\cite{MR819932} about the relationship between generic hugeness and generic almost hugeness. 3) Finally, we provide solutions…
We study the notion of $\mathcal J$-MAD families where $\mathcal J$ is a Borel ideal on $ω$. We show that if $\mathcal J$ is an arbitrary $F_σ$ ideal, or is any finite or countably iterated Fubini product of $F_σ$ ideals, then there are no analytic infinite $\mathcal J$-MAD families, and assuming Projective Determinacy there are no infinite projective $\mathcal J$-MAD families; and under the full Axiom of Determinacy + $V=\mathbf{L}(\mathbb{R})$ there are no infinite $\mathcal J$-mad families. These results apply in particular when $\mathcal J$ is the ideal of finite sets $\mathrm{Fin}$, which…
A family $\mathscr{I} \subseteq [ω]^ω$ such that for all finite $\{X_i\}_{i\in n}\subseteq \mathcal I$ and $A \in \mathscr{I} \setminus \{X_i\}_{i\in n}$, the set $A \setminus \bigcup_{i < n} X_i$ is infinite, is said to be ideal independent. An ideal independent family which is maximal under inclusion is said to be a maximal ideal independent family and the least cardinality of such family is denoted $\mathfrak{s}_{mm}$. We show that $\mathfrak{u}\leq\mathfrak{s}_{mm}$, which in particular establishes the independence of $\mathfrak{s}_{mm}$ and $\mathfrak{i}$. Given an arbitrary set $C$ of un…
Some models of combinatorial principles have been obtained by collapsing a huge cardinal in the case of the successors of regular cardinals. For example, saturated ideals, Chang's conjecture, polarized partition relations, and transfer principles for chromatic numbers of graphs. In this paper, we study these in the case of the successors of singular cardinals. In particular, we show that Prikry forcing preserves the centeredness of ideals but kills the layeredness. We also study $\binom{μ^{++}}{μ^{+}}\to\binomκ{μ^{+}}_μ$ and $\mathrm{Tr}_{\mathrm{Chr}}(μ^{+++},μ^{+})$ in the extension by Prikr…
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) = smm(A) < u(A), answering questions raised by [Mon08] and [Mon11].
We show that certain type of tree forcings, including Sacks forcing, increases the covering of the strong measure zero ideal $\mathcal{SN}$. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which indicates that this covering number is consistently larger than any other classical cardinal invariant of the continuum. Even more, Sacks forcing can be used to force that $\mathrm{non}(\mathcal{SN})<\mathrm{cov}(\mathcal{SN})<\mathrm{cof}(\mathcal{SN})$, which is the first consistency result where more than two cardinal invariants associated with $\mathcal…
The weakly compact reflection principle $\text{Refl}_{\text{wc}}(κ)$ states that $κ$ is a weakly compact cardinal and every weakly compact subset of $κ$ has a weakly compact proper initial segment. The weakly compact reflection principle at $κ$ implies that $κ$ is an $ω$-weakly compact cardinal. In this article we show that the weakly compact reflection principle does not imply that $κ$ is $(ω+1)$-weakly compact. Moreover, we show that if the weakly compact reflection principle holds at $κ$ then there is a forcing extension preserving this in which $κ$ is the least $ω$-weakly compact cardinal.…
Using a countable support product of creature forcing posets, we show that consistently, for uncountably many different functions the associated Yorioka ideals' uniformity numbers can be pairwise different. In addition we show that, in the same forcing extension, for two other types of simple cardinal characteristics parametrised by reals (localisation and anti-localisation cardinals), for uncountably many parameters the corresponding cardinals are pairwise different.
Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a given ideal. We prove that for all $σ$-ideals $I$ such that the ideal forcing $\mathbb{P}_I$ of Borel sets modulo $I$ is proper, this uniformization principle is equivalent to an absoluteness principle for projective formulas with respect to $\mathbb{P}_I$ that we call internal absoluteness. In addition, we show that it is equivalent to measurability with res…
We prove that a large class of presaturated ideals at inaccessible cardinals can be de-saturated while preserving their presaturation, answering both a question of Foreman and of Cox and Eskew. We do so by iterating a generalized version of Baumgartner and Taylor's forcing to add a club with finite conditions along an inaccessible cardinal, and invoking Foreman's Duality Theorem.
Let $\mathcal{E}$ be the $σ$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\ additivity, covering, uniformity and cofinality) are pairwise different.
We investigate two variants of splitting tree forcing, their ideals and regularity properties. We prove connections with other well-known notions, such as Lebesgue measurablility, Baire- and Doughnut-property and the Marczewski field. Moreover, we prove that any \emph{absolute} amoeba forcing for splitting trees necessarily adds a dominating real, providing more support to Spinas' and Hein's conjecture that $\add(\ideal{I}_\spl) \leq \mathfrak{b}$.
