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-resit/9/b/iii/solution

The disjoint decomposition into sets uses only events in . Finite additivity and nonnegativity give
Thus already follows from the two stated requirements. Equality is attained, for example, by choosing , since then . More generally it holds whenever . Neither normalization nor countable additivity is needed for this particular inequality.

New to topics? Read the docs here!