To prove unboundedness, begin above any prescribed ordinal with and choose a strictly increasing sequence so that
This upper bound is below : there are fewer than countable sets in the union, and is regular and uncountable. Put . For any , choose with ; then . Thus .
For closedness, suppose is a limit point of . Given , choose with . Then . Therefore as well. Hence is a club set in . This is the club of closure points for countable set-valued functions.

Articles by others on the same topic (0)

There are currently no matching articles.