The axiom of constructibility asserts every set belongs to the constructible universe, or . Define , , and at limit stages. Here consists of subsets of first-order definable over with finitely many parameters from . Then . The assertion is , rather than a statement that every set is parameter-free definable.
The Bukovský-Hechler theorem states: if is singular and there are a cardinal and a cardinal such that for every cardinal with , thenThus an eventual plateau of the power-set function below a singular cardinal continues at that cardinal. One can see the mechanism by decomposing into bounded pieces: . On the plateau choose , so .
The singular cardinals hypothesis is the assertion that for every infinite singular cardinal ,In particular, for a singular strong-limit cardinal it gives . This is a restriction on singular-cardinal exponentiation; it does not assert the full Generalized continuum hypothesis at all cardinals.
Put . There is a strictly increasing cofinal map . If , choose a cofinal map . Then is cofinal in , contradicting the definition of as its least cofinal order type. Since always , we obtainFor a nonzero limit ordinal this is an infinite regular cardinal. If the convention includes zero among limit ordinals, its cofinality is zero and the identity is immediate there.
First the increasing sequence is cofinal in . Write . Strict increase gives when the sequence is infinite, so its cardinal sum is . The given sum therefore implies and .
For any function , choose an index with for every . There are at most such indices, so they are bounded below . Enlarging the bound if needed gives an index with . ThusConversely each summand is at most , and because . Infinite cardinal multiplication consequently givesCombining the inequalities proves .
For the intended infinite regular cardinal , set . Suppose and the functions for its predecessors have been constructed. Since , choose a surjection and defineThe supremum is below : it uses fewer than ordinals below , and is regular. This defines a function at each stage of the recursion.
For any , choose with . Whenever , the displayed supremum includes , so . Therefore the recursion yields a long chain under eventual domination of length .
Take the graphs . Each has size , and any two meet in fewer than points, because their functions are eventually strictly ordered. Fix a bijection and let .
Given , enumerate it as and trim the sets in this order:The deleted part is a union of fewer than pairwise intersections, each of size less than . Regularity ensures its size is less than . If , then is disjoint even from the full earlier , hence from its trimmed version. Thus all the retained sets are pairwise disjoint and each lost fewer than elements. This provesThe argument is the essential disjointness of small subfamilies of a regular-cardinal almost disjoint family.
Articles by others on the same topic
There are currently no matching articles.