TOPICS
Search

Finite Subadditivity


A set function mu is said to possess finite subadditivity if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined,

 mu( union _(k=1)^nE_k)<=sum_(k=1)^nmu(E_k).

A set function possessing finite subadditivity is said to be finitely subadditive. In particular, every finitely additive set function mu is also finitely subadditive.


See also

Countable Additivity, Countable Subadditivity, Disjoint Union, Finite Additivity, Set Function

This entry contributed by Christopher Stover

Explore with Wolfram|Alpha

References

Royden, H. L. and Fitzpatrick, P. M. Real Analysis. Pearson, 2010.

Cite this as:

Stover, Christopher. "Finite Subadditivity." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/FiniteSubadditivity.html

Subject classifications