A tail cone version of the Halpern-Läuchli theorem at a large cardinal
Jing Zhang
Abstract.
The classical Halpern-Läuchli theorem states that for any finite coloring of a finite product of finitely branching perfect trees of height ω, there exist strong subtrees sharing the same level set such that tuples in the product of the strong subtrees consisting of elements lying on the same level get the same color.
Relative to large cardinals, we establish the consistency of a tail cone version of the Halpern-Läuchli theorem at a large cardinal (see Theorem 3.1), which, roughly speaking, deals with many colorings simultaneously and diagonally. Among other applications, we generalize a polarized partition relation on rational numbers due to Laver and Galvin to one on linear orders of larger saturation.
Contents
- 1 Introduction, definitions and preliminaries
- 2 The 1-dimensional asymmetric version of the Halpern-Läuchli theorem at a weakly compact cardinal for less than κ many colors
- 3 Tail cone homogeneity
- 4 A polarized partition relation for large saturated linear orders
- 5 The Halpern-Läuchli theorem at κ does not imply κ is weakly compact
- A A proof of Lemma 3.6
††footnotetext: 2010 Mathematics Subject Classification. Primary: 03E02, 03E35, 03E55.
1. Introduction, definitions and preliminaries
Recall that a linear order (X,<) is κ-saturated if for any A,B⊂X such that ∣A∣,∣B∣<κ and A<B, then there exists c∈X such that A<c<B.
Given κ regular, define <lex on 2<κ such that s<lext iff s=t and
whenever s and t are incomparable, s(j)<t(j) for j∈κ least such that s(j)=t(j);
whenever s⊏t, t(j)=1 for j=dom(s);
whenever t⊏s, s(j)=0 for j=dom(t).
Note that this ordering is different from the Kleene-Brouwer ordering (<KB) in that for any x∈2<κ, x⌢0<lexx<lexx⌢1 while x⌢0<KB<x⌢1<KBx. We follow the convention as in Laver [11] for this ordering while in M. Džamonja, J. Larson and W. Mitchell [5], this ordering is called ”<Q”.
Then (2<κ,<lex) is κ-saturated iff κ is regular as proved in Lemma 1.7 of [5]. Note that if κ<κ=κ, there is one κ-saturated linear order of size κ up to isomorphism Qκ, whose order type is denoted as ηκ. We will prove the following in this paper.
Theorem 1.1**.**
Let d∈ω, κ inaccessible and λ infinite cardinals satisfying that λ→(κ)2κ2d (in fact λ=(2κ)+ suffices when d=1) be given. Suppose further that κ is measurable in the forcing extension by Add(κ,λ). Then
[TABLE]
and
[TABLE]
The partition relation symbol in (1.1) means the following: for any δ<κ and any f:Qκd+1→δ, there exists Xj⊂Qκ for j≤d such that type(Xj)=ηκ and ∣f′′Πj≤dXj∣≤(d+1)!.
It is known that starting with a ground model satisfying GCH containing a cardinal κ that is (κ+2d+1)-strong (or just (κ+2)-strong when d=1), we can get a forcing extension where the hypothesis in the theorem is true.
This is a higher analog of a theorem by Laver [11] (the 2-dimensional case is due to Galvin). The classical proof of Laver’s theorem is a combination of the Halpern-Läuchli theorem and a fusion type argument. Let us first review some basic definitions.
Definition 1.2**.**
A partial order (T,≺) is a tree if for each t∈T, {s∈T:s≺t} is well ordered by ≺.
Remark 1.3*.*
When there is no confusion about the tree order, we use T to refer to the tree (T,≺).
Definition 1.4**.**
Given T a tree, t∈T, α∈κ and A⊂κ,
The height of t in T is htT(t)= order type of {s∈T:s≺t}. When there is no confusion we write ht instead of htT. SuccT(t)={s∈T:ht(s)=ht(t)+1 & t≺s}, PredT(t)={t′∈T:t′≺t}.
T[t]={s∈T:s⪰t},T(α)={s∈T:ht(s)=α},T(<α)=⋃ξ<αT(ξ),T(α)[t]={s∈T(α):s⪰t}.
Definition 1.5**.**
(T,≺) is a nice tree with the height function htT if
(T,≺) is a tree.
(T,≺) has a unique root which we call root(T), that is for any t∈T, root(T)⪯t.
T is a κ-tree, namely for each s∈T htT(s)<κ, supt∈ThtT(t)=κ and for any α<κ, ∣T(α)∣<κ.
T is well-pruned, that is every maximal path through T has order type κ under ≺ and for any limit γ and t,s∈T(γ), if PredT(t)=PredT(s), then s=t.
T is perfect, namely, for any t∈T, there exists s0,s1≻t, s0,s1∈T, s0 and s1 are incomparable.
Note such trees are automatically <κ-closed, in the following sense: for any α<κ and increasing sˉ=⟨si∈T:i<α⟩, there exists an upper bound t∈T for sˉ. Also notice that if κ<κ=κ and T is a nice tree, then (T,<lex)≃Qκ. This fact will be useful later on.
Definition 1.6**.**
Given T a nice tree, we say T′⊂T is a strong subtree if T′ is a nice tree and there exists a set A∈[κ]κ with increasing enumeration ⟨ai:i<κ⟩ such that
- (1)
for any ξ<κ, T′(ξ)⊂T(aξ)
2. (2)
for each ξ<κ,s∈T′(ξ) and each t∈SuccT(s), there exists exactly one extension of t in T′(ξ+1).
A set A as above is called a witnessing level set for T′.
In search for a generalization of Laver’s theorem, two difficulties are present.
The first difficulty is the need for the Halpern-Läuchli theorem at a large cardinal. The classical Halpern-Läuchli theorem is a partition theorem about finite products of finitely branching infinite perfect trees of height ℵ0. It was first proved in [8] by J. Halpern and H. Läuchli and was used in [9] to establish the independence of the axiom of choice from the Boolean prime ideal theorem over ZF.
L. Harrington came up with a nice forcing proof of the classical Halpern-Läuchli theorem, see for example [15]. S. Shelah [13] generalized L. Harrington’s argument to show that consistently for any m∈ω and any <κ coloring of ⋃ξ<κ[2ξ]m, there exists a strong subtree T⊂2<κ such that for any ξ<κ, [T∩2ξ]m only gets finitely many colors. M. Džamonja, J. Larson and W. Mitchell in [5] further extended the result to deal with any m-sized antichains in T. They further applied the theorem to obtain a partition theorem for large saturated linear orders, generalizing a classical theorem by D. Devlin [2]. In particular they show:
Theorem 1.7** (M. Džamonja, J. Larson and W. Mitchell [5]).**
Under the hypothesis of Theorem 1.1 for d≥2, there exists td+∈ω such that (ηκ)→(ηκ)<κ,td+d and (ηκ)→(ηκ)<κ,td+−1d. In fact [ηκ]d can be classified into td+ many types and the coloring restricted on each type is constant. Here td+≥td+(2d−1)(−1+Πi<di!) where td is the d-th tangent number that can be calculated recursively as tn=Σi=1n−1(2i−12n−2)titn−i with t1=1.
Notice we can derive a version of Theorem 1.1 from the above theorem. Given f:(2<κ)d→δ, form g:[2<κ]d→δ such that for any σ0<lex⋯<lexσd−1,
g({σ0,⋯,σd−1})=f(σ0,⋯,σd−1). Find T⊂2<κ with (T,<lex) of type ηκ such that ∣g′′[T]d∣≤td+. Find sub-orders T0<lex⋯<lexTd−1 of T each of type ηκ, then ∣f(T0×⋯×Td−1)∣≤td+.
However the conclusion is not exactly that of Theorem 1.1 as
- (1)
td+ is a lot larger than d! when d is large;
2. (2)
under the hypothesis with parameter d, the conclusion is valid for exponent j for every j≤d rather than for exponent j for every j≤d+1 as in Theorem 1.1.
As the canonical types that occur in the polarized case are simpler, the method presented here will be different from that in [5] and closer to Laver’s argument in [11].
More recently in [4], N. Dobrinen and D. Hathaway considered the polarized version of the Halpern-Läuchli theorem regarding trees whose height is some large cardinal κ. They prove the equivalence of various forms of the Halpern-Läuchli theorem at the level of weakly compact cardinals and go on to establish the consistency of the asymmetric dense set version of the Halpern-Läuchli theorem (Theorem 1.14). It turns out that this polarized version is the most relevant for our purpose.
The second difficulty in generalizing Laver’s theorem is the lack of fusion arguments when the height of the tree is larger than ℵ0. One might hope to find some version of the Halpern-Läuchli theorem that finds ”large” strong subtrees. For example, in the countable case we have the following: given a Ramsey ultrafilter U on ω, a finitely branching perfect tree T of height ω and a finite coloring f, there exists a strong subtree T′ whose level set A∈U such that T′ is homogeneous with respect to f. In fact higher dimensional results are also true, which is a corollary of a theorem by Mathias [12], see [15] for a proof. One might hope for the analogous result for κ measurable with normal measure U, which will then give us ”large” strong subtrees. However, the analog is false as witnessed by the Sierpinski-style coloring 2<κ→2 ensuring that for each strong limit α<κ and each subtree T⊂2<α with 2α branches there exist two branches, i.e. nodes on level α, that get different colors. This shows that in general the witnessing level sets cannot even be stationary.
In order to tackle these two problems, we consider a version of the Halpern-Läuchli theorem, which we call the tail cone version, such that it incorporates the consequence we want to achieve with the usual fusion argument. We will establish its consistency.
We will mainly be concerned with the versions of the Halpern-Läuchli theorem considered in [4].
In Section 2, we show at the level of a weakly compact cardinal, the 1-dimensional Halpern-Läuchli theorem holds for <κ many colors, extending a previous result by Dobrinen and Hathaway [4] where the number of colors is finite. In Section 3, we establish the consistency of the tail cone version of the Halpern-Läuchli theorem. Further we show there is a dimension boost phenomenon, namely, the d-dimensional tail cone Halpern-Läuchli theorem implies the usual (d+1)-dimensional Halpern-Läuchli theorem. Then in Section 4 we prove the tail cone version of the Halpern-Läuchli theorem implies the polarized partition relation in Theorem 1.1. Finally in Section 5, we show the consistency of the Halpern-Läuchli theorem as considered in [4] being true at κ yet κ is not weakly compact, in contrast with other versions previously considered.
We end the section with more definitions, notations and preliminaries. Let κ be a strongly inaccessible cardinal.
Notation 1.8*.*
We will typically use a letter with an overhead bar to denote a tuple and a subscript to indicate the element in the tuple with the prescribed coordinate.
For example, if ⟨Aj:j∈I⟩ is a given set with an index set I, then xˉ∈ΠjAj and xj denotes the j-th element in the tuple. In particular, xj∈Aj.
Definition 1.9** ([4], [16]).**
Given a sequence of nice trees ⟨Tj:j<d⟩, M⊂Πj<dTj, and xˉ∈Πj<dTj with ξ>supj<dhtTj(xj), we say M is xˉ-ξ-dense if for each tˉ∈Πj<dTj(ξ)[xj], there exists tˉ′∈M such that tj′⪰Tjtj for each j<d. M is a somewhere dense set if there exists xˉ and ξ such that M is xˉ-ξ-dense. A somewhere dense matrix is a somewhere dense set of the form M0×⋯×Md−1 where Mj⊂Tj.
We usually add an overhead bar to denote a matrix, that is Mˉ usually means Mˉ=M0×⋯Md−1 for some Mj⊂Tj for j<d.
We call tˉ∈Πj<dTj a level sequence and Mˉ a level matrix if all the elements lie on the same level. The height of a level sequence (a level matrix) will be defined naturally as the common level on which each element lies, denoted as ht(tˉ) (ht(Mˉ)).
Convention 1.10*.*
Whenever tˉ∈Πj<dTj is a level sequence, for some ξ≤ht(tˉ), we use tˉ↾Πj<dTjξ to denote the tuple whose j-th coordinate is the ξ-th element with respect to the natural tree ordering in {s∈Tj:s≤Tjtj}. Define similarly for level matrices.
Notation 1.11*.*
In this paper, we will frequently take restrictions with respect to different subtrees. To avoid some cumbersome indices, we will adopt the following notation. The superscript for the restriction symbol will correspond to taking restriction with respect to the strong subtrees with the same superscript. For example, given Tj′, which are strong subtrees of Tj for j<d and a level sequence tˉ∈Πj<dTj′, tˉ↾′i denotes tˉ↾Πj<dTj′i. Likewise ↾∗ for Tj∗, ↾i for Tji etc.
Similarly for level matrices.
The next definition collects different versions of the Halpern-Läuchli theorem that will be considered in this paper. The motivation for the following different versions considered here is that the asymmetric versions are technical strengthenings of the Halpern-Läuchli theorem while the somewhere dense version is a localized statement that is equivalent under suitable assumptions on the large cardinal κ.
The dense set version enables the construction of desired strong subtrees in a rather straightforward way.
Definition 1.12** (Dobrinen and Hathaway [4]).**
Let d∈ω, κ inaccessible and δ<κ be given.
- (1)
HL(d,δ,κ) (the strong subtree version) abbreviates the following statement:
For any ⟨Tj:j<d⟩, a sequence of nice trees, and any coloring f:Πj<dTj→δ, there exist strong subtrees Tj′⊂Tj with the same witnessing level set such that
f′′⋃ξ<κΠj<dTj′(ξ) is constant.
2. (2)
HLasym(d,δ,κ) (the asymmetric strong subtree version) abbreviates the following statement:
For any ⟨Tj:j<d⟩, a sequence of nice trees, and any coloring f:Πj<dTj→δ, there exist strong subtrees Tj′⊂Tj with root tj sharing the same witnessing level set such that for some γ<δ,
f′′⋃ξ<κΠj<dTj′(ξ)={γ} and if γ=0 we could take tj=root(Tj) for each j<d.
3. (3)
DSHL(d,δ,κ) (the dense set version) abbreviates the following statement: for any nice trees ⟨Tj:j<d⟩ and f:Πj<dTj→δ, there exist ξ∈κ, tˉ∈Πj<dTj(ξ) and γ<δ such that for all η∈κ there exists a tˉ-η-dense level matrix Dˉ⊂Πj<dTj and f′′Dˉ={γ}.
4. (4)
DSHLasym(d,δ,κ) (the asymmetric dense set version) abbreviates the following statement: for any nice trees ⟨Ti:i<d⟩ and f:Πi<dTi→δ, there exist ξ∈κ, tˉ∈Πi<dTi(ξ) and γ<δ such that for all η∈κ there exists a tˉ-η-dense level matrix Dˉ⊂Πj<dTj and f′′Dˉ={γ}. In addition if γ is [math], then tˉ could be chosen to be ⟨root(Tj):j<d⟩.
5. (5)
SDHL(d,δ,κ) (the leveled somewhere dense version) abbreviates the following statement: for any nice trees ⟨Tj:j<d⟩ and f:Πj<dTj→δ, there exists a level sequence tˉ∈Πj<dTi and some tˉ-(ht(tˉ)+1)-dense level matrix Dˉ that ∣f′′Dˉ∣=1.
6. (6)
SDHL′(d,δ,κ) (the somewhere dense version) abbreviates the following statement: for any nice trees ⟨Tj:j<d⟩ and f:Πj<dTj→δ, there exists a somewhere dense matrix Dˉ that ∣f′′Dˉ∣=1.
Note HLasym(d,δ,κ) and DSHLasym(d,δ,κ) imply HL(d,δ,κ) and DSHL(d,δ,κ) respectively.
It is important in the strong subtree version in Definition 1.12 that these strong subtrees share the same level set. However, there are circumstances, for example in the proof of Theorem 3.17 and Lemma 4.2, where strong subtrees not necessarily sharing the same level set are produced. Hence whenever a sequence of strong subtrees is produced, we will always make it clear whether they share the same level set.
Theorem 1.13** (Dobrinen and Hathaway [4]).**
For κ a weakly compact cardinal, d∈ω,δ<κ, the following are equivalent.
- (1)
DSHL(d,δ,κ)**
2. (2)
HL(d,δ,κ)**
3. (3)
SDHL(d,δ,κ)**
4. (4)
SDHL′(d,δ,κ)**
In fact (1), (2), (3) are already equivalent when κ is merely strongly inaccessible.
Theorem 1.14** (Dobrinen and Hathaway [4] Theorem 4.6).**
Let d∈ω and let κ<λ be cardinals such that λ→(κ)κd. Suppose further that κ is measurable in the forcing extension by Add(κ,λ). Then in V, DSHLasym(d,δ,κ) holds for all δ<κ.
It is pointed out in [4] that the hypothesis can be obtained starting from κ (κ+d)-strong.
The notion of branches and the bounded topology on the branches will be useful in proving d-dimensional tail cone homogeneity implies the d+1-dimensional Halpern-Läuchli theorem.
Definition 1.15**.**
Given a nice tree T, and assume T⊂κ. Then [T] denotes the collection of branches through T, namely {f∈Πξ<κT(ξ):∀α<β<κ f(α)≺Tf(β)}. We can topologize [T] with basic open sets NtT={f∈[T]:t=f(htT(t))} where t∈T. We call this topology τ. For any A⊂[T], we use ∃τx∈A to mean “there exists a collection of elements in A that is τ-dense in A”.
2. The 1-dimensional asymmetric version of the Halpern-Läuchli theorem at a weakly compact cardinal for less than κ many colors
In [4], HL(1,k,κ) is established for any finite k and any weakly compact κ. We pointed out that their proof works for any strongly inaccessible κ.
In the context of weakly compact cardinals, we are able to extend this result to fewer than κ many colors.
Theorem 2.1**.**
If κ is weakly compact, then for all δ<κ, HLasym(1,δ,κ) holds.
Proof.
Given δ<κ and a coloring f:T→δ where T is a nice tree, let Aq,γ={α<κ:∃q′∈T(α)[q] f(q′)=γ} and consider the collection X={Aq,γ⊂κ:q∈T,γ<δ}.
Notice that ∣X∣≤κ, hence by weak compactness, there exists a non-principal κ-complete filter F on κ that decides every member of X, that is for each A∈X, exactly one of A, Ac is in X. Notice that for any γ∈δ if p⪯q then Aq,γ∈F implies Ap,γ∈F. In other words, if p⪯q and Ap,γc∈F, then Aq,γc∈F.
We show the following claim:
Claim 2.2**.**
For each p∈T there exist γ∈δ and q⪰p such that for all q′⪰q, Aq′,γ∈F.
Proof of the claim.
Suppose not, then there exists p∈T such that for all γ∈δ and for all q⪰p there exists q′⪰q such that Aq′,γ∈F (so Aq′,γc∈F).
Inductively we build a chain of nodes ⟨qγ:γ<δ⟩ such that
for any α<β<δ,qα≺qβ;
for any γ∈δ, Aqγ,γc∈F.
Let q−1=p. Inductively at stage α<δ suppose we already have a ⟨qi:i<α⟩, let q′ be some upper bound for this sequence in T. By hypothesis, we can extend q′ to qα such that Aqα,αc∈F.
Hence the construction of such sequence is possible. Now let q∗ be some upper bound for ⟨qα:α<δ⟩. We know that for any γ∈δ,Aq∗,γc∈F. By the κ-completeness of F we can find a β∈⋂γ∈δAq∗,γc\ht(q∗)+1. On level β, for any t∈T(β)[q∗] and any γ<δ, f(t)=γ. However by the fact that the tree is well-pruned, there must exist some node on level β extending q∗ which gets some color in δ, which is a contradiction. This proves the claim.
∎
Let p=root(T). We will pick γ∈δ and build a strong subtree T′ of color γ.
Consider the following cases:
- Case 1
For all q′∈T[p], Aq′,0∈F. Then γ=0 and root(T)=root(T′).
2. Case 2
Case 1 is not true. Let q∗∈T be such that Aq∗,0c∈F. Note that this is also true for all extensions of q∗ in T. By Claim 2.2, we can find q∈T[q∗] and γ′∈δ−{0} such that for all q′∈T[q], Aq′,γ′∈F. Let q=root(T′) and γ=γ′.
With root(T′) and γ we can recursively build a strong subtree T′ with level set A={ai:i<κ} as follows.
At stage α+1, assume we have constructed T′(≤α). Enumerate the immediate successors of T′(α) in T as {tk:k<β}. Hence they lie on T(aα+1). As F is κ-complete, we can find η∈⋂k<βAtk,γ\aα+1. Find extensions tk′ of tk in T(η) of color γ. Let T′(α+1)={tk′:k<β} and aα+1=η.
At stage ν where ν is a limit, let {tk:k<β} enumerate nodes in T(νˉ) where νˉ=supi<νai such that each tk is on top of a branch through T′(<ν). Repeat the procedure as before to define T′(ν) and aν.
It is easy to see from the construction that T′ is a strong subtree with level set A that gets color γ and if γ is [math], then root(T′)=root(T).
∎
Remark 2.3*.*
We can use the same proof to get the following simultaneous/diagonal version under the same assumptions:
For γ<κ, ⟨δj<κ:j<κ⟩, a sequence of nice trees ⟨Tj:j<κ⟩ and a sequence of colorings ⟨fj:Tj→δj∣ j<κ⟩ there exists A∈[κ]κ enumerated increasingly as {ai:i<κ} such that for all j<κ, there exists a strong subtree Tj′⊂Tj with witnessing level set A\aj+1 and fj↾Tj′ is constant.
3. Tail cone homogeneity
In this section, we establish the consistency of the following analog of a consequence of a typical fusion argument in the classical context. The following argument makes use of a combinatorial lemma due to Shelah (see [13] and also a nice presentation in [5]) who generalized a forcing argument by Harrington in the countable context.
Theorem 3.1**.**
Let d∈ω, and let κ,λ be cardinals such that
- (1)
λ* satisfies λ→(κ)2κ2d (when d=1, λ=(2κ)+ suffices);*
2. (2)
κ* is inaccessible and is measurable in the forcing extension by P=Add(κ,λ).*
Then in V,
for any ⟨δi<κ:i<κ⟩, ⟨Tj:j<d⟩ nice trees and fi:Πj<dTj→δi with i<κ, there exists a sequence of strong subtrees ⟨Tj′⊂Tj:j<d⟩ sharing the same witnessing level set such that for each i<κ, ξ≥i+1, and tˉ∈Πj<dTj′(ξ), fi(tˉ)=fi(tˉ↾′i+1). In other words, for each i<κ and ⟨yj:j<d⟩∈Πj<dTj′(i+1), fi′′⋃i+1≤ξ<κΠj<dTj′(ξ)[yj] is a singleton.
Remark 3.2*.*
Use HLtc(d,<κ,κ) to denote the conclusion of the theorem, which we call tail cone homogeneity.
If there exists δ<κ such that each coloring uses at most δ many colors, then the conclusion of the theorem is abbreviated as HLtc(d,δ,κ).
Remark 3.3*.*
HLtc(d,<ω,ω) can be proved using HL(d,<ω,ω) combined with a fusion type argument. Note also that, since κ=ω satisfies the hypothesis in Theorem 3.1, our proof yields HLtc(d,<ω,ω) in ZFC.
Without loss of generality we may assume Tj,j<d are mutually disjoint. P consists of partial functions p:λ→Πj<dTj such that ∣support(p)∣<κ. P is ordered by the following: q≤Pp (namely, q is stronger than p) iff support(q)⊃support(p) and for each γ∈support(p), q(γ)(j)⪰Tjp(γ)(j) for any j<d. What this forcing is doing is to add λ generic tuples of branches through Πj<dTj. For each η<λ, let c˙η be the P-name for the generic d-tuple of branches at η-th coordinate, namely, in V[G], (c˙η)G=G(η)∈Πj<d[Tj].
We claim that P is forcing equivalent to Add(κ,λ). To see this, since P is the <κ-support product of λ many copies of Πj<dTj with the coordinate-wise tree order, it suffices to show each copy in the product is equivalent to Add(κ,1). But each of these forcings is separative, κ-closed, of cardinality κ, and hence is equivalent to Add(κ,1). For a proof see [1] for example. Notice that for any subset A⊂P of cardinality <κ such that conditions in A are pairwise compatible, then there exists in P a greatest lower bound for elements in A.
Definition 3.4**.**
For B⊂λ, p∈P, define P↾B to be {p∈P:support(p)⊂B} and p↾B is the condition that agrees with p on B and whose support is contained in B.
Definition 3.5**.**
Given W0,W1⊂λ of the same order type, let hW0,W1 be the unique order preserving map from W0 to W1. We can then induce a copying action hW0,W1P:P↾W0→P↾W1 such that ∀p∈P↾W0,j∈W0 hW0,W1P(p)(hW0,W1(j))=p(j). With a slight abuse of notation, we write hW0,W1P as hW0,W1 since it can be easily inferred from the context.
The following combinatorial lemma plays a key role in the construction.
Lemma 3.6** (Lemma 4.1 in [13] and Claim 7.2.a in [5] with slight modifications, see the remarks that follow).**
Suppose λ→(κ)2κ2d and ⟨δi:i<κ⟩ is a sequence of cardinals <κ. Let ⟨τ˙i(u):i<κ,u∈[λ]d⟩ be a collection of P-names such that each τ˙i(u) is a name for an ordinal <δi. Then there exists E∈[λ]κ and W:[E]≤d→[λ]≤κ such that
- CL.1
For all u∈[E]d, u⊂W(u) and P↾W(u) contains a maximal antichain deciding the value of τ˙i(u) for each i<κ.
2. CL.2
For any u,v∈[E]d, type(W(u))=type(W(v)), hW(u),W(v)(u)=v and for any p∈P↾W(u), for any i<κ and γ<δi, p⊩τ˙i(u)=γ⇔hW(u),W(v)(p)⊩τ˙i(v)=γ.
3. CL.3
For any u,v∈[E]d, W(u)∩W(v)=W(u∩v).
4. CL.4
For any u1⊂u2,u1′⊂u2′ where u2,u2′∈[E]d, if (u2,u1,<)≃(u2′,u1′,<), then W(u1′)=hW(u2),W(u2′)(W(u1)).
Remark 3.7*.*
Lemma 4.1 appeared in [13] where for each u∈[λ]d the size of {τ˙i(u):i<κ} is at most countable while in Claim 7.2.a in [5] the requirement (4) is not present and there exists a uniform upper bound δ<κ for ⟨δi:i<κ⟩. However the lemma with these modifications still follow from the proof presented in [5]. For the sake of completeness, we include a sketch of this lemma in the Appendix A.
We point out that when d=1, λ=(2κ)+ suffices. Note that (2κ)+ is smaller than the least cardinal λ satisfying λ→(κ)2κ2.
Proof of Theorem 3.1.
Recall that for each ξ<λ, c˙ξ is a name for the ξ-th generic tuple of branches through Πj<dTj.
Fix {u0<⋯<ud−1}=u∈[λ]d and i<κ. In V[G], let D be a κ-complete ultrafilter on κ.
Hence there exists a unique color τi(u)<δi
such that
[TABLE]
Let D˙, τ˙i(u) and A˙ui be the respective names such that the relevant facts above are forced by 1P.
Apply Lemma 3.6 to get the desired E and W with respect to ⟨τ˙i(u):i<κ,u∈[λ]d⟩. Let an injective association {es∈E:s∈⋃j<dTj} be such that:
[TABLE]
Given any uˉ⊂⋃j<dTj, we use euˉ to denote {es:s∈u}. If uˉ∈Πj<dTj, then use euˉ to denote {es:for some j<d,uj=s}.
We will recursively construct the desired strong subtrees Tj′⊂Tj,j<d with the same witnessing level set A={ai:i<κ}. Along the way we will define {puˉ∈P↾W(euˉ):uˉ∈⋃i<κΠj<dTj′(i)} and {ji,vˉ<δi:vˉ∈Πj<dTj′(i+1),i<κ} maintaining the following construction invariants:
- CI.1
For any i<κ,vˉ∈Πj<dTj′(i+1)⊂Πj<dTj(ai+1), pvˉ⊩τ˙i(evˉ)=ji,vˉ and for any level sequence vˉ′∈Πj<dTj′ with vˉ≺vˉ′, pvˉ′⊩τ˙i(evˉ′)=ji,vˉ and fi(vˉ′)=ji,vˉ;
2. CI.2
For any i<κ, uˉ∈Πj<dTj′(i), for each j<d, pu(euj)(j)=uj and (∀z∈dom(puˉ))(∀j<d) htTj(puˉ(z,j))≤ai (We often times write puˉ(a)(b) as puˉ(a,b) by currying);
3. CI.3
For any i<κ, {puˉ:uˉ∈Πj<dTj′(i)} consists of pairwise compatible conditions, hence has a greatest lower bound;
4. CI.4
For any level sequences uˉ,uˉ′ in Πj<dTj′ with uˉ≺uˉ′, puˉ′≤PhW(euˉ),W(euˉ′)(puˉ).
The key point of this construction is that by CI.1 we are ensuring that for any i<κ, any level sequence vˉ∈Πj<dTj′(i+1), any level sequence vˉ′ above vˉ in Πj<dTj′ gets color ji,vˉ under fi. This verifies the desired tail cone homogeneity we are asking for. The rest of the invariants are technical and are intended for the induction to go through.
To start the construction, let root(Tj′)=root(Tj) for all j<d and a0=0.
Stage α+1: Suppose we have defined
T′(≤α) and ⟨ai:i≤α⟩.
For each j<d let Bj={tkj:k<βj} enumerate the immediate successors of the nodes on Tj′(α) in Tj. Thus Bj is a subset of Tj(aα+1).
We remind the reader of Notation 1.11 as restrictions with respect to different trees will be taken in the following construction.
Let tˉ∈Πj<dBj and sˉ∈Πj<dTj′(α) such that sˉ≺tˉ.
Claim 3.8**.**
{hW(esˉ↾′β),W(etˉ)(psˉ↾′β):β≤α}* consists of pairwise compatible conditions, and in fact it is decreasing as β increases.*
Proof of the claim.
Notice by CI.4 of the construction invariants we have for any β<α, psˉ≤hW(esˉ↾′β),W(esˉ)(psˉ↾′β), hence
[TABLE]
∎
Claim 3.9**.**
C={hW(esˉ),W(etˉ)(psˉ):tˉ∈Πj<dBj,sˉ=tˉ↾aα}* consists of pairwise compatible conditions.*
Proof of the claim.
Let tˉi∈Πj<dBj, sˉi∈Πj<dTj′(α) with sˉi≺tˉi, i<2. Consider t∗={(t0)j:j<d}∩{(t1)j:j<d},s∗={x∈⋃j<dTj′(α):for some y∈t∗, x≺y}. By CL.3 in Lemma 3.6, we have W(etˉ0)∩W(etˉ1)=W(et∗). Since by (3.2), for i<2, (etˉi,et∗,<)≃(esˉi,es∗,<), we know hW(esˉi)),W(etˉi)(W(es∗))=W(et∗) by CL.4 in Lemma 3.6. Since psˉ0 and psˉ1 are compatible by CI.3, and in particular they agree on W(es∗), so hW(esˉ0),W(etˉ0)(psˉ0) and hW(esˉ1),W(etˉ1)(psˉ1) are compatible.
∎
Now we let p∗ be the greatest lower bound for C. Note that for each j<d, k<βj, p∗(etkj,j)=tkj↾aα.
To see this, let {s0,⋯,sd−1}=sˉ∈Πj<dTj′, {t0,⋯,td−1}=tˉ∈Πj<dBj be such that tj=tkj and sj=tkj↾aα. As p∗≤hW(esˉ),W(etˉ)(psˉ) and psˉ(esj,j)=sj by CI.2, we know hW(esˉ),W(etˉ)(psˉ)(etj,j)=sj, hence p∗(etj,j)⪰sj. Again by CI.2 we know that htTj(p∗(etj,j))≤aα, so p∗(etj,j)=p∗(etkj,j)=sj.
Further extend p∗ to p′ to ensure that
[TABLE]
Claim 3.10**.**
There exist p′′≤p′ and {jα,tˉ<δα:tˉ∈Πj<dBj} such that for any tˉ∈Πj<dBj p′′↾W(etˉ)⊩τ˙α(etˉ)=jα,tˉ.
Proof of the claim.
Enumerate Πj<dBj={tˉl:l<ϵ}. We will build recursively a decreasing chain ⟨ql:l<ϵ⟩ such that for each l<ϵ, ql↾W(etˉl)⊩τ˙α(etˉl)=jα,tˉl. At stage l<ϵ, let q∗ be a lower bound for ⟨qw:w<l⟩ and jα,tˉl<δα such that q∗⊩τ˙α(etˉl)=jα,tˉl. Since P↾W(etˉl) contains a maximal antichain deciding the values of τ˙α(etˉl), there exists q′∈P↾W(etˉl) and q′≤q∗↾W(etˉl) such that q′⊩τ˙α(etˉl)=jα,tˉl. Pick ql≤q′,q∗, then it would be as desired. Let p′′ be a lower bound for ⟨ql:l<ϵ⟩, then it works.
∎
Claim 3.11**.**
p′′⊩∀β<α∀tˉ∈Πj<dBj τ˙β(etˉ)=jβ,tˉ↾aβ+1.
Proof of the claim.
Let xˉ=tˉ↾aβ+1∈Πj<dTj′(β+1).
Notice that p′′≤hW(exˉ),W(etˉ)(pxˉ) and pxˉ⊩τ˙β(exˉ)=jβ,xˉ. By CL.2 in Lemma 3.6,
we know that hW(exˉ),W(etˉ)(pxˉ)⊩τ˙β(etˉ)=jβ,xˉ. The claim then follows.
∎
Now find p′′′≤p′′ and χ<κ such that
[TABLE]
and p′′′⊩χ∈⋂{A˙etˉβ:β≤α,tˉ∈Πj<dBj}. The reason why we can do this is D˙ is forced to be κ-complete.
Extending p′′′ if necessary we may assume that for any l∈dom(p′′′) and j<d, we have htTj(p′′′(l)(j))≥χ.
Consider Cj={p′′′(et)(j)↾χ:t∈Bj} for each j<d.
For any tˉ={t0,t1,⋯,td−1}∈Πj<dBj,
[TABLE]
which implies
[TABLE]
and similarly for any β<α,
[TABLE]
which implies
[TABLE]
Note that for any t∈Bj, p′′′(et,j)↾χ≻p′′(et,j)≻p′(et,j)=t by (3.3). Let Cj=Tj′(α+1),j<d and let aα+1=χ. For any j<d, and any t∈Bj, there exists a unique t′∈Cj, equivalently t′∈Tj′(α+1), such that t′≻t. Thus this ensures the trees being constructed are strong subtrees.
Let q∈P be such that dom(q)=dom(p′′′) and for any k∈dom(q),j<d, q(k)(j)=p′′′(k)(j)↾χ. Notice by the choice of χ as in (3.4), q≤p′′.
For each yˉ∈Πj<dCj, let tˉ=yˉ↾aα+1 so that tˉ∈Πj<dBj and define
- R.1
jα,yˉ:=jα,tˉ
2. R.2
pyˉ:=hW(etˉ),W(eyˉ)(q↾W(etˉ)).
Fix {y0,⋯,yd−1}=yˉ∈Πj<dTj′(α+1) and let {t0,⋯,td−1}=tˉ=yˉ↾aα+1 so that tˉ∈Πj<dBj. We will verify the construction invariants are maintained.
- CI.1
Since by Claim 3.10, p′′↾W(etˉ)⊩τ˙α(etˉ)=jα,tˉ and q↾W(etˉ)≤p′′↾W(etˉ), using CL.2 in Lemma 3.6 we know pyˉ⊩τ˙α(eyˉ)=jα,tˉ=jα,yˉ. Similarly let xˉ=tˉ↾aβ+1 and for any β<α, we have
[TABLE]
Since pxˉ⊩τ˙β(exˉ)=jβ,xˉ by CI.1 in the induction hypothesis, we know pyˉ⊩τ˙β(eyˉ)=jβ,xˉ. By 3.6, fβ(yˉ)=jβ,xˉ.
This is as desired since xˉ=yˉ↾′β+1.
2. CI.2
Observe that for any k∈dom(pyˉ),j<d, htTj(pyˉ(k)(j))≤χ=aα+1 and
[TABLE]
3. CI.3
It follows from the similar proof as in Claim 3.9. More precisely, given yˉ0,yˉ1∈Πj<dCj=Πj<dTj′(α+1), we need to show pyˉ0 and pyˉ1 are compatible. Let tˉ0=yˉ0↾aα+1,tˉ1=yˉ1↾aα+1. By R.2, pyˉ0=hW(etˉ0),W(eyˉ0)(q↾W(etˉ0)) and pyˉ1=hW(etˉ1),W(eyˉ1)(q↾W(etˉ1)). Let y∗={(y0)j:j<d}∩{(y1)j:j<d} and t∗={t∈(⋃tˉ0∪⋃tˉ1):for some h∈y∗,t≺h}. We know that (eyˉi,ey∗,<)≃(etˉi,et∗,<) for i<2. By CL.3 in Lemma 3.6, we know W(eyˉ0)∩W(eyˉ1)=W(ey∗). By CL.4 we get hW(etˉi),W(eyˉi)(W(et∗))=W(ey∗) for i<2. As q↾W(etˉ0) agrees with q↾W(etˉ1) on W(et∗), it follows that pyˉ0 agrees with pyˉ1 on W(ey∗). But dom(pyˉ0)∩dom(pyˉ1)⊂W(eyˉ0)∩W(eyˉ1)=W(ey∗). Hence these two conditions are compatible.
4. CI.4
For any β≤α, let sˉ=yˉ↾′β and recall the choice of p∗ following Claim 3.9, we have
[TABLE]
Therefore,
[TABLE]
as desired.
Stage α when α is a limit.
The construction will be very similar to the successor case so we will just point out differences. Suppose we have constructed {Tj′(<α):j<d} and {ai:i<α} satisfying the construction invariants. For j<d, let Bj={tkj:k<βj} enumerate the nodes on Tj(αˉ) where αˉ=supγ<αaγ such that they are the upper bounds of branches through Tj′(<α).
We need the following claims, that are analogous to Claim 3.8 and Claim 3.9 respectively.
Claim 3.12**.**
For each tˉ∈Πj<dBj, {hW(etˉ↾aβ),W(etˉ)(ptˉ↾aβ):β<α} consists of pairwise compatible conditions, in fact it is decreasing as β increases.
Proof of the claim.
Given β0<β1<α, let xˉ=tˉ↾aβ0 and yˉ=tˉ↾aβ1. By CI.4 of the construction invariants, pyˉ≤hW(exˉ),W(eyˉ)(pxˉ). Hence
[TABLE]
∎
For each tˉ∈Πj<dBj, let qtˉ denote the greatest lower bound for the set as in Claim 3.12.
Claim 3.13**.**
{qtˉ:tˉ∈Πj<dBj}* consists of pairwise compatible conditions.*
Proof of the claim.
Suppose for the sake of contradiction that there exists tˉ0,tˉ1∈Πj<dBj such that qtˉ0⊥qtˉ1. Then there exists ν∈dom(qtˉ0)∩dom(qtˉ1),j<d such that qtˉ0(ν,j) and qtˉ1(ν,j) are incompatible in (Tj,<Tj). Since for i<2, qtˉi(ν,j)=supβ<αhW(etˉi↾aβ),W(etˉi)(ptˉi↾aβ)(ν,j), we can find some β<α large enough such that if we let sˉ0=tˉ0↾aβ,sˉ1=tˉ1↾aβ, both in Πj<dTj′(β), then hW(esˉ0),W(etˉ0)(psˉ0)(ν,j) and hW(esˉ1),W(etˉ1)(psˉ1)(ν,j) are incompatible in Tj. Let t∗=tˉ0∩tˉ1 then W(et∗)=W(etˉ0)∩W(etˉ1). Let s∗={z∈⋃j<dTj′(β):for some y∈t∗,z≺y}. As in Claim 3.9 we have hW(esˉi),W(etˉi)(W(es∗))=W(et∗). Note that hW(esˉ0),W(etˉ0) and hW(esˉ1),W(etˉ1) actually agree on W(es∗). Now let ν′∈W(es∗) be such that hW(esˉi),W(etˉi)(ν′)=ν. Then for i<2,
[TABLE]
By the assumption we have that psˉ0(ν′,j) is incompatible with psˉ1(ν′,j), but this contradicts with our induction hypothesis on the construction invariants.
∎
The rest of the proof is almost identical with the successor case except that we do not need to determine the corresponding values for τ˙α now. More precisely, we follow the proof after Claim 3.9 but skip Claim 3.10.
∎
Remark 3.14*.*
If inaccessible κ satisfies HLtc(1,2,κ), then κ is weakly compact. To see this, given g:[κ]2→2, we have gα:κ→2 for each α<κ such that gα(β)=g(α,β). Fix a bijection h between κ and 2<κ. We may view gα as colorings of 2<κ via h. By tail cone homogeneity, we have a strong subtree T′⊂2<κ that is tail cone homogeneous with respect to ⟨gα:α<κ⟩. Pick a branch through T′, then this is a subset of 2<κ of size κ such that any gα is constant except for a subset of size <κ. But this clearly implies that κ is weakly compact.
The following is a straightforward recursive construction.
Lemma 3.15**.**
For any nice tree T, any strong subtree T′⊂T with witnessing level set A′∈[κ]κ and any A⊂A′ with ∣A∣=κ, there exists a strong subtree T∗⊂T′ such that T∗ is a strong subtree of T with witnessing level set A.
Corollary 3.16**.**
Let 0<i<d∈ω, δ<κ be given and assume HLtc(i,δ,κ). For any sequence of nice trees ⟨Tj:j<d⟩, f:Πj<dTj→δ and B⊂d with ∣d\B∣=i, there exist strong subtrees ⟨Tj′⊂Tj:j<d⟩ sharing the same witnessing level subset satisfying the following:
For any tˉ=⟨tj:j∈B⟩∈Πj∈BTj′ with ξ=max{htTj′(tj):j∈B} and any level sequence sˉ∈Πj∈d−BTj′ with height greater than ξ, f(sˉ∪tˉ)=f((sˉ↾′ξ+1)∪tˉ). Note that here we do not require tˉ to be a level sequence.
Proof.
Enumerate Πj∈BTj as {tˉl∈Πj∈BTj:l<κ}. Define fl:Πj∈d−BTj→δ such that fl(sˉ)=f(tˉl∪sˉ). Applying HLtc(i,δ,κ), we get a sequence of strong subtrees ⟨Tj∗:j∈d−B⟩ sharing the same level subset A′∈[κ]κ with increasing enumeration ⟨ak′:k<κ⟩ so that for any k<κ, any level sequence sˉ∈Πj∈d−BTj∗ with (Πj∈d−BTj)-height greater than ak′, fk(sˉ)=fk(sˉ↾∗k+1)=fk(sˉ↾ak+1′). Thin A′ to A⊂A′ with increasing enumeration ⟨ak:k<κ⟩ such that for any tˉi∈Πj∈BTj(≤ak), any level sequence sˉ∈Πj∈d−BTj∗ with (Πj∈d−BTj)-height greater or equal to ak+1, f(tˉi∪sˉ)=fi(sˉ)=fi(sˉ↾ak+1)=f(tˉi∪(sˉ↾ak+1)).
Apply Lemma 3.15 to get strong subtrees Tj′⊂Tj for j<d with A being the common witnessing level set and whenever j∈d−B, Tj′⊂Tj∗. It is now easy to verify that these trees are as desired.
∎
Theorem 3.17**.**
Let d∈ω and assume HLtc(d,δ,κ). Then HL(d+1,δ,κ) holds.
Proof.
The hypothesis implies that κ is weakly compact by Remark 3.14. By Theorem 1.13 it suffices to show SDHL′(d+1,δ,κ).
Given nice trees ⟨Tj:j≤d⟩ and a coloring f:Πj≤dTj→δ, apply Corollary 3.16, we can find strong subtrees Tj′ sharing the same level set such that for any x∈T0′ with T0′-height ξ<κ and any level sequence yˉ∈Π1≤j≤dTj′(ζ) for some ζ>ξ, then f(x,yˉ)=f(x,yˉ↾′ξ+1). Our goal is find a somewhere dense monochromatic matrix for Πj≤dTj′.
Apply Lemma 3.15 to find a sequence of strong subtrees ⟨Tj∗⊂Tj′:j<d⟩ with witnessing level set {ξ+1:ξ<κ} for 1≤j≤d. Notice that for any ξ<κ,Tj∗(ξ)⊂Tj′(ξ+1) and for any r∈Tj∗,SuccTj∗(r)=SuccTj′(r).
For each x∈[T0′], consider the following induced level coloring fx:Π1≤j≤dTj∗→δ defined as follows: for any χ<κ,yˉ∈Π1≤j≤dTj∗(χ), fx(yˉ)=f(x(χ),yˉ). Recall HLtc(d,δ,κ) implies κ is weakly compact and HL(d,δ,κ) which in turn implies DSHL(d,δ,κ) by Theorem 1.13. Apply DSHL(d,δ,κ) to Π1≤j≤dTj∗ and fx. We know there exists a level sequence tˉx∈Π1≤j≤dTj∗ of height ν and γx<δ such that for any ν′∈κ\(ν+1) there exists a tˉx-ν′-dense level matrix Mˉ with fx′′Mˉ={γx}. Note that any density notion here is with respect to Π1≤j≤dTj∗.
Now consider the map x∈[T0′]↦(tˉx,γx). This is a partition of [T0′] into κ many pieces. Therefore, there exists (tˉ,γ) and s∈T0′ such that ∃τx∈NsT0′ (tˉx,γx)=(tˉ,γ). Recall Definition 1.15 for the meaning of ∃τx∈NsT0′. Extending if necessary we might assume htT0′(s)=β+1 and htΠ1≤j≤dTj∗(tˉ)=β. Let tˉ=⟨tj:1≤j≤d⟩. Hence we have the following:
For each x∈T0′[s],ν<κ, there exist ν′<κ,ν′≥htT0′(x), x′∈T0′(ν′)[x] and level matrix Mˉ=M1×⋯×Md⊂Π1≤j≤dTj∗(ν′)[tj] that is tˉ-ν-dense such that f′′x′×Mˉ={γ}.
Now enumerate the immediate successors in T0′ of s as {sk:k≤μ}. Note sμ is the last element in this enumeration. Recursively we build level matrices with increasing heights {Mˉk⊂Π1≤j≤dTj∗:k≤μ} and {sk′∈T0′[sk]:k≤μ} such that
- (1)
Mˉ0 is tˉ-(β+1)-dense in Π1≤j≤dTj∗ and ∀k≤μ, Mˉk is tˉ-αˉ-dense in Π1≤j≤dTj∗ where αˉ=supl<khtΠ1≤j≤dTj∗(Mˉl);
2. (2)
for all k≤μ, htT0′(sk′)=htΠ1≤j≤dTj∗(Mˉk);
3. (3)
for all k≤μ, f({sk′}×Mˉk)={γ}.
Pick level matrix Nˉ⊂Mˉμ such that for each 1≤j≤d, Nj is tj-(β+1)-dense in Tj∗ and xˉ∈Nˉ implies that for all k<β ∃λ xˉ↾∗λ∈Mˉk.
We now check that {sk′:k≤μ}×Nˉ is (s,tˉ)-(β+2)-dense matrix in Πj≤dTj′ of color γ. The density is clear since Tj∗(β+1)[tj]=Tj′(β+2)[tj],1≤j≤d. For any k≤β and yˉ∈Nˉ, we need to show f(sk′,yˉ)=γ. If k=μ we are done. If k<μ, by the choice of Nˉ, there exists λ<κ such that xˉ=yˉ↾∗λ∈Mˉk. Note that f(sk′,xˉ)=γ.
We have htT0′(sk′)=htΠ1≤j≤dTj∗(xˉ)=λ so htΠ1≤j≤dTj′(xˉ)=λ+1. Since yˉ is also a level sequence in Π1≤j≤dTj′, we know f(sk′,yˉ)=f(sk′,yˉ↾′λ+1)=f(sk′,xˉ)=γ.
∎
It is a reasonable question to ask if the tail cone version of the Halpern-Läuchli theorem is true at all assuming κ is some large enough cardinal.
In particular:
Question 3.18**.**
Is HLtc(1,δ,κ),δ<κ true in ZFC for some large enough cardinal κ?
A positive answer will enable us to establish results of higher dimension via the inductive argument as in Theorem 3.17.
4. A polarized partition relation for large saturated linear orders
We show that tail cone homogeneity can be used to prove a higher analog of a theorem by Laver [11] (the 2-dimensional case is due to Galvin) regarding a polarized partition relation for dense linear orders.
Notation 4.1*.*
We use ∀<κ to mean “for all except for <κ many”. For example, let φ(x) be a formula with a free variable x, then ∀<κx φ(x) means ∣{x:¬φ(x)}∣<κ.
Lemma 4.2**.**
Let d∈ω,d≥2, ⟨Tj:j<d⟩ nice trees and a coloring f:Πj<dTj→δ for some δ<κ be given. Assume HLtc(d−1,δ,κ). There exist strong subtrees Tj∗⊂Tj not necessarily sharing the same level set with respect to Tj,j<d, such that there exists γ∈δ, (∀<κx0∈T0∗)⋯(∀<κxd−1∈Td−1∗) f(x0,⋯,xd−1)=γ.
Proof.
We first shrink the trees to satisfy the following claim.
Claim 4.3**.**
There exist strong subtrees Tj′⊂Tj,j<d not necessarily sharing the same level set such that for any x∈T0′ with htT0′(x)=ξ and any yj∈Tj′ whose heights are increasing with htT1′(y1)>ξ,
[TABLE]
Proof of the claim.
As the restrictions taken in the following proof are with respect to different subtrees, we remind the reader of Notation 1.11.
We shrink the trees in d stages. For each j<d, let Tj0=Tj. Assume at stage 0≤i<d−1, we already have strong subtrees {Tji:j<d} such that if xˉ∈Πj<dTji is such that its respective heights are increasing with ξ=htTd−1−ii(xd−1−i), then
[TABLE]
Stage i+1: Apply Corollary 3.16 and find strong subtrees Uj⊂Tji sharing the same level set A with respect to Πj<dTji such that for any xˉ∈Πj<d−1−iUj with increasing heights and ξ=htUj(xd−2−i) and any χ>ξ,yˉ∈Πd−1−i≤j<dUj(χ), f(xˉ⌢yˉ)=f(xˉ⌢(yˉ↾Πd−1−i≤j<dUjξ+1)).
Now let Tji+1=Uj for j<d−1−i and for d−1−i≤j<d apply Lemma 3.15 to get strong subtrees Tji+1 of Uj with witnessing level set {ξ+1:ξ<κ}, hence Tji+1(ξ)⊂Uj(ξ+1) for all ξ<κ. We need to verify that for any
xˉ∈Πj<dTji+1 whose respective heights are increasing with ξ=htTd−2−ii+1(xd−2−i), then
[TABLE]
Let ξ′=htTd−1−ii+1(xd−1−i).
Note that
[TABLE]
The reason is that ⟨Tji+1:d−1−i≤j<d⟩ share the same level set with respect to ⟨Tji:d−1−i≤j<d⟩ so it follows from the induction hypothesis (4.1).
But now it follows that
[TABLE]
since for all d−1−i≤j<d,ξ<κ, Tji+1(ξ)⊂Uj(ξ+1). This finishes the inductive construction. Finally let Tj′=Tjd−1,j<d and it is straightforward to see that they are as desired.
∎
Now consider the coloring f restricted to Πj<dTj′. Apply HL(d,δ,κ), which we have by Theorem 3.17. We can find strong subtrees Tj∗ of Tj′ for all j<d sharing the same witnessing level set with respect to ⟨Tj′:j<d⟩ such that f′′⋃ξ<κΠj<dTj∗(ξ)={γ} for some γ<δ. To see this is desired, given xˉ∈Πj<dTj∗ whose respective heights are increasing and ξ=htT0∗(x0), we see that
[TABLE]
as desired.
∎
Theorem 4.4**.**
Let d∈ω and suppose HLtc(d,<κ,κ). Then
[TABLE]
Proof.
Given f:Πj<d+12<κ→δ for some δ<κ, our aim is to find for j<d+1, Tj⊂2<κ such that (Tj,<lex) contains a copy of a κ-saturated linear order and ∣f′′Πj<d+1Tj∣≤(d+1)!.
Claim 4.5**.**
There exists strong subtrees Tj′⊂2<κ,j<d+1, not necessarily sharing the same witnessing level set with respect to 2<κ, such that for any permutation π:d+1→d+1, there exists γπ<δ such that
[TABLE]
Furthermore, by possibly throwing away <κ many nodes from each tree, we can assume the first quantification of Equation 4.3 is actually ∀t0∈Tπ(0)′
Proof of the claim.
Enumerate all permutations of d+1 and iteratively apply Lemma 4.2 finitely many times.
∎
Given the claim with ⟨Tj′:j<d+1⟩,{γπ:π∈Perm(d+1)} where Perm(S) is the collection of permutations of set S, we can recursively build nice subtrees ⟨Tj:j<d+1⟩. Recall the definition of a nice tree as in Definition 1.5. Note that we do not require Tj′ to be a strong subtree of Tj for j<d+1.
We will construct these trees in κ stages so that each stage we only pick <κ many elements. For j<d+1 and each β<κ, let {sβj,k:k<iβ,j} be the set of nodes picked in Tj′ at stage (d+1)β+j.
Suppose for some p≤d and some ordinal α<κ the construction reaches stage (d+1)α+p. Let Aα,pj={(sβj,k)k<iβ,j:β<α} if j≥p and Aα,pj={(sβj,k)k<iβ,j:β≤α} if j<p. Note that iβ,j<κ if defined.
Define a partial binary relation ⊏ on ⋃j<dTj such that s⊏s′ iff there exist β,β′<κ,j=j′<d,k<iβ,j,k′<iβ′,j′ such that s=sβj,k,s′=sβ′j′,k′ and β<β′ or (β=β′ and j<j′). Notice that if s⊏s′, then s and s′ must have been picked during the construction. Intuitively one element precedes the other if it appears earlier in the construction. Further suppose during the construction we ensure
- (1)
(∀j<d)(∀β<α)(∀k<iβ,j) sβj,k has Tj′-height greater than β and (∀j<p)(∀k<iα,j) sαj,k has Tj′-height greater than α;
2. (2)
For
any l≤d
any permutation ⟨j0,⋯,jl⟩ of a subset of d+1 of size l+1
any t0∈Tj0′,⋯,tl∈Tjl′ satisfying that for t0⊏t1⊏⋯⊏tl, and any π∈Perm(d+1) with π(w)=jw for w≤l (in other words, π extends the partial permutation ⟨j0,⋯,jl⟩)
we have
[TABLE]
In particular this implies
[TABLE]
At stage (d+1)α+p: Enumerate the terminal nodes in Aα,pp or top nodes for branches through Aα,pp as {wj:j<χ}. For each wj we aim to add incompatible wj0,wj1 extending it of height >α satisfying the 2 requirements above. This is possible since for l<d and for each t0,⋯,tl∈⋃j<d,j=pAα,pj satisfying that t0⊏t1⊏⋯⊏tl and no two nodes belong to the same tree, only <κ many nodes are forbidden. Hence in total only <κ many nodes are forbidden by (4.4) and by the remark following (4.3). Hence we can find such wj0,wj1 above wj of heights greater than α maintaining (2). {wjk:j<χ,k<2} will be picked from Tj′. In other words, {sαp,k:k<iα,p}={wjk:j<χ,k<2}.
For each j<d+1, consider Tj=⋃α<κAα,0j. Then by construction each Tj is rooted, perfect, and every maximal branch through Tj is of order type κ. Thus each Tj is nice. It is easy to see that for any j<d+1, (Tj,<lex) contains a copy of a κ-saturated linear order. But now we are done as f′′Πj<d+1Tj⊂{γπ:π∈Perm(d+1)}.
∎
Remark 4.6*.*
(d+1)! is the best possible in the theorem above. To see (d+1)!−1 is not enough, simply define a coloring on (2<κ,<lex)d+1 with Perm(d+1) being the color set such that whenever xˉ∈(2<κ,<lex)d+1 is such that the respective heights are distinct, then it gets color π where π∈Perm(d+1) satisfies that ht(xπ(0))<⋯<ht(xπ(d)).
Remark 4.7*.*
For ◃ a well ordering of ηκ of order type κ such that any (x0,⋯,xd)∈ηκd+1 is associated with a unique type π∈Perm(d+1) where xπ(0)◃⋯◃xπ(d), then essentially the same proof shows that there exist Xj⊂ηκ of order type ηκ for j≤d such that tuples from Πj<d+1Xj of the same type get the same color.
Remark 4.8*.*
(ηκηκ)→(ηκηκ)<κ,22 implies
(κκ)→(κκ)ω,22.
To see this, let h be a bijection between κ and 2<κ. Given f:κ×κ→ω, we use h to transfer f to a coloring g:2<κ×2<κ→ω. The assumption implies that there exists T0,T1 that are nice subtrees of 2<κ such that ∣g′′T0×T1∣≤2. Now letting A0=h−1T0,A1=h−1T1 we have ∣h′′A0×A1∣≤2.
The latter by a Theorem of Todorcevic implies ¬□(κ) (see for example Theorem 6.3.2 in [14]), which in turn implies κ is weakly compact in L by a theorem of Jensen. Note that HLtc(1,2,κ) implies κ is weakly compact (see Remark 3.14), which in turn implies κ is weakly compact in L by downward absoluteness.
Theorem 1.1 easily follows from Theorem 3.1 and Theorem 4.4. One might ask:
Question 4.9**.**
*Is the conclusion of Theorem 4.4 a consequence of some large cardinal hypothesis?
*
Very recently, Dobrinen and Hathaway [3] showed that if HLtc(d,<κ,κ) holds in the ground model, then after forcing with a poset of size <κ, HLtc(d,<κ,κ) remains true.
It was pointed out in [5] that Theorem 1.7 is not a consequence of any large cardinal hypothesis. More precisely, by a theorem of Hajnal and Komjáth [7], there exists a forcing of size ℵ1 that adds a linear order θ of size ℵ1, that is strongly non-Ramsey, in the sense that for any linear ordering φ, φ→[θ]ω12, namely for any ω1-coloring of [φ]2, any copy of θ in φ gets all colors.
Combining these two observations, it is consistent that
ηκ→(ηκ)<κ,<ω12 while (\refpolarizerelation) holds for all d∈ω.
5. The Halpern-Läuchli theorem at κ does not imply κ is weakly compact
In this section, we show that relative to the existence of a measurable cardinal it is possible that κ is a strongly inaccessible cardinal but not weakly compact yet HL(1,δ,κ) holds for all δ<κ. At the cost of stronger hypothesis, we show it is consistent that for all d∈ω and δ<κ,HL(d,δ,κ) holds while κ is strongly inaccessible but not weakly compact, in contrast with the situation in the tail cone version of the Halpern-Läuchli theorem and in Theorem 2.5 of [5] (regarding coloring unordered m-sized antichains of a single tree for finite m) where any inaccessible κ satisfying those theorems must be weakly compact.
Recall the following definitions.
Definition 5.1**.**
Let κ,λ,η be cardinals. I⊂P(κ) an ideal on κ is
non-trivial if κ∈I;
λ-complete if for any α<λ and Xi∈I,i<δ, ⋃i<αXi∈I;
η-saturated if P(κ)/I has η-c.c, namely, any collection X⊂P(κ) such that for any A,B∈X, A,B∈I and A∩B∈I, in other words, A and B are almost disjoint modulo I, satisfies that ∣X∣<η.
For the rest of the section, fix an inaccessible cardinal κ and a κ-complete κ-saturated ideal I on κ.
We list some standard facts, which can be found in [6].
Fact 5.2**.**
Let G be a generic ultrafilter on P=P(κ)/I over V then
- (1)
I* is precipitous, namely, in V[G], the ultrapower Ult(V,G)={[f]G:f∈V} is well-founded.
Let j:V→M≃Ult(V,U) be the ultrapower map in V[G] and M is a transitive class.*
2. (2)
V[G]⊨Mκ⊂M.
3. (3)
G* is V\textendashκ-complete, meaning for any α<κ and any ⟨Ai:i<α⟩∈V with Ai∈G for all i<α, ⋂i<αAi∈G.*
Theorem 5.3**.**
Suppose κ is an inaccessible cardinal that carries a κ-saturated κ-complete ideal, then for any δ<κ, HL(1,δ,κ).
Proof.
Let T, a nice tree and f:T→δ be given.
Without loss of generality, we might assume T is a subtree of κ<κ.
For each q∈T,γ∈δ, define Aq,γ as in Theorem 2.1.
Let G be P=P(κ)/I-generic over V. In V[G], let j:V→M≃Ult(V,G) be the generic ultrapower embedding.
Claim 5.4**.**
(κ<κ)M=(κ<κ)V[G]=(κ<κ)V* and κ remains strongly inaccessible in both V[G] and M.*
Proof of the claim.
The first equality follows from Fact 5.2. To show the second equality, first note that κ remains regular in V[G] hence in M since forcing with P=P(κ)/I is κ-c.c. Given any x∈κ<κ in V[G], by closure we know that x∈M. By the regularity of κ in M, we can find sufficiently large θ∈κ and α<κ such that x∈(θα)M. However since j is elementary we have j((θα)V)=(θα)M=(θα)V since (θα)V∈H(κ)V and j↾(H(κ))V=id↾(H(κ))V. Hence we conclude no bounded subset of κ is added after forcing with P and then κ remains strongly inaccessible in V[G].
∎
Claim 5.5**.**
In V[G],
(∀p∈T)(∃q⪰p)(∃γ∈δ)(∀q′⪰q) Aq′,γ∈G.
Proof of the claim.
Note T=j(T)∩κ<κ∈M.
Suppose the claim is not true, in V[G], (∃p∈T)(∀γ∈δ)(∀q⪰p)(∃q′⪰q) Aq′,γc∈G. In V[G] we build an increasing chain of nodes in T, ⟨pγ:γ<δ⟩ such that p0=p and ∀γ∈δ, Apγ,γc∈G. As by Claim 5.4 ⟨pγ:γ<δ⟩∈V, we can pick q∗∈T that is an upper bound for ⟨pγ:γ<δ⟩ in T.
However, we know ⋂γ<δAq∗,γc∈G by the construction and the fact that G is V-κ-complete, ⟨pγ:γ<δ⟩∈V. Work in V. We know that ⋂γ<δAq∗,γc is not bounded in κ.
Let β∈⋂γ<δAq∗,γc and β>ht(q∗). Then there is no q′′∈T(β)[q∗] that gets color γ for any γ<δ.
This is clearly a contradiction.
∎
Now in V[G], pick the witness q∈T,γ∈δ for the root(T). We claim that in V for any ξ>ht(q), there exists β>ξ and D⊂T(β) such that all elements in D get color γ and D is ξ-q-dense. That is to say, DSHL(1,δ,κ) is true, which then implies HL(1,δ,κ) by Theorem 1.13. Let ⟨qi:i<α⟩ enumerate T(ξ)[q]. We know in V[G] that ⋂i<αAqi,γ\ξ+1∈G. In particular, it can’t have empty intersection in V. Pick any β∈⋂i<αAqi,γ\ξ+1, then by definition for each i<α, there exists qi′∈T(β)[qi] such that f(qi′)=γ. Thus D={qi′∈T(β):i<α} works.
∎
In fact an almost identical proof shows the asymmetric version, for any δ<κ, HLasym(1,δ,κ), is true. Combine with the following theorem by Kunen:
Theorem 5.6** (Kunen [10]).**
It is consistent relative to the existence of a measurable cardinal that there exists a strongly inaccessible cardinal κ that is not weakly compact but carries a κ-saturated κ-complete ideal.
The following corollary is then immediate.
Corollary 5.7**.**
It is consistent relative to the existence of a measurable cardinal that there exists an inaccessible cardinal not weakly compact and for any δ<κ HL(1,δ,κ) holds.
We can obtain similar conclusions in higher dimension at the cost of stronger hypothesis.
Theorem 5.8**.**
Suppose κ is inaccessible and GCH holds above κ. Moreover, assume κ is measurable in the forcing extensions by Add(κ,κ+d) for all d∈ω.
Then there exists a forcing extension in which κ is inaccessible but not weakly compact and for all d∈ω,δ<κ, HL(d,δ,κ) holds.
Proof.
By Kunen’s absorption technique (see Kunen [10]), Add(κ,1) is forcing equivalent with P∗Q˙ where P adds a κ-Suslin tree S and ⊩PQ˙ adds a branch to S. Let g be generic for P over V. We claim that V[g] is the desired model.
First note that κ is inaccessible but not weakly compact in V[g] as there exists a κ-Suslin tree in V[g] and the forcing adds no bounded subsets of κ. Given d∈ω,δ<κ,⟨Tj:j<d⟩,f:Πj<dTj→δ as in HL(d,δ,κ), let h be V[g]-generic for (Q˙)g=Q. By assumption we know in V[g][h] κ is measurable and it remains so after further adding any λ∈{κ+d:d∈ω} many Cohen subsets of κ.
Furthermore, as over V[g] Q does not add any bounded subsets of κ, Tj remains a nice tree in V[g][h] for j<d. Hence by Theorem 1.14, in V[g][h], there exist ζ<κ,tˉ=⟨tj:j<d⟩∈Πj<dTj(ζ) such that for all ζ′<κ, there is ζ′′≥ζ′,ζ′′<κ and ⟨Xj⊂Tj(ζ′′):j<d⟩ such that for each j<d, Xj dominates Tj(ζ′)[tj] and ∣f′′Πj<dXj∣=1. However, since forcing with Q over V[g] does not add any new <κ-sequence of ordinals, these witnesses can be found in V[g]. Therefore, the same statement holds in V[g].
∎
Remark 5.9*.*
The hypothesis in Theorem 5.8 can be forced from V⊨ GCH + there exists a cardinal κ that is (κ+ω)-strong.
Acknowledgment
I want to thank James Cummings for illuminating discussions of the problem. I am especially grateful for his time spent on reading and correcting previous drafts. I also want to thank the anonymous referees for carefully reading the drafts and suggesting lots of improvements, including pointing out countless grammatical mistakes and spots of poor readability.
Appendix A A proof of Lemma 3.6
First we show when d=1 we can use λ=(2κ)+ to do the construction. To see this, note we can find W(α)∈[λ]≤κ for each α∈λ fulfilling the first requirement by κ+-c.c-ness of P. Applying the Δ-system lemma, we can find Z∈[λ]λ such that {W(γ):γ∈Z} forms a Δ-system with root R∈[λ]≤κ and ∀α∈Z W(α)∩supR=R. Define W(∅)=R.
Define an equivalence relation ∼ on Z such that α∼β iff
type(W(α))=type(W(β));
type(α∩W(α))=type(β∩W(β));
For any p∈P↾W(α), i<κ and γ<δi, we have
[TABLE]
The number of equivalence classes is at most ≤2κ. Hence by the hypothesis there exists a E∈[Z]κ consisting of ∼-equivalent elements (in fact we can even find such a set of size λ). It then follows that E and W are as desired.
More generally, fix d∈ω and suppose λ→(κ)2κ2d. If d=1, argue as above. So consider d≥2. First we list some facts proved in [5].
Fact A.1**.**
There exist E′∈[λ]κ and {W′(u)∈[λ]≤κ:u∈[E′]≤d} satisfying the following:
- (1)
u⊂W′(u)* for all u∈[E′]≤d;*
2. (2)
for any u,v∈[E′]≤d, if u⊂v, then W′(u)⊂W′(v);
3. (3)
for each i<κ and each u∈[E′]d, P↾W′(u) contains a maximal antichain deciding τ˙i(u);
4. (4)
for any u,v∈[E′]d, type(W′(u))=type(W′(v)), hW′(u),W′(v)(u)=v and for any i<κ, j<δi, p∈P↾W′(u), p⊩τ˙i(u)=j iff hW′(u),W′(v)(p)⊩τ˙i(v)=j.
5. (5)
for any k∈ω,{ui:i<k},{wi:i<k}⊂[E′]d, if (⋃i<kui,u0,⋯,uk−1)≃(⋃i<kwi,w0,⋯,wk−1), then
[TABLE]
Define for each u∈[E′]≤d, W(u)=⋃{⋂v∈XW′(v):X⊂[E′]≤d & ⋂X⊂u}. Let E={γων:ν<κ} where {γν:ν<κ} is the increasing enumeration of E′. We will collect more facts about W and E from [5].
Fact A.2**.**
- (1)
For all u,v∈[E]≤d W(u)∩W(v)=W(u∩v);
2. (2)
We can without loss of generality take X in the definition of W(u) to be of cardinality at most d+1;
3. (3)
For any X={ui:i<k}⊂[E′]≤d and Y={vi:i<k}⊂[E′]≤d and u∈[E]≤d, if (⋃X,u,u0,⋯,uk−1)≃(⋃Y,u,v0,⋯,vk−1), then ⋂v∈XW′(v)=⋂v∈YW′(v). We say X,Y have the same isomorphism type with respect to u if ⋂X⊂u, ⋂Y⊂u and there exist some enumerations of X and Y satisfying (⋃X,u,u0,⋯,uk−1)≃(⋃Y,u,v0,⋯,vk−1).
It suffices to consider X⊂[E′]d in the definition of W(u). Since for each finite X={u0,⋯,uk−1} such that ⋂X⊂u, we can find ui′⊃ui for i<k such that ui′∈[E′]d and ⋂i<k{ui′:i<k}=⋂X. Let X′={ui′:i<k}. Then as W′(ui)⊂W′(ui′) so ⋂v∈XW′(v)⊂⋂v∈X′W′(v).
Now we are ready to show that W and E satisfy the requirements of Lemma 3.6. CL.3 is satisfied by (1) in Fact A.2. First we verify requirement CL.4. Given u2,w2∈[E]d and u1⊂u2 and w1⊂w2 with (u2,u1,<)≃(w2,w1,<), we need to show
[TABLE]
Let {Xp⊂[E′]d:p<l} enumerate the representatives for the isomorphism types with respect to u2 with ∣Xp∣≤d+1. Enumerate each Xp as {upi:i<kp}. More precisely, for any X⊂[E′]d and ∣X∣=k≤d+1 such that ⋂X⊂u2, there exists some p<l such that X and Xp have the same isomorphism type in the sense of 3 in Fact A.2.
For each Xp we can find isomorphic Xp′={wpi:i<kp}⊂[E′]d, in the sense that
[TABLE]
so that {Xp′:p<l} will be an enumeration of the representatives for the isomorphism types with respect to w2, satisfying that
[TABLE]
The reason why we can do this is u2 and w2 only contains limit points with respect to the increasing enumeration of E′. Hence when choosing Xp′ for p<l, we make sure there are sufficiently many elements in E′ between consecutive elements in ⋃s≤p(⋃Xs′)∪w2. Figure 1 is a demonstration.
By (5) in Fact A.1 this implies
[TABLE]
Let h be the isomorphism. Then h↾W(u2)=⋃{⋂v∈XpW′(v):p<l} is the isomorphism with W(w2)=⋃{⋂v∈Xp′W′(v):p<l}.
Notice that h respects blocks, more precisely, for each p<l, h(⋂v∈XpW′(v))=⋂v∈Xp′W′(v). Since there exists K⊂l such that W(u1)=⋃{⋂v∈XpW′(v):p∈K} and W(w1)=⋃{⋂v∈Xp′W′(v):p∈K} (exactly those p<l such that ⋂Xp⊂u1 or equivalently ⋂Xp′⊂w1), so h(W(u1))=W(w1).
This verifies requirement CL.4.
This also shows that the isomorphism extends that of W′(u2)→W′(w2) so h(u2)=w2. In particular requirement CL.1 of Lemma 3.6 is satisfied. To see requirement CL.2 is satisfied, given i<κ,γ<δi,p∈P↾W(u2), such that p⊩τ˙i(u2)=γ. We need to show h(p)=hW(u2),W(w2)(p)⊩τ˙i(w2)=γ. Suppose not, there exists q′≤h(p) and l=γ,l<δi such that q′⊩τ˙i(w2)=l. Since P↾W′(w2) contains a maximal antichain deciding the values of τ˙i(w2), there exists q∈P↾W′(w2) such that q≤q′↾W′(w2) that q⊩τ˙i(w2)=l. By the choice of W′(w2) as in (4) of Fact A.1, we have hW′(u2),W′(w2)−1(q)=hW(u2),W(w2)−1(q)=h−1(q)⊩τ˙i(u2)=l. But h−1(q)≤p↾W′(u2) and h−1(q)∈P↾W′(u2). So take any q∗≤h−1(q),p↾(W(u2)−W′(u2)), then q∗≤p and q∗⊩τ˙i(u2)=l, contradiction. To get the other direction, argue with h−1 in place of h.