Jump to content

Superadditive set function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 20:38, 29 September 2015 (Definition). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 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 with to subadditive set function.

Definition

Let be a set and be a set function, where denotes the power set of . The function f is superadditive if for any two subsets and of , we have .

See also

Citations