Next Article in Journal
Unpacking Mathematics Pedagogical Content Knowledge for Elementary Number Theory: The Case of Arithmetic Word Problems
Previous Article in Journal
Efficient k-Step Linear Block Methods to Solve Second Order Initial Value Problems Directly
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Invariant Means, Complementary Averages of Means, and a Characterization of the Beta-Type Means

by
Janusz Matkowski
1 and
Paweł Pasteczka
2,*
1
Institute of Mathematics, University of Zielona Góra, Szafrana 4a, PL-65-516 Zielona Góra, Poland
2
Institute of Mathematics, Pedagogical University of Krakow, Podchorążych 2, PL-30-084 Kraków, Poland
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(10), 1753; https://doi.org/10.3390/math8101753
Submission received: 4 September 2020 / Revised: 30 September 2020 / Accepted: 5 October 2020 / Published: 12 October 2020
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
We prove that whenever the selfmapping ( M 1 , , M p ) : I p I p , ( p N and M i -s are p-variable means on the interval I) is invariant with respect to some continuous and strictly monotone mean K : I p I then for every nonempty subset S { 1 , , p } there exists a uniquely determined mean K S : I p I such that the mean-type mapping ( N 1 , , N p ) : I p I p is K-invariant, where N i : = K S for i S and N i : = M i otherwise. Moreover min ( M i : i S ) K S max ( M i : i S ) . Later we use this result to: (1) construct a broad family of K-invariant mean-type mappings, (2) solve functional equations of invariant-type, and (3) characterize Beta-type means.
MSC:
primary 26E60; 39B22; secondary 39B12

1. Preliminaries

In the whole paper I R stands for an interval, p N , p > 1 is fixed, and N p : = { 1 , , p } .
A function M : I p I is called a mean on I if
min x 1 , , x p M x 1 , , x p max x 1 , , x p , x 1 , , x p I ,
or, briefly, if
min x M x max x , x = x 1 , , x p I p .
The mean M is called strict, if for all nonconstant vectors x these inequalities are sharp; and symmetric, if M x σ 1 , , x σ p = M x 1 , , x p for all x 1 , , x p I and all permutations σ of the set N p . Mean M is monotone if it is increasing in each of its variables. It is important to emphasize that every strictly monotone mean is strict.
A mapping M : I p I p is referred to as mean-type if there exist some means M i : I p I , i N p , such that M = ( M 1 , , M p ) . For a mean-type mapping M : I p I p we denote a projection onto the i-th coordinate by [ M ] i : I p I . In this case we obviously have [ M ] i = M i for all i N p .
We say that a function K : I p R is invariant with respect to M (briefly M -invariant), if K M = K .
Theorem 1
(Invariance Principle, [1]). If M : I p I p , M = ( M 1 , , M p ) is a continuous mean-type mapping such that
max M x min M x < max x min x , x I p \ Δ I p ,
where Δ I p : = x = x 1 , , x p I p : x 1 = = x p then there is a unique M -invariant mean K : I p I and the sequence of iterates M n n N of the mean-type mapping M converges to K : = K , , K pointwise on I p .

2. A Family of Complementary Means

Let us recall the following result.
Remark 1
(Matkowski [2]). Assume that K : I 2 I is a symmetric mean which is continuous and monotone.
Then
(i)
for an arbitrary mean M 1 : I 2 I there is a unique mean M 2 : I 2 I such that K is ( M 1 , M 2 ) -invariant,
K ( M 1 , M 2 ) = K ;
K M 1 : = M 2 , is referred to as a K-complementary mean for M 1 ; and we have
K M 1 = M 2 K M 2 = M 1 ;
(ii)
if M 1 , M 2 : I 2 I are means such that K is ( M 1 , M 2 ) -invariant, then there exists a unique mean M : I 2 I such that
min M 1 , M 2 M max M 1 , M 2
and
K ( M , M ) = K ;
moreover
M = K .
In this case, p 3 the counterpart of part (i) of Remark 1 is false which shows the following
Example 1.
Let I = R , and K = A where A x 1 , x 2 , x 3 = x 1 + x 2 + x 3 3 . The functions M 1 x 1 , x 2 , x 3 = x 1 + x 2 2 , M 2 x 1 , x 2 , x 3 = x 2 are means in R . Then it is easy to see that there is no mean M 3 such that
A M 1 , M 2 , M 3 = A ,
but a partial counterpart of part (ii) holds true.
The main result of this section reads as follows.
Theorem 2.
Let M 1 , , M p : I p I be means. Assume that K : I p I is a continuous and monotone mean which is invariant with respect to the mean type mapping M : = ( M 1 , , M p ) .
Then for every nonempty subset S N p there exists a unique mean K S ( M ) : I p I such that K in K S ( M ) -invariant, where K S ( M ) : I p I p is given by
[ K S ( M ) ] i : = K S ( M ) for i S , M i for i N p \ S .
Moreover, min ( M i : i S ) K S ( M ) max ( M i : i S ) .
Proof. 
In the case S = N p the K S ( M ) -invariance of K implies K S ( M ) = K and the statement is obvious. From now on we assume that S N p .
Denote briefly M : = max { M i : i S } and M : = min { M i : i S } . Fix x I n arbitrarily. Define a function T : I I p by
T ( α ) i : = M i ( x ) i N p \ S , α i S .
and f : I I by f ( α ) : = K T ( α ) . Then, as K is continuous and strictly increasing, so is f. Therefore in view of the equality K M ( x ) = K ( x ) we obtain f ( M ( x ) ) K ( x ) and f ( M ( x ) ) K ( x ) . Thus, there exists unique number α x [ M ( x ) , M ( x ) ] such that f ( α x ) = K ( x ) . Now, as x I n was arbitrary we define K S ( M ) ( x ) : = α x .
Then we have
K ( x ) = f ( α x ) = f ( K S ( M ) ( x ) ) = K T K S ( M ) ( x ) = K K S ( M ) ( x ) ,
which shows that K is K S ( M ) -invariant.
Now we need to show that K S ( M ) is uniquely determined. Assume that K is K S ( M ) -invariant and K S ( M ) ( x ) α x for some x I p . Then, as f is a monomorphism we obtain
K K S ( M ) ( x ) = K T K S ( M ) ( x ) f ( α x ) = K ( x )
contradicting the K S ( M ) -invariance. □
Let us underline that we do not assume that means M 1 , , M P are continuous. This is relatively recent approach to invariant property which was studied by the authors in [3].
The intuition beyond this theorem is the following. Once we have a continuous and monotone mean K such that M is K-invariant mean we can unite a subfamily ( M s ) s S into a single mean (denoted by K S ( M ) ) to preserve the K-invariance. In view of Theorem 1, such a mean is unique. In this connection we propose the following
Definition 1.
Let K : I p I be a continuous and monotone mean which is invariant with respect to the mean type mapping M : = ( M 1 , , M p ) .
For each set S N p :
(i) 
the mean K S ( M ) is called a K-complementary averaging of the means { M i : i S } with respect to the invariant mean-type mapping M = ( M 1 , , M p ) ;
(ii) 
the mean-type mapping K S ( M ) given by (1) is called a K-complementary averaging of the mean-type mapping M = ( M 1 , , M p ) with respect to the means { M i : i S } .
Moreover, the set
K K , M : = K S ( M ) : S N p , S
is called the family of all K-complementary averaging of the mean-type mapping M = ( M 1 , , M p ) .
We can now reapply this result to the complementary of the establish a K-complementary of K S ( M ) for the set N p \ S . More precisely we obtain
Corollary 1.
Under the assumptions of Theorem 2 there exists unique mean K S * ( M ) : I p I such that K is K S * ( M ) -invariant, where K S * ( M ) : I p I p is given by
[ K S * ( M ) ] i : = K S ( M ) for i S , K S * ( M ) for i N p \ S .
Moreover, min ( M i : i N p \ S ) K S * ( M ) max ( M i : i N p \ S ) .
Let us underline that the value K S * ( M ) does not depend on M explicitly. The whole system of dependences is illustrated in Figure 1.
Observe that, as the mean K S * ( M ) is uniquely determined, we obtain
K S * ( M ) K K , M all means ( M i : i N p \ S ) are equal to each other .

3. Application in Solving Functional Equations

Theorem 3.
Let M = ( M 1 , , M p ) be a mean-type mapping such that M 1 , , M p : 0 , p 0 , are strictly monotonic and homogeneous. Then
(i) 
the sequence M n : n N of iterates of M converge uniformly on compact subsets to a mean-type mapping K = K , , K , where K is a unique M -invariant mean.
(ii) 
K is monotone, homogeneous and for every S N p the iterates of K S ( M ) converge uniformly on compact subsets to a mean-type mapping K = K , , K ;
(iii) 
a function F : 0 , p R is continuous on the diagonal Δ 0 , p : = x 1 , , x p 0 , p : x 1 = = x p and satisfies the functional equation
F M = F
if and only if F = φ K , where φ : 0 , R is an arbitrary continuous function of a single variable;
(iv) 
a function F : 0 , p R is continuous on the diagonal Δ 0 , p and satisfies the simultaneous system of functional equations
F K S ( M ) = F , S N p ;
if and only if F = φ K , where φ : 0 , R is an arbitrary continuous function of a single variable (so (2) and (3) are equivalent)
Proof. 
The homogeneity and monotonicity of M 1 , , M p imply their continuity (cf. ([4], Theorem 2)), so the invariance principle implies (i).
Now we prove that K is monotone. Indeed, take two vectors v , w ( 0 , ) p such that v i w i for all i N p and v i 0 < w i 0 for certain i 0 N p . Then, as each M i is monotone, there exists a constant θ ( 0 , 1 ) such that M i ( v ) θ M i ( w ) for all i N p .
Then for all n N and i N p we have
M n ( v ) i = M n 1 ( M 1 ( v ) , , M p ( v ) ) i M n 1 ( θ M 1 ( w ) , , θ M p ( w ) ) i = θ M n 1 ( M 1 ( w ) , , M p ( w ) ) i = θ M n ( w ) i .
In a limit case as n in view of the first part of this statement we obtain K ( v ) θ K ( w ) < K ( w ) . Thus, K is monotone, which is (ii).
(iii) Assume first that F : 0 , p R that is continuous on the diagonal Δ 0 , p and satisfies Equation (2). Hence, by induction,
F = F M n , n N ,
By (ii) the sequence M n : n N converges to K = K , , K . Since F is continuous on Δ 0 , p , we hence get for all x 0 , p ,
F x = lim n F M n x = F lim n M n x = F K x = F K x , , K x .
Setting
φ t : = F t , , t , t 0 , ,
we hence get F x = φ K x for all x 0 , p .
To prove the converse implication, take an arbitrary function φ : I R and put F : = φ K . Then, for all x 0 , p , making use of the K-invariance with respect to M , we have
F M x = φ K M x = φ K M x = φ K x = F x ,
which completes the proof of (iii).
(iv) we omit similar argument. □
Part (ii) of this result gives rise to the following extension.

General Complementary Process

Once we have a mean-type M : I p I p and a continuous and monotone mean K : I p I which is M -invariant let K + M , K be the smallest family of mean-type mappings containing M which is closed under K-complementary averaging.
More precisely, for every X K + M , K and nonempty subset S N p we have K S ( X ) K + M , K , too. We also define a family of means
K 0 M , K : = [ X ] i : X K + M , K and i N p
Obviously using notions from Theorem 2 and Corollary 1 we have
K + M , K K + K S ( M ) , K K + K S * ( M ) , K
Furthermore, we have the following.
Proposition 1.
Given an interval I R , p N , and a mean-type mapping M : = ( M 1 , , M p ) : I p I p which is invariant with respect to some continuous and monotone mean K : I p I . Then
min ( M 1 , , M p ) X max ( M 1 , , M p ) for all X K 0 M , K .
Its inductive proof is obvious in view of Theorem 2 (moreover part).
Now we prove that complementary means preserve symmetry.
Proposition 2.
If a continuous and monotone mean K : I p I is invariant with respect to a mean-type mapping M : = ( M 1 , , M p ) : I p I p such that all M i -s are symmetric, then K and all means in K 0 M , K are symmetric.
Proof. 
Fix a nonconstant vector x I p and a permutation σ of N p . First observe that K ( x ) = K M ( x ) = K M ( x σ ) = K ( x σ ) , which implies that K is symmetric.
As the family K 0 M , K is generating by complementing, we need to show that symmetry is preserved by a single complement. Therefore, it is sufficient to show that the mean K S ( M ) defined in Theorem 2 is symmetric. However, using the notions therein, we have
K ( K S ( M ) ) ( x ) = K ( x ) = K ( x σ ) = K ( K S ( M ) ) ( x σ ) .
By monotonicity of K, if K S ( M ) ( x ) < K S ( M ) ( x σ ) we would have
K ( K S ( M ) ) ( x ) = K ( x ) < K ( K S ( M ) ) ( x σ )
contradicting the above equality. Similarly we exclude the case K S ( M ) ( x ) > K S ( M ) ( x σ ) . Therefore K S ( M ) ( x ) = K S ( M ) ( x σ ) which, as x and σ were taken arbitrarily, yields the symmetry of K S ( M ) . □

4. An Applications to Beta-Type Means

Following [5], for a given k N we define a p-variable Beta-type mean B p : R + k R + by
B p ( x 1 , , x p ) : = p x 1 x p x 1 + + x p 1 p 1 .
This is a particular case of so-called biplanar-combinatoric means (Media biplana combinatoria) defined in Gini [6] and Gini–Zappa [7].
In order to formulate the next results, we adapt the notation that A, G and H are arithmetic, geometric and harmonic means of suitable dimension, respectively.
In [8], the invariance G A , H = G , equivalent to the Pythagorean proportion, has been extended for arbitrary p 3 . In case p = 3 it takes the form G A , F , H = G , where
F x 1 , x 2 , x 3 = : x 2 x 3 + x 3 x 1 + x 1 x 2 x 1 + x 2 + x 3 , x 1 , x 2 , x 3 > 0 ,
and H F A . Hence, making use of Corollary 1 with p = 3 , K = G , S = 1 , 2 we obtain the following.
Remark 2.
For all x 1 , x 2 , x 3 , the following inequality holds
H x 1 , x 2 , x 3 B 3 ( x 1 , x 2 , x p ) A x 1 , x 2 , x 3 ,
and the inequalities are sharp for nonconstant vectors x = x 1 , x 2 , x 3 0 , 3 .
Passing to the main part of this section, first observe the following easy-to-see lemma.
Lemma 1.
Let p N , p 2 . Then there exists exactly one mean M : I p I such that G A , M , , M ( p 1 ) times = G . Furthermore M = B p .
Its simple proof which is a straightforward implication of Theorem 2 is omitted. Based on this lemma it is natural to define a mean-type mapping B : I p I p by [ B ] 1 : = A and [ B ] i : = B p for all i { 2 , , p } . Then we have G B = G , which implies that the geometric mean is the unique B -invariant mean.
We are now going to establish the set K + B , G . It is quite easy to observe that all means in K 0 B , G are of the form H p , α : I p I ( α R ) given by
H p , α ( x 1 , , x p ) : = x 1 x p 1 α p x 1 + + x p p α
including B p = H p , 1 p 1 . In the next lemma we show some elementary properties of the family ( H p , α ) .
Lemma 2.
Let p N . Then
1.
H p , α is reflexive for all α R , that is H p , α ( x , , x ) = x for all x R + ,
2.
H p , α is continuous for all α R (as a p-variable function),
3.
H p , α is a strict mean for all α [ 1 p 1 , 1 ] ,
4.
H p , α is a symmetric function for all α R , that is H p , α ( x σ ) = H p , α ( x ) for all x R + p and a permutation σ of N p ,
5.
H p , 1 and H p , 0 are p-variable arithmetic and geometric means, respectively,
6.
H p , α is increasing with respect to α, that is H p , α ( x ) < H p , β ( x ) for every nonconstant vector x R + p and α , β R with α < β .
Proof. 
By the definition of H p , α we can easily verify that (1), (2), (4) and (5) holds.
From now on fix a nonconstant vector x = ( x 1 , , x p ) R + p . By (4) we may assume without loss of generality that x 1 x p . Denote briefly
g : = x 1 x p p and a : = x 1 + + x p p .
By Cauchy inequality we have x 1 < g < a < x p . Moreover, by the definition H p , α ( x ) = a α g 1 α . Thus, for all α < β we have
H p , β ( x ) = a β g 1 β = a α g 1 α a g β α > a α g 1 α = H p , α ( x ) ,
which completes the proof of (6). The only remaining part to be proved is (3). However, applying (6), it is sufficient to show that
H p , 1 ( x ) < max ( x ) = x p and H p , 1 p 1 ( x ) > min ( x ) = x 1 .
By (5) we immediately obtain H p , 1 ( x ) = a < x p . For the second part observe that
H p , 1 p 1 ( x ) = g p a p 1 = x 1 x p a p 1 > x 1 x p x p p 1 = x 1 x p 1 p 1 x 1 ,
which completes the proof. □
Now we generalize Lemma 1 to the following form
Lemma 3.
Let p N , p 2 and α R p . Then G ( H p , α 1 , , H p , α p ) = G , if and only if α 1 + + α p = 0 .
Its proof is obvious in view of the identity G ( H p , α 1 , , H p , α p ) = H p , 1 p ( α 1 + + α p ) . Having this proved, let us show the next important result.
Theorem 4.
Let p 2 . Then
K + ( A , B p , , B p ( p 1 ) times ) , G ( H p , α 1 , , H p , α p ) α 1 , , α p Q [ 1 p 1 , 1 ] and α 1 + + α p = 0 .
In particular
K 0 = ( A , B p , , B p ) , G H p , α α Q [ 1 p 1 , 1 ] .
Proof. 
First observe that in view of Lemma 1 G is B -invariant, and thus the set K + ( B , G ) is well-defined. Now denote briefly
Λ : = ( H p , α 1 , , H p , α p ) α 1 , , α p Q [ 1 p 1 , 1 ] and α 1 + + α p = 0 .
Obviously B Λ , so it is sufficient to prove that Λ is closed with respect to G-complementary averaging. To this end take an arbitrary vector ( α 1 , , α p ) real numbers such that H : = ( H p , α 1 , , H p , α p ) Λ and a nonempty subset S N p .
By Theorem 2 there exists exactly one mean G S ( H ) : I p I such that G is G S ( H ) -invariant, where G S ( H ) : I p I p is given by
G S ( H ) i : = H p , α i for i N p \ S , G S ( H ) for i S .
On the other hand, in view of Lemma 3 we obtain that G is invariant with respect to the mean-type mapping H 0 : I p I p given by
H 0 i : = H p , α i for i N p \ S , H p , β for i S , where β = 1 | S | i S α i .
As G is both G S ( H ) -invariant and H 0 -invariant we obtain G S ( H ) = H p , β , and consequently G S ( H ) = H 0 . Observe that H 0 Λ is a straightforward implication of the equality
i N p \ S α i + | S | β = i N p α i = 0 .
Now we show that β Q [ 1 p 1 , 1 ] , which would complete the proof. However, this is easy in view of the definition of β and the analogous property α i Q [ 1 p 1 , 1 ] , which is valid for all i S . □
Remark 3.
Let us emphasize that inclusions in the above theorem are strict. More precisely, we can prove by simple induction that the denominator of α in irreducible form has no prime divisors greater than p.

Author Contributions

J.M. and P.P. contributed equally to the manuscript, and they read and approved the final manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Matkowski, J. Iterations of the mean-type mappings. In Iteration Theory (ECIT ’08); Sharkovsky, A.N., Sushko, I.M., Eds.; Grazer Math. Ber., Bericht Nr 354; Institut für Mathematik, Karl-Franzens-Universität Graz: Graz, Austria, 2009; pp. 158–179. [Google Scholar]
  2. Matkowski, J. Invariant and complementary quasi-arithmetic means. Aequ. Math. 1999, 57, 87–107. [Google Scholar] [CrossRef]
  3. Matkowski, J.; Pasteczka, P. Mean-type mappings and invariance principle. arXiv 2020, arXiv:2005.10623. [Google Scholar]
  4. Matkowski, J. Iterations of the mean-type mappings and uniqueness of invariant means. Ann. Univ. Sci. Budapest. Sect. Comput. 2013, 41, 145–158. [Google Scholar]
  5. Himmel, M.; Matkowski, J. Beta-type means. J. Differ. Equ. Appl. 2018, 24, 753–772. [Google Scholar] [CrossRef]
  6. Gini, C. Di una formula comprensiva delle medie. Metron 1938, 13, 3–22. [Google Scholar]
  7. Gini, C.; Zappa, G. Sulle proprieta delle medie potenziate e combinatorie. Metron 1938, 13, 21–31. [Google Scholar]
  8. Matkowski, J. Means, generalized harmony proportion and applications. In Colloquium Mathematicum; Instytut Matematyczny Polskiej Akademii Nauk: Warsaw, Poland, 2020; Volume 160, pp. 109–118. [Google Scholar]
Figure 1. Map of dependencies between means. Rectangle vertexes are dependent on S. Dotted line means that there could exists more M -invariant mean satisfying the conditions of Theorem 2.
Figure 1. Map of dependencies between means. Rectangle vertexes are dependent on S. Dotted line means that there could exists more M -invariant mean satisfying the conditions of Theorem 2.
Mathematics 08 01753 g001

Share and Cite

MDPI and ACS Style

Matkowski, J.; Pasteczka, P. Invariant Means, Complementary Averages of Means, and a Characterization of the Beta-Type Means. Mathematics 2020, 8, 1753. https://doi.org/10.3390/math8101753

AMA Style

Matkowski J, Pasteczka P. Invariant Means, Complementary Averages of Means, and a Characterization of the Beta-Type Means. Mathematics. 2020; 8(10):1753. https://doi.org/10.3390/math8101753

Chicago/Turabian Style

Matkowski, Janusz, and Paweł Pasteczka. 2020. "Invariant Means, Complementary Averages of Means, and a Characterization of the Beta-Type Means" Mathematics 8, no. 10: 1753. https://doi.org/10.3390/math8101753

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop