This paper explores a strong variant of destroying Borel ideals using forcing, characterizes when such destruction occurs, and examines implications for classical ideals and related cardinal invariants.
Contribution
It introduces a new strong destruction concept for Borel ideals, provides combinatorial criteria, and analyzes destruction by specific forcing notions like Mathias-Prikry and Laver-Prikry.
Findings
01
Characterization of when a real forcing can $+$-destroy a Borel ideal
02
Analysis of $+$-destructibility for classical Borel ideals
03
Equivalence conditions for $+$-destruction by Mathias-Prikry forcing
Abstract
We study the following natural strong variant of destroying Borel ideals: P\textit{+-destroys}I if P adds an I-positive set which has finite intersection with every A∈I∩V. Also, we discuss the associated variants \begin{align*} \mathrm{non}^*(\mathcal{I},+)=&\min\big\{|\mathcal{Y}|:\mathcal{Y}\subseteq\mathcal{I}^+,\; \forall\;A\in\mathcal{I}\;\exists\;Y\in\mathcal{Y}\;|A\cap Y|<\omega\big\}\\ \mathrm{cov}^*(\mathcal{I},+)=&\min\big\{|\mathcal{C}|:\mathcal{C}\subseteq\mathcal{I},\; \forall\;Y\in\mathcal{I}^+\;\exists\;C\in\mathcal{C}\;|Y\cap C|=\omega\big\} \end{align*} of the star-uniformity and the star-covering numbers of these ideals. Among other results, (1) we give a simple combinatorial characterisation when a real forcing PI can +-destroy a Borel ideal J; (2) we discuss many…
\mathrm{Conv}=\big{\{}A\subseteq\mathbb{Q}\cap[0,1]:|\text{accumulation points of $A$ (in}\;\mathbb{R})|<\omega\big{\}}.
\mathrm{Conv}=\big{\{}A\subseteq\mathbb{Q}\cap[0,1]:|\text{accumulation points of $A$ (in}\;\mathbb{R})|<\omega\big{\}}.
Fin(φ)
Fin(φ)
Exh(φ)
add(I)
add(I)
cof(I)
non(I)
cov(I)
add∗(I)
add∗(I)
cof∗(I)
non∗(I)
cov∗(I)
inv∗(I)=inv(I)for all four invariants above.
inv∗(I)=inv(I)for all four invariants above.
inv∗(I,D):=inv(I↾D)whereD=[ω]ω,I+,I∗,
inv∗(I,D):=inv(I↾D)whereD=[ω]ω,I+,I∗,
non∗(I,∞)
non∗(I,∞)
cov∗(I,∞)
non∗(I,+)
cov∗(I,+)
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
\diagramstyle
[labelstyle=]
\newarrowImplies =====>
Ways of destruction
Barnabás Farkas
Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstraße 8-10/104, 1040 Wien, Austria
We study the following natural strong variant of destroying Borel ideals: P+-destroysI if P adds an I-positive set which has finite intersection with every A∈I∩V. Also, we discuss the associated variants
[TABLE]
of the star-uniformity and the star-covering numbers of these ideals.
Among other results, (1) we give a simple combinatorial characterisation when a real forcing PI can +-destroy a Borel ideal J; (2) we discuss many classical examples of Borel ideals, their +-destructibility, and cardinal invariants; (3) we show that the Mathias-Prikry, M(I∗)-generic real +-destroys I iff M(I∗)+-destroys I iff I can be +-destroyed iff cov∗(I,+)>ω; (4) we characterise when the Laver-Prikry, L(I∗)-generic real +-destroys I, and in the case of P-ideals, when exactly L(I∗)+-destroys I; (5) we briefly discuss an even stronger form of destroying ideals closely related to the additivity of the null ideal.
The first author was supported by the Austrian Science Fund (FWF) project P29907. The second author was supported by the Austrian Science Fund (FWF) project I2374-N35.
1. Motivation
Ideals on ω and on Polish spaces
If I is an ideal on an infinite set X, we will always assume that [X]<ω={A⊆X:∣A∣<ω}⊆I and X∈/I. Let I+=P(X)∖I be the family of I-positive sets and I∗={X∖A:A∈I} be the dual filter of I. We will work with ideals on countable underlying sets, e.g.
[TABLE]
where ∀∞ stands for “for all but finitely many”, ∃∞ for ¬∀∞¬, that is, for “there is infinitely many”, and (A)n denotes {k:(n,k)∈A}; also we will work with (σ-)ideals on uncountable Polish spaces, e.g.
[TABLE]
where ω2 and ωω are equipped with the usual Polish product topologies, that is, these topologies are generated by the clopen sets {f∈ωℓ:t⊆f} where ℓ=2 or ℓ=ω and t∈<ωℓ={s:s is a function, dom(s)∈ω, and ran(s)⊆ℓ}. The Cantor space ω2 is compact and the measure we referred to as the Lebesgue-measure above is the product probability measure (the power of the uniform distribution on 2).
By identifying P(ω) and ω2, we can talk about measure, category, and complexity of subsets of P(ω), in particular, of ideals on ω, and similarly on arbitrary countably infinite underlying sets (e.g. I1/n is Fσ, Nwd is Fσδ, and Fin⊗Fin is Fσδσ). In Section 2, we will present many classical examples of ideals on countable underlying sets.
Concerning combinatorial properties and cardinal invariants of definable (typically Borel) ideals in forcing extensions, one of the most crucial points is to understand whether a forcing notion destroys an ideal, and if so, how “strongly”. We are interested in various notions of destroying ideals, in their possible characterisations, in their interactions with classical properties of forcing notions, and in the associated cardinal invariants.
We will mainly focus on classical forcing notions, and in general on forcing notions (can be written / equivalent to one) of the form PI=(B(X)∖I,⊆) where X is an uncountable Polish space, B(X)={Borel subsets of X}, and I is a σ-ideal on Xσ-generated by a “definable” family of Borel sets (see later). For example, C=PM is the Cohen forcing, B=PN is the random forcing, and PKσ is the Miller forcing. In general, we know (see [43, Prop. 2.1.2]) that PI adds a “real” rI∈X (X can be seen as a Gδ subset of ω[0,1]) determined by the following property: If V is a transitive model (of a large enough finite fragment) of ZFC, I (more precisely, the family σ-generating I) is coded in V, G is PI-generic over V, and B∈PI is a Borel set coded in V, then rI∈B iff B∈G111When working with PI, sometimes we refer to PI in the universe and sometimes to its interpretation in a transitive model but this should always be clear from the context. Similarly when working with Borel sets, for example in models or in a formula of the forcing language, we refer to their definition, e.g. if B is coded in V, then B∈G means that the interpretation BV=B∩V of B’s code in V belongs to G; and p⊩Px˚∈B means that x˚[G]∈BV[G] (or simply x˚[G]∈B) for every P-generic G (over V) containing p. (see [43] for a detailed study of these forcing notions).
Destroying ideals
Let us recall the classical notion of forcing (in)destructibility: We say that an ideal I on ω is tall if every infinite X⊆ω contains an infinite element of I, e.g. I1/n, Nwd, and Fin⊗Fin are tall. A forcing notion Pcan destroyI if there is a condition p∈P such that
[TABLE]
where we write IV to make it completely clear that even in the case of definable ideals, we refer to the ideal from (or interpreted in) the ground model.222Of course, we could also write Iˇ here, referring to the canonical P-name of I, but as usual, in the forcing language we will not use any specific notions for ground model objects. We say that PdestroysI if p=1P, and that I is P-indestructible if P cannot destroy I.
We know that every ideal can be destroyed by a σ-centered forcing notion: Let I be arbitrary and define the associated Mathias-Prikry forcingM(I∗) as follows (see [12], [13], and [26]): (s,F)∈M(I∗) if s∈[ω]<ω and F∈I∗; (s0,F0)≤(s1,F1) if s0 end-extends s1 (with respect to a fixed enumeration of the underlying set of I), F0⊆F1, and s0∖s1⊆F1. We know that M(I∗) is σ-centered (conditions with the same first coordinates are compatible), and it destroys I: If G is (V,M(I∗))-generic and YG=⋃{s:(s,F)∈G for some F}, then YG∈[ω]ω∩V[G] and ∣YG∩A∣<ω for every A∈IV.
Sometimes M(I∗) does more than just “simply” destroying I: Trivial density arguments show that if I=I1/n or I=Nwd then VM(I∗)⊨YG˚∈I+ (where I+ is defined in the extension of course). In general, YG˚ is not necessarily I-positive: If I=Fin⊗Fin and Y∈I+∩VP, then Y∩({n}×ω) is infinite for infinitely many n and {n}×ω∈IV for every n, in other words, no forcing notion can add a I-positive set which is almost disjoint from all elements of IV. In the case of this stronger notion of destruction we need definability, we will focus on Borel, sometimes analytic or coanalytic ideals. If I is analytic or coanalytic and P adds a Y˚∈I+ such that ∣Y˚∩A∣<ω for every A∈IV, then we will say that P+*-destroys * (or can +-destroy) I. We will show (see Corollary 5.2) that if a Borel ideal I can be +-destroyed, then M(I∗)+-destroys it.
Why do we prefer (at most) analytic or coanalytic ideals? If I is {\vtop{\hbox{\Sigma}\hbox{\sim}}}{}^{1}_{1} or {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{1}, then, applying the Mostowski Absoluteness Theorem, IV=I∩V whenever V is a transitive model of ZFC and I is coded V. Furthermore, if X⊆P(ω) is an analytic or coanalytic set, then “X is an ideal” is a {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{2} statement and hence, by the Shoenfield Absoluteness Theorem, it is absolute between V and VP assuming X is coded in V (in general, between transitive models V⊆W satisfying ω1W⊆V).
One may ask now if we can go even further and add a set Z∈I∗∩VP which has finite intersection with every A∈I∩V (where I is analytic or coanalytic), if so, we say that P∗-destroys (or can ∗-destroy) I. Let us point out certain crucial observations concerning ∗-destructibility:
If we can add such a Z, then A⊆∗ω∖Z∈I (where X⊆∗Y iff ∣X∖Y∣<ω) for every A∈IV. Therefore I must be a P-ideal, that is, for every countable A⊆I there is a pseudounionB∈I of A, that is, A⊆∗B for every A∈A (e.g. I1/n is a P-ideal but Nwd and Fin⊗Fin are not). Why? The formula “x=(xn)n∈ω∈ωP(ω) is a sequence in I without pseudounion in I” is {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{2} hence absolute between V and VP.
A σ-centered forcing notion cannot ∗-destroy any tall analytic P-ideal I
(see [17, Thm. 6.4]), in particular, M(I∗) cannot ∗-destroy I. The same holds for somewhere tall analytic P-ideals, that is, when I↾X={A⊆X:A∈I} is tall for some X∈I+. What can we say about nowhere tall analytic P-ideals? Applying Solecki’s characterisation of analytic P-ideals, one can show (see later) that up to isomorphism (via a bijection between the underlying sets, in notation I≃J) there are only three nowhere tall analytic P-ideals: trivial modifications ofFin=[ω]<ω, that is, ideals of the form {A⊆ω:∣A∩X∣<ω} for an infinite X⊆ω (clearly, there are two nonisomorphic ideals of this form); and the density ideal (see below for the definition of density ideals)
[TABLE]
Clearly, every forcing notion ∗-destroys trivial modifications of Fin, and P∗-destroys {∅}⊗Fin iff P adds a dominating real (and hence in these three special cases, ∗-destruction is possible by σ-centered forcing notions).
And finally, we know that every analytic P-ideal I can be ∗-destroyed: We either use Solecki’s characterisation and an ad hoc construction for a fixed analytic P-ideal, or consider the localization forcing (see below or [9, Lem. 3.1]).
The role of the Katětov(-Blass) preorder
Probably the most well-known characterisation of (classical) forcing destructibility of ideals is via Katětov-reductions to trace ideals (see [6] and [22]). If I and J are ideals on ω, then I is Katětov-belowJ,
[TABLE]
If we restrict f to be finite-to-one in this definition, we obtain the Katětov-Blass-preorder, ≤KB. These preorders play a fundamental role in characterising combinatorial properties of ideals (see e.g. [24], [27], [23], [28], [40], [29], [25], [45]). Let us point out here that if I and J are Borel ideals, then the statement “I≤K(B)J” is {\vtop{\hbox{\Sigma}\hbox{\sim}}}{}^{1}_{2} and hence absolute between V and VP.
For A⊆<ωℓ where ℓ=2 or ℓ=ω, define the Gδ-closure of A as
[TABLE]
and for any ideal I on ωℓ define the trace of I, an ideal on <ωℓ, as follows
[TABLE]
For example if NWD is the ideal of nowhere dense subsets of ω2, then tr(NWD)=tr(M)=
[TABLE]
where t↑={t′∈<ω2:t⊆t′}. It is trivial to see that PI destroys tr(I): If r˚I∈ωℓ∩VPI is the PI-generic real over V, R˚={r˚I↾n:n∈ω}∈[<ωℓ]ω∩VPI, B∈PI, and A∈tr(I), then B′=B∖[A]δ∈PI, B′≤B, and B′⊩∣A∩R˚∣<ω.
Theorem 1.1**.**
(see [22, Thm. 1.6])*
Let I be a σ-ideal on ωℓ such that PI is proper and I satisfies the continuous readings of names (CRN, see below), and let J be an ideal on ω. Then PI can destroy J if, and only if J≤Ktr(I)↾X for some X∈tr(I)+.*
The paper is organised as follows: In Section 2, we present many classical Borel ideals, as well as the characterisations of Fσ ideals and of analytic P-ideals (due to Mazur and Solecki). In Section 3, we give a detailed introduction to the notions of destructibility of ideals and to the associated cardinal invariants, also, we present a combinatorial characterisation of forcing (in)destructibility by proper real forcing notions. In Section 4, we discuss our examples of non P-ideals from Section 2 in the context of +-destructibility and the new cardinal invariants. In Section 5, applying Laflamme’s filter games and his results, we characterise when the Mathias-Prikry and Laver-Prikry generic reals, and in the case of the first one, the forcing notion in general, +-destroy the defining ideal. In Section 6, we characterise when exactly the Laver-Prikry forcing +-destroys the defining P-ideal. In Section 7, we present a survey on ∗-destructibility and its connection to the null ideal. Finally, in Section 8, we list all our remaining open questions.
2. Borel ideals
We present some additional classical examples of Borel ideals (for their specific roles in characterisation results see e.g. [24] or [27], also find more citations below). We already defined I1/n, Nwd, Fin⊗Fin, and {∅}⊗Fin.
Summable ideals (a.k.a. generalisations of I1/n): Let h:ω→[0,∞) such that ∑n∈ωh(n)=∞. Then the summable ideal generated by h is
[TABLE]
Ih is an Fσ P-ideal, and it is tall iff
limn→∞h(n)=0.
Eventually different ideals: Let
[TABLE]
Δ={(n,k)∈ω×ω:k≤n}, and EDfin=ED↾Δ. Then ED and EDfin are tall Fσ non P-ideals.
The random graph ideal: Let
[TABLE]
where the random graph(ω,E), E⊆[ω]2 is up to isomorphism uniquely determined by the following property: For every pair A,B⊆ω of nonempty, finite, disjoint sets, there is an n∈ω∖(A∪B) such that {{n,a}:a∈A}⊆E and {{n,b}:b∈B}∩E=∅. A set H⊆ω is (E-)homogeneous iff [H]2⊆E or [H]2∩E=∅; and id(H) stands for the ideal generated by H (that is, the collection of all subsets of ⋃H which can be covered by finitely many elements of H, of course in general id(H) is not necessarily proper). Ran is a tall Fσ non P-ideal.
Solecki’s ideal (see [40], [29], and [25]): Let CO(ω2) be the family of clopen subsets of ω2 and Ω={C∈CO(ω2):λ(C)=1/2} where λ is the Lebesgue-measure on ω2 (clearly, C is clopen iff C is a union of finitely many basic clopen sets, and hence ∣CO(ω2)∣=∣Ω∣=ω). The ideal S on Ω is generated by {Cx:x∈ω2} where Cx={C∈Ω:x∈C}. S is a tall Fσ non P-ideal.
Density and generalised density ideals.
Let (Pn)n∈ω be a partition of ω into nonempty finite sets and let ϑ=(ϑn)n∈ω be a
sequences of measures or submeasures (in the generalised case, see the definition below), ϑn:P(Pn)→[0,∞) such that limsupn→∞ϑn(Pn)>0. The (generalised) density ideal generated by ϑ
is
[TABLE]
Ideals of this form are Fσδ P-ideals, and the ideal Zϑ is tall iff max{ϑn({k}):k∈Pn}n→∞0. The density zero ideal
[TABLE]
is a tall density ideal. It is easy to see that I1/n⊊Z. Also, it is straightforward to check that {∅}⊗Fin is a density ideal.
The trace ideal of the null ideal:
[TABLE]
is a tall Fσδ P-ideal (but in general, trace ideals can be very complex, see [22, Prop. 5.1]).
The ideal Conv is generated by those infinite subsets of Q∩[0,1] which are convergent in [0,1], in other words
[TABLE]
This ideal is a tall, Fσδσ, non P-ideal.
It is easy to see that there are no Gδ (i.e. {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{0}_{2}) ideals, and we know that there are many Fσ (i.e. {\vtop{\hbox{\Sigma}\hbox{\sim}}}{}^{0}_{2}) ideals. In general, we know (see [10] and [11]) that there are {\vtop{\hbox{\Sigma}\hbox{\sim}}}{}^{0}_{\alpha}- and {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{0}_{\alpha}-complete ideals for every α≥3. About ideals on the ambiguous levels of the Borel hierarchy see [16]. For projective examples, see [18].
Katětov and Katětov-Blass reducibilities between our main examples have been extensively studied (see e.g. [27], [8], and [9]), and apart from the very few unknown reducibilities (e.g. the still open Ran≤K(B)S), we are provided with a quite satisfying “map” of Katětov-reducibilities between our main examples. Moreover, all these reductions can be chosen as finite-to-one (i.e. as KB-reductions), and in almost all cases, if we know that there is a no KB-reduction then there is no K-reduction either between these examples.
Fσ ideals and analytic P-ideals
There is a natural way of defining nice ideals on ω from submeasures.
A function φ:P(ω)→[0,∞]
is a submeasure on ω if φ(∅)=0; φ(X)≤φ(X∪Y)≤φ(X)+φ(Y) for every X,Y⊆ω; and φ({n})<∞ for every n∈ω. φ is lower semicontinuous (lsc, for short) if φ(X)=sup{φ(X∩n):n∈ω} for each X⊆ω.
If φ is an lsc submeasure on ω then for X⊆ω let ∥X∥φ=limn→∞φ(X∖n).
We assign two ideals to a submeasure φ as follows
[TABLE]
It is easy to see that if Fin(φ)=P(ω), then it is an Fσ ideal; and similarly if Exh(φ)=P(ω), then it is an Fσδ P-ideal. Clearly, Iφ({⋅})⊆Exh(φ)⊆Fin(φ) always holds where Iφ({⋅}) stands for the summable ideal generated by the sequence (φ({n}))n∈ω. From now on, when working with Fin(φ) or Exh(φ), we will always assume that they are proper ideals.
It is straightforward to see that if φ is an lsc submeasure on ω then Exh(φ) is tall iff limn→∞φ({n})=0.
Example 2.1**.**
If Ih is a summable ideal then Ih=Fin(φh)=Exh(φh) where φh(A)=∑n∈Ah(n); if Zϑ is a generalised density ideal, then Zϑ=Exh(φϑ) where φϑ(A)=sup{ϑn(A∩Pn):n∈ω}; and finally tr(N)=Exh(ψ) where ψ(A)=∑{2−∣s∣:s∈A is ⊆-minimal in A} (and of course, φh, φϑ, and ψ are lsc submeasures).
The following characterisation theorem gives us the most important tool when working on combinatorics of Fσ ideals and analytic P-ideals.
I* is an Fσ ideal iff I=Fin(φ) for some lsc submeasure φ.*
•
I* is an analytic P-ideal iff I=Exh(φ) for some lsc submeasure φ.*
•
I* is an Fσ P-ideal iff I=Fin(φ)=Exh(φ) for some lsc submeasure φ.*
In particular, analytic P-ideals are Fσδ. When working with Exh(φ), we can always assume that φ({n})>0 for every n, and that φ(ω)=∥ω∥φ=1: Let φ0(A)=φ(A)+∑n∈A2−n, φ1(A)=min(φ0(A),1), φ2(A)=φ1(A)/∥ω∥φ1, and φ3(A)=min(φ2(A),1), then Exh(φi)=Exh(φ) for i=0,1,2,3 and φ3(ω)=∥ω∥φ3=1.
As promised, we give an easy characterisation of nowhere tall analytic P-ideals:
Fact 2.3**.**
Assume that I is a nowhere tall analytic P-ideal. Then I is a trivial modification of Fin or I≃{∅}⊗Fin.
Proof.
Let I=Exh(φ) for some lsc submeasure φ. First we show that I is nowhere tall iff I=I′:={A⊆ω:A is finite or limn∈Aφ({n})=0}.
First assume that I is nowhere tall. As I⊆I′ always holds, we show that if A∈I′ then A∈I. Assume on the contrary, that A∈/I. Then there is an infinite A′⊆A such that I↾A′=[A′]<ω. If B={b0<b1<b2<…}⊆A′ such that φ({bn})<2−n for every n, then B∈I, a contradiction. Conversely, assume now that I=I′, and let X∈I+. If Y⊆X is infinite and inf{φ({k}):k∈Y}>0 then I↾Y=[Y]<ω and hence I↾X is not tall.
Therefore, if I is a nowhere tall analytic P-ideal, then there is a sequence xn>0 such that I={A⊆ω:A is finite or limn∈Axn=0}. By modifying xn, we can assume that xn=xm for every n=m. Let X={xn:n∈ω}, X′ be set of accumulation points of X, and X′′=(X′)′, we know that X′⊇X′′ are closed. We have the following three cases: (1) 0∈/X′. Then I=Fin. (2) 0∈X′∖X′′. Let y=min(X′∖{0})>0. Now A⊆ω belongs to I iff ∣A∩{n:xn≥y}∣<ω, hence I is a trivial modification of Fin. (3) 0∈X′′. Fix a sequence y0=∞>y1>y2… tending to [math] such that each [yk+1,yk) contains infinitely many xn, and let Pk={n:xn∈[yk+1,yk)}. Then A∈I iff A∩Pk is finite for every k, and hence I≃{∅}⊗Fin.
∎
3. Degrees of destruction
Starting with the usual forcing destructibility of ideals, we define three notions of destroying ideals in forcing extensions:
Definition 3.1**.**
Let I be an analytic or coanalytic ideal on ω, D=[ω]ω,I+, or I∗, and let P be a forcing notion. We say that P* can D-destroy I* if there is a p∈P such that p⊩“∃Y∈D∀A∈IV∣X∩A∣<ω”. Mostly we will write (∞-)destroy, +-destroy, and ∗-destroy instead of [ω]ω/I+/I∗-destroy.
Clearly, ∗-destruction implies +-destruction which implies ∞-destruction. All these notions can be reformulated with pseudounions: P destroys I if it adds a pseudounion of I∩V with infinite complement, it +-destroys I if it adds a pseudounion of I∩V with I-positive complement, and P∗-destroys I if it adds a pseudounion of I∩V with complement in I∗, i.e. a pseudounion which belongs to I.
Our main goals is to deepen our understanding of ∞/+/∗-destructibility of Borel ideals, in particular, to characterise which ideals a fixed “nice” forcing notion P can ∞/+/∗-destroy and to study the associated cardinal invariants of these ideals.
Let us take a look on forcing (in)destructibility in the context of cardinal invariants. If I is an ideal on X, then its additivity, cofinality, uniformity, covering numbers are defined as follows:
[TABLE]
In the case of ideals on countable underlying sets, most of these invariants equal ω. In [21], for tall ideals on ω the following cardinal invariants were introduced:
[TABLE]
Notice that in this context, destroying a Borel I means increasing cov∗(I), and similarly, ∗-destroying I is associated to increasing add∗(I). Strictly speaking, these invariants are not new, they can be seen as usual additivity, cofinality, uniformity, and covering numbers (see [21]): If I is a tall ideal on ω, then let I be the ideal on [ω]ω generated by all sets of the form A={X∈[ω]ω:∣A∩X∣=ω}, A∈I. Now it is trivial to see that
[TABLE]
To put +-destructibility into the context of cardinal invariants, we can easily generalise these cardinals by replacing [ω]ω with I+ in their definitions. In general, if I is an ideal on ω then we define
[TABLE]
in particular, inv∗(I)=inv∗(I,[ω]ω). To avoid tedious notations, especially if the notation for an ideal or for its underlying set is too long (e.g. Conv or ω×ω), we will write inv∗(I,∞)=inv∗(I,[ω]ω), inv∗(I,+)=inv∗(I,I+), and inv∗(I,∗)=inv∗(I,I∗).
When exactly are these cardinals defined? The invariants add,cof,non,cov are defined for proper ideals containing all finite subsets of their underlying sets. Properness is not an issue because if I is proper, then I∗∈/I. Considering finite subsets of the underlying set, [ω]ω=⋃I iff I+=⋃(I↾I+) iff I is tall; and I∗=⋃(I↾I∗) iff I is not a trivial modification of Fin. To simply our list of conditions in the forthcoming statements, whenever we work with cardinal invariants of the form inv∗(I,∞) or inv∗(I,+), we will always assume that I is tall. Similarly, when inv∗(I,∗) is involved, we will assume that I is not a trivial modification of Fin.
The cardinal invariants inv∗(I,∞) have been extensively studied (see e.g. [21], [37], [1], and [23]) but we know much less about e.g. inv∗(I,+) (it was introduced in [8]). As we will mainly focus on uniformity and covering, let us reformulate these coefficients without referring to I:
[TABLE]
Observations 3.2**.**
(1)
Let I be an arbitrary tall ideal on ω and A,B∈I. Then the following are equivalent: (i) A⊆∗B, (ii) A⊆B, (iii) A∩I+⊆B∩I+, and (iv) A∩I∗⊆B∩I∗. (i)→(ii)→(iii)→(iv) are trivial, and (iv) implies (i) because if ∣A∖B∣=ω then ω∖B∈(A∩I∗)∖B.
(2)
Some of these new coefficients are actually equal:
[TABLE]
add∗(I,∞)≤add∗(I,+)≤add∗(I,∗)≤cov∗(I,∗) are trivial (actually, (1) implies that the three additivities are equal), and cov∗(I,∗)=add∗(I,∞) because an A⊆I is ⊆∗-unbounded in I iff ∀F∈I∗∃A∈A∣F∩A∣=ω. This argument can be “dualised”, and we obtain the equalities cof∗(I,∞)=cof∗(I,+)=cof∗(I,∗)=non∗(I,∗).
(3)
The remaining cardinal coefficients in a diagram (where a→b stands for a≤b and D=[ω]ω,I+,I∗):
{diagram}
(4)
If I is tall then cov∗(I,∞)>ω. If I is Borel and cov∗(I,+)=ω, then no forcing notion can +-destroy I. If I is Borel and cov∗(I,∗)=ω (i.e. I is not a P-ideal), then no forcing notion can ∗-destroy I (see also in Section 1). The first statement is trivial. To show the second and third, notice that if I is Borel, then “(An)n∈ω witnesses cov∗(I,+/∗)=ω” is a {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{1} property.
(5)
If I≤KBJ are Borel, then (5a-i) cov∗(I,∞)≥cov∗(J,∞) and (5a-ii) non∗(I,∞)≤non∗(J,∞); and (5b-i) if P cannot destroy I then P cannot destroy J either, and dually, (5b-ii) if ⊩P[ω]ω∩V∈I then ⊩P[ω]ω∩V∈J.
(6)
If I≤KJ are Borel, then (5a-i) and (5b-i) hold, (6a)
cov∗(I,+)≥cov∗(J,+) and non∗(I,+)≤non∗(J,+); and (6b) if P cannot +-destroy I then P cannot +-destroy J either, and dually, if ⊩PI+∩V∈I then ⊩PJ+∩V∈J.
Point (6) above, more precisely the fact that K-reducibility is enough to obtain “half” of the consequences of KB-reducibility from point (5) is not so surprising after our remark on Katětov and Katětov-Blass reductions between our main examples (see after the definitions of these examples). Moreover if I=Fin, J is a P-ideal, and I≤KJ, then I≤KBJ holds as well: Fix a K-reduction f:ω→ω (that is, f−1[A]∈J for every A∈I) which is not finite-to-one and a B∈J such that f−1[{n}]⊆∗B for every n (in particular, B is infinite). Let Fn=f−1[{n}]∖B and fix an infinite element A∈I. Define g:ω→ω such that g↾Fn≡n for every n and g↾B is a bijection between B and A. Then g is a KB-reduction.
One may have noticed that ∗-destructibility, more precisely, the effect of reducibility between ideals on ∗-destructibility is missing from the list of our basic observations above. We will need a more general notion of reduction between ideals, see Section 7 for details.
We give a combinatorial characterisation of ∞/+/∗-destructibility of Borel ideals by forcing notions of the form PI. Unlike in the case of the original Theorem 1.1, we can work with arbitrary Polish spaces, do not have to understand trace ideals, and do not need continuous reading of names. Of course, this does not make this characterisation “better” (and it is certainly not “deeper”) but it provides a new approach to forcing indestructibility of ideals.
In [2], based on a result from [15], the authors introduced and studied the following notion: Let X be an uncountable Polish space, I be a σ-ideal on X, and J be an ideal on ω. Assuming that X is clear from the context, we say that I has the J-covering property, J-c.p. if for every I-almost everywhere infinite-fold cover(Bn)n∈ω of X by Borel set, that is, {x∈X:{n∈ω:x∈Bn} is finite}∈I, there is an S∈J (a “small” index set) such that (Bn)n∈S is still an I-a.e. infinite fold cover of X. It turned out that this property is a strong variant of forcing indestructibility: If PI is proper and I has the J-c.p., then PI cannot destroy J. In general, the covering property is stronger: Fin⊗Fin is Cohen-indestructible but M does not have the Fin⊗Fin-c.p. See [2] for more results about this property.
We show that a natural weak variant of the covering property is equivalent to forcing indestructibility, moreover, that the appropriate modifications work for +/∗-indestructibility as well.
Theorem 3.3**.**
Let J be a Borel ideal on ω, D=[ω]ω,J+, or J∗, and let I be a σ-ideal on a Polish space X such that PI is proper. Then PI cannot D-destroy J if, and only if for every sequence (Bn)n∈ω of Borel subsets of X
[TABLE]
Proof.
Let D=[ω]ω or J+ or J∗ accordingly.
The “if” direction: Assume on the contrary that ⊩PIY˚∈D and C⊩∀A∈JV∣Y˚∩A∣<ω for some C∈PI. Applying the Borel reading of names (see [43, Prop. 2.3.1]), there are a C′∈PI, C′≤C and a Borel function f:C′→D (coded in the ground model) such that C′⊩PIf(r˚I)=Y˚ where r˚I is the generic real. For n∈ω define Bn={x∈C′:n∈f(x)}. Then Bn=f−1[{A⊆ω:n∈A}] is Borel and C′={x∈X:{n∈ω:x∈Bn}∈D}∈I+. Applying our assumption, there is an S∈J such that C′′={x∈C′:∣{n∈S:x∈Bn}∣=ω}∈I+. Notice that C′′={x∈C′:∣f(x)∩S∣=ω}=f−1[{A⊆ω:∣A∩S∣=ω}] is also Borel and hence it is a condition below C′, and of course C′′⊩PI∣f(r˚I)∩S∣=ω, a contradiction.
The “only if” direction: Let (Bn)n∈ω be a sequence of Borel subsets of X such that {x:{n∈ω:x∈Bn}∈D}=C∈I+. Notice that C is Borel because g:X→P(ω), g(x)={n∈ω:x∈Bn} is a Borel function and C=g−1[D]. In particular, C∈PI, C⊩Y˚:={n∈ω:r˚I∈Bn}∈D, and hence (as PI cannot D-destroy J) there are a C′≤C and an S∈J such that C′⊩Y˚∩S=∣{n∈S:r˚I∈Bn}∣=ω, equivalently, {x∈C′:∣{n∈S:x∈Bn}∣<ω}∈I, and hence {x:∣{n∈S:x∈Bn}∣=ω}∈I+.
∎
Remark 3.4**.**
One may wonder what the exact role of CRN was in the original characterisation of forcing indestructibility of ideals (see Theorem 1.1). The ideal I satisfies the continuous reading of names, if for every Polish space Y, B∈PI, and Borel g:B→ω2, there is a C∈PI, C⊆B such that g↾C is continuous (in particular, the function f in the application of Borel reading of names above can be chosen as continuous). For example, the following properties imply CRN: (a) PI is ωω-bounding (e.g. N and [ω2]≤ω, i.e. the random and Sacks forcings); (b) I is σ-generated by closed sets (e.g. M and Kσ, i.e. the Cohen and Miller forcings); (c) the “natural” ideal generating the Hechler forcing D; (d) the ideal generating the Laver forcing L; (e) the ideal generating M(I∗) if I is a P-ideal; on the other hand, regardless its presentation, the eventually different real forcing does not have the CRN (for more details see [43, Section 3.1] and [22]).
We know that under CRN the following are equivalent: (a) PI cannot destroy J, and (b) J≰Ktr(I)↾X for every X∈tr(I)+. We show that without assuming CRN, (a) still implies (b). Assume on the contrary that f:X→ω witnesses J≤Ktr(I)↾X for some X∈tr(I)+. Then [X]δ is an I-positive Gδ set. Define the Borel sets Bn={x∈[X]δ:∃k(x↾k∈X and f(x↾k)=n)}. Now if x∈[X]δ, then ∣{n∈ω:x∈Bn}∣<ω iff f[{x↾k:k∈ω}∩X]⊆m for some m, in particular, x∈⋃m∈ω[f−1[m]]δ∈I, and hence {x∈[X]δ:∣{n∈ω:x∈Bn}∣=ω}∈I+. Applying Theorem 3.3, there is an S∈J such that {x∈[X]δ:∣{n∈S:x∈Bn}∣=ω}∈I+ but {x∈[X]δ:∣{n∈S:x∈Bn}∣=ω}=[f−1[S]]δ∈I, a contradiction.
4. Examples
In this section, we discuss some of our main examples I, their cardinal invariants non∗(I,+) and cov∗(I,+), and their (+-)destructibility. For a survey on the invariants inv∗(I,∞), see e.g. [37], [23] (for ED and EDfin), and [1] (for Nwd).
Easy examples: Fin⊗Fin, Conv, and Ran
Example 4.1**.**
When working with cardinal invariants of Fin⊗Fin we will write Fin2=Fin⊗Fin. We know that non∗(Fin2,∞)=ω, cov∗(Fin2,∞)=b, and cof∗(Fin2,∞)=d; and it is easy to show the following:
(1)
non∗(Fin2,+)=d and cov∗(Fin2,+)=ω.
(2a)
P destroys Fin⊗Fin iff P adds dominating reals.
(2b)
No forcing notion can +-destroy Fin⊗Fin.
Example 4.2**.**
We know that non∗(Conv,∞)=ω and cov∗(Conv,∞)=c. We show the following:
(1)
non∗(Conv,+)=ω and cov∗(Conv,+)=c.
(2)
If a forcing notion adds new reals then it +-destroys Conv.
(1): A countable base of the topology of Q witnesses the uniformity. Now if xnα→yα are convergent sequences, xnα∈Q and α<κ<c, then there is a (nontrivial) convergent sequence zn→z, zn,z∈[0,1]∖{yα:α<κ}, and if Q∋rknk→∞zn such that R={rkn:n,k∈ω} has no accumulation points apart from the zn’s and z, then R∈Conv+ witnesses that {{xnα:n∈ω}:α<ω} cannot be a covering family.
(2): Notice that if P adds a new real then it adds a (nontrivial) sequence (zn)n∈ω of new reals converging to a new real z, and hence the argument above shows that P+-destroys Conv.
Example 4.3**.**
We know that non∗(Ran,∞)=ω and cov∗(Ran,∞)=c; and applying Ran≤KBConv (see e.g. [27]), the last example, and Observations 3.2 (5) and (6), we know that
(1)
non∗(Ran,+)=ω and cov∗(Ran,+)=c;
(2)
if a forcing notion adds new reals then it +-destroys Ran.
Problem 4.4**.**
Can we characterise those Borel ideals which are (+-)destroyed by every forcing notion introducing a new real? (Loosely speaking, we would like to characterise those Borel ideals I such that ZFC proves cov∗(I,∞/+)=c.) Does there exist a tall Borel ideal I which is destroyed by every forcing notion introducing a new real but I is not +-destroyed by all these forcing notions?
Around ED and EDfin
We know (see [23]) that non∗(ED,∞)=ω, cov∗(ED,∞)=non(M), and cof∗(ED,∞)=c.
Proposition 4.5**.**
**
(1a)
non∗(ED,+)=cov(M);
(1b)
cov∗(ED,+)=non(M);
(2)
P* +-destroys ED iff P destroys ED iff P adds an eventually different real (that is, an f∈ωω such that ∣f∩g∣<ω for every g∈ωω∩V).*
Proof.
(1a): Let us recall the following characterisations of cov(M) (see [3, Lem. 2.4.2, Thm. 2.4.5]):
Let C={S∈ω([ω]<ω):∑n∈ω∣S(n)∣/n2<∞} (for now let 1/0=1). Then
[TABLE]
[TABLE]
To show non∗(ED,+)≤cov(M), fix an F⊆ωω witnessing the above characterisation. For every f∈F define Xf∈ED+ as follows
[TABLE]
Let A∈ED, we show that there is an f∈F such that ∣A∩Xf∣<ω, and hence non∗(ED,+)≤∣F∣=cov(M). As columns have finite intersection with every Xf, we can assume that A is of the form ⋃{{n}×Fn:n∈ω} where Fn∈[ω]m for some fixed m∈ω. Let SA:ω→[ω]<ω,
[TABLE]
Then SA∈C and hence there is an f∈F such that f(n)∈/SA(n) for almost all n, and so ({n}×Fn)∩Xf=∅ for almost all n, i.e. ∣A∩Xf∣<ω.
Conversely, we show that if a family {Xα:α<κ} witnesses non∗(ED,+) then there is a family D of dense subsets of C, ∣D∣=κ such that no filter on C is D-generic. We know that for every α there are infinitely k such that (Xα)k=∅. Interpret C now as (<ωω,⊇) and for every α and n let Dα,n={s∈C:∃k≥ns(k)∈(Xα)k}. Then Dα,n is dense in C, and if G⊆C is a {Dα,n:α<κ,n∈ω}-generic filter, then g=⋃G:ω→ω (in particular, g∈ED) and ∣g∩Xα∣=ω for every α, a contradiction.
(1b): We already know that cov∗(ED,+)≤cov∗(ED,∞)=non(M). To show the reverse inequality, we will need the following characterisation (see [3, Lem. 2.4.8]):
[TABLE]
Notice that there is a family witnessing cov∗(ED,+) of the form {{n}×ω:n∈ω}∪{fα:α<κ} where fα:ω→ω. For every α define Sα∈C, S_{\alpha}(n)=(X_{f_{\alpha}})_{n}=\big{[}f_{\alpha}(n)-\lfloor\sqrt{n}\rfloor,f_{\alpha}(n)+\lfloor\sqrt{n}\rfloor\big{]}\cap\omega. Using the same argument we used in (1a), one can easily show that {Sα:α<κ} satisfies the conditions in the above characterisation of non(M), and hence non(M)≤κ.
(2): The first “left to right” implication is trivial. The second one is basically [3, Lem. 2.4.8, (2)→(3)]. Assume that in an extension W⊇V there is an A∈[ω×ω]ω such that ∣A∩B∣<ω for every B∈ED∩V. By shrinking A can assume that A={(n,kn):n∈E}, E∈[ω]ω is an infinite partial function. Let E={n0<n1<…}, FP={finite partial functions ω→ω}, and let f∈ωFP∩W, f(m)={(ni,kni):i≤m}. We show that f is an eventually different real over ωFP∩V. Let g∈ωFP∩V and assume on the contrary that f(m)=g(m) for infinitely many m. We can assume that ∣dom(g(m))∣=m+1 for every m. Define the infinite partial function g′∈V by recursion as follows: Let dom(g(0))={m0} and g′(m0)=g(0)(m0). If we already have m0,m1,…,mn−1 and g′ is defined on these entries, then pick an mn∈dom(g(n))∖{m0,m1,…,mn−1} and define g′(mn)=g(n)(mn). It is trivial to show that ∣A∩g′∣=ω, a contradiction.
Finally we show that if f∈ωω∩W is an eventually different real over V then ED∩V is +-destroyed in W. Fix an interval partition (Pn)n∈ω in V such that ∣Pn∣=n+1, and fix enumerations {(ain,bin):i∈ω}=Pn×ω. Define X={(n,i):f(ain)=bin}∈ED+∩W (because ∣(X)n∣=n+1). We claim that X+-destroys ED∩V. Let g∈ωω∩V and assume on the contrary that ∣X∩g∣=ω. Define g′∈ωω∩V as follows: If g(n)=i then let g′↾Pn≡bin. It follows that f(a)=g′(a) for infinitely many a, a contradiction.
∎
Cardinal invariants of EDfin are more intriguing (see [23]): add∗(EDfin,∞)=ω, cof∗(EDfin,∞)=c, s≤cov∗(EDfin,∞), non∗(EDfin,∞)≤r (where s and r are the slitting and reaping numbers), furthermore, cov(M)=min{d,non∗(EDfin,∞)}, and non(M)=max{cov∗(EDfin,∞),b}.
Proposition 4.6**.**
**
(1)
non∗(EDfin,+)=non∗(EDfin,∞)* and cov∗(EDfin,+)=cov∗(EDfin,∞);*
(2)
P* +-destroys EDfin iff P destroys EDfin iff P adds an eventually different infinite partial function f⊆Δ iff P adds an eventually different infinite partial function bounded by a ground model real.*
Proof.
(1): We know that non∗(EDfin,+)≥non∗(EDfin,∞) and cov∗(EDfin,+)≤cov∗(EDfin,∞). For every n∈ω fix a partition (Δ)(n+1)2−1={((n+1)2−1,i):i<(n+1)2}=⋃k≤nPkn such that ∣Pkn∣=n+1 for every k, and define the following functions:
(i)
f:Δ→[Δ]<ω, f(n,k)=Pkn;
(ii)
α:[Δ]ω→EDfin+, α(X)=⋃{f(n,k):(n,k)∈X};
(iii)
β:EDfin→EDfin, β(A)={(n,k):f(n,k)∩A=∅}.
Now, if X⊆[Δ]ω witnesses non∗(EDfin,∞) then α[X]={α(X):X∈X} witnesses non∗(EDfin,+): Otherwise, if A∈EDfin and ∣A∩α(X)∣=ω for every X∈X, then ∣β(A)∩X∣=ω for every X∈X, a contradiction. Similarly, if A⊆EDfin witnesses cov∗(EDfin,+) then β[A] witnesses cov∗(EDfin,∞): Otherwise, if Y∈[Δ]ω has finite intersection with all β(A), then α(Y)∈EDfin+ has finite intersection with all Y∈A, a contradiction.
(2): All “left to right” implications are trivial. Assume now that V⊆W is an extension and g∈W is an eventually different infinite partial function over V, g≤h∈ωω∩V. We can assume that h is strictly increasing. It is straightforward to show that X={(h(n),g(n)):n∈ω}⊆Δ is also an eventually different infinite partial function over V, and hence α(X)+-destroys EDfin∩V.
∎
Around S
We know that non∗(S,∞)=ω, cov∗(S,∞)=non(N), and cof∗(S,∞)=c.
(1a): Let F={F∈[<ω2]<ω∖{∅}:∑t∈F2−∣t∣≤1/4} and for every F∈F define the clopen set UF=⋃t∈F{x∈ω2:t⊆x} and the family UF={C∈Ω:C∩UF=∅}. Notice that UF∈S+ because if X⊆ω2 is finite then UF∪X is a closed set of measure ≤1/4<1/2 and hence there is a clopen set C of measure 1/2 inside its complement, therefore UF⊈⋃x∈XCx. We show that for every A∈S there is an F∈F such that A∩UF=∅, i.e. that {UF:F∈F} witnesses non∗(S,+)=ω. Let {xi:i<k}⊆ω2 be finite. Pick finite initials ti⊆xi such that ∑i<k2−∣ti∣≤1/4 and let F={ti:i<k}∈F, then UF∩⋃i<kCxi=∅ (because xi∈UF for every i, and C∩UF=∅ for every C∈UF).
(1b): Let λ∗ be the Lebesgue outer measure on ω2. We show that if λ∗(Y)<1/2 then there is an S-positive D⊆Ω such that ∣Cy∩D∣<ω for every y∈Y. This implies that non(N)≤cov∗(S,+), and the reverse inequality follows from cov∗(S,+)≤cov∗(S,∞)=non(N).
Fix an increasing sequence of clopen sets Un such that Y⊆⋃n∈ωUn and the measure of this union is less then 1/2−ε for some ε>0. Enumerate {Vn:n∈ω} all clopen sets of measure <ε and for each n pick a Cn∈Ω such that Cn∩(Un∪Vn)=∅ (this is possible because Un∪Vn is a closed set of measure <1/2). The set D={Cn:n∈ω} is S-positive because if X⊆ω2 is finite, then X⊆Vn for some n, hence Cn∈/⋃x∈XCx (and so D⊈⋃x∈XCx). Also, if y∈Y, then y∈Un in particular y∈/Cn for every large enough n, and hence ∣D∩Cy∣<ω.
(2): The first “only if” implication is trivial.
Now assume that P destroys S. We will need the following result (see [37, Lem. 1.6.3 (b)]): If λ∗(Y)>1/2 then for every infinite D⊆Ω there is a y∈Y such that ∣D∩Cy∣=ω. This implies that ⊩Pλ∗(ω2∩V)≤1/2. Notice that ⊩P“λ∗(ω2∩V)=0 or 1” holds for every P: If V[G]⊨λ∗(ω2∩V)<1 then there is a compact set C∈V[G] of positive measure which is disjoint from V, and hence, applying the [math]-1 law, the Fσ tail-set {x∈ω2:∃y∈C∣x△y∣<ω} generated by C is of measure 1, and of course, this set is also disjoint from V. We conclude that ⊩Pω2∩V∈N.
Finally, the last implication follows from the result we used in (1b).
∎
Around Nwd
We know (see [1]) that non∗(Nwd,∞)=ω, cov∗(Nwd,∞)=cov(M), and cof∗(Nwd,∞)=cof(M).
Proposition 4.8**.**
**
(1)
(see [30] and [1])* non∗(Nwd,+)=ω and cov∗(Nwd,+)=add(M).*
(2)
If P adds Cohen reals then it destroys Nwd. If P+-destroys Nwd then it adds both dominating and Cohen reals.
(2-cd)
(see [1])* If P adds a Cohen real and ⊩P“Q˚ adds a dominating real”, then P∗Q˚+-destroys Nwd.*
(2-dc)
Adding first a dominating then a Cohen real does not necessarily +-destroy Nwd: If P has the Laver property then P cannot destroy Nwd and P∗C cannot +-destroy Nwd.
Proof.
(1): A countable base of the topology witnesses non∗(Nwd,+)=ω, and reformulating a result from [30] (see also in [1]) shows that cov∗(Nwd,+)=add(M).
(2): We already know that C=PM destroys tr(M)≃Nwd, and hence adding a Cohen real destroys Nwd.
First we show that if P+-destroys Nwd, then P adds a dominating real. For now let Nwd={A⊆<ω2:∀s∃t(s⊆t and A∩t↑=∅)}, and let X˚ be a P-name such that ⊩PX˚∈Nwd+ and ⊩P∣X˚∩A∣<ω for every A∈Nwd∩V. We can assume that X˚ is dense in <ω2, that is, ⊩P∀s∃ts⊆t∈X˚ (because there is a P-name t˚ for a node in <ω2 such that ⊩P“X˚ is dense in t˚↑” and the proof below can be easily modified to t˚↑≃<ω2). Let f˚ be a P-name for an element of ωω such that
[TABLE]
We claim that f˚ is dominating over ωω∩V: Let g∈ωω∩V be strictly increasing and satisfying g(0)>1. Fix an infinite maximal antichain {an:n∈ω}⊆<ω2 such that ∣an∣=g(n), and let A=<ω2∖⋃{an↑:n∈ω}∈Nwd. It is easy to see that ∣A∩n2∣≥2n−1 for every n. We know that in the extension A∩X˚⊆≤N2 for an N∈ω. Now if n>N then we can pick a point s∈A∩n2 such that s⊈ak for k<n. As there can be no ak below s, K=min{k:s⊆ak}<ω, and ∣aK∣>K≥n. In particular, s↑∩<∣aK∣2={t:s⊆t and ∣t∣<∣aK∣}⊆A, and hence f˚(n)≥min{∣t∣:s⊆t∈X˚}≥∣aK∣=g(K)≥g(n).
Now we show that if P+-destroys Nwd, then it adds Cohen reals. Let X˚ be as above, then in the extension [X˚]δ=∅. We show that every element y of this set is Cohen over V: If C⊆ω2 is a closed and nowhere dense set coded in V, then there is a tree T⊆<ω2, T∈Nwd such that C=[T]δ=[T]:={x∈ω2:∀nx↾n∈T}, in particular ∣X˚∩T∣<ω and hence y∈/[T].
(2-cd): This is basically [1, Thm. 1.4 (ii)]. Let G be (V,P)-generic, c∈ω2∩V[G] be Cohen over V, H be (V[G],Q˚[G])-generic, and d∈ωω∩V[G,H] be dominating over V[G]. Enumerate <ω2={tn:n∈ω} in V and for every n define cn∈ω2∩V[G] as cn=tn⌢(c(k):k≥∣tn∣), then cn is also Cohen over V, and let X={cn↾m:m≥d(n)}∈V[G,H]. Notice that X is dense in <ω2. Now if A∈Nwd∩V then ∣A∩{cn↾m:m∈ω}∣<ω, in particular
[TABLE]
is well defined, and fA∈ωω∩V[G]. We know that fA(n)≤d(n) for every n≥NA for some NA∈ω, and hence X∩A⊆{cn↾m:n<NA,m<fA(n)}.
(2-dc): If X˚ is a P-name, p∈P, and p⊩X˚∈[<ω2]ω, then we can assume that X˚ is either (i) an infinite chain, that is, p⊩“X˚={s˚0⊊s˚1⊊…} and s˚k⊆x˚∈ω2 for every k”, or (ii) a converging antichain, that is, there is a P-name y˚ such that p⊩“y˚∈ω2 and ∀n∀∞s∈X˚y˚↾n⊆s”.
In the first case, as P satisfies the Laver-property, x˚ cannot be a Cohen real over V, and hence a q≤p forces that x˚∈C for some nowhere dense closed set C=[T]∈V, T∈Nwd∩V, and so q⊩∣X˚∩T∣=ω.
In the second case, we can shrink X˚ and assume that it has an enumeration X˚={s˚k:k∈ω} and there is a sequence (n˚k)k∈ω of P-names for an increasing sequence in ω such that p forces the following:
[TABLE]
Now define the P-names E˚m as follows: p forces that if m∈[n˚k,n˚k+1) and m>∣s˚k∣ then E˚m={y˚↾m}, and if m∈[n˚k,n˚k+1) and m≤∣s˚k∣ then E˚m={y˚↾m,s˚k↾m}. Now E˚m⊆m2 is of size ≤2, hence applying the Laver property, there are a q≤p and a sequence Fm⊆[m2]≤2 in V such that ∣Fm∣=m+1 and q⊩E˚m∈Fm for every m, in particular, if Fm′=⋃Fm∈[m2]≤2m+2 then q⊩E˚m⊆Fm′ for every m. Let A={t∈<ω2:∀m≤∣t∣t↾m∈Fm′}. Then A∈Nwd because for every t∈<ω2 there is a t′⊇t such that t′∈/F∣t′∣′ and hence no extension of t′ belongs to A, and of course q⊩X˚⊆A.
We show that P∗C cannot +-destroy Nwd. First notice that if X˚ is a C-name for a dense subset of <ω2, then there is a countable family {Yn:n∈ω} of dense subsets of <ω2 such that if an A∈Nwd has infinite intersection with all Yn (there is always such an A because each Yn is dense) then ⊩C∣A∩X˚∣=ω. Why? Enumerate C={qn:n∈ω} and define Yn={s∈<ω2:∃q′≤qnq′⊩s∈X˚}. It is easy to see that this family satisfies our requirements. Now if X˚ is a P∗C-name and (p,q)⊩X˚∈Nwd+ then we can assume that (p,q) forces that X˚ is dense (because a condition below (p,q) decides where X˚ is dense and we can work inside that cone in <ω2). Therefore there are P-names Y˚n for dense subsets of <ω2 such that p forces the following: “If A∈Nwd and ∣A∩Y˚n∣=ω for every n, then q⊩C∣A∩X˚∣=ω”. Working in VP, it is trivial to construct an antichain Z˚⊆<ω2 satisfying (♯) which has infinite intersection with all Y˚n, and hence there is an A∈Nwd∩V covering Z˚. It follows that (p,q)⊩∣A∩X˚∣=ω.
∎
Remark 4.9**.**
Notice that the proof of part (2) of the last Proposition “almost” shows that destroying Nwd requires Cohen reals: Assume that there is an X∈[<ω2]ω∩VP such that ∣X∩A∣<ω for every A∈Nwd∩V. Then either [X]δ=∅, i.e. X contains an infinite chain Y defining a real y=⋃Y∈ω2 or X contains an infinite “convergent” antichain Z defining z∈ω2 as the unique real such that ∀n∀∞t∈Zz↾n⊆t. In the first case we can use the same argument as above but the second case in unclear.
Problem 4.10**.**
Does there exist a forcing notion P which destroys Nwd but does not add Cohen reals? (This problem might be quite difficult because we know that cov∗(Nwd,∞)=cov(M) and hence iterated destruction of Nwd implies adding Cohen reals. In other words, this problem resembles to the well-known “half-a-Cohen-real” problem, see [44].)
Problem 4.11**.**
Is there any reasonable characterisation of those tall Borel ideals I such that destruction of I implies +-destruction of it? (We will show later that there are Fσ counterexamples too, e.g. I1/n.)
We will discuss analytic P-ideals later.
5. The M(I∗)- and L(I∗)-generic reals
In this section, applying Laflamme’s filter games and his characterisations of the existence of winning strategies in these games, we will characterise when the generic reals added by the Mathias-Prikry forcing M(I∗) and the Laver-Prikry forcing L(I∗) (see below) +-destroy I.
Fix an ideal I on ω. Then we can talk about infinite games of the following form (see [32] and [33]) G(X,Y,O) where X=I∗ or I+, Y=ω or [ω]<ω, and O=I∗, I+, or P(ω)∖I∗. In the nth round Player I chooses an Xn∈X and Player II responds with a kn∈Xn (if Y=ω) or with an Fn∈[Xn]<ω (if Y=[ω]<ω, respectively). Player II wins if {kn:n∈ω}∈O (if Y=ω) or ⋃{Fn:n∈ω}∈O (if Y=[ω]<ω).
Let us show that Borel Determinacy (see [35]) implies that all these games are determined if I is Borel. First of all, we recall the setting of Borel Determinacy. Fix an infinite set Γ, a nonempty tree T⊆<ωΓ without terminal nodes (the set of all possible outcomes of the game), and a set A⊆[T]={g∈ωΓ:∀ng↾n∈T}. The game G(A,T) is played by players I and II, in the nth round I chooses an xn∈Γ and II responds with yn∈Γ such that (x0,y0,x1,…,xn,yn)∈T. Player I wins if (x0,y0,…,xn,yn,…)∈A. Consider ωΓ as the power of a discrete space (in particular [T] is a closed set). We know that if A⊆[T] is Borel, then the game is determined, i.e. one of the players has a winning strategy.
Now assume that I is Borel and fix X,Y and O as above. Let Γ=P(ω) and define T accordingly, that is, (X0,F0,X1,F1,…,Xn−1,Fn−1)∈T iff Xk∈X and Fk∈[Xk]1 (if Y=ω) or Fk∈[Xk]<ω (if Y=[ω]<ω) for every k<n, and let A={g∈[T]:⋃{g(2n+1):n∈ω}∈P(ω)∖O}. Then a player has winning strategy in G(A,T) iff he has winning strategy in G(X,Y,O) (in other words, the two games are equivalent). To see that A is Borel, notice that the map α:ωP(ω)→P(ω), g↦⋃{g(2n+1):n∈ω} is Borel because the preimage of {S⊆ω:m∈S} is the open set {g∈ωP(ω):∃nm∈g(2n+1)}. In particular, A=α−1[P(ω)∖O]∩[T] is Borel.
We say that a tall ideal I is a weak P-ideal, if every sequence Xn∈I∗ (n∈ω) has an I-positive pseudointersection, i.e. cov∗(I,+)>ω. To define the next property, we need the following construction: For a fixed tall I on ω, we define I<ω on [ω]<ω∖{∅} (see [26]) as the ideal generated by all sets of the form A<ω={x∈[ω]<ω:A∩x=∅} for A∈I (notice that this family is closed for taking finite unions). We say that I is ω-diagonalisable by I-universal sets if there is a countable family {Xn:n∈ω}⊆(I<ω)+ (i.e. ∀n∀A∈I∃x∈XnA∩x=∅) such that
[TABLE]
Theorem 5.1**.**
(see [32])*
In G(I∗,[ω]<ω,I+), I has a winning strategy iff I is not a weak P-ideal, and II has a winning strategy iff I is ω-diagonalisable by I-universal sets.*
Corollary 5.2**.**
Let I be a tall Borel ideal on ω. Then the following are equivalent: (a) The M(I∗)-generic +-destroys I. (b) M(I∗)+-destroys I. (c) There is a forcing notion which +-destroys I. (d) cov∗(I,+)>ω.
Proof.
(a)→(b)→(c) is trivial and (c)→(d) follows from Observations 3.2 (4). To show (d)→(a), assume that cov∗(I,+)>ω, i.e. that I is a weak P-ideal. As G(I∗,[ω]<ω,I+) is determined, II has winning strategy in this game, i.e. Iω-diagonalisable by I-universal sets, fix such a family {Xn:n∈ω}⊆(I<ω)+. Notice that property (∗) of this family is {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{1} and hence holds in VM(I∗) as well. It is straightforward to check that the sets
[TABLE]
are dense in M(I∗) and hence the generic R⊆ω does not satisfy (∗) (that is, ∀n∃∞x∈Xnx⊆R), in particular, VM(I∗)⊨R∈I+.
∎
If I is an ideal on ω, then the associated Laver-Prikry forcingL(I∗) is defined as follows (see [7] and [26]): T∈L(I∗) if T⊆<ωω is a tree containing a (unique) stem(T)∈T such that (i) ∀t∈T(t⊆stem(T) or stem(T)⊆t), and (ii) extT(t)={n:t⌢(n)∈T}∈I∗ for every t∈T, stem(T)⊆t; and T0≤T1 if T0⊆T1.
L(I∗) is σ-centered (if stem(T0)=stem(T1) then T0∥T1) and destroys I: If G is L(I∗)-generic over V, rG=⋃{stem(T):T∈G}∈ωω, and YG=ran(rG), then YG∈[ω]ω and ∣YG∩A∣<ω for every A∈IV.
Perhaps the most important difference between M(I∗) and L(I∗) is that L(I∗) always adds dominating reals, and we know (see [13]) that for a Borel I, M(I∗) adds dominating reals iff I is not Fσ. Another important, and for us relevant, difference between the two forcing notions is that while (see above) the M(I∗)-generic object is I-positive for every tall Borel I satisfying cov∗(I,+)>ω, the L(I∗)-generic object YG is not necessarily, e.g. it is easy to see that VL(ED∗)⊨YG˚∈ED. Of course, this does not mean that L(ED∗) cannot +-destroy ED, and indeed, we already know that if P destroys ED then it +-destroys ED. We will see later that e.g. L(Z∗) cannot +-destroy Z.
We say that an ideal I is weakly Ramsey if every T∈L(I∗) has a branch x∈[T] such that ran(x)∈I+. We say that I is ω-+-diagonalisable if non∗(I,+)=ω.
Theorem 5.3**.**
(see [32])*
In G(I∗,ω,I+), I has a winning strategy iff I is not weakly Ramsey, and II has a winning strategy iff I is ω-+-diagonalisable.*
Corollary 5.4**.**
Let I be a tall Borel ideal on ω. Then the following are equivalent: (a) The L(I∗)-generic +-destroys I. (b) non∗(I,+)=ω.
Proof.
(a)→(b): First of all, (a) implies that I must be weakly Ramsey. If T∈L(I∗) does not have I-positive branches, then this holds in VL(I∗) as well because this property of T is {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{1}, in particular, T⊩YG˚∈I. As G(I∗,ω,I+) is determined, non∗(I,+)=ω.
(b)→(a): If {Xn:n∈ω}⊆I+ witnesses non∗(I,+)=ω, then this property of this family is {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{1} hence it is still a witness of non∗(I,+)=ω in the extension as well. It is easy to show that the sets
[TABLE]
are dense in L(I∗), in particular, in the extension ∣YG∩Xn∣=ω for every n, and hence YG∈/I.
∎
Remark 5.5**.**
Let us recall the Category Dichotomy (see [27]): If I has winning strategy in G((I↾Y)∗,Y,(I↾Y)+) for some Y∈I+, then ED≤KI↾X for some X∈I+; if II has winning strategy in G((I↾X)∗,X,(I↾X)+) for every X∈I+, then I↾X≤KNwd for every X∈I+. In particular, if I is Borel, then one of these cases holds.
Now one may wonder if non∗(I,+)=ω has a characterisation using the Katětov preorder and the Category Dichotomy. This does not seem doable: We need that II has winning strategy in G(I∗,ω,I+), i.e. non∗(I,+)=ω, but not necessarily in all G((I↾X)∗,X,(I↾X)+) games, e.g. if I=ED⊕Nwd (the ideal generated by disjoint copies of the two ideals, in this case on (ω×ω)∪Q) then non∗(I,+)=ω but ED=I↾(ω×ω)≰KNwd.
Notice that unlike in the case of M(I∗), the characterisation above says much less about L(I∗). In the next section, we will characterise when exactly L(I∗)+-destroys an analytic P-ideal I.
6. Fragile ideals
Definition 6.1**.**
Let I be an ideal on ω. We say that I is fragile if there are a Y∈I+ and an f:Y→[ω]<ω such that the following holds:
(a)
f witnesses I<ω≤KI↾Y, i.e. f−1[A<ω]∈I for every A∈I;
(b)
⋃n∈Hf(n)∈I+ for every infinite H⊆Y.
It is trivial to see that I<ω≤KI↾Y for every Y∈I+, simply consider the map n↦{n}. Loosely speaking, an ideal I is fragile if there is a very nontrivial reduction I<ω≤KI↾Y for some Y∈I+. Notice that for Borel ideals, being fragile is a {\vtop{\hbox{\Sigma}\hbox{\sim}}}{}^{1}_{2} property and hence absolute between V and VP.
Fact 6.2**.**
Let I be a fragile Borel ideal witnessed by f:Y→[ω]<ω. If a forcing notion P destroys I↾Y, then it +-destroys I. In particular, if I↾Y≤KI (e.g. Y=ω or I is K-uniform, that is, I↾Y≤KI for every Y∈I+), then destroying I implies +-destroying it.
Proof.
Let H˚ be a P-name such that ⊩P“H˚∈[Y]ω and ∣H˚∩A∣<ω for every A∈I∩V”. In the extension, X˚=⋃n∈H˚f(n)∈I+ because (b) is a {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{1} property of (f(n))n∈Y∈YFin; and ∣X˚∩A∣<ω for every A∈I∩V because for such an A, f−1[A<ω]∈I∩V, therefore H˚∩f−1[A<ω]={n∈H˚:f(n)∩A=∅} is finite.
∎
One can easily show that ED and Conv are not fragile. Also, it is easy to see that Fin⊗Fin and Nwd are K-uniform, and we know that Fin⊗Fin cannot be +-destroyed, and that Nwd can be destroyed without being +-destroyed, hence they are not fragile either. Our flagship example of a fragile K-uniform ideal is EDfin (see the proof of Proposition 4.6 (1)). Let us present “very” fragile summable and density ideals as well:
Example 6.3**.**
There are a tall summable ideal Ih and a tall density ideal Zμ which are fragile with Y=ω in the definition (and hence destruction of these ideals implies +-destruction of them): Fix an interval partition (Pn) such that ∣Pn+1∣=2n+1∣Pn∣, let h(k)=μn({k})=2−n if k∈Pn=supp(μn), fix partitions Pn+1=⋃k∈PnPkn+1 such that ∣Pkn+1∣=2n+1 for every k∈Pn and n∈ω, and define f(k)=Pkn+1 if k∈Pn.
We will show that fragility plays a fundamental role when discussing whether an analytic P-ideal I is +-destroyed by L(I∗) or not, but first let us show some less trivial examples of not fragile ideals.
Observation 6.4**.**
If an analytic P-ideal I=Exh(φ) is fragile witnessed by f:Y→[ω]<ω, then there are a Z⊆Y, Z∈I+ and an ε>0 such that with g=f↾Z (clearly, g also witnesses fragility of I) the following holds: (i) g−1[k<ω]={z∈Z:g(z)∩k=∅} is finite for every k∈ω, and (ii) φ(g(z))>ε for every z. Why? Fix a C∈I such that g−1[k<ω]⊆∗C for every k, and define Z=Y∖C. Then (i) holds. To show that (ii) also holds, assume on the contrary that there is a sequence z0<z1<⋯ in Z such that φ(g(zi))i→∞0. Then there is an infinite H={i0<i1<⋯}⊆ω such that g(zi0)<g(zi1)<⋯ (because of (i)) and φ(g(zim))<2−m. Now ⋃i∈Hg(zi)∈I (because φ is σ-subadditive) but this contradicts (b) in the definition of fragility.
Proposition 6.5**.**
I1/n* is not fragile.*
Proof.
We will work with the canonical isomorphic copy I={A⊆<ω2:h(A):=∑s∈A2−∣s∣<∞} of I1/n, and assume on the contrary I is fragile. Applying the last Observation, we can assume that there are a Y∈I+, an f:Y→[<ω2]<ω, and an ε>0 such that f−1[A<ω]∈I for every A∈I, f−1[(<n2)<ω] is finite for every n, and h(f(y))>ε for every y∈Y (this implies that f witnesses fragility of I).
Further restricting f, we can assume that there is a sequence m0=0<m1<⋯ such that if In:=[mn,mn+1), Bn:=⋃k∈Ink2, and Yn=Y∩Bn, then h(Yn)=1 and ∪f[Yn]⊆Bn.
Now, let Zn=mn+12, Z=⋃n∈ωZn∈I+, fix a partition Zn=⋃y∈YnZyn such that h(Zyn)=h(y), and define g:Z→[<ω2]<ω by g(z)=f(y) if z∈Zyn. It is trivial to show that g still witnesses fragility of I.
There is an N such that 2−mN<ε, and hence, by shrinking values of g, we can assume that ε<h(g(z))<2ε for every z∈⋃n≥NZn. Fix an n≥N. We claim that we can pick single points at each level in Bn, that is, we can construct an Fn={tk:k∈In} where tk∈k2 such that h(g−1[Fn<ω])≥ε/(1+2ε). Then we are done, because h(Fn)<2−mn+1 and hence A=⋃n≥NFn∈I but h(g−1[A<ω])=∞, a contradiction.
For every z∈Zn define the “vector” vz∈In[0,∞), vz(k)=h(g(z)∩k2)=∣g(z)∩k2∣⋅2−k. Now ε<∑vz=h(g(z))<2ε for every z∈Zn. Picture these vectors as columns next to each other in a In×Zn matrix. The next diagram may help following the construction of Fn below:
[TABLE]
We will construct tk by recursion on k∈In as follows: Let amn=⌈∑z∈Znvz(mn)⌉. A trivial version of Fubini’s theorem shows that there is a point tmn∈mn2 such that ∣{z∈Zn:tmn∈g(z)}∣=∣g−1[{tmn}<ω]∣≥amn, fix a Zn,mn∈[Zn]amn such that tmn∈g(z) for every z∈Zn,mn. If we are done below k, define
[TABLE]
fix a tk∈k2 such that ∣g−1[{tk}<ω]∣≥ak and a Zn,k∈[Zn∖(Zn,mn∪⋯∪Zn,k−1)]ak such that tk∈g(z) for every z∈Zn,k.
Of course, it is possible that Zn∖(Zn,mn∪⋯∪Zn,k−1)=∅. Then declare the empty sum to be [math], let tk∈k2 be arbitrary and Zn,k=∅. Now the sum of all elements in this matrix is S=∑k∈In∑z∈Znvz(k)>∣Zn∣ε=2mn+1ε, also S≤∑k∈Inak+∑“grey section”, and, by extending the grey section with all elements above it, we obtain that
[TABLE]
Therefore, 2mn+1ε<(1+2ε)∑k∈Inak, and so h(g−1[Fn<ω])≥2−mn+1∑k∈Inak>ε/(1+2ε).
∎
Proposition 6.6**.**
Z* is not fragile.*
Proof.
Let Pn=[2n,2n+1), and φ(A)=supn→∞∣A∩Pn∣/2n. Then clearly ∥A∥φ=limsupn→∞∣A∩Pn∣/2n and Z=Exh(φ). Assume on the contrary that Z is fragile, that is, by applying Observation 6.4, that there are a Y∈Z+, an f:Y→[ω]<ω, and an ε>0 such that f−1[A<ω]∈Z for every A∈Z, f−1[n<ω] is finite for every n, and φ(f(y))>ε for every y∈Y. Furthermore, we can assume the following:
(i)
f(y)⊆Pk(y) for some k(y)∈ω for every y∈Y;
(ii)
there is a sequence m(0)<m(1)<m(2)<⋯ such that Y=⋃n∈ωYn where Yn⊆Pm(n) and φ(Yn)=∣Yn∣/2m(n)>∥Y∥φ−2−n for every n;
(iii)
max{k(y):y∈Yn}<min{k(y):y∈Yn+1} for every n.
We will define a sequence A0<A1<⋯ of finite sets such that An⊆⋃y∈YnPk(y), ∣An∩Pk∣≤1 for every k, and φ(f−1[An<ω])=∣f−1[An<ω]∣/2m(n)≥εφ(Yn). In particular, if A=⋃n∈ωAn then A∈Z and ∥fn−1[A<ω]∥φ≥ε∥Y∥φ, a contradiction.
Fix an n, let {ki:i<d}={k(y):y∈Yn} be an enumeration, and partition Yn accordingly, that is, Yn=⋃i<dQi where y∈Qi iff k(y)=ki. Now in Pki we have ∣Qi∣ many sets f(y)∈[Pki]>ε∣Pki∣. Counting with multiplicity, at least ∣Qi∣ε∣Pki∣ many points are covered by these sets in Pki, and hence there must be an an,i∈Pki which is contained at least in ε∣Qi∣ many of these sets. Now if An={an,i:i<d} then
[TABLE]
and so φ(f−1[An<ω])≥εφ(Yn).
∎
In the case of tr(N), we know more, as one can show that tr(N) is K-uniform (or see e.g. [37, Thm. 2.1.17]), Fact 6.2 and the following easy one imply that tr(N) is not fragile either.
Fact 6.7**.**
The random forcing cannot +-destroy tr(N), in particular, cov∗(tr(N),+)<cov∗(tr(N),∞) in the random model.
Proof.
We know (see e.g. [3, Lem. 6.3.12]) that VB⊨λ∗(ω2∩V)>0 and hence VB⊨λ∗(ω2∩V)=1, i.e. every positive Borel set coded in VB, e.g. [X]δ for X∈tr(N)+∩VB, contains ground model reals. In the case of [X]δ, the branch associated to such a ground model real has infinite intersection with X.
∎
In the proof of the main result of this section, we will need the following technical lemma:
Lemma 6.8**.**
An analytic P-ideal I is not fragile if, and only if the following holds for a (equivalently, for every) lsc submeasure φ generating I: IFε∈(0,∥ω∥φ), Yn∈I+, and fn:Yn→Hφ,ε:={F∈[ω]<ω:φ(F)>ε} such that fn−1[{H}]∈I for every n∈ω and H∈[ω]<ω, THEN there is an A∈I such that fn−1[A<ω]∈I+ for every n.
Proof.
Assume first that I is fragile witnessed by an f:Y→[ω]<ω. By Observation 6.4, we can assume that ran(f)⊆Hφ,ε for some ε>0, therefore the trivial sequence fn=f witnesses that the second statement fails.
Conversely, assume that I=Exh(φ) and that the second statement does not hold, that is, there are Yn∈I+ and fn:Yn→Hφ,ε for some ε>0 such that fn−1[{H}]∈I for every n and H, and ∀A∈I∃nA∈ωfnA−1[A<ω]∈I. We can assume that I is tall, otherwise it is trivially fragile. By shrinking the values of these functions, we can assume that φ(fn(y))≥ε for every n and y∈Yn but φ(F)<ε for every F⊊fn(y) (this can be show by recursively removing points from fn(y) until we can). Let An={A∈I:nA=n}. Then I=⋃n∈ωAn and hence there is an N such that AN is ⊆∗-cofinal in I. Then
[TABLE]
holds, in particular, the set Bad={k∈ω:fN−1[{k}<ω]∈I+} is finite (otherwise there was an infinite B∈I such that fN−1[{k}<ω]∈I+ for every k∈B).
Now, fix a C∈I which almost contains fN−1[{k}<ω] for every k∈ω∖Bad, and define Y=YN∖(C∪fN−1[P(Bad)])∈I+ and f:Y→[ω]<ω, f(y)=fN(y)∖Bad. Then f witnesses I<ω≤KI↾Y because if B∈I and m is as in (⋆) then f−1[B<ω]⊆f−1[m<ω]∪f−1[(B∖m)<ω] where f−1[m<ω]∈I because f(y)∩Bad=∅ for every y∈Y, and f−1[(B∖m)<ω]∈I because of (⋆).
It is left to show that ⋃n∈Hf(n)∈I+ for every H∈[Y]ω (then f witnesses that I is fragile). By removing C from YN, we ensured that f−1[{k}<ω] and hence f−1[k<ω] is finite for every k. In particular, if H={a0<a1<⋯}⊆Y is infinite, then we can assume that f(a0)<f(a1)<⋯. To finish the proof we show that there is an ε′>0 such that φ(f(y))≥ε′ for every y∈Y (and hence ∥⋃i∈ωf(ai)∥φ≥ε′). We know that fN(y)⊈Bad for any y∈Y, and hence φ(fN(y)∩Bad)<ε. This implies that ε′=ε−max{φ(F):F⊆Bad,φ(F)<ε} is as desired.
∎
Theorem 6.9**.**
Let I be an analytic P-ideal. Then L(I∗) cannot +-destroy I iff I is not fragile.
Proof.
A trivial density argument shows that L(I∗) destroys I↾Y for every Y∈I+∩V, and hence applying Fact 6.2, if I is fragile, then L(I∗)+-destroys I.
Conversely, assume that I is not fragile. Let φ be an lsc submeasure such that I=Exh(φ), and let X˚ be an L(I∗)-name for a I-positive set, fix a T0∈L(I∗) and an ε>0 such that T0⊩∥X˚∥φ>ε. We show that there is an A∈I such that T0⊩∣X˚∩A∣=ω.
Fix a bijection e:[ω]<ω→ω and a sequence (H˚m)m∈ω of L(I∗)-names such that T0 forces the following for every m: (i) H˚m⊆X˚ and φ(H˚m)>ε, (ii) max(H˚m)<min(H˚m+1), and (iii) e(H˚m)>ℓ˚(m) where ℓ˚ is an L(I∗)-name for the generic ω→ω function.
We will use a rank argument on Q=T0∩stem(T0)↑. We say that an s∈QfavorsH˚m=E (for some E∈Hφ,ε) if
[TABLE]
Now define the rank functions ϱm on Q for every m∈ω by recursion as follows: ϱm(s)=0 if there is an Ems∈Hφ,ε such that s favors H˚m=Ems; and ϱm(s)=α>0 if ϱm(s)<α and {n:ϱm(s⌢(n))<α}∈I+. It is trivial to show that dom(ϱm)=Q.
We claim that ϱm(s)>0 whenever m≥∣s∣. Fix conditions Sk≤T0 for every k such that stem(Sk)=s and extSk(t)⊆ω∖k for every t∈Sk∩s↑. Now if m≥∣s∣ then Sk⊩k≤ℓ˚(m)<e(H˚m), and hence s cannot favor H˚m=E for any E because e(E)=k for some k.
If ϱm(s)=1 then Ym,s={n:ϱm(s⌢(n))=0}∈I+, and s⌢(n) favors H˚m=Ems⌢(n) for every n∈Ym,s. Define fm,s:Ym,s→Hφ,ε as fm,s(n)=Ems⌢(n). Notice that fm,s−1[{E}]∈I for every E because otherwise s would favor H˚m=E, and hence ϱm(s) would be [math].
Applying Lemma 6.8, there is an A∈I such that fm,s−1[A<ω]∈I+ whenever ϱm(s)=1. We claim that T0⊩∣X˚∩A∣=ω. Otherwise, there is a T≤T0 with stem s forcing X˚∩A⊆M for some M∈ω. Fix an m≥M,∣s∣, then ϱm(s)>0 and hence there is a t∈T above its stem of m-rank 1 (this can be shown by induction on ϱm(s)). As fm,t−1[A<ω]∈I+, we know that there is an n∈extT(t)∩fm,t−1[A<ω], in particular, t⌢(n) favors H˚m=fm,t(n)=Emt⌢(n)⊆ω∖m⊆ω∖M and this set has nonempty intersection with A. If T′≤T↾(t⌢(n)) forces H˚m=Emt⌢(n) then T′⊩X˚∩A⊈M, a contradiction.
∎
Unfortunately, it is still unclear what happens under iterations:
Problem 6.10**.**
Let I be an analytic P-ideal which is not fragile. Is it true that finite support iterations of L(I∗) cannot +-destroy I? Or at least, is cov∗(I,+)<cov∗(I,∞) consistent? (We have seen that for I=tr(N), this strict inequality holds in the random model.) Similarly, one can ask about possible separations of the uniformity numbers.
7. Remarks on ∗-destruction
Let us begin with a short introduction to (Borel) Tukey connections using Fremlin’s notations (for more details, see [20] or [4]): A triple R=(A,R,B) is a (supported) relation if R⊆A×B, A=dom(R), B=ran(R), and ∄b∈B∀a∈AaRb (where aRb stands for (a,b)∈R). The relation R is Borel if A,B⊆ωω and R are Borel sets. For a given R=(A,R,B), a set X⊆A is R-unbounded if there is no b∈BR-above every a∈X, and a Y⊆B is R-cofinal if for every a∈A there is a b∈Y such that aRb. We define the unbounding and dominating numbers of R as follows:
[TABLE]
Every cardinal invariant from Cichoń’s diagram (see [4]) and from above can easily be written of this form, for example cov(M)=d(ω2,∈,M), d=d(ωω,≤∗,ωω), add(N)=b(N,⊆,N), non∗(I,∞)=b([ω]ω,∈,I)=b([ω]ω,Rii,I), and cov∗(I,+)=d(I+,∈,I)=d(I+,Rii,I) where XRiiA iff ∣X∩A∣=ω, etc. Notice that each unbounding number is actually a dominating number and vice versa: If R⊥=(B,¬R−1,A) then b(R⊥)=d(R) and d(R⊥)=b(R). Furthermore, all these underlying relations can be seen as Borel (in the cases of M, N, and I we can use natural codings of nice bases of these ideals).
Fremlin and Vojtáš isolated a method of comparing cardinal invariants of these forms (see [19] and [42]), it turned out that most of the known inequalities can be proved by this method, and most importantly, applying this approach we immediately obtain more than “just” inequalities between cardinal invariants. For given (Borel) R0=(A0,R0,B0) and R1=(A1,R1,B1), we say that R0 is (Borel) Tukey-reducible to R1, R0≤(B)TR1,444Some authors, including of [4] and [14], would write R1≤TR0 here. if there are (Borel) maps α:A0→A1 and β:B1→B0 such that aR0β(b) whenever α(a)R1b, in a diagram:
{diagram}
We use the equivalence notation ≡(B)T for bireducibilities.
Now if R0≤TR1 then clearly
[TABLE]
If R0≤BTR1 then we know more but first we need the following definitions: Let P be a forcing notion and R=(A,R,B) be a Borel relation. We say that P is R-bounding if ⊩P∀a∈A∩V[G˚]∃b∈B∩VaRb, i.e. B∩V remains R-cofinal in VP; and we say that P is R-dominating if ⊩P∃b∈B∩V[G˚]∀a∈A∩VaRb, i.e. A∩V is R-bounded in VP. For example, P adds Cohen reals iff it is (M,∋,ω2)-dominating, P is ωω-bounding iff it is (ωω,≤∗,ωω)-bounding, ⊩Pω2∩V∈/N iff P is (N,∋,ω2)-bounding555Notice that, if P is (N,∋,ω2)-bounding, then it is not (ω2,∈,N)-dominating, but the reverse implication requires that P satisfies some sort of homogeneity., P+-destroys I iff it is (I,¬Rii,I+)-dominating, and P∗-destroys I iff it is (I,¬Rii,I∗)-dominating iff it is (I⊆∗,I)-dominating, etc.
It is easy to see that if R0≤BTR1 then
[TABLE]
For example, now we can add the “missing” last point to Observations 3.2:
Observation 7.1**.**
Let I and J be Borel ideals and assume that (I,⊆∗,I)≤BT(J,⊆∗,J), that is, there are Borel functions α:I→J and β:J→I such that for every A∈I and B∈J, α(A)⊆∗B implies A⊆∗β(B). Then cof∗(I,∞)=non∗(I,∗)≤non∗(J,∗)=cof∗(J,∞) and add∗(I,∞)=cov∗(I,∗)≥cov∗(J,∗)=add∗(J,∞); and if P cannot ∗-destroy I then P cannot ∗-destroy J either, and dually, if ⊩PI∗∩V∈I then ⊩PJ∗∩V∈J.
Example 7.2**.**
Let I be a Borel ideal. The identity maps show that (I,¬Rii,[ω]ω)≤BT(I,¬Rii,I+) holds. Conversely, if I is fragile with Y=ω is the definition, then a trivial modification of the proof of Proposition 4.6 shows that (I,¬Rii,I+)≤BT(I,¬Rii,[ω]ω) also holds, and so non∗(I,+)=non∗(I,∞), cov∗(I,+)=cov∗(I,∞), if P destroys I then it +-destroys I, and if ⊩P[ω]ω∩V∈/I then ⊩PI+∩V∈/I.
Concerning analytic P-ideals and their ∗-destructibility, we know (basically [9, Lem. 3.1]) that (I,⊆∗,I)≤BT(ωω,∈∗,Slm) for every such ideal where Slm=∏n∈ω[ω]≤n is the family of slaloms on ω (equipped with the product topology where [ω]≤n is discrete) and f∈∗S iff f(n)∈S(n) for almost every n; and (see [20, Cor. 524H]) that (ωω,∈∗,Slm)≡BT(N⊆,N). In particular, if I is tall, then
[TABLE]
[TABLE]
[TABLE]
The question whether these inequalities and implications are actually equalities and equivalences for every tall analytic P-ideal is still open, but there are some partial results (see also after Corollary 7.4). An lsc submeasure φ is summable-like if there is an ε>0 such that for every δ>0 we can pick a sequence (Fk) of pairwise disjoint finite sets and an m∈ω such that (i) φ(Fk)<δ for every k and (ii) φ(⋃k∈HFk)≥ε for every H∈[ω]m. We say that an analytic P-ideal I is summable-like if I=Exh(φ) for some summable-like submeasure φ (which implies that if I=Exh(ψ) then ψ is also summable-like, this follows from [5, Rem. 3.3]). For example, summable ideals which are not trivial modifications of Fin and tr(N) (see [5]) are summable-like. Also, if I↾X is summable-like for some X∈I+, then I is summable-like too. The next result is a special case of [41, Thm. 3.7(ii)].
Proposition 7.3**.**
(ωω,∈∗,Slm)≤BT(I,⊆∗,I)* for every summable-like ideal I, and hence these relations are BT-equivalent.*
Proof.
For a strictly increasing mˉ=(mn)n∈ω∈ωω let Slm(mˉ)=∏n∈ω[ω]≤mn be the family of mˉ-slaloms, and define the relation (ωω,∈∗,Slm(mˉ)) as in the case of mn=n.
(ωω,∈∗,Slm(mˉ))≤BT(ωω,∈∗,Slm) is trivial. Conversely, fix a bijection j:ω→<ωω; for f∈ωω let f′∈ωω, f′(n)=j−1(f↾mn+1); and for S∈Slm(mˉ) and n∈[mk,mk+1) let
[TABLE]
and if n∈[0,m0) then let S′(n)=∅. Notice that if n∈[mk,mk+1) then ∣S(k)∣≤mk so ∣S′(n)∣≤mk≤n for each n, hence S∈Slm.
Now if f′∈∗S, f′(k)=j−1(f↾mk+1)∈S(k) for k≥K, then for every such k and n∈[mk,mk+1) we have f(n)=(f↾mk+1)(n)=j(f′(k))(n)∈S′(n), and hence f∈∗S′.
∎
Let I=Exh(φ) and ε>0 from the definition of summable-likeness. For every n pick a sequence (Fkn)k∈ω of pairwise disjoint finite sets and an mn∈ω to δ=2−n, that is, φ(Fkn)<2−n for every n,k, and φ(⋃{Fkn:k∈H})≥ε for every H∈[ω]mn. We can assume that mˉ=(mn)n∈ω is strictly increasing and, by shrinking the sequences (Fkn)k∈ω, that Fkn∩Fk′n′=∅ whenever n=n′ or k=k′.
We will define a reduction (ωω,∈∗,Slm(mˉ))≤BT(I,⊆∗,I). For g∈ωω let Ag=⋃{Fg(n)n:n∈ω}, then Ag∈I because lsc submeasures are σ-subadditive; and for B∈I let SB(n)={k:Fkn⊆B} if this set is of size <mn, and SB(n)=∅ otherwise. Notice that for almost every n (say for n≥NB), we defined SB(n) according to the first option because otherwise there were X∈[ω]ω and Hn∈[ω]mn (n∈X) such that Fkn⊆B for every n∈X and k∈Hn, and hence B contains infinitely many pairwise disjoint sets ⋃{Fkn:k∈Hn} (n∈X) each of whom is of measure ≥ε, and hence B∈/I, a contradiction.
Now if Ag⊆∗B, then if n is large enough, say n≥M then ∀k(Fkn⊆Ag→Fkn⊆B). In particular, if n≥M,NB then Fg(n)n⊆B, and hence g(n)∈SB(n), so g∈∗SB.
∎
Corollary 7.4**.**
If I is tall and summable-like then in (Ia,Ib) the inequalities are actually equalities, and in (IIa,IIb) the implications are actually equivalences.
Concerning ∗-destructibility and combinatorics of analytic P-ideals, one of the most fundamental questions is if the above proposition, or at least the reverse inequalities in (Ia,Ib) and reverse implications in (IIa,IIb) hold for every tall analytic P-ideal.
Concerning non summable-like ideals, e.g. density ideals, in [21] (applying results due to Fremlin and Farah), the authors proved that add∗(Zμ,∞)=add(N) and cof∗(Zμ,∞)=cof(N) hold for every tall density ideal Zμ. Their proof is of purely combinatorial nature, is not via Borel Tukey connections.
Concerning Z, there are strong indications that (ωω,∈∗,Slm)≤BT(Z,⊆∗,Z) may not hold (see e.g. [20, Cor. 524H] and [34, Thm. 7]). At the same time, we already know that add∗(Z,∞)=add(N) and cof∗(Z,∞)=cof(N), and also (see [17, Thm. 6.16], based on Fremlin’s proof of these last equalities) that the “reverse” (IIa) holds for Z, that is, if Z∩V is cofinal in Z∩VP, then P has the Sacks-property. The last missing implication, (IIb) for Z is still an open problem:
Problem 7.5**.**
Does there exist a P which ∗-destroys Z but does not add a slalom capturing all ground model reals?
8. Further questions
Additional to the problems from the previous sections, here we list a couple of further questions we found interesting.
Destruction without collateral damage
Fix two Borel ideals I and J and assume that there is no “obvious” reason why ∞/+-destruction of J would imply ∞/+-destruction of I, e.g. I≰KJ↾X for any X∈J+. One may ask if we can find a forcing notion P which ∞/+-destroys J but does not ∞/+-destroy I, or even +-destroys J without destroying I, etc.
Destruction without adding unbounded reals
First of all, by applying results from [31], we show that every Fσ ideal can be +-destroyed by an ωω-bounding proper forcing notion. In [31], Laflamme showed that for every Fσ ideal I there is an ωω-bounding proper forcing notion which destroys I. This construction depends on certain parameters rather than directly on the ideal. We show that these parameters can be chosen such that the associated forcing notion +-destroys the ideal.
Let I=⋃n∈ωCn be an Fσ ideal on ω (Cn compact) and C=⋃{C∖n:C∈Cn}. Then C is compact and I={F∪C:F∈[ω]<ω,C∈C}. Using this family, we can construct (see [31, Lem. 3.2] and below) a partition (Qn)n∈ω of ω into nonempty finite sets and families En⊆P(Qn) such that
(a)
∣En∣≥n+1 and ⋂E=∅ for every E∈[En]n+1;
(b)
∀A∈I∃E∈∏n∈ωEn∣A∩⋃n∈ωE(n)∣<ω.
The forcing notion depends on these parameters (that is, on (Qn) and (En)): T∈P iff T⊆⋃k∈ω∏n<k[En]n+1 is a perfect tree (where ∏∅={∅}) such that
[TABLE]
where Tm={s∈T:∣s∣=m} stands for the mth level of T. Then P destroys I because if e∈∏n∈ω[En]n+1 is the generic real, then ⋃n∈ω⋂e(n)∈[ω]ω has finite intersection with every A∈I∩V. The nontrivial part (see [31, Thm. 3.1]) is that P is proper and ωω-bounding.
Observe that the sequences Qn′:=Qn+1 and En′:=En+1 satisfy (a) and (b) above (on ω∖Q0 with I↾(ω∖Q0)), and hence give rise to an analogous poset P′. If e′ is a P′-generic over V, then E∩⋂e′(n)=∅ for every E∈En′ because e′(n)∪{E}∈[En′]≤n+2=[En+1]≤n+2. Applying
(b) in VP′ (it is a {\vtop{\hbox{\Pi}\hbox{\sim}}}{}^{1}_{2} property) we conclude that ⋃n∈ω⋂e′(n)∈I+.
In particular, if I is an Fσ ideal, then we can force b<cov∗(I,+).
Problem 8.1**.**
Which Borel ideals can be +-destroyed by ωω-bounding proper forcing notions?
More general degrees of destruction
We can define an even more general notion of destroying ideals as follows: Fix a Borel ideal I and a Borel D⊆⋃I. We say that Pcan D-destroyI if there is a p∈P such that p⊩∃D∈D∀A∈IV∣D∩A∣<ω, and of course, we can define the cardinal invariants inv∗(I,D) as well. This notion raises a plethora of questions, for example: We know that I1/n⊆Z, and hence I1/n+⊇Z+. In particular, M(Z∗)I1/n+-destroys Z. Does there exist a forcing notion P which I1/n+-destroys Z but cannot Z+-destroy Z?
Forcing with PI
Let I be a tall analytic P-ideal. What can we say about the forcing notion PI=B([ω]ω)∖I? We know that it is proper (see [43, Section 4.6]) and it clearly destroys I. Also, notice that I+∈PI is a condition and forces that I is +-destroyed, similarly, I∗ forces that I is ∗-destroyed. In other words, it seems reasonable to decompose PI into three forcing notions P(I,∞)=PI↾(I∩[ω]ω), P(I,+)=PI↾(I+∖I∗), and P(I,∗)=PI↾I∗.
Problem 8.2**.**
Can P(I,∞)+-destroy or P(I,+)∗-destroy I? If not, what can we say about their countable support iterations? Do they add dominating etc reals?
If I is not a P-ideal but cov∗(I,∞)>ω, then we can talk about the σ-ideal Iσ∋[ω]ω generated by I and the forcing notion P(I,∞)=PIσ↾(I∩[ω]ω). Similarly, if even cov∗(I,+)>ω, then we can talk about P(I,+)=PIσ↾(I+∖I∗) too. In particular, one can ask the questions above about these forcing notions as well.
Bibliography45
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] B. Balcar, F. Hernández-Hernández, M. Hrušák: Combinatorics of dense subsets of the rationals , Fund. Math. 183 (2004), pages 59-80.
2[2] M. Balcerzak, B. Farkas, S. Gła̧b: Covering properties of ideals , Arch. Math. Logic 52 (3-4) (2013), pages 279-294.
3[3] T. Bartoszyński, H. Judah: Set Theory: On the Structure of the Real Line , A.K. Peters, 1995.
4[4] A. Blass: Combinatorial cardinal characteristics of the continuum , in Handbook of set theory (editors: M. Foreman, A. Kanamori), Vol. 1, Springer, 2010, pages 395-490.
5[5] P. Borodulin–Nadzieja, B. Farkas, G. Plebanek: Representation of ideals in Polish groups and in Banach spaces , J. Symbolic Logic 80 (4) (2015), pages 1268-1289.
6[6] J. Brendle, S. Yatabe: Forcing indestructibility of MAD families , Ann. Pure Appl. Logic 132 (2-3) (2005), pages 271-312.
7[7] J. Brendle, M. Hrušák: Countable Fréchet Boolean groups: an independence result , J. Symbolic Logic 74 (3) (2009), pages 1061-1068.
8[8] J. Brendle, J. Flašková: Generic existence of ultrafilters on the natural numbers , Fund. Math. 236 (2017), pages 201-245.