TOPICS
Search

Countable Monotonicity


Countable monotonicity is a property of a nonnegative set function. Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] has countable monotonicity if, whenever a set E in S and a countable collection {E_k}_(k=1)^infty of sets in S satisfy E subset=  union _(k=1)^inftyE_k,

 mu(E)<=sum_(k=1)^inftymu(E_k).

A set function with this property is said to be countably monotone.

If S is a sigma-algebra, then any nonnegative set function mu that is monotone and countably additive is countably monotone. Here monotone means that mu(A)<=mu(B) whenever A subset= B for A,B in S. The converse is not true in general.


See also

Countable Additivity, Cover, Finite Monotonicity, Monotone, Monotonic Function, Set Function

Portions of this entry contributed by Christopher Stover

Explore with Wolfram|Alpha

References

Royden, H. L. and Fitzpatrick, P. M. Real Analysis, 4th ed. Boston, MA: Pearson-Prentice Hall, 2010.

Referenced on Wolfram|Alpha

Countable Monotonicity

Cite this as:

Weisstein, Eric W., with contributions by Christopher Stover. "Countable Monotonicity." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CountableMonotonicity.html

Subject classifications