This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "Generalized mean" – news · newspapers · books · scholar · JSTOR (June 2020) (Learn how and when to remove this template message)

In mathematics, **generalized means** (or **power mean** or **Hölder mean** from Otto Hölder)^{[1]} are a family of functions for aggregating sets of numbers. These include as special cases the Pythagorean means (arithmetic, geometric, and harmonic means).

If p is a non-zero real number, and are positive real numbers, then the **generalized mean** or **power mean** with exponent p of these positive real numbers is:^{[2]}^{[3]}

(See p-norm). For *p* = 0 we set it equal to the geometric mean (which is the limit of means with exponents approaching zero, as proved below):

Furthermore, for a sequence of positive weights w_{i} we define the **weighted power mean** as:^{[2]}

and when

The unweighted means correspond to setting all *w _{i}* = 1/n.

A few particular values of p yield special cases with their own names:^{[4]}

- minimum
- harmonic mean
- geometric mean
- arithmetic mean
- root mean square

or quadratic mean^{[5]}^{[6]} - cubic mean
- maximum

For the purpose of the proof, we will assume without loss of generality that and .

We can rewrite the definition of M_{p} using the exponential function

In the limit *p* → 0, we can apply L'Hôpital's rule to the argument of the exponential function. We assume that p ∈ R but p ≠ 0, and that the sum of w_{i} is equal to 1 (without loss in generality);^{[7]} Differentiating the numerator and denominator with respect to p, we have

By the continuity of the exponential function, we can substitute back into the above relation to obtain

as desired.

Assume (possibly after relabeling and combining terms together) that . Then

The formula for follows from

Let be a sequence of positive real numbers, then the following properties hold:^{[1]}

- .Each generalized mean always lies between the smallest and largest of the x values.
- , where is a permutation operator.Each generalized mean is a symmetric function of its arguments; permuting the arguments of a generalized mean does not change its value.
- .Like most means, the generalized mean is a homogeneous function of its arguments
*x*_{1}, ...,*x*. That is, if b is a positive real number, then the generalized mean with exponent p of the numbers is equal to b times the generalized mean of the numbers_{n}*x*_{1}, ...,*x*._{n} - .Like the quasi-arithmetic means, the computation of the mean can be split into computations of equal sized sub-blocks. This enables use of a divide and conquer algorithm to calculate the means, when desirable.

In general, if *p* < *q*, then

and the two means are equal if and only if

The inequality is true for real values of p and q, as well as positive and negative infinity values.

It follows from the fact that, for all real p,

which can be proved using Jensen's inequality.

In particular, for p in {−1, 0, 1}, the generalized mean inequality implies the Pythagorean means inequality as well as the inequality of arithmetic and geometric means.

We will prove the weighted power mean inequality. For the purpose of the proof we will assume the following without loss of generality:

The proof for unweighted power means can be easily obtained by substituting *w _{i}* = 1/

Suppose an average between power means with exponents p and q holds:

applying this, then:

We raise both sides to the power of −1 (strictly decreasing function in positive reals):

We get the inequality for means with exponents −*p* and −*q*, and we can use the same reasoning backwards, thus proving the inequalities to be equivalent, which will be used in some of the later proofs.

For any *q* > 0 and non-negative weights summing to 1, the following inequality holds:

The proof follows from Jensen's inequality, making use of the fact the logarithm is concave:

By applying the exponential function to both sides and observing that as a strictly increasing function it preserves the sign of the inequality, we get

Taking q-th powers of the x_{i}, we are done for the inequality with positive q; the case for negatives is identical.

We are to prove that for any *p* < *q* the following inequality holds:

if p is negative, and q is positive, the inequality is equivalent to the one proved above:

The proof for positive p and q is as follows: Define the following function: *f* : **R**_{+} → **R**_{+} . f is a power function, so it does have a second derivative:

which is strictly positive within the domain of f, since

Using this, and the Jensen's inequality we get:

after raising both side to the power of 1/

Using the previously shown equivalence we can prove the inequality for negative p and q by replacing them with −q and −p, respectively.

Main article: Generalized f-mean |

The power mean could be generalized further to the generalized f-mean:

This covers the geometric mean without using a limit with *f*(*x*) = log(*x*). The power mean is obtained for *f*(*x*) = *x ^{p}*. Properties of these means are studied in de Carvalho (2016).

A power mean serves a non-linear moving average which is shifted towards small signal values for small p and emphasizes big signal values for big p. Given an efficient implementation of a moving arithmetic mean called `smooth`

one can implement a moving power mean according to the following Haskell code.

```
powerSmooth :: Floating a => ([a] -> [a]) -> a -> [a] -> [a]
powerSmooth smooth p = map (** recip p) . smooth . map (**p)
```

- For big p it can serve as an envelope detector on a rectified signal.
- For small p it can serve as a baseline detector on a mass spectrum.