数学論理学アドベントカレンダー2022
の記事を書いてみました。遅れてすみません。
Let denote the collection of all finite subsets of (also written ).
Independent set
Let be any function. A set is called independent if for all finite and , we have .
For example, if is a field, is an -vector space, and is the -span, then a set is independent with respect to iff is -linearly independent.
We have a folklore characterization of the Continuum Hypothesis ().
The following are equivalent:
- For any , there exists an independent set of size .
- .
In this article, we'll see proofs of the following facts.
- For any and , there exists an independent set of size .
- For , there exists some without any independent set of size .
- For any Borel , there exists an independent nonempty perfect set . (Thus .)
Items (i) and (ii) imply Theorem 1, since one sees that every admits an independent set of size iff .
Item (iii) illustrates that the above phenomenon is orthogonal to descriptive set theory. Indeed, if is Borel, then moving to a generic extension with and using item (i), we see from -absoluteness that in , admits independent sets of size for any . I learned about this absoluteness argument from
ジタさん's article here
.
Proof of (i)
The following proof is from [1, Lemma 2.3].
We proceed via induction on . When , let be any set with , and this is an independent set of size .
Let and , and fix .
For a set (later taken to be ), we put , so that a routine cardinality computation shows that . We can perform the "closure under " operation
such that and moreover . This defines the least with the property that .
Now since , we can pick some arbitrary outside of this closure.
Define the "restriction to " function such that
By induction on , the function has an independent set of size .
We claim that is an independent set of size . It's clear from the -independence of that if and , then
Moreover for any , we have
due to being closed under . So is indeed independent.
Proof of (ii)
Again we proceed by induction on .
When , we define via
Then any set of size cannot be independent since if , then .
Let . For each , since , we can fix by induction a function without independent sets of size . Then we define via
For example, when , our function defined above can be made more explicit. For each , fix an enumeration with indices from . Then
One may use this explicit form to check that has no independent set of size . [Hint: Let be the independent set.]
We claim that admits no independent set of size . Towards a contradiction, assume is an independent set with . Let , and so is an independent set for of size , which is a contradiction.
A slight variation of the proofs above gives another equivalent formulation of :
Let denote the collection of all countable subsets of (also written ).
The following are equivalent:
- For any , there exists an independent set of size .
- .
Proof of (iii)
Recall that is a standard Borel space, when its Borel structure is inherited from the set of representatives as a Borel (in fact, open) subset of the Polish space .
Fix any Borel function .
For every positive integer , the set
is a comeager Borel subset of .
Fix , and let
It's clear that is Borel.
Then for each , the section
is a cofinite subset of , and so is comeager.
By Kuratowski–Ulam [2, Theorem 8.41], every section of is comeager implies that the set is comeager Borel.
In a similar way and by modifying the proof above, Kuratowski–Ulam also implies that the desired set
is comeager Borel. Here we may use that comeager Borel sets are closed under finite intersections, and also preimages under canonical projections .
Now let's recall the definition and some properties of the hyperspace of (nonempty) compact subsets of (later taken to be ).
The hyperspace
Let be a Polish space. Denote by the set of (nonempty) compact subsets of . When is endowed with the Vietoris topology (see [2, §4.F]), becomes a Polish space.
More explicitly, if is a compatible complete metric on , then the Hausdorff metric is a compatible complete metric on (see [2, Theorem 4.25]).
[2, Exercise 8.8]
Recall that a Polish space is perfect if has no isolated points.
If is a perfect Polish space, then comeagerly many is (nonempty) perfect.
[2, Theorem 19.1]
For and , define to be the set of tuples in with pairwise distinct entries.
Let be a Polish space. For all , we fix a natural number and a comeager subset . Then comeagerly many satisfies that .
Fixing the sets from Lemma 4, we can use Lemmas 5 and 6 to find a comeager set of such that is nonempty perfect and for all . By definition of independent sets and using , we see that any such is an independent set.
The same proof above applies to any Universally Baire measurable as well.
For example, let be a countable subfield of . The -span can be defined to be a Borel function. So by Example 1, there must exist a nonempty perfect set which is -linearly independent.
Cohen forcing
We can give an explicit combinatorial account of the previous proof of (iii), and some alternative lemmas to replace Lemmas 5 and 6.
For simplicity, instead of using , we replace it with the Baire space . For our purposes, the Cohen forcing consists of conditions which are finite segments , and we say that ( is stronger than ) if is an end-extension of .
When is -generic, we write the corresponding Cohen real as .
For a Borel set , we can use -absoluteness to define it in using the same Borel code, such that . Then recall that is comeager iff .
Now we define a notion of forcing that generically adds a nonempty perfect subset of .
The notion of forcing consists of conditions such that for some , is a function , satisfying for all ,
where denotes end-extension.
For conditions , we say that ( is stronger than ) if is an end-extension of , that is .
When is generic, we can define a function such that for all , . (We will show in Lemma 7.)
This is clearly continuous, and we will see that in fact it is an embedding, so that is a nonempty perfect set. The main lemma is the following:
For all pairwise distinct (), is -generic over .
The proof is mostly standard, and the only nontrivial step is the following.
Let with , and let be a dense set. Then there exists some with and .
Lemma 8
Consider . Then since is dense, there exists some such that . Define such that
Now we finish by checking that , .
Lemma 7
Fix such that are pairwise distinct for .
For any open dense set and , define such that
Note that for every (pairwise distinct), the set is open dense in , and so as a finite intersection of these many open dense sets is open dense in .
Define such that for any with ,
Since we've shown that is open dense in , Lemma 8 implies that is dense, so we can fix some and let .
Since , are pairwise distinct for . By definition of and , we have
Since , we also have as an initial segment, so meets as desired.
When combined with Lemma 4, Lemma 7 implies that is an independent nonempty perfect set. Then the statement “there exists an independent nonempty perfect set” is , so -absoluteness implies that it holds in as well. This gives an alternative proof of (iii).
Infinite independent sets
Questions of the form “Which admits an infinite independent set?” is once again less related to the question of , but more related to partition properties of cardinals. For example:
[3, Theorem 45.2]
Let be a Ramsey cardinal and let . Then every admits an independent set of size .
Compared with the main phenomema (i) and (ii), the consistency of “every admits an infinite independent set” seems to be still unclear. The best result I could find is the following:
[4, Theorem 2]
Assume . The following are equivalent:
- Every admits an independent set of size .
- .
So if , then does not satisfy the critetion of this last theorem, see eg. [5, Proposition 7.15].
Strong Fubini's Theorem
We conclude this article with a connection to the strong Fubini's theorem. I first learned about strong Fubini's theorem from でぃぐさん's article [6].
Let denote the set of Lebesgue null sets in .
The following are equivalent:
- Every admits an independent set of size .
- For any function , it holds that
whenever both integrals exist in the sense of Lebesgue integration.
The reader may compare this statement with the statement of Theorem 3, where every admitting an independent set of size is equivalent to .
It's easy to see that statement (1) from Proposition 11 is equivalent to the following statement:
(1') Every admits an independent pair , in the sense that and .
- Here, (1) ⇒ (1') is easy since given any , we can let be defined via if and otherwise, and so any -independent set of size gives an -independent pair .
- Next, (1') ⇒ (1) is also easy since if , then letting for every , , we see that any -independent pair gives an -independent set of size .
A proof from [6, Lemma 2] showed that statement (2) of Proposition 11 is equivalent to the following statement:
(2') There does not exist a set , such that:
- For every , the vertical section is Lebesgue conull;
- For every , the horizontal section is Lebesgue null.
Note that in [6, Lemma 2], the quantifiers for the sections' coordinates are "for almost every", but we can always modify over a Lebesgue null subset of to get to a set of our desired form, where we can quantify over every vertical/horizontal section.
It remains to show that (1') ↔ (2'). The following proofs are essentially contained in [6, Theorem 3].
Let admit no independent pair. That is, for all , we have or .
Define the set .
- Fix any . For any , we have either so then , or . So every possible is covered by . Then since , the section is Lebesgue conull.
- Fix any . Then the section is Lebesgue null.
So violates (2').
Let violate (2'). So for every , we have and .
Define the function such that
Fix any .
So admits no independent pair.