PFA and the tree property at 2

Recall that a poset T, is said to be a λ+-Aronszajn tree, if it isomorphic to a poset (T,) of the form:

  1. T<λ+λ; Write Tα:={σTdom(σ)=α};
  2. for all α<λ+, Tα has size λ, say Tα={Tαii<λ};
  3. if σT and α<λ+, then there exists τTα such that στ<λ+λ;
  4. T has no cofinal branches, i.e., t is not in λ+λ for every tα<λ+Tα.

Kurepa found a connection between the Souslin problem and the above sorts of trees. In particular, he introduced the notion of an 1-Souslin tree (in the above terminology – an 1-Aronszajn tree plus requirement #5 which I will not define here) and showed that such a tree provides a counterexample to the Souslin problem.
Failing to construct such a tree, Kurepa once asked his fellow, Aronszajn, whether an 1-tree satisfying (1)–(4) exists. Aronszajn proved it does! Kurepa, who did not seem to appreciate this “poor man’s Souslin tree”, labeled this tree – as a joke – by Aronszajn tree.

So, we know that an 1-Aronszajn tree exists. How about 2-Aronszajn trees? In this post, we shall see that PFA rules them out.

Theorem (Baumgartner). PFA implies the tree property holds at 2.
That is, if PFA holds, then there are no 2-Aronszajn trees.
Proof. Assume PFA. In particular, 20=2.
Suppose towards a contradiction that (T,) is an 2-Aronszajn tree as above. Let P denote Levy’s notion of forcing for collapsing ω2 to ω1.   Let o1 and o2 denote ω1 and ω2 of V, respectively. In VP, let c:o1o2 be an increasing cofinal map. Define T:={Tc(α)α<ω1}. As P is σ-closed, Silver’s lemma together with 1<20 tells us that T admits no cofinal branches. As (T,) is a tree with no uncountable chains, we may pick a c.c.c. notion of forcing Q that specializes it. This means that in VPQ, there exists f:Tω such that f(σ)f(τ) for all στ in T.
It follows that for every α,i<ω1, the set Dα,i:={pPQ(β,n)ω2×ω,pc(α)=β &f(Tβi)=n} is dense-open. Since PQ is proper, and PFA holds, let us pick a pseudo-generic set G that meets Dα,i for all α,i<ω1.
Define d:ω1ω2 by letting c(α):=β iff there exists some pG such that pc(α)=β. Clearly, d is an increasing map, and δ:=sup(d[ω1]) has cofinality ω1.
By condition (3), let us pick some tTδ. Note that by condition (3) again, we have T:={td(α)α<ω1}T.
Define g:Tω by letting g(σ):=n iff there exists some pG such that pf(σ)=n.
Finally, pick α0<α1<ω1 such that g(td(α0))=g(td(α1)). Then we get a contradiction to the fact that td(α0)td(α1). ◻

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

5 Responses to PFA and the tree property at 2

  1. Mohammad says:

    Let PFA hold, so there are no aleph2Souslin trees. Now force with Add(omega1,1). Are there any aleph2Souslin trees in the extension.

    (A theorem of Shelah says that adding a Cohen real adds an aleph1Sosulin tree, also a result of Shelah-Stanley says that 2kappa=kappa+ and kappa++ is accessible in L, then there are kappa++Soulin trees. In “Souslin trees constructed from morasses” it is proved that if kappa is weakly inaccessible, 2<kappa=kappa and kappa+ is accessible in L, then forcing with Add(kappa,1) adds a kappa+Souslin tree. None of these results apply to the above question)

  2. Mohammad says:

    Dear Assaf,

    the question is not meaningful. The aleph2 of the extension is the aleph3 of the ground mode; I didn’t consider this fact at my question.

    • saf says:

      That’s right. PFA+(aleph2aleph1=aleph2)+diamondsuit(Ealeph2aleph3) is consistent (modulo the consistency of PFA), and so you may indeed get a Souslin tree at aleph2 after the collapse.

  3. Ari Brodsky says:

    Hi Assaf!
    Can you explain what you mean by Kurepa’s not appreciating the “poor man’s Souslin tree”? Why was it a “joke” that he named the tree after Aronszajn? It seems a reasonable thing to name the tree after its discoverer.

    P.S. Mary Ellen Rudin refers to Aronszajn trees as “fake Souslin trees” here:
    http://www.ams.org/mathscinet-getitem?mr=270322
    http://www.jstor.org/stable/2317183?origin=crossref&seq=3

    • saf says:

      I already forgot whom I heard this version of the story from, but it makes perfect sense to me. That is, Kurepa – who was hopelessly trying to construct a Souslin tree – was telling about the problem to a friend, who could produce an approximation of seemingly no interest.

Leave a Reply

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