In mathematics, a subadditive set function is a set function whose value, informally, has the property that the value of function on the union of two sets is at most the sum of values of the function on each of the sets. This is thematically related to the subadditivity property of real-valued functions.
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 subadditive if for each subset S {\displaystyle S} and T {\displaystyle T} of Ω {\displaystyle \Omega } , we have f ( S ) + f ( T ) ≥ f ( S ∪ T ) {\displaystyle f(S)+f(T)\geq f(S\cup T)} . Note that by substitution of T = S {\displaystyle T=S} into the defining equation, it follows that f ( S ) ≥ 0 {\displaystyle f(S)\geq 0} for all S {\displaystyle S} .
Examples of subadditive functions
… excerpt ends here. Continue reading the full article.

