This paper deals with families of infinite sets, typically given in some definable way in the descriptive set theoretic sense. In analogy with the results in our companion paper, that deals with finite sets, we show here how in a first-order way we can define intersecting families, and how we can extract from them small sets, at least under reasonable restrictions.

These results have been in the works for a while, but it is only very recently that we have been able to state them in their current generality, thanks to recent advances due to Ben Miller. In the mean time, Richard Ketchersid and I have proved some results in models of (continuing the work reported here) that have also allowed the four of us to find a few extensions of the results in this paper to models of

Here is a sample result, a generalization of the perfect set theorem:

Theorem. Suppose that is -Suslin. Then either

contains a pairwise disjoint perfect subset, i.e., for any two sequences in the subset, for all we have or else

is the union of many graph intersecting -Borel sets, i.e., for any two sequences in any of these sets, there is some such that

Here, a set is -Borel iff it comes from basic open sets by taking unions and complements, where we now allow the unions to have size rather than just countable.

An interesting side effect of our arguments is that the results are provable in We also consider a few extensions that use the axiom of choice, but have decided to indicate explicitly whenever choice is required.

This entry was posted on Friday, April 23rd, 2010 at 8:47 am and is filed under Papers. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.