TOPICS
Search

Finite Monotonicity


Finite monotonicity of a set function mu:S->[0,infty], where S is a collection of subsets of a set X, means that, whenever a set E in S is contained in the union of a finite collection {E_k}_(k=1)^n of sets in S,

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

A set function possessing finite monotonicity is said to be finitely monotone. A set function mu which is countably monotone is necessarily finitely monotone provided that emptyset in S and mu(emptyset)=0, where emptyset is the empty set.


See also

Countable Monotonicity, Monotone, Set Function

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

Finite Monotonicity

Cite this as:

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

Subject classifications