Superadditivity

Template:Short description In mathematics, a function <math>f</math> is superadditive if <math>f(x+y) \geq f(x) + f(y)</math> for all <math>x</math> and <math>y</math> in the domain of <math>f.</math>

Similarly, a sequence <math>a_1, a_2, \ldots</math> is called superadditive if it satisfies the inequality <math display=block>a_{n+m} \geq a_n + a_m</math> for all <math>m</math> and <math>n.</math>

The term "superadditive" is also applied to functions from a boolean algebra to the real numbers where <math>P(X \lor Y) \geq P(X) + P(Y),</math> such as lower probabilities.

Examples of superadditive functions

• The map <math>f(x) = x^2</math> is a superadditive function for nonnegative real numbers because <math>f(x + y) = (x + y)^2 = x^2 + y^2 + 2 x y = f(x) + f(y) + 2 x y \ge f(x) + f(y).</math>

• The determinant is superadditive for nonnegative Hermitian matrix, that is, if <math>A, B \in \text{Mat}_n(\Complex)</math> are nonnegative Hermitian then <math>\det(A + B) \geq \det(A) + \det(B).</math> This follows from the Minkowski determinant theorem, which more generally states that <math>\det(\cdot)^{1/n}</math> is superadditive (equivalently, concave)<ref>M. Marcus, H. Minc (1992). A survey in matrix theory and matrix inequalities. Dover. Theorem 4.1.8, page 115.</ref> for nonnegative Hermitian matrices of size <math>n</math>: If <math>A, B \in \text{Mat}_n(\Complex)</math> are nonnegative Hermitian then <math>\det(A + B)^{1/n} \geq \det(A)^{1/n} + \det(B)^{1/n}.</math>
• Horst Alzer proved<ref>Template:Cite journal</ref> that Hadamard's gamma function <math>H(x)</math> is superadditive for all real numbers <math>x, y</math> with <math>x, y \geq 1.5031.</math><ref>Template:Cite OEIS</ref>
• Mutual information

Properties

If <math>f</math> is a superadditive function whose domain contains <math>0,</math> then <math>f(0) \leq 0.</math> To see this, simply set <math>x=0</math> and <math>y=0</math> in the defining inequality.

The negative of a superadditive function is subadditive.

Fekete's lemma

The major reason for the use of superadditive sequences is the following lemma due to Michael Fekete.<ref>Template:Cite journal</ref>

Lemma: (Fekete) For every superadditive sequence <math>a_1, a_2, \ldots,</math> the limit <math>\lim a_n/n</math> is equal to the supremum <math>\sup a_n/n.</math> (The limit may be positive infinity, as is the case with the sequence <math>a_n = \log n!</math> for example.)

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 <math>m</math> and <math>n.</math> 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).<ref>Template:Cite book</ref><ref>Template:Cite video</ref>

See also

• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link

References

Notes

• Template:Cite book

{{#if: | This article incorporates material from the following PlanetMath articles, which are licensed under the Creative Commons Attribution/Share-Alike License: {{#if: | Superadditivity | {{#if: 4616 | Superadditivity | [{{{sourceurl}}} Superadditivity] }} }}, {{#if: | {{{title2}}} | {{#if: | {{{title2}}} | [{{{sourceurl2}}} {{{title2}}}] }} }}{{#if: | , {{#if: | {{{title3}}} | {{#if: | {{{title3}}} | [{{{sourceurl3}}} {{{title3}}}] }} }} }}{{#if: | , {{#if: | {{{title4}}} | {{#if: | {{{title4}}} | [{{{sourceurl4}}} {{{title4}}}] }} }} }}{{#if: | , {{#if: | {{{title5}}} | {{#if: | {{{title5}}} | [{{{sourceurl5}}} {{{title5}}}] }} }} }}{{#if: | , {{#if: | {{{title6}}} | {{#if: | {{{title6}}} | [{{{sourceurl6}}} {{{title6}}}] }} }} }}{{#if: | , {{#if: | {{{title7}}} | {{#if: | {{{title7}}} | [{{{sourceurl7}}} {{{title7}}}] }} }} }}{{#if: | , {{#if: | {{{title8}}} | {{#if: | {{{title8}}} | [{{{sourceurl8}}} {{{title8}}}] }} }} }}{{#if: | , {{#if: | {{{title9}}} | {{#if: | {{{title9}}} | [{{{sourceurl9}}} {{{title9}}}] }} }} }}. | This article incorporates material from {{#if: | Superadditivity | Superadditivity}} on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License. }}