Let S be a collection of subsets of a set X and let μ:S->[0, ∞] be a set function. The function μ is called a premeasure provided that μ is finitely additive, countably monotone, and that μ(∅) = 0 if ∅ element S, where ∅ is the empty set.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.