Superadditive set function

In mathematics, a superadditive set function is a set function whose value, informally, has the property that the value of function on the union of two disjoint sets is at least the sum of values of the function on each of the sets. This is thematically related to the superadditivity property of real-valued functions. It is contrasted to subadditive set function.

Definition

Let \Omega be a set and f \colon 2^{\Omega} \rightarrow \mathbb{R} be a set function, where 2^\Omega denotes the power set of \Omega. The function f is superadditive if for any pair of disjoint subsets S,T of \Omega, we have f(S) + f(T) \leq f(S \cup T).[1]

See also

Citations

This article is issued from Wikipedia - version of the Monday, December 21, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.