An inconsistent form of club guessing

In this post, we shall present an answer (due to P. Larson) to a question by A. Primavesi concerning a certain strong form of club guessing.

We commence with recalling Shelah’s concept of club guessing.

Concept (Shelah). Given a regular uncountable cardinal κ and a subset Sκ, we say that CααS is a club-guessing sequence, if the following two holds:

  • Cα is a subset of α, for every αS;
  • for every club subset Dκ, there exists some nonzero αS with sup(Cα)=α such that Cα and D are alike.

Now, here are a few concrete instances of being alike:

  1. Cα=Dα;
  2. CαD;
  3. CαD, (so, CαD is bounded below α);
  4. sup({βCαDsup(Cαβ)<β})=α, and otp(Cα)=cf(α);
  5. sup(CαD)=α, and otp(Cα)=cf(α).

Note that 12345. In particular, if S holds, then S carries a club-guessing sequence. However, in contrast to , club-guessing sequences are often consequences of ZFC, hence allowing to prove ZFC results that were previously known to follow from -type assumptions (here’s a recent example) :

Theorem (Shelah). Suppose that λ<κ are given infinite regular cardinals, and S is a stationary subset of  Eλκ={α<κcf(α)=λ}.

  • if λ+<κ, then S carries a club-guessing sequence in the sense of (2) above.
  • if λ+=κ>1, then S carries a club-guessing sequence in the sense of (4) above.

To give you a taste of the flavour of the proofs of these theorems, we provide here a proof of the instance λ=1,κ=3.

Proof. Suppose that SE13 is a given stationary set. For every αS, pick a club subset Cαα of order-type ω1. We claim that there exists some club E3 such that CαEαS is a club-guessing sequence in the sense of (2) above. Suppose not. Then there exists a decreasing chain of club subsets of 3, {Eii<2}, with E0=3, such that for every i<2, and every αS, either sup(CαEi)<α, or CαEiEi+1.
Consider the club E:=i<2Ei. Let αS be an accumulation point of E (the choice is possible, since the set of accumulation points of E is a club, and S is stationary). So sup(Eα)=α, and hence Eα is a club in α. As αS, we get that cf(α)=ω1, and so a standard close-off argument shows that sup(CαE)=α. In particular, sup(CαEi)=α for every i<2. It now follows that for every i<2, CαEiEi+1. So CαEii<2 is a strictly decreasing chain of subset of Cα of length 2, contradicting the fact that otp(Cα)=ω1. ◻

To see that not all instances of club-guessing are consequences of ZFC, we also mention the following. Let (c) denote the assertion that for every P-Ideal I over [ω1]0, one of the following holds:

  1. there exists a club Dω1 such that [D]0I;
  2. there exists a stationary subset Tω1 such that [T]0I=.

Theorem (Eisworth-Nyikos, 2009). PFA implies (c).
In particular, under PFA, there exists no-club guessing sequence for κ=1,λ=0, even in the weakest sense of (5) above.
Proof of the second part. Suppose that Cαα<ω1 is a club-guessing sequence, with otp(Cα)ω for every α<ω1. Let I={X[ω1]0α<ω1(CαX is finite)}.
It is clear that I is downward closed, as well as closed under finite unions. Next, we note the following:

  1. If Dω1 is a club, then there exists some limit α<ω1 for which the element Cα of our club-guessing sequence satisfies sup(CαD)=α.  As CαD[D]0, we infer that [D]0 is not a subideal of I.
  2. If Xω1 and otp(X)=ω2, then [X]0I. To see this, put α:=sup(X), and let {αmm<ω} denote some enumeration of α+1. Then recursively construct an injection f:ωX such that f(n)mnCαm. As otp(X)=ω2, such a function may indeed be constructed. Put Y:=fω. Then Y[X]0I. It follows that [T]0I for every stationary subset Tω1.

Thus, we have shown that the alternatives of (c) fails for I, and this must mean that I is not a P-ideal. To get a contradiction, we prove that it is a P-ideal:

We need to show that for any given collection {Xnn<ω}I, there exists some XI such that XnX for all n<ω. As I is downard closed, we may assume that {Xnn<ω} are mutually disjoint. Fix a bijection ψ:ωn<ωXn . Then for all α<ω1, define fα:ωω by letting for all n<ω: fα(n):=min{m<ωXnAαψm}.

As PFA implies that b>ω1, we may pick a function f:ωω such that fnf for all n<ω. Now, let X={Xnψ[f(n)]n<ω}. Then, for every n<ω, XnXψ[f(n)] is finite. Now, let us assume towards a contradiction that XI. Then, we may find some α<ω1 such that AαX is infinite. As fαf while AαXn is finite for all n<ω, let us pick a large enough n<ω such that fα(n)<f(n) and (AαX)Xn. Pick βAαXXn, and let m:=ψ1(β). Since βAαXn, we get that fα(n)>m. In particular, f(n)>m, and so by definition of X, we get that ψ(m)X, contradicting the choice of β in X. ◻.

We remark that the assumption b>ω1 was not essential in the above proof, and also that Hirschorn established the consistency of a generalization of (c) together with CH.


We now arrive to the following strong form of club guessing.

Definition (Primavesi). For a regular uncountable cardinal κ, and a stationary subset Sκ, we say that StatS holds, if there exists a sequence CααS such that:

  • Cα is a subset of α;
  • for every stationary subset TS, there exists some αT with sup(Cα)=α, for which CαT.

So instead of guessing clubs, the sequence guesses stationary subset of S, but, more importantly, it does so within these sets.

I met Alex Primavesi at the Young Set Theory 2010 meeting, and he asked me about the consistency of his principle. It didn’t take long to realize that if κ>1, then StatS fails for all stationary subsets Sκ. Let’s first dispose of this observation!

Sketch of the proof. Suppose that CααS witnesses StatS for a stationary Sκ with κ>1. Without loss of generality, we may assume that sup(Cα)=α for all αS. First, notice that for every stationary subset TS, there exists a club Cκ such that sup(CαT)<α for every αSC. Next, pick distinct regular cardinals θ,λ smaller than κ such that SEλκ is stationary. Then, construct a decreasing chain of clubs {Dii<θ} such that:

  • D0:=κ, and for all i<θ:
  • Di+1{α<καS or sup(CαSEλκDi)<α}.

Put D:=i<θDi, and T:=SEλκD. Utilize the fact that θλ, to argue that sup(CαT)<α for every αT. Consider α:=min(T). As sup(CαT)<α=sup(Cα), there must exist some βCαT, contradicting the minimality of α. ◻

My proof uses the fact that κ>1 in a crucial way (the existence of θ,λ follows from it), and hence the case κ=1 requires a different handling. After asking people who know a great deal of the constructible universe whether Statω1 holds in L, without getting definite answer, I considered another extreme – getting a model in which the nonstationary ideal on ω1 is dense, together with a variant of the standard club guessing property for ω1. I was under the impression that a Pmax-variation could produce such a model (and that Stat1 would hold there), so I wrote to Paul Larson. To my surprise, after a while, he sent me a very short and elegant disproof of Primavesi’s principle.

Proposition (Larson, 2011). StatS fails for every stationary Sκ (and every regular uncountable cardinal κ).
Proof. Suppose not, and let CααS be a StatS-sequence. Recursively define a function f:Sκ+1 by letting for all αS:f(α):={α,sup(Cαf[α])=ακ,otherwise Put T:=f[S]κ. Then TS, and we consider two cases.

  • If T is stationary, then there must exist some αT such that CαT. That is sup(CαT)<α. But then, f(α)α, i.e., αT. This is a contradiction.
  • If T is nonstationary, then there exists a club Cκ which is disjoint from T. So CS is stationary, and we may find some αCS such that CαCS. That is, sup(CαCS)<α. It follows that sup(CαT)=α, and hence f(α)=α, i.e.,αT. This contradicts the fact that TC=. ◻

 

Open Problems

We saw that Primavesi’s principle is inconsistent. Still, there are other generalizations of club guessing which I find important, and their state is currently unclear. Let me mention the following two.

Quesion A (#10, in here). Suppose that λ is an uncountable cardinal, and SE<λλ+ is stationary.
Does there exist a sequence CααS that guesses clubs in the following sense: for every club Dλ+, there exists some αS with sup(Cα)=α such that CαSD.

Some partial answers:

  • For λ regular, the answer is yes.
  • For λ singular and S such that SEcf(λ)λ+ is stationary, the answer is yes.
  • For λ singular and SEcf(λ)λ+ that does not reflect, the answer is consistently no (from very large cardinals);
  • For λ singular and SEcf(λ)λ+ that reflects on some fixed cofinality club often (i.e., there is some uncountable regular cardinal θ<λ such that {αEθλ+Sα is stationary } contains a club relative to Eθλ+), the answer is yes.
  • For λ singular and SEcf(λ)λ+ that reflects stationarily often, the answer is yes provided that ◻λ holds.

So, the remaining case is that in which λ is a singular cardinal, and SEcf(λ)λ+ merely reflects stationarily often. Notice that S (and ◻λ) necessarily fails in any model that serves as a counterexample, however, that’s not very much of a problem, as this has already been established a couple of years ago.

Question B. Suppose that λ is an uncountable regular cardinal, and that S,T are disjoint stationary subsets of Eλλ+.
Does there exist a sequence CααS that guesses clubs in the following sense: for every club Dλ+, there exists some αS with otp(Cα)=λ such that sup(CαDT)=α.

Note that by otp(Cα)=λ, we get that sup(Cαβ)<β for all βCαT. Also notice that S necessarily fails in any model that serves as a counterexample.

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

5 Responses to An inconsistent form of club guessing

  1. Pingback: Shelah’s approachability ideal, part 1 | Assaf Rinot

  2. saf says:

    For a proof on the existence of club-guessing over a stationary set concentrating on points of countable cofinality, see here.

  3. Pingback: Shelah’s approachability ideal (part 2) | Assaf Rinot

  4. Ari B. says:

    In order for the concept to be non-trivial, it seems that you need to specify α>0 somewhere in the definition.

Leave a Reply

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