Superadditive set function
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 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]
gollark: You can do that to some extent, but if everyone else is spreading disease constantly (and you can't work from home etc., because not all companies actually allow this) there are limits to what you can do yourself.
gollark: Spreading disease/not taking precautions is a negative externality™ against other people.
gollark: It's an analogy.
gollark: Yes. There are multiple people in existence, so one example of a thing being okay for you doesn't generalize.
gollark: There really should be standard machine-readable metadata for looking up papers based on things.
Citations
- Nimrod Megiddo (1988). "ON FINDING ADDITIVE, SUPERADDITIVE AND SUBADDITIVE SET-FUNCTIONS SUBJECT TO LINEAR INEQUALITIES" (PDF). Retrieved 21 December 2015.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.