The Engelking-Karlowicz theorem, and a useful corollary

Theorem (Engelking-Karlowicz, 1965). For cardinals κλμ2λ, the following are equivalent:

  1. λ<κ=λ;
  2. there exists a collection of functions, fi:μλi<λ, such that for every X[μ]<κ and every function f:Xλ, there exists some i<λ with ffi.

Proof. (2)(1) Suppose fi:μλi<λ is a given collection. Then |{fiθi<λ,θ<κ}|λ<λ<κ,
so there must exists some f<κλ with ffi for all i<λ.

(1)(2) We follow a proof due to Shelah. Put:
W:={(a,A,g)a[λ]<κ,A[P(a)]<κ,gAλ}.
Then |W|=λ<κ=λ, and we may fix an enumeration
W={(ai,Ai,gi)i<λ}.
By μ2λ, let Bαα<μ be a sequence of distinct subsets of λ.
For all i<λ, we now define fi:μλ, by letting for all α<μ:
fi(α)={gi(aiBα),aiBαAi0,otherwise.
Finally, suppose that a set X[μ]<κ and a function f:Xλ are given.
For all distinct α,βX, pick x(α,β)BαΔBβ.
Put a={x(α,β)α,βX,αβ}. Then, |a|<κ and for all distinct α,βX, we have aBαaBβ.
It follows that |A|=|a|, where A:={aBααX}. It also follows that we may well-define a function g:Aλ by letting:
g(aBα):=f(α),(αX).
Pick i<λ such that (a,A,g)=(ai,Ai,gi). Then, ffi. ◻

Corollary (folklore). Assume CH.
Then there exists a function G:[ω2]<ω1ω1 with the property that if G(A)=G(B), then A,B have the same order-type, and their intersection is an initial segment of A and of B.
In particular, G(A)=G(B) entails the existence of an order-preserving isomorphism g:AB, which is the identity on AB.

Proof. For all α<ω2, fix a bijection gα:α|α|. By 10=1 and the Engelking-Karlowicz theorem, we may also fix a sequence of functions fi:21i<1 such that for every X[2]<1 and f:X1, there exists some i<1 such that ffi.

We now define G:[ω2]<ω1<ω1([ω1]<ω1), as follows.
Given A[ω2]<ω1, let  i<1 be the least ordinal such that the order-preserving isomorphism πA:Aotp(A) is extended by fi, and put:
G(A):={(0,i)}gπA1(j)[A]0<jotp(A).

Next, suppose that G(A)=G(B), for distinct A,B[ω2]<ω1. It follows that:

  • otp(A)=dom(G(A))1=dom(G(B))1=otp(B);
  • πAπBfi, for i:=G(A)(0);
  • if αAB, then πA(α)=fi(α)=πB(α), and one of the following holds:

    fi(α)=0, and Aα==Bα;
     fi(α)>0, and Aα=gα1[gα[A]]=gα1[G(A)(πA(α))]=gα1[G(B)(πB(α))]=gα1[gα[B]]=Bα.

So AB is an initial segment of A and of B.

Let g:=πB1πA. Then g:AB is an order-preserving isomorphism, and gAB is the identity function, since πAAB=πBAB is simply the collapsing function from AB to otp(AB). ◻

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

5 Responses to The Engelking-Karlowicz theorem, and a useful corollary

  1. Pingback: The uniformization property for aleph2 | Assaf Rinot

  2. DM says:

    There is a typo in the definition of W. It should not be A[a]<κ but A[P(a)]<κ (where P(a) denotes the power set of a).

  3. D.A. Mejia says:

    This is a very helpful post.
    One easy (but practical) observation: the proof of (1)(2) gives, independent of (1), that there is a collection of functions fi:μλ:i<λ<κ (note the power <κ) satisfying (2).

Leave a Reply

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