VOOZH about

URL: https://en.wikipedia.org/wiki/Superadditive

⇱ Superadditivity - Wikipedia


Jump to content
From Wikipedia, the free encyclopedia
(Redirected from Superadditive)
Property of a function

In mathematics, a function πŸ‘ {\displaystyle f}
is superadditive if πŸ‘ {\displaystyle f(x+y)\geq f(x)+f(y)}
for all πŸ‘ {\displaystyle x}
and πŸ‘ {\displaystyle y}
in the domain of πŸ‘ {\displaystyle f.}

Similarly, a sequence πŸ‘ {\displaystyle a_{1},a_{2},\ldots }
is called superadditive if it satisfies the inequality πŸ‘ {\displaystyle a_{n+m}\geq a_{n}+a_{m}}
for all πŸ‘ {\displaystyle m}
and πŸ‘ {\displaystyle n.}

The term "superadditive" is also applied to functions from a boolean algebra to the real numbers where πŸ‘ {\displaystyle P(X\lor Y)\geq P(X)+P(Y),}
such as lower probabilities.

Examples of superadditive functions

[edit]

Properties

[edit]

If πŸ‘ {\displaystyle f}
is a superadditive function whose domain contains πŸ‘ {\displaystyle 0,}
then πŸ‘ {\displaystyle f(0)\leq 0.}
To see this, simply set πŸ‘ {\displaystyle x=0}
and πŸ‘ {\displaystyle y=0}
in the defining inequality.

The negative of a superadditive function is subadditive.

Fekete's lemma

[edit]

The major reason for the use of superadditive sequences is the following lemma due to Michael Fekete.[4]

Lemma: (Fekete) For every superadditive sequence πŸ‘ {\displaystyle a_{1},a_{2},\ldots ,}
the limit πŸ‘ {\displaystyle \lim a_{n}/n}
is equal to the supremum πŸ‘ {\displaystyle \sup a_{n}/n.}
(The limit may be positive infinity, as is the case with the sequence πŸ‘ {\displaystyle a_{n}=\log n!}
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 πŸ‘ {\displaystyle m}
and πŸ‘ {\displaystyle 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).[5][6]

See also

[edit]

References

[edit]
  1. ^ M. Marcus, H. Minc (1992). A survey in matrix theory and matrix inequalities. Dover. Theorem 4.1.8, page 115.
  2. ^ Horst Alzer (2009). "A superadditive property of Hadamard's gamma function". Abhandlungen aus dem Mathematischen Seminar der UniversitΓ€t Hamburg. 79. Springer: 11–23. doi:10.1007/s12188-008-0009-5. S2CID 123691692.
  3. ^ Sloane, N. J. A. (ed.). "Sequence A381340 (Decimal value of c > 1.5 for which H(2*c) = 2*H(c) for H = Hadamard's gamma function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ Fekete, M. (1923). "Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten". Mathematische Zeitschrift. 17 (1): 228–249. doi:10.1007/BF01504345. S2CID 186223729.
  5. ^ Michael J. Steele (1997). Probability theory and combinatorial optimization. SIAM, Philadelphia. ISBN 0-89871-380-3.
  6. ^ Michael J. Steele (2011). CBMS Lectures on Probability Theory and Combinatorial Optimization. University of Cambridge.

Notes

  • GyΓΆrgy Polya and GΓ‘bor SzegΓΆ. (1976). Problems and theorems in analysis, volume 1. Springer-Verlag, New York. ISBN 0-387-05672-6.

This article incorporates material from Superadditivity on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.