Jump to content

Superadditive set function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Erel Segal (talk | contribs) at 13:27, 21 December 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 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 be a set and be a set function, where denotes the power set of . The function f is superadditive if for any pair of disjoint subsets of , we have .[1]

See also

Citations

  1. ^ Nimrod Megiddo (1988). "ON FINDING ADDITIVE, SUPERADDITIVE AND SUBADDITIVE SET-FUNCTIONS SUBJECT TO LINEAR INEQUALITIES" (PDF). Retrieved 21 December 2015.