Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V or V[s]=V[r].
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 …
The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give some results concerning cardinal characteristics of the sigma-ideals determined by those universality parameters.
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 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.]
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.
We study an extensive connection between factor forcings of Borel subsets of Polish spaces modulo a sigma-ideal, and factor forcings of subsets of countable sets modulo an ideal.
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.
Answering two questions of D. Fremlin [Real-valued measurable cardinals, in Set Theory of the Reals, H. Judah ed. 1993, 151-305 ] we show the following: (1) If c is real-valued measurable then the Maharam type of (c,P(c),sigma) is 2^c. (2) It is consistent to have k real-valued measurable but for every submodel V_1 with k measurable in it there are no k reals which are random over V_1.
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler's classical result in the theory of forcing.
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.
The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $σ$-continuity of a certain Borel not $σ$-continuous function. We give a characterization of this forcing in the language of trees and using this characterization we establish such properties of the forcing as fusion and continuous reading of names. Although the latter property is usually implied by the fact that the associated ideal is generated by closed sets, we show it is not the case with Steprans forcing. We also establish a connection between Steprans forcing and Miller forcing thus giving a new descripti…
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 prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler's classical result in the theory of forcing, and the statement of the theorem for the meager ideal has been already proved by Bartoszynski and the author.
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…
Let l^0 and m^0 be the ideals associated with Laver and Miller forcing, respectively. We show that add (l^0) < cov(l^0) and add (m^0) < cov(m^0) are consistent. We also show that both Laver and Miller forcing collapse the continuum to a cardinal <= h .
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].
With each of the usual tree forcings I (e.g., I = Sacks forcing S, Laver forcing L, Miller forcing M, Mathias forcing R, etc.) we associate a sigma--ideal i^0 on the reals as follows: A \in i^0 iff for all T \in I there is S \leq T (i.e. S is stronger than T or, equivalently, S is a subtree of T) such that A \cap [S] = \emptyset, where [S] denotes the set of branches through S. So, s^0 is the ideal of Marczewski null sets, r^0 is the ideal of Ramsey null sets (nowhere Ramsey sets) etc. We show (in ZFC) that whenever i^0, j^0 are two such ideals, then i^0 \sem j^0 \neq \emptyset. E.g., for I=S …
We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.
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…
I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.
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.
We study the spectrum of forcing notions between the iterations of $σ$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $α$-proper forcings for indecomposable countable ordinals as well as the Axiom A forcings. We focus on the bounded forcing axioms for the hierarchy of $α$-proper forcings and connect them to a hierarchy of weak club guessing principles. We show that they are, in a sense, dual to each other. In particular, these weak club guessing principles separate the bounded forcing axioms for distinct countable indecomposable ordinals. In the study o…
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…
In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We show that various uncountable Borel chromatic numbers of closed graphs can be consistently different, as well as consistently equal to the continuum. This is done using arguments that are typical to Axiom A forcing notions.
Throughout this abstract let U be a fixed p-point ultrafilter and let I be the dual ideal. Grigorieff forcing is P(U)={p:omega to 2|dom(p) is an element of I} ordered by reverse inclusion. It is well known that Grigorieff forcing is proper. The main result of this paper is the following: THEOREM: Gregorieff forcing does not satisfy Axiom A. To prove this we use the following game, denoted G(U), for two players playing alternatively: Player I plays a partition of omega, {J_n| n<omega}, such that for all n<omega, J_n is an element of I; At the nth turn Player II plays a finite subset F_n of J_n.…
We show that compact cardinals and {\rm MM} are sensitive to $λ$-closed forcings for arbitrarily large $λ$. This is done by adding 'regressive' $λ$-Kurepa-trees in either case. We argue that the destruction of regressive Kurepa-trees with {\rm MM} requires the use of Namba forcing.
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.
In the first part of the paper, we show that if $ω\le κ< λ$ are cardinals, $κ^{<κ} = κ$, and $λ$ is weakly compact, then in $V[\M(κ,λ)]$ the tree property at $λ= κ^{++V[\M(κ,λ)]}$ is indestructible under all $κ^+$-cc forcing notions which live in $V[\Add(κ,λ)]$, where $\Add(κ,λ)$ is the Cohen forcing for adding $λ$-many subsets of $κ$ and $\M(κ,λ)$ is the standard Mitchell forcing for obtaining the tree property at $λ= (κ^{++})^{V[\M(κ,λ)]}$. This result has direct applications to Prikry-type forcing notions and generalized cardinal invariants. In the second part, we assume that $λ$ is superco…
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.
Following the topic of the book Canonical Ramsey Theory on Polish Spaces by V. Kanovei, M. Sabok and J. Zapletal we study Borel equivalences on Laver trees. Here we prove that equivalence relations Borel reducible to an equivalence relation on $2^ω$ given by some $F_σ$ $P$-ideal on $ω$ can be canonized to the full equivalence relation or to the identity relation. This has several corollaries, e.g. Silver type dichotomy for the Laver ideal and equivalences Borel reducible to equivalence relations given by $F_σ$ $P$-ideals.
This paper investigates properties of $σ$-closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter $\mathcal{U}$ for $n$-tuples, denoted $t(\mathcal{U},n)$, is the smallest number $t$ such that given any $l\ge 2$ and coloring $c:[ω]^n\rightarrow l$, there is a member $X\in\mathcal{U}$ such that the restriction of $c$ to $[X]^n$ has no more than $t$ colors. Many well-known $σ$-closed forcings are known to generate ultrafilters with finite Ramsey degrees, but finding the precise degrees can sometimes prove elusive or quite involved, at …
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}$.
We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $ω_1.$ We also produce, relative to the existence of suitable large cardinals, a model of $ZFC$ in which $2^{\aleph_0}=\aleph_2$ and all $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ collapse $\aleph_2,$ and hence are forcing equivalent to $Add(\aleph_1, 1).$ These results answer a question of Scott Williams from 1978. We also extend a result of Todorcevic and…
Let $\mathcal{SN}$ be the strong measure zero $σ$-ideal. We prove a result providing bounds for $\mathrm{cof}(\mathcal{SN})$ which implies Yorioka's characterization of the cofinality of the strong measure zero. In addition, we use forcing matrix iterations to construct a model of ZFC that satisfies $\mathrm{add}(\mathcal{SN})=\mathrm{cov}(\mathcal{SN})<\mathrm{non}(\mathcal{SN})<\mathrm{cof}(\mathcal{SN})$.
Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Here, we study the indestructibility properties of remarkable cardinals. We show that if $κ$ is remarkable, then there is a forcing extension in which the remarkability of $κ$ becomes indestructible by all $\ltκ$-closed $\leqκ$-distributive forcing and all two-step iterations of the form ${\rm Add}(κ,θ)*\dot{\mathbb R}$, where $\dot{\mathbb R}$ is forced to be $\ltκ$-closed and $\leqκ$-di…