Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 3 ii b Solution Created 2026-10-03 Updated 2026-10-07
To prove unboundedness, begin above any prescribed ordinal with and choose a strictly increasing sequence so thatThis 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.