A large cardinal in the constructible universe

In this post, we shall provide a proof of Silver’s theorem that the Erdos caridnal κ(ω) relativizes to Godel’s constructible universe.

First, recall some definitions. Given a function f:[κ]<ωμ, we say that Iκ is a set of indiscernibles for f iff for every n<ω and every x,y[I]n, we have f(x)=f(y). Let κ(α)μ<ω denote the assertion that every function f:[κ]<ωμ admits a set of indiscernibles of order-type α. Then, one defines the αth-Erdos cardinal, as follows:
κ(α) is the least cardinal κ (if exists) for which κ(α)2<ω.
We mention that Erdos and Hajnal proved that α<β entails κ(α)<κ(β), and that a cardinal κ is said to be Ramsey iff it is the κth-Erdos cardinal, i.e., κ(κ)=κ.

Silver’s idea for relativizing κ(ω) goes through a reformulation of the statement concerning the existence of a set of indiscenribles, in terms of the failure of well-foundedness of a related poset. This leads us to revisiting this subject:

Definition. A poset (P,) is said to be well-founded iff every non-empty subset AP has a -minimal element x. (the latter means that yxy=x for all yA)

Fact (ZF). Suppose that (P,) is a poset whose underlying set P admits a well-ordering , then all of the following are equivalent:

  1. (P,) is well-founded (slang: “P does not admit an infinite -descending chain”);
  2. if f:ωP is an order-reversing map, then its image is finite;
  3. there exists an ordinal θ and a function ρ:Pθ such that for every distinct elements x,yP: xy implies ρ(x)<ρ(y).

Proof. (13) Recursively define

  • R0:=;
  • Rα+1:={xPyP{x}(yxyRα)};
  • Rα:=β<αRβ for all limit α.

Of course, {RααOn} is an increasing chain of subsets of P, and so by the axiom of replacement, there exists some θOn such that Rθ+1=Rθ. Note that Rθ=P, because otherwise, PRθ would be non-empty, and one could find a minimal xPRθ; it will then follow from the minimality of x in PRθ, that y<xyPθ. So xRθ+1Rθ, contradicting the definition of θ.
Thus, define (the rank function) ρ:Pθ by letting ρ(x):=min{α<θxRα+1} for all xP. Then ρ has the desired properties.

(32) Let ρ:Pθ witness (3). Suppose that f:ωP is order-reversing. Then (ρf):ωθ is an order-reversing map from ordinal to ordinals, and hence (ρf)[ω] is finite. Since f[ω] is linearly-ordered by , (ρf)[ω] is finite iff  f[ω] is finite. Consequently, the image of f is indeed finite.

(¬1¬2) Suppose that A is non-empty subset of P without a minimal element. Define a relation R of over A, as follows: yRx iff x=min(y), that is, x=min{zA{y}zy}.

Note that yRx entails xy, and that for every yA, there exists a unique xA such that yRx. Let us say that a function f is good, if dom(f) is a positive integer, f(0)=minA, and if n+1dom(f), then f(n)Rf(n+1).
Let F={f<ωPf is good}. Then a second look at the definition of R reveals that f:=F is a function. Moreover, since A does not contain a minimal element, we get that Im(f) is infinite. As yRx implies xy, we conclude that f:ωP is an order-reversing function with an infinite image. ◻

Proposition (ZF). <ωκ admits a well-ordering.
Proof. Given x,y<ωκ, we let xy iff one of the following holds:

  1. x=y;
  2. |x|<|y|;
  3. |x|=|y| and xy and x(Δ(x,y))<y(Δ(x,y)). (here, Δ(x,y):=min{n<ωx(n)y(n)}.)

We need to show that (<ωκ,) is linearly-ordered, and well-founded. It is obvious that for every x,y<ωκ, we either have xy or yx, and that if xy and yx, then x=y. Next, suppose that xy and yz. We need to verify that xz. To avoid trivialities, we may assume that |{x,y,z}|=3. If |x|<|y| or |y|<|z|, then |x|<|z|, and we are done. So, we assume that |x|=|y|=|z|. Put n0:=Δ(x,y),n1:=Δ(y,z).

  • If n0n1, then x(n0)<y(n0)z(n0) and xn0=yn0=zn0. So Δ(x,z)=n0 and x(Δ(x,z))<z(Δ(x,z)).
  • If n1<n0, then x(n1)=y(n1)<z(n1) and xn1=yn1=zn1. So Δ(x,z)=n1 and x(Δ(x,z))<z(Δ(x,z)).

Next, we verify well-foundedness. Suppose that A is a non-empty subset of <ωκ. If A, then it is the minimal element of A, and we are done. Suppose now that this is not the case, and let n be the least natural number for which there exists xA with |x|=n+1. Put B:={xA|x|=n+1}. Next, let k0:=min{x(0)xB}, and put B0:={xBx(0)=k0}. Then for i<n, let ki+1:=min{x(i+1)xBi}, and put Bi+1:={xBix(i+1)=ki+1}. Then Bn is a singleton whose element is the minimal element of A. ◻

Terminology. Let us say that two functions g,h are compatible iff for every i,jdom(g)dom(h), we have g(i)g(j) iff h(i)h(j).

Lemma (ZF). Given a function f:[κ]<ωX, a (countable) ordinal α, and bijection g:ωα, denote S(f,g):={h<ωκg,h are compatible, and Im(h) are indiscenrnibles for f}. Then f has a set of indiscernibles of order-type α iff (S(f,g),) is not well-founded.

Proof. As <ωκ admits a well-ordering, we know that (S(f,g),) is well-founded iff it does not admit an infinite -descending chain iff if does not admit an infinite -increasing chain.
Suppose that f has a set of indiscernibles of order-type α. Fix an order-preserving injection i:ακ such that iα is a set of indiscernibles for f. Define h:ωκ by letting h(n)=i(g(n)) for all n<ω. As i is order-preserving, we get that g and h are compatible, and then hnS(f,g) for all n<ω. As  {hnn<ω} is an increasing -chain, we infer that  (S(f,g),) is not well-founded.
Suppose that (S(f,g),) is not well-founded, and let hnn<ω be an increasing -chain within S(f,g). Let h:=n<ωhn. Then dom(h)=ω, and g,h are compatible. Put I:=Im(h). Then I is a set of indiscerinbles for f. Finally, since g,h are compatible and dom(h)=dom(g), we get that Im(g) and Im(h) has the same order-type. That is otp(I)=α. ◻

We know that Δ0 properties (e.g., being an ordinal, being a function) are absolute for all transitive models of ZF, and hence Σ1 properties are upward absolute, and Π1 properties are downward absolute. In particular, Δ1 properties are absolute. Let us point out that this is indeed the case here:

Suppose that f,α,g are as in the preceding lemma. Then f has a set of indiscernibles of order-type α iff the following Π1 formula (with a parameter S:=S(f,g)) fails:

A[((A)(AS))(xAyA(yxy=x))].

Recalling the fact that we proved at the beginning of this post, we get as well that f has a set of indiscerinbles of order-type α iff the following Σ1 formula (with a parameter S:=S(f,g)) fails:

θρ[(θ is an ordinal)(ρ:Sθ is a function)(xSyS(xyρ(x)ρ(y))].

[Note that the negation of a Δ1 statement is again Δ1]

Corollary (Silver, 1970). Suppose that M is transitive model of ZF, and α,κ,μM with α<(ω1)M. If κ(α)μ<ω holds (in the universe), then Mκ(α)μ<ω.
In particular, if κ(ω) exists, say it is κ, then Lκ(ω) exists, and κ(ω)=κ.
Proof. Suppose that f:[κ]<ωμ is a given coloring in M, and α<(ω1)M. Our goal is to find (within M) a set of indiscernibles for f of order-type α.
Fix in M, a bijection g:ωα. As κ(α)μ<ω holds in the universe, there exists a set of indiscernibles for f of order-type α. So S(f,g) is not well-founded. Since f,gM, we infer that S(f,g)M, and so by absoluteness for Δ1 properties: MS(f,g) is not well-founded. It now follows from the lemma that M contains a set of indiscernibles for f of order-type α. ◻

For completeness, we mention that Rowbottom proved in his dissertation that the existence of the Erdos cardinal κ(ω1) contradicts the axiom V=L. (Thus, improving Scott’s famous theorem that the existence of a measurable cardinal implies VL.) It follows that Silver’s theorem that κ(α) relativizes to L for all α<(ω1)L is best possible.

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

10 Responses to A large cardinal in the constructible universe

  1. Enjoyed your talk in class, by the way!

  2. Ari B. says:

    1) In the sentence defining indiscernibles, you switch between the variables I and X, where both letters are referring to the same set.
    2) In the second bullet point of the proof of (1 Rightarrow 3), toward the end of the line, Palpha should be Ralpha.
    3) I see you changed the Proposition to use <omegakappa instead of [kappa]<omega, but at the beginning of the proof of the Lemma it still says "As [κ]<ω admits a well-ordering…", which should be <omegakappa.

    4) I see you've already made the other corrections that I was going to suggest!

    5) What's the reason for using the terminology of "indiscernibles" rather than referring to "homogeneous sets"?

    • saf says:

      Hi Ari,
      Thank you very much for your comments!

      I think that the term “homogeneous” is more common for colorings of the form c:[kappa]nrightarrowlambda (where one usually mean that [H]n is monochromatic with resepct to c), while “indiscernibles” is for colorings of the form c:[kappa]<murightarrowlambda (where [I]i is monochromatic for each i<mu).

      • David F.B. says:

        Hey Assaf, I’m glad you posted this, it’s really interesting! (especially since I missed your lecture). I think the explanation on why people use the term “indiscernibles” rather than just “homogeneous” can be seen if you follow the link that appears when you first mention Ramsey cardinals. On that webpage, they explain the model-theoretic caracterization, in which it is more natural to call the homogeneous set “a set of indiscernibles”.

  3. David F.B. says:

    Also, in the second line of the Proof of the last Lemma, I would add the word “infinite” right before both “supseteq-descending chain” and “subseteq-increasing chain”.

  4. Pingback: The chromatic numbers of the Erdos-Hajnal graphs | Assaf Rinot

  5. Pingback: Prikry Forcing

Leave a Reply

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