Math 2.0

Difference and functional equations Definition

Submultiplicative function

Builds on Semigroup

Definition

Let (S,⋅)(S, \cdot) be a semigroup. A function f ⁣:S→[0,∞)f \colon S \to [0, \infty) is submultiplicative if f(x⋅y)≤f(x) f(y)for all x,y∈S.f(x \cdot y) \le f(x) \, f(y) \quad \text{for all } x, y \in S.

Remarks

For S=(ℕ≥1,+)S = (\N_{\ge 1}, +) the condition reads am+n≤amana_{m+n} \le a_m a_n for a sequence (an)n≥1(a_n)_{n \ge 1}, and one speaks of a submultiplicative sequence. Example: on the multiplicative semigroup (0,∞)(0, \infty), let f(x)=x+1f(x) = x + 1. Then f(xy)=xy+1≤xy+x+y+1=f(x)f(y)f(xy) = xy + 1 \le xy + x + y + 1 = f(x) f(y), since x,y>0x, y > 0. Example: for a square matrix AA and a matrix norm with ∥BC∥≤∥B∥∥C∥\norm{BC} \le \norm{B} \norm{C}, the sequence an=∥An∥a_n = \norm{A^n} is submultiplicative. Non-example: the constant function f=1/2f = 1/2 on any semigroup fails the condition, since 1/2>1/4=f(x)f(y)1/2 > 1/4 = f(x) f(y). If ff takes only positive values, then ff is submultiplicative exactly when log⁡f\log f satisfies log⁡f(xy)≤log⁡f(x)+log⁡f(y)\log f(xy) \le \log f(x) + \log f(y).

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Semigroup concept
  2. Submultiplicative function definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Subadditivity
About this page
TagW5YGV8P9F2
URIm2://W5YGV8P9F2
Kinddefinition
WritingW0 stub
MSC39B62
DefinesSubmultiplicative function
UsesSemigroup

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.