In mathematics, a superadditive set function is a set function whose value when applied to the union of two disjoint sets is greater than or equal to the sum of values of the function applied to each of the sets separately. This definition is analogous to the notion of superadditivity for real-valued functions. It is contrasted to subadditive set function.
Definition
Let Ω {\displaystyle \Omega } be a set and f : 2 Ω → R {\displaystyle f\colon 2^{\Omega }\rightarrow \mathbb {R} } be a set function, where 2 Ω {\displaystyle 2^{\Omega }} denotes the power set of Ω {\displaystyle \Omega } . The function f is superadditive if for any pair of disjoint subsets S , T {\displaystyle S,T} of Ω {\displaystyle \Omega } , we have f ( S ) + f ( T ) ≤ f ( S ∪ T ) {\displaystyle f(S)+f(T)\leq f(S\cup T)} .1
See also
Citations
References
Nimrod Megiddo (1988). "ON FINDING ADDITIVE, SUPERADDITIVE AND SUBADDITIVE SET-FUNCTIONS SUBJECT TO LINEAR INEQUALITIES" (PDF). Retrieved 21 December 2015. http://theory.stanford.edu/~megiddo/pdf/Finding_supperadditiveX.pdf ↩