Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2015/iii/paper-23/1/d/solution

An ultrafilter on is kappa-complete if, for every index set with and every family of members of ,
The bound is strictly fewer than sets. In particular every ultrafilter is -complete, since this requires only finite intersections; countably complete ultrafilters require intersections of countably many members, equivalently -completeness.

New to topics? Read the docs here!