I was thinking if it's possible to generalize the idea of averages, like we have already the arithmetic, geometric and harmonic averages and I realized that they share some properties and I'd like to know if there's a theory about averages and generalizations.
So, my idea to try to tackle the problem is the following:
For each $n \in \mathbb{Z}_{>0} $ define the set $X_n = \{ (x_1, ..., x_n) \in \mathbb{R}^n : x_i > 0 \ \forall i \}$ . Consider the set $X = \cup_{n \in \mathbb{Z}_{>0}} X_n$.
Then what I realized is that averages satisfy the following properties:
Is a function $f: X \rightarrow \mathbb{R}_{>0}$
If we have $(x_1, ..., x_n) \in X$, let $m = \min \{x_1, ..., x_n\}$ and $M = \max \{x_1,...,x_n\}$ then $m \leq f(x_1, ..., x_n) \leq M$ with equality iff $x_1 = ... = x_n$ i.e. the "average" will always be strictly bigger than the minimum value and strictly less than the maximum if there are at least two different values
If $(x_1,...,x_n) \in X$ and $\sigma \in S_n$ the group of permutations of $\{ 1,..., n\}$ then $f(x_1,...,x_n) = f(x_{\sigma(1)}, ..., x_{\sigma(n)})$
If $(x_1,...,x_n) \in X$ and $x_{n+1} > 0$ then we have that:
$x_{n+1} > f(x_1,...,x_n) \Leftrightarrow f(x_1,...,x_n,x_{n+1}) > f(x_1,...,x_n)$ ,and we could also replace $>$ for $=$ or $<$
This last one is about pondered averages:
If we $(x_1,...,x_n) \in X$ then for every $m \in \mathbb{Z}_{>0}$ we have that $f(x_1,...,x_n) = f(y_1,...,y_m,...,y_{nm})$ where for each $k \in \{1,...,n \}$ we set $y_{(k-1)m + 1} =... = y_{km} = x_k$
So my question is if is there a way to generalize averages or if there's a theory corcening about it and if it can be interesting somehow