Set-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 or inside the collection of all sets of hereditary size less than . It turns out that this concept is exactly equivalent to the property being expressible in the language of set theory.
Theorem. For any assertion in the language of set theory, the following are equivalent:
- is ZFC-provably equivalent to a assertion.
- is ZFC-provably equivalent to an assertion of the form “,” where is a statement of any complexity.
- is ZFC-provably equivalent to an assertion of the form “,” where is a statement of any complexity.
Just to clarify, the assertions in set theory are those of the form , where has only bounded quantifiers. The set refers to the rank-initial segment of the set-theoretic universe, consisting of all sets of von Neumann rank less than . The set consists of all sets of hereditary size less than , that is, whose transitive closure has size less than .
Proof. () Since is correctly computed inside for any , it follows that to assert that some satisfies is the same as to assert that some thinks that there is some cardinal such that satisfies .
() The statement is equivalent to the assertion . The claim that involves only bounded quantifiers, since the quantifiers of become bounded by . The claim that is in and , since it is equivalent to saying that is transitive and the ordinals of are precisely and thinks every exists, plus a certain minimal set theory (so far this is just , since all quantifiers are bounded), plus, finally, the assertion that contains every subset of each of its elements. So altogether, the assertion that some satisfies has complexity in the language of set theory.
() This implication is a consequence of the following absoluteness lemma.
Lemma. (Levy) If is any uncountable cardinal, then .
Proof. Suppose that and , where has only bounded quantifiers. Fix some such witness , which exists inside some for perhaps much larger . By the Löwenheim-Skolem theorem, there is with , and of size less than . Let be the Mostowski collapse of , so that is transitive, and since it has size less than , it follows that . Since the transitive closure of was contained in , it follows that . Thus, since we conclude that and so hence is a witness to inside , as desired. QED
Using the lemma, we now prove the remaining part of the theorem. Consider any assertion , where has only bounded quantifiers. This assertion is equivalent to , simply because if there is such a with having such an , then by the lemma this works for all since ; and conversely, if there is an such that , then this will remain true inside any with . QED
In light of the theorem, it makes sense to refer to the properties as the locally verifiable properties, or perhaps as semi-local properties, since positive instances of assertions can be verified in some sufficiently large , 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 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 , perhaps very large, but rather is verified in a 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 . Thus, the assertion “ is measurable,” has complexity over . One may similarly speak of or properties, to refer to properties that can be verified with assertions in . Alternatively, for any class function on the ordinals, one may speak of -local properties, meaning a property that can be checked of by checking a property inside .
This post was made in response to a question on MathOverflow.
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 and so this is impossible. It is a great observation!
Because supercompact cardinals are -reflecting.
Yes, that is completely right.
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 . 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 -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 as you say, and so I have also edited on MO.
Pingback: The universal definition — it can define any mathematical object you like, in the right set-theoretic universe | Joel David Hamkins
Pingback: When does every definable nonempty set have a definable element? | Joel David Hamkins
Dear Joel,
This post is very useful for something (philosophical) I’m writing up now. Is there a way of citing it, or have versions of this appeared in print?
Best,
Neil
Pingback: The otherwordly cardinals | Joel David Hamkins
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 . 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.