Superadditivity

In mathematics, a function f {\displaystyle f} is superadditive if f ( x + y ) ≥ f ( x ) + f ( y ) {\displaystyle f(x+y)\geq f(x)+f(y)} for all x {\displaystyle x} and y {\displaystyle y} in the domain of f . {\displaystyle f.} Similarly, a sequence a 1 , a 2 , … {\displaystyle a_{1},a_{2},\ldots } is called superadditive if it satisfies the inequality a n + m ≥ a n + a m {\displaystyle a_{n+m}\geq a_{n}+a_{m}} for all m {\displaystyle m} and n .

Source: Wikipedia — Superadditivity (CC BY-SA 4.0)

Superadditivity

In mathematics, a function f {\displaystyle f} is superadditive if f ( x + y ) ≥ f ( x ) + f ( y ) {\displaystyle f(x+y)\geq f(x)+f(y)} for all x {\displaystyle x} and y {\displaystyle y} in the domain of f . {\displaystyle f.} Similarly, a sequence a 1 , a 2 , … {\displaystyle a_{1},a_{2},\ldots } is called superadditive if it satisfies the inequality a n + m ≥ a n + a m {\displaystyle a_{n+m}\geq a_{n}+a_{m}} for all m {\displaystyle m} and n .

This neuron ends here.

Source: Wikipedia "Superadditivity" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy