Bell’s theorem on the cardinal invariant p

In this post, we shall provide a proof to a famous theorem of Murray Bell stating that MAκ(the class of σ-centered posets) holds iff κ<p.

We commence with defining the cardinal invariant p. For sets A and B, we write BA iff sup(BA)<sup(B). We say that B is a pseudointersection of a family A, if BA for all AA. Then, the cardinal p stands for the smallest size of a family A of subsets of ω such that any finite subcollection of A admits an infinite pseudointersection, while A itself does not.

(To see that p is well-defined, let A be any uniform ultrafilter on ω. Also, note that a standard diagonlization argument entails that p>0.)

Lemma. If X is a countable set, κ<p, and fi:Xωi<κ is a sequence of functions, then there exists a function g:Xω such that for all i<κ: {xXg(x)<fi(x)} is finite.
Proof. Suppose that fii<κ is as above. Without loss of generality, X=ω and fi(j)<fi(n) for all j<n<ω and i<κ. Fix a bijection π:ω×ωω.  For each i<κ and j<ω, let

  • Ai:={π(n,m)n<ω,mfi(n)}, and
  • Bj:={π(n,m)j<n<ω,m<ω}.

It is trivial to verify that iF,jJAiBj is infinite for every finite Fκ and finite Jω. In particular, every finite subset of A:={Ai,Bji<κ,j<ω} admits a pseudointersection. By max{κ,ω}<p, we then pick a pseudointersection P of A. For all j<ω, we have PBj, and hence we may let:

g(j):=min{m<ωj<n<ω,π(n,m)P}.

Finally, fix i<κ, and let us verify that J:={j<ωg(j)<fi(j)} is finite. Fix jJ. Let (n,m) be such that π(n,m)P, j<n and g(j)=m. Since m=g(j)<fi(j) and fi is increasing, we also get that m<fi(n). So π(n,m)Ai. Thus, we have shown that for every jJ, there exists some (nj,mj)PAi with j<nj. Since PAi is finite, it must be the case that J is finite. ◻

Corollary. Suppose that κ<p, and Aσαα<κ,σ<ωω is a collection of subsets of ω with the property that for every σ<ωω and I[κ]<ω, the set αIAσα is infinite.
Then there exists h:ωω such that {n<ωh(n)Ahnα} is finite for all α<κ.

Proof. Since κ<p, let us fix for every α<κ, an infinite pseudointersection Aσ of {Aσαα<κ}. For every α<κ, this induces a function fα:<ωωω as follows: fα(σ):=min{n<ω(AσAσα)n}.
By the preceding lemma, we then get a function g:<ωωω such that {σ<ωωg(σ)<fα(σ)} is finite for all α<κ. By pointwise increasing the function g, we may moreover assume that g(σ)Aσ for all σ<ωω. Finally, define h:ωω by letting h(0):=0 and, recursively, h(n):=g(hn) for all positive n<ω.

To see that h works, fix α<κ. Since {σ<ωωg(σ)<fα(σ)} is finite, let us pick a large enough m<ω such that fα(σ)g(σ) whenever σ<ωω has dom(σ)>m. In particular, (AσAσα)g(σ)Aσ whenever σ{hnm<n<ω}. Consequently, h(n)=g(hn)Ahnα whenever m<n<ω. ◻

Our next perspective is partial orders. For a poset P=P,, and a subset AP, we write:

  • A={pPaA(ap)};
  • A:={pPaA(pa)}.

Recall that A is said to be cofinal in P in case that A=P.

Definition. MAκ(C) asserts that for every partial order PC, and every sequence Dαα<κ of cofinal subsets of P, there exists a subset GP that satisfies the following two:

  1. {p}{q}G for all p,qG;
  2. GDα for all α<κ.

Observation. MA0(the class of posets) holds.
Proof. Given a poset P=P,, and  a sequence Dnn<ω of cofinal subsets of P, let us construct an order-preserving injection g:ωP by recursion on nω. Let g(0) be an arbitrary element of D0, and let g(n+1) be some element of Dn+1 such that g(n)g(n+1) (by utilizing the fact that Dn+1 is cofinal in P). Finally, put G:=g[ω].
As G, is isomorphic to ω,, we see that item (1) above is satisfied. As G=g[ω] and gn<ωDn, we get in particular that item (2) above is satisfied. ◻

Next, let us study MAκ(C) for κ>0.

Definition. We say that a poset P, is σ-centered if there exists Pnn<ω s.t. :

  1. P=n<ωPn;
  2. for all n<ω, Pn is centered, that is, {p0}{pk+1}P for any finite subset {p0,,pk+1}Pn.

Observation. MAp(the class of σ-centered posets) fails.
Proof. By definition of p, it is easy to pick a family A[ω]ω such that:

  1. for any finite subcollection FA, we have FA;
  2. A does not admit an infinite pseudointersection;
  3. |A|=p.

Next, consider the poset P,, where P:=[ω]<ω×[A]<ω, and (σ0,F0)(σ1,F1) if the following three hold:

  1. σ0σ1;
  2. F0F1;
  3. σ1σ0F0.

For any finite subset σ of ω, denote Pσ:={(σ,F)F[A]<ω}. Clearly, Pσσ[ω]<ω witnesses that P, is σ-centered. Next, for all AA and n<ω define

  • DA:={(σ,F)PAF}, and
  • Dn:={(σ,F)Pσn}.

For any (σ,F), and AA, we have (σ,F{A})DA, and hence DA is cofinal. Also, for any (σ,F) and n<ω, since F is a finite subset of A, we have FA[ω]ω, and hence we may pick some mFn, and infer that (σ,F)(σ{m},F)Dn. This shows that Dn is cofinal.

Finally, assume towards a contradiction that MAp(the class of σ-centered posets) does not fail. Then, by |{DA,DnAA,n<ω}|=p, we find a set G such that:

  1. {p}{q}G for all p,qG;
  2. GDA for all AA;
  3. GDn for all n<ω.

Let B:={σ(σ,F)G}. By clause (3) above, we see that B is infinite. Thus, to meet a contradiction, it suffices to show that for all AA, we have BA. Fix AA. By clause (2) above, let us pick (σ0,F0)(σ1,F1) such that (σ0,F0)DA and (σ1,F1)G. We claim that BA is contained in the finite set σ0. To see this, pick kBA. By definition of B then, there exists some (σ2,F2)G such that kσ2. By clause (3) above, let us pick (σ3,F3){p}{q}G.
By kσ2, and (σ2,F2)(σ3,F3), we have kσ3.
By AF0, and (σ0,F0)(σ3,F3), we have σ3σ0F0A.
Altogether, either kσ0 or kA. ◻

Lemma. For every infinite cardinal κ, the following are equivalent:

  1. MAκ(the class of σ-centered posets);
  2. MAκ(the class of σ-centered posets of size κ).

Proof. Suppose that MAκ(the class of σ-centered posets of size κ) holds and that Dαα<κ is a sequence of cofinal subset of some σ-centered poset P=P,. Let Pnn<ω witness that P is σ-centered. Let M be an elementary submodel of (H(θ),,<θ) for a large enough regular cardinal θ such that |M|=κ and PM and Dα,PnM for all α<κ and n<ω. Let Q:=PM and Qn:=QnM. It is easy to see that Qnn<ω witnesses that (Q,≤↾[Q]2) is a σ-centered poset. For all α<κ, put Eα:=DαM. By elementarity, Eα is cofinal in Q. As |Q|κ, we then infer the existence of a subset GQ such that

  1. {p}{q}G for all p,qG;
  2. GEα for all α<κ.

In particular, GDα for all α<κ, and we are done. ◻

We now arrive to the main result of this post.

Theorem (Bell, 1981). MAκ(the class of σ-centered posets) holds iff κ<p.
Proof. By all of the above, it suffices to show that if κ<p, then MAκ(the class of σ-centered posets of size κ) holds. Thus, let P=P, be some σ-centered poset of size κ, as witnessed by Pnn<ω. Without loss of generality, the set {n<ωPn=Pm} is infinite for all m<ω. This will entail that the sets Aσα defined below will either be empty or infinite.
Let Dαα<κ be a sequence of cofinal subsets of P. For any p0,p1P, let Ep0,p1:={qPq{p0}{p1} or {q}{p0}= or {q}{p1}=}.
A moment reflection makes it clear that for every rP, there exists some qEp0,p1 with rq. Thus, by |P|κ, we may assume that {Ep0,p1p0,p1P}{Dαα<κ}.

Fix α<κ.

  • Let pα be an arbitrary element of P0.
  • Next, if σ<ωω and pσα is defined, then for all n<ω, we let pσnα be an element of PnWhenever possible, we require in addition that pσnα be an element of {pσα}(Dα).

For every  σ<ωω, let Aσα:={n<ω{pσα}(Dα)Pn}.

Next, notice that for every σ<ωω, there exists some n<ω such that {pσαα<κ}Pn. As the latter is centered, we then get that for every σ<ωω and I[κ]<ω, there exists some pP such that pαI{pσα}. Since {DααI} is a finite collection of cofinal sets, it is easy to find qαI(Dα){p}. Let m<ω be such that qPm, then mαIAσα. So αIAσα is infinite.

It follows that may invoke the corollary established earlier in this post, and get a function h:ωω together with g:κω such that h(n)Ahnα whenever g(α)n<ω and α<κ. Write pα:=ph(g(α)+1)α, and then put G:={pαα<κ}.

Given α<κ, let us verify that GDα by pointing out that ph(g(α)+1)α(Dα). Indeed, we have h(g(α))Ahg(α)α and hence ph(g(α)+1)α has been defined according to the “whenever possible” case.

The same argument shows that if α<κ, then {phnαg(α)n<ω} is a linearly-ordered set. So for every α<β<κ, if we take n=max{g(α),g(β)}, then pα=ph(g(α)+1)αphn+1αPh(n) and pβ=ph(g(β)+1)βphn+1βPh(n). So {pα}{pβ} for all α<β<κ.

Finally, given α<β<κ, pick qG(Epα,pβ). Then q=pγ for some γ<κ, and hence  {pα}{pγ}, as well as {pβ}{pγ}. Recalling that qG(Epα,pβ), we conclude that q{pα}{pβ}G, as required. ◻

 

This entry was posted in Blog, Expository and tagged , . Bookmark the permalink.

2 Responses to Bell’s theorem on the cardinal invariant p

  1. Pingback: Jones’ theorem on the cardinal invariant p | Assaf Rinot

  2. Pingback: The S-space problem, and the cardinal invariant p | Assaf Rinot

Leave a Reply

Your email address will not be published. Required fields are marked *