In mathematics, a sequence { an }, n ≥ 1, is called superadditive if it satisfies the inequality

$a_{n+m} \geq a_n+a_m\,$

for all m and n. The major reason for the use of superadditive sequences is the following lemma due to Michael Fekete.[1]

Lemma: (Fekete) For every superadditive sequence { an }, n ≥ 1, the limit lim an/n exists and is equal to sup an/n. (The limit may be positive infinity, for instance, for the sequence an = log n!.)

Similarly, a function f is superadditive if

$f(x+y) \geq f(x)+f(y)\,$

for all x and y in the domain of f.

For example, $f(x)=x^2$ is a superadditive function for nonnegative real numbers because the square of $(x+y)$ is always greater than or equal to the square of $x$ plus the square of $y$, for nonnegative real numbers $x$ and $y$.

The analogue of Fekete's lemma holds for subadditive functions as well. There are extensions of Fekete's lemma that do not require the definition of superadditivity above to hold for all m and n. There are also results that allow one to deduce the rate of convergence to the limit whose existence is stated in Fekete's lemma if some kind of both superadditivity and subadditivity is present. A good exposition of this topic may be found in Steele (1997).[2][3]

If f is a superadditive function, and if 0 is in its domain, then f(0) ≤ 0. To see this, take the inequality at the top. $f(x) \le f(x+y) - f(y)$. Hence $f(0) \le f(0+y) - f(y) = 0$