Math 2.0

Real functions Theorem

Kolmogorov–Nagumo characterization of quasi-arithmetic means

Builds on Quasi-arithmetic meanFunctional equationIntervalContinuous functionStrictly monotone function

Statement

Let II be a real interval. For each integer n≥1n \ge 1, let Mn ⁣:In→ℝM_n \colon I^n \to \R be a function. Assume that the sequence (Mn)(M_n) has these four properties for all n≥1n \ge 1.

  1. MnM_n is continuous and strictly increasing in each variable.
  2. MnM_n is symmetric: its value does not change when its arguments are permuted.
  3. Mn(x,x,…,x)=xM_n(x, x, \dots, x) = x for all x∈Ix \in I.
  4. For all 1≤k≤n1 \le k \le n and x1,…,xn∈Ix_1, \dots, x_n \in I, with m=Mk(x1,…,xk)m = M_k(x_1, \dots, x_k), one has Mn(x1,…,xk,xk+1,…,xn)=Mn(m,…,m,xk+1,…,xn)M_n(x_1, \dots, x_k, x_{k+1}, \dots, x_n) = M_n(m, \dots, m, x_{k+1}, \dots, x_n), where mm is repeated kk times.

Then there is a continuous strictly monotone function φ ⁣:I→ℝ\varphi \colon I \to \R such that, for all nn, MnM_n is the quasi-arithmetic mean generated by φ\varphi: Mn(x1,…,xn)=φ−1(1n∑i=1nφ(xi)).M_n(x_1, \dots, x_n) = \varphi^{-1}\left( \frac{1}{n} \sum_{i=1}^{n} \varphi(x_i) \right). Conversely, every quasi-arithmetic mean has properties 1 to 4.

Remarks

The converse is a direct check: property 4 holds because replacing x1,…,xkx_1, \dots, x_k by mm does not change the sum ∑φ(xi)\sum \varphi(x_i). For the main direction, one fixes two points a<ba < b of II and defines φ\varphi on the numbers Mn(a,…,a,b,…,b)M_n(a, \dots, a, b, \dots, b) with kk copies of bb out of nn as k/nk/n. Properties 1 to 4 show that this is consistent and strictly increasing on a dense set of points, and continuity extends it. The theorem was proved independently by Kolmogorov and by Nagumo in 1930. Strict monotonicity cannot be weakened to monotonicity: Mn(x1,…,xn)=min⁡ixiM_n(x_1, \dots, x_n) = \min_i x_i is continuous, increasing in each variable and has properties 2 to 4, but it is not a quasi-arithmetic mean.

Going deeper

For a student

The theorem turns a question about means into a functional equation for the generator φ\varphi, and the solution is unique up to φ↦aφ+b\varphi \mapsto a \varphi + b. It is used to justify the choice of particular means in statistics, economics and information theory. For example, adding the requirement Mn(x1+c,…,xn+c)=Mn(x1,…,xn)+cM_n(x_1 + c, \dots, x_n + c) = M_n(x_1, \dots, x_n) + c narrows the generators to φ(x)=x\varphi(x) = x and φ(x)=eax\varphi(x) = e^{ax} up to affine changes. That narrowing is the route from quasi-arithmetic means to Rényi entropies.

Reading path

To understand this page from the ground up, read these 6 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. Continuous function concept
  2. Functional equation concept
  3. Interval concept
  4. Quasi-arithmetic mean concept
  5. Strictly monotone function concept
  6. Kolmogorov–Nagumo characterization of quasi-arithmetic means statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Quasi-arithmetic_mean
About this page
Tag9Q5DPYQ5NP
URIm2://9Q5DPYQ5NP
Kindstatement, theorem
WritingW0 stub
MSC26E60, 39B22
StatusThis copy of the site has no build data. Run m2 status 9Q5DPYQ5NP.
AboutQuasi-arithmetic mean
UsesQuasi-arithmetic mean, Functional equation, Interval, Continuous function, Strictly monotone function

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.