Local properties in set theory

V_thetaSet-theoretic arguments often make use of the fact that a particular property φ is local, in the sense that instances of the property can be verified by checking certain facts in only a bounded part of the set-theoretic universe, such as inside some rank-initial segment Vθ or inside the collection Hκ of all sets of hereditary size less than κ. It turns out that this concept is exactly equivalent to the property being Σ2 expressible in the language of set theory.

Theorem. For any assertion φ in the language of set theory, the following are equivalent:

  1. φ is ZFC-provably equivalent to a Σ2 assertion.
  2. φ is ZFC-provably equivalent to an assertion of the form “θVθψ,” where ψ is a statement of any complexity.
  3. φ is ZFC-provably equivalent to an assertion of the form “κHκψ,” where ψ is a statement of any complexity.

Just to clarify, the Σ2 assertions in set theory are those of the form xyφ0(x,y), where φ0 has only bounded quantifiers. The set Vθ refers to the rank-initial segment of the set-theoretic universe, consisting of all sets of von Neumann rank less than θ. The set Hκ consists of all sets of hereditary size less than κ, that is, whose transitive closure has size less than κ.

Proof. (32) Since Hκ is correctly computed inside Vθ for any θ>κ, it follows that to assert that some Hκ satisfies ψ is the same as to assert that some Vθ thinks that there is some cardinal κ such that Hκ satisfies ψ.

(21) The statement θVθψ is equivalent to the assertion θx(x=Vθxψ). The claim that xψ involves only bounded quantifiers, since the quantifiers of ψ become bounded by x. The claim that x=Vθ is Π1 in x and θ, since it is equivalent to saying that x is transitive and the ordinals of x are precisely θ and x thinks every Vα exists, plus a certain minimal set theory (so far this is just Δ0, since all quantifiers are bounded), plus, finally, the assertion that x contains every subset of each of its elements. So altogether, the assertion that some Vθ satisfies ψ has complexity Σ2 in the language of set theory.

(13) This implication is a consequence of the following absoluteness lemma.

Lemma. (Levy) If κ is any uncountable cardinal, then HκΣ1V.

Proof. Suppose that xHκ and Vyψ(x,y), where ψ has only bounded quantifiers. Fix some such witness y, which exists inside some Hγ for perhaps much larger γ. By the Löwenheim-Skolem theorem, there is XHγ with TC({x})X, yX and X of size less than κ. Let π:XM be the Mostowski collapse of X, so that M is transitive, and since it has size less than κ, it follows that MHκ. Since the transitive closure of {x} was contained in X, it follows that π(x)=x. Thus, since Xψ(x,y) we conclude that Mψ(x,π(y)) and so hence π(y) is a witness to ψ(x,) inside Hκ, as desired. QED

Using the lemma, we now prove the remaining part of the theorem. Consider any Σ2 assertion xyφ0(x,y), where φ0 has only bounded quantifiers. This assertion is equivalent to κHκxyφ0(x,y), simply because if there is such a κ with Hκ having such an x, then by the lemma this x works for all yV since HκΣ1V; and conversely, if there is an x such that yφ0(x,y), then this will remain true inside any Hκ with xHκ. QED

In light of the theorem, it makes sense to refer to the Σ2 properties as the locally verifiable properties, or perhaps as semi-local properties, since positive instances of Σ2 assertions can be verified in some sufficiently large Vθ, without need for unbounded search. A truly local property, therefore, would be one such that positive and negative instances can be verified this way, and these would be precisely the Δ2 properties, whose positive and negative instances are locally verifiable.

Tighter concepts of locality are obtained by insisting that the property is not merely verified in some Vθ, perhaps very large, but rather is verified in a Vθ where θ has a certain closeness to the parameters or instance of the property. For example, a cardinal κ is measurable just in case there is a κ-complete nonprincipal ultrafilter on κ, and this is verified inside Vκ+2. Thus, the assertion “κ is measurable,” has complexity Σ12 over Vκ. One may similarly speak of Σmn or Σmα properties, to refer to properties that can be verified with Σm assertions in Vκ+α. Alternatively, for any class function f on the ordinals, one may speak of f-local properties, meaning a property that can be checked of xVθ by checking a property inside Vf(θ).

This post was made in response to a question on MathOverflow.

12 thoughts on “Local properties in set theory

  1. I always find this equivalence surprising and it is very useful. When I read the MO question that presumably motivated this post, asking about whether there is a locally defined large cardinal which always has a supercompact below it, I mistakenly tried to come with such a notion (I thought of rank-into-rank). But of course, as you point out in your answer, local notions are always Σ2 and so this is impossible. It is a great observation!

  2. Joel, this is a nice and really helpful post. Just a couple of small remarks.

    1. Shouldn’t Levy’s absoluteness lemma be for uncountable cardinals κ?

    2. In your response to the related question on mathoverflow, you say that “κ is supercompact”, like other global large cardinal properties, has complexity Π3. However, and while this is true for e.g., extendible cardinals, for the case of supercompactness we can do better and show that “κ is supercompact” is in fact Π2-expressible (see Kanamori Ch. 5, right after 22.8 Exercise). Essentially, the point is that “we know where to look” for the normal measures witnessing (levels of) supercompactness, i.e., we have a bound on the ordinal rank in which we have to search for them, just as you mention in your final paragraph of this post.

    Best regards!

    • Yes, you are right on both counts. I have edited here to insist κ is uncountable. And indeed, the failure of the supercompactness of κ is clearly locally verifiable, so being supercompact is at worst Π2 as you say, and so I have also edited on MO.

  3. Pingback: The universal definition — it can define any mathematical object you like, in the right set-theoretic universe | Joel David Hamkins

  4. Pingback: When does every definable nonempty set have a definable element? | Joel David Hamkins

  5. Pingback: The otherwordly cardinals | Joel David Hamkins

  6. Dear Dr. Hamkins,

    I am afraid to be slightly confused by the exact meaning of this wonderful equivalence: isn’t it the property ψ which is the local one here, and not φ itself?

    Thank you.

    • That is an interesting perspective, but I don’t agree. The statement ψ might not be local—if true in the universe, it might not necessarily be verifiable inside any set. But meanwhile, we are checking whether ψ holds in this local set Vθ. Ultimately, it is φ that is local, because it is equivalent to the truth of a statement, ψ, inside a set.

      Consider this: being the tallest person is not a local property, since one must make global comparisons. But being the tallest-in-your-household is local, since you just have to check if you have the being-the-tallest property in a local region, your household.

      • I strangely wasn’t notified of your answer… Anyway, okay thank you I got it! Now in my mind occurred the switch of perspective to your point of view, and I agree not to agree.
        Nice illustrative example by the way.

Leave a Reply

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