998.
The
convexity number of a set is the least size of a family of convex sets with . is
countably convex if its convexity number is countable. Otherwise is
uncountably convex.
Uncountably convex closed sets in have been studied recently by Geschke, Kubis, Kojman and Schipperus. Their line of research is continued in the present article. We show that for all , it is consistent that there is an uncountably convex closed set whose convexity number is strictly smaller than all convexity numbers of uncountably convex subsets of .
Moreover, we construct a closed set whose convexity number is and that has no uncountable -clique for any 1$">. Here is a -clique if the convex hull of no -element subset of is included in . Our example shows that the main result of the above-named authors, a closed set either has a perfect -clique or the convexity number of is in some forcing extension of the universe, cannot be extended to higher dimensions.
相似文献