Finite Subadditivity

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

A set function possessing finite subadditivity is said to be finitely subadditive. In particular, every finitely additive set function 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

More things to try:

References

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

Referenced on Wolfram|Alpha

Finite Subadditivity

Cite this as:

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

Subject classifications