Large Sets 9
Posted by Tom Leinster
Previously: Part 8. Next: Part 9.5
Today I’ll talk about inaccessibility. A set is said to be “inaccessible” if it cannot be reached or accessed from below using certain operations. We’ve seen this rough idea before — but which operations are the ones in play here, and what makes them especially interesting?
The definition is short and sweet: a set is inaccessible if it is uncountable, a strong limit, and regular. Let’s review what that means:
A set is a strong limit if . That’s the most economical form of the definition, anyway. But an equivalent condition is maybe more illumnating: an uncountable strong limit is a set such that the sets are a model of ETCS.
A set is regular if whenever is a family of sets with and for all , then . Another way to say this: there’s no map out of whose codomain and fibres are all smaller than .
So, for a set to be inaccessible means that it’s unreachable from below in two different ways: by the constructions that ETCS provides, and by coproducts of a smaller number of smaller sets.
Some other perspectives on inaccessibility begin to suggest why it’s an important notion:
Every infinite set is either regular or a weak limit. In other words, every successor is regular (as we saw last time). This makes it natural to ask which sets are both regular and a weak limit. The uncountable such sets are called weakly inaccessible. Accessibility itself is the corresponding notion with “strong limit” in place of “weak limit”.
(What I’m calling “inaccessible” used to be called “strongly inaccessible”, but I believe I’m following the dominant modern usage by dropping the “strongly”.)
We saw last time that regularity is a natural condition. Now regularity involves sums (coproducts) of sets. What if we change them to products? That is, call a set product-regular if whenever is a family of sets with and for all , then . Which sets are product-regular? Certainly is, but what else?
In fact, for uncountable sets, This is another hint that inaccessibility is important.
Can I give you an example of an inaccessible set? No! Inaccessible sets — if they exist — are larger than anything we’ve contemplated before, and beyond the realm where we can just “write one down”.
Let’s dig into that claim.
The largest kinds of sets we’ve considered so far are the beth fixed points. As I’ll explain, every inaccessible set is a beth fixed point… but most beth fixed points aren’t inaccessible. (They’re “accessible”, I guess, but do people really say that?)
The proof that inaccessible sets are beth fixed points is really nice, so I’ll show it to you in full. It rests on a fact I mentioned in Part 7:
A set is a beth fixed point if and only if the sets are a model of ETCS + (all beths exist).
We’ll show that every inaccessible set satisfies this equivalent condition. The sets are certainly a model of ETCS, since is a strong limit. What we have to show, then, is that for every well-ordered set whose underlying set is , the beth exists and is . We do this by induction on :
If is empty then exists (it’s ) and is since is uncountable.
If is a successor, say , then by inductive hypothesis, exists and is . Now exists; it’s , which is since is a strong limit.
If is a nonempty limit then by inductive hypothesis, exists and is for all . Now where . This is a supremum of sets indexed by , and is therefore since is regular.
What I like about this proof is that the three cases of the transfinite induction naturally use the three parts of the definition of inaccessibility: uncountability, the strong limit property and regularity.
So: every inaccessible set is a beth fixed point. But inaccessibility is a much stronger condition. The smallest beth fixed point (if it exists) is not inaccessible. Nor is the second-smallest, nor the third-smallest. In fact:
For any inaccessible set , there are unboundedly many beth fixed points .
This means that for any set , there is some beth fixed point with .
We can even construct such a , in some sense of “construct”:
Take our starting set , and put .
Form an initial well order with underlying set . Now is a beth fixed point, meaning that exists and is . Since , it follows that exists and is . Put . Then from our starting set , we’ve constructed a new set .
Repeat this process to get a sequence of sets which are all .
This sequence has an upper bound, , so it has a least upper bound, , satisfying . Better still, is strictly smaller than : for is uncountable and regular, so it can’t be the supremum of the sequence of strictly smaller sets. So . And finally, is a beth fixed point, as mentioned in Part 7.
This result gives us another little independence theorem:
It is consistent with ETCS + (there are unboundedly many beth fixed points) that there are no inaccessible sets.
The proof is the same old argument we keep on seeing. Take a model of ETCS with unboundedly many beth fixed points. Call a set “small” if it is every inaccessible set in the model. Then the previous result implies that the small sets form a model of ETCS with unboundedly many beth fixed points, in which there are no inaccessible sets.
Perhaps I should state that proof a little more carefully. If the original model contains no inaccessible sets, we’re done. If it does contain an inaccessible set, there’s a smallest one, . Then by the previous result, the sets (the “small sets”) are a model of ETCS + (there are unboundedly many beth fixed points) + (there are no inaccessible sets).
So if there are any inaccessible sets at all, they’re among the beth fixed points, but the smallest inaccessible set is bigger than the smallest beth fixed point.
Next time
In the next of my posts we’ll look at measurable sets. Measurability is the largest large set axiom I’ll talk about in this series, and it’s a nice one: it connects to both measurability in the sense of measure theory and codensity monads in category theory.
Added later: but first, Mike will talk about the size levels in between inaccessibility and measurability.
Re: Large Sets 9
Now seems like a good moment to cite Mike Shulman’s Set theory for category theory, both for this post in particular and the series of posts in general.
I didn’t want to talk about the connection between inaccessibility and Grothendieck universes, but if you’re interested, you can find that topic discussed in section 8 of Mike’s paper.