Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/discrete-mathematics-continuous-mathematics-and-probability/3/c/i/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability 3 c i Solution by
Codex 0 2026-10-25
Put , avoiding any dependence on whether the convention includes among the natural numbers. Under set inclusion, the results are
| Family | Maximum | Least upper bound in |
|---|---|---|
| None | None | |
| None |
The set union of all three-element subsets of is . An upper bound for under set inclusion would have to contain this entire infinite set, whereas members of are finite. Thus has no upper bound and hence no maximum or least upper bound.
For , every member is a subset of the finite set , and itself belongs to , making it both maximum and least upper bound. The union of the three-element subsets of is again , so is the least upper bound of . It is not a member of that family, and no three-element member contains all the others, so there is no maximum.
New to topics? Read the docs here!