Next Article in Journal
Modelling of Alumina Splat Solidification on Preheated Steel Substrate Using the Network Simulation Method
Previous Article in Journal
Polarized Rigid Del Pezzo Surfaces in Low Codimension
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Beckenbach–Gini–Lehmer Means and Means Mappings

by
Janusz Matkowski
1 and
Małgorzata Wróbel
2,*
1
Institute of Mathematics, University of Zielona Góra, Szafrana 4A, PL 65-516 Zielona Góra, Poland
2
Department of Mathematics, Czestochowa University of Technology, al. Armii Krajowej 21, PL 42-200 Częstochowa, Poland
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(9), 1569; https://doi.org/10.3390/math8091569
Submission received: 18 August 2020 / Revised: 3 September 2020 / Accepted: 4 September 2020 / Published: 11 September 2020
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
Beckenbacg–Gini–Lehmer type means and mean-type mappings generated by functions of several variables, for which the arithmetic mean is invariant, are introduced. Equality of means of that type, their homogeneity, and convergence of the iterates of the respective mean-type mappings are considered. An application to solving a functional equation is given.
MSC:
Primary 26E60; 39B22; Secondary 39B12

1. Introduction

If I is an interval and φ is a positive function defined on I, then the two-variable function M φ defined on I 2 by
M φ ( x , y ) = x φ ( x ) + y φ ( y ) φ ( x ) + φ ( y ) , x , y I ,
maps I 2 into I, and even more: it is a mean in I, that is, min ( x , y ) M φ ( x , y ) max ( x , y ) for all x , y I , and it is called a Gini mean, Beckenbach–Gini mean, or Lehmer mean ([1,2,3]) of a generator φ . In the sequel we shall write briefly, B–G–L mean. The function M φ * : I 2 I defined by
M φ * ( x , y ) = y φ ( x ) + x φ ( y ) φ ( x ) + φ ( y ) , x , y I ,
is also a B–G–L mean in I , because M 1 φ * = M φ . The pair of means M φ and M φ * has an interesting property. Namely, the arithmetic mean A 2 x , y = x + y 2 is invariant with respect to the mean-type mapping M φ , M φ * : I 2 I 2 , i.e.,
A 2 ( M [ φ ] , M [ φ ] * ) = A 2 ;
and, if φ is continuous, the sequence ( M [ φ ] , M [ φ ] * ) n : n N of iterates of the mean-type mapping M φ , M φ * converges to the mean-type mapping A 2 , A 2 , uniformly on compact sets ([4,5]). For this reason M φ * is called complementary to M φ (and vice-versa) with respect to the arithmetic mean A 2 ([6]).
In this paper we show that these properties remain true for some broader classes of means which generalize the two-variable B–G–L means. In particular, in Section 3, modifying a k-variable counterpart of B–G–L mean
M [ φ ] , k 1 x 1 , , x k = x 1 φ ( x 1 ) + + x k φ ( x k ) φ ( x 1 ) + + φ ( x k )
by cycling the variables x 1 , , x k which are not arguments of φ , we construct the means M [ φ ] , k 2 , , M [ φ ] , k k (“complementary” to M [ φ ] , k 1 ) such that the arithmetic mean A k is invariant with respect to the mean-type mapping M [ φ ] , k = M [ φ ] , k 1 , , M [ φ ] , k k and the sequence M [ φ ] , k n : n N of iterates of M [ φ ] , k converges to A k : = A k , , A k k t i m e s (Theorem 1). In Section 4 we show that similar facts hold true if a single-variable function φ is replaced by a suitable generator f of k 1 variables, which leads to a mean-type mapping M f , k (Theorem 3). In Section 5 we consider equality of means considered in Section 3 and Section 4 (Theorems 4 and 5). In Section 6 we examine conditions under which two mean-type mappings constructed in Section 4 are equal (Theorem 6). Section 7 is devoted to the question of homogeneity of the mean M f , k . In Section 8 we examine conditions under which the result obtained in Section 3 can be extended for the mean-type mappings of the form M = M [ φ 1 ] , k , , M [ φ k ] , k . In the last section we give an application of Theorem 2 in solving some functional equations.

2. Preliminaries

In the sequel I R denotes an interval and k N , k 2 , a fixed number.
A function M : I k I is said to be a k-variable mean if, for all x 1 , , x k I ,
min { x 1 , , x k } M ( x 1 , , x k ) max { x 1 , , x k } .
If for all x 1 , , x k I such that min { x 1 , , x k } < max { x 1 , , x k } (these inequalities are sharp), M is called a strict mean. A mean M is symmetric if
M ( x σ ( 1 ) , , x σ ( k ) ) = M ( x 1 , , x k ) ; x 1 , , x k I ,
for every bijection σ : { 1 , , k } { 1 , , k } .
Let I = 0 , . A mean M : 0 , k 0 , is called homogeneous, if
M ( t x 1 , , t x k ) = t M ( x 1 , , x k ) , t , x 1 , , x k > 0 .
A function M : I k I k , M = ( M 1 , , M k ) , is called a mean-type mapping if, for each i { 1 , , k } , the function M i : I k I is a mean. A mean-type mapping M is called strict if each of its coordinate functions M i is a strict mean.
Let M : I k I k , M = ( M 1 , , M k ) , be a mean-type mapping. A mean K : I k I is called invariant with respect to a mean-type mapping M , shortly, M -invariant if K M = K ; i.e., if, for all x 1 , , x k I ,
K ( M 1 ( x 1 , , x k ) , , M k ( x 1 , , x k ) ) = K ( x 1 , , x k ) .
It turns out that if M : I k I k , M = ( M 1 , , M k ) is a continuous and strict mean-type mapping, then there exists a unique continuous and M -invariant mean K : I k I . Moreover K is strict and the sequence ( M n : n N ) of iterates of the mean-type mapping M converges on I k to the mean-type mapping K = ( K , , K ) k times (cf. [4,7,8] where a more general result is presented).

3. Mean-Type Mappings Generated by Functions of a Single Variable

In the sequel, for k N , k 2 , the symbol A k stands for the arithmetic mean
A k ( x 1 , , x k ) : = x 1 + + x k k , x 1 , , x k R .
The following extends the result of two-variable B–G–L means in [5].
Theorem 1.
Let k N , k 2 , and φ : I ( 0 , ) be an arbitrary function. Then (i) For every i = 1 , , k the function M [ φ ] , k i : I k I defined by
M [ φ ] , k [ i ] ( x 1 , , x k ) : = j = 1 k i + 1 x i 1 + j φ ( x j ) + j = k i + 2 k x j k + i 1 φ ( x j ) φ ( x 1 ) + + φ ( x k )
is a k-variable mean in I (here we adopt the convention, that any sum over the empty set of indices is zero); (ii) The arithmetic mean A k is invariant with respect to the mean-type mapping M [ φ ] , k : I k I k given by
M [ φ ] , k : = M [ φ ] , k 1 , M [ φ ] , k 2 , , M [ φ ] , k k ,
i.e., A k M [ φ ] , k = A k ; (iii) If φ is continuous then the sequence M [ φ ] , k n : n N of iterates of the mean-type map M [ φ ] , k converges uniformly on compact set to the mean-type mapping A k : = A k , , A k k t i m e s .
Proof. 
(i) From the definition of M [ φ ] , k [ i ] we have
M [ φ ] , k [ i ] ( x 1 , , x k ) = j = 1 k i + 1 φ ( x j ) φ ( x 1 ) + + φ ( x k ) x i 1 + j + j = k i + 2 k φ ( x j ) φ ( x 1 ) + + φ ( x k ) x j k + i 1 ;
i.e., M [ φ ] , k [ i ] ( x 1 , , x k ) is a convex combination of the numbers x 1 , , x k with positive coefficients summing up to 1 ; so M [ φ ] , k [ i ] is a mean. Result (ii) follows immediately from the obvious equality
i = 1 k M [ φ ] , k [ i ] ( x 1 , , x k ) = x 1 + + x k .
Result (iii) is a consequence of (ii) and the main result of [4] (see also [8]). □
Remark 1.
Note that, under the conditions of the above result, we have
M [ φ ] , k [ 1 ] ( x 1 , , x k ) = x 1 φ ( x 1 ) + x 2 φ ( x 2 ) + + x k 1 φ ( x k 1 ) + x k φ ( x k ) φ ( x 1 ) + + φ ( x k ) , M [ φ ] , k [ 2 ] ( x 1 , , x k ) = x 2 φ ( x 1 ) + x 3 φ ( x 2 ) + + x k φ ( x k 1 ) + x 1 φ ( x k ) φ ( x 1 ) + + φ ( x k ) , M [ φ ] , k [ k ] ( x 1 , , x k ) = x k φ ( x 1 ) + x 1 φ ( x 2 ) + + x k 2 φ ( x k 1 ) + x k 1 φ ( x k ) φ ( x 1 ) + + φ ( x k ) ,
so replacing cyclically x 1 by x 2 , x 2 by x 3 ,..., x k 1 by x k and x k by x 1 , from M [ φ ] , k [ 1 ] we get M [ φ ] , k [ 2 ] . Similarly, from M [ φ ] , k [ 2 ] we get M [ φ ] , k [ 3 ] , etc.
The mean M [ φ ] , k [ 1 ] is a natural extension of the two-variable B–G–L mean M [ φ ] , 2 ( x , y ) = x φ ( x ) + y φ ( y ) φ ( x ) + φ ( y ) . The means M [ φ ] , 2 and M [ ψ ] , 2 * , where
M [ ψ ] , 2 * ( x , y ) : = x ψ ( y ) + y ψ ( x ) ψ ( y ) + ψ ( x ) , x , y I ,
are complementary with respect to the arithmetic mean A 2 ( x , y ) = x + y 2 ; i.e.,
A 2 ( M [ φ ] , 2 , M [ ψ ] , 2 * ) = A 2 ,
if and only if φ = ψ ([5]). Moreover the M [ ψ ] , 2 * is also a B–G–L mean. Note also that
M [ φ ] , 2 x , y = φ x φ ( x ) + φ ( y ) x + φ ( y ) φ ( x ) + φ ( y ) y , M [ φ ] , 2 * x , y = φ x φ ( x ) + φ ( y ) y + φ ( y ) φ ( x ) + φ ( y ) x ,
so M [ φ ] , 2 x , y and M [ φ ] , 2 * x , y are the weighted arithmetic means of x and y with cyclically replaced weights φ x φ ( x ) + φ ( y ) and φ ( y ) φ ( x ) + φ ( y ) .
For this reason, the mean-type mapping M [ φ ] , k defined by (1) can be called a B–G–L mean-type mapping of a generator φ .

4. Mean-Type Mappings Generated by Functions of Several Variables

In this section we generalize Theorem 1 as follows.
Theorem 2.
Let I R be an interval and k N , k 2 , be fixed. Let f : I k 1 ( 0 , ) be an arbitrary function. Then (i) The functions M f , k 1 , , M f , k k : I k I defined by
M f , k 1 ( x 1 , , x k ) = x 1 f ( x 2 , , x k ) + x 2 f ( x 3 , , x k , x 1 ) + + x k f ( x 1 , , x k 1 ) f ( x 2 , , x k ) + f ( x 3 , , x k , x 1 ) + + f ( x 1 , , x k 1 ) M f , k 2 ( x 1 , , x k ) = x 2 f ( x 2 , , x k ) + x 3 f ( x 3 , , x k , x 1 ) + + x 1 f ( x 1 , , x k 1 ) f ( x 2 , , x k ) + f ( x 3 , , x k , x 1 ) + + f ( x 1 , , x k 1 ) . M f , k k ( x 1 , , x k ) = x k f ( x 2 , , x k ) + x 1 f ( x 3 , , x k , x 1 ) + + x k 1 f ( x 1 , , x k 1 ) f ( x 2 , , x k ) + f ( x 3 , , x k , x 1 ) + + f ( x 1 , , x k 1 )
are means in I . (ii) The arithmetic mean A k is invariant with respect to the mean-type mapping M f , k : I k I k defined by
M f , k : = M f , k 1 , , M f , k k ;
(iii) If f is continuous then the sequence M [ f ] , k n : n N of iterates of the mean-type map M [ f ] , k converges uniformly on compact sets to the mean-type mapping A k : = A k , , A k k t i m e s .
Proof. 
(i) From the definition of M [ f ] , k [ 1 ] ( x 1 , , x k ) it is a convex combination of the numbers x 1 , , x k with respective positive weights
f ( x 2 , , x k ) f ( x 2 , , x k ) + f ( x 3 , , x k , x 1 ) + + f ( x 1 , , x k 1 ) , , f ( x 1 , , x k 1 ) f ( x 2 , , x k ) + f ( x 3 , , x k , x 1 ) + + f ( x 1 , , x k 1 )
summing up to 1 ; so M [ f ] , k [ i ] is a mean. We omit similar arguments for the remaining functions. Result (ii) follows from an easy to see equality
i = 1 k M [ f ] , k [ i ] ( x 1 , , x k ) = x 1 + + x k .
Result (iii) is a consequence of (ii) and the main result of [4] (see also [8]). □
As suggested in the previous section, the mean-type mapping M f , k is referred to as a B–G–L mean-type mapping of the generator f.
Remark 2.
The above result remains true on replacing M f , k = M f , k 1 , , M f , k k by each of the following k 1 mean-type mappings:
M f , k 2 , , M f , k k , M f , k 1 , M f , k 3 , , M f , k k , M f , k 1 , M f , k 2 , , M f , k k , M f , k 1 , M f , k 2 , , M f , k k 1 ,
which arises from M f , k by the cyclic translation of its coordinate means.

5. Equality M f , k = M [ φ ] , k

In this section we examine when the means defined in the previous two sections coincide (and therefore we omit writing upper indexes at M f , k i and M [ φ ] , k i ). We begin with the following
Remark 3.
Let φ , ψ : I ( 0 , ) . Then
M [ φ ] , 2 ( x , y ) = M [ ψ ] , 2 * ( x , y ) , x , y I ,
if, and only if, for a positive constant c ,
ψ ( x ) = c φ ( x ) , x I .
This remark is an easy consequence of the definitions of the involved means. Its 3-dimensional counterpart reads as follows:
Theorem 3.
Let f : I 2 ( 0 , ) be a symmetric function and φ : I ( 0 , ) . Then
M [ φ ] , 3 ( x , y , z ) = M f , 3 ( x , y , z ) , x , y , z I ,
if, and only if, there is c > 0 such that
f ( x , y ) = c φ ( x ) φ ( y ) , x , y I .
Proof. 
Assume that equality (2) is satisfied. Setting z : = y in (2), making use of the definitions of the means M [ φ ] , 3 and M f , 3 , and the symmetry of f , we obtain that
x φ ( x ) + 2 y φ ( y ) φ ( x ) + 2 φ ( y ) = x f ( y , y ) + 2 y f ( x , y ) f ( y , y ) + 2 f ( x , y ) , x , y I .
Defining D : I ( 0 , ) by
D ( x ) : = f ( x , x ) , x I ,
we can write this equation in the form
x φ ( x ) + 2 y φ ( y ) φ ( x ) + 2 φ ( y ) = x D ( y ) + 2 y f ( x , y ) D ( y ) + 2 f ( x , y ) , x , y I .
Hence, we get
f ( x , y ) = D ( y ) φ ( y ) φ ( x ) , x , y I .
The symmetry of f implies that
D ( y ) φ ( y ) φ ( x ) = D ( x ) φ ( x ) φ ( y ) , x , y I ,
which is equivalent to
D ( x ) [ φ ( x ) ] 2 = D ( y ) [ φ ( y ) ] 2 , x , y I .
Consequently, there is a constant c > 0 such that
D ( x ) = c [ φ ( x ) ] 2 , x I .
Hence, applying (3)
f ( x , y ) = c φ ( x ) φ ( y ) , x , y I .
Since the reversed implication is easy to verify, the proof is completed. □
In a similar way, one can prove more general
Theorem 4.
Let I R be an interval, k N , k 3 fixed. Suppose that a function f : I k 1 ( 0 , ) is symmetric and φ : I ( 0 , ) . Then
M [ φ ] , k ( x 1 , , x k ) = M [ f ] , k ( x 1 , , x k ) , x 1 , , x k I ,
if, and only if, there is c > 0 such that
f ( x 1 , , x k 1 ) = c φ ( x 1 ) · · φ ( x k 1 ) , x 1 , , x k 1 I .
Proof. 
(Proof an idea). Suppose that (4) is satisfied. Putting in (4)
x k 2 : = x k 1 , x k 3 : = x k 1 , , x 2 : = x k 1 ,
by the symmetry of f, we get
f ( x 1 , x k 1 , , x k 1 ) φ x 1 = f ( x k 1 , x k 1 , , x k 1 ) φ x k 1 , x 1 , x k 1 I ,
and, consequently,
f ( x 1 , x k 1 , , x k 1 ) = f ( x k 1 , x k 1 , , x k 1 ) φ x k 1 φ x 1 , x 1 , x k 1 I .
Returning to the one before last substitution x k 3 = = x 3 = x k 1 , by the symmetry of f and the above, we obtain
f ( x 1 , x 2 , x k 1 , , x k 1 ) = f ( x k 1 , x k 1 , , x k 1 ) φ x k 1 2 φ x 1 φ x 2 , x 1 , x 2 , x k 1 I ,
and finally, repeating this procedure k 1 -times, we come back to (4) getting
f ( x 1 , . . . x k 2 , x k 1 ) = f ( x k 1 , x k 1 , , x k 1 ) φ x k 1 k 2 φ ( x 1 ) · · · · · φ ( x k 2 ) ,
for all x 1 , . . . x k 2 , x k 1 I . Since f is symmetric, we have
f ( x k 1 , , x k 1 ) φ x k 1 k 2 φ ( x 1 ) · . . . · φ ( x k 2 ) = f ( x σ k 1 , , x σ k 1 ) φ x σ k 1 k 2 φ ( x σ 1 ) · . . . · φ ( x σ k 2 ) ,
whence
f ( x k 1 , x k 1 , , x k 1 ) φ x k 1 k 1 = f ( x σ k 1 , x σ k 1 , , x σ k 1 ) φ x σ k 1 k 1
for every bijection σ : { 1 , , k 1 } { 1 , , k 1 } and x 1 , x k 2 , x k 1 I . Thus, there is a constant c > 0 such that
f ( x k 1 , x k 1 , , x k 1 ) = c φ x k 1 k 1 , x k 1 I ,
which, by (5), gives
f ( x 1 , , x k 1 ) = c φ ( x 1 ) · · φ ( x k 1 ) , x 1 , , x k 1 I .
The reversed implication is obvious. □
Remark 4.
It is easy to show that the family of B–G–L means of the form
M [ φ ] , 3 ( x , y , z ) = x φ ( x ) + y φ ( y ) + z φ ( z ) φ ( x ) + φ ( y ) + φ ( z )
with the single variable generators φ : ( 0 , ) ( 0 , ) does not contain the geometric mean G ( x , y , z ) = ( x y z ) 1 / 3 . Taking however f : ( 0 , ) 2 ( 0 , ) , given by
f ( x , y ) = ( x y ) 1 / 3 ( x 1 / 3 + y 1 / 3 ) , x , y > 0 ,
we obtain
M f ( x , y , z ) = ( x y z ) 1 / 3 = G ( x , y , z ) , x , y , z > 0 .
Theorems 2 and 3 and this remark show, in particular, that the family of means generated by the several variables functions f is essentially richer than M [ φ ] .

6. Equality M f , k = M [ g ] , k

Theorem 5.
Suppose that f , g : I k 1 ( 0 , ) are continuous functions. Then M f , k = M [ g ] , k if, and only if, g = c f for some constant c > 0 .
For the simplicity of notations, we prove this result assuming that k = 3 .
In view of Theorem 2, if f : I 2 0 , then M f , 3 = M f , 3 1 , M f , 3 2 , M f , 3 3 where
M f , 3 1 x , y , z = x f ( y , z ) + y f ( z , x ) + z f ( x , y ) f ( y , z ) + f ( z , x ) + f ( x , y ) ,
M f , 3 2 x , y , z = y f ( y , z ) + z f ( z , x ) + x f ( x , y ) f ( y , z ) + f ( z , x ) + f ( x , y ) ,
M f , 3 3 x , y , z = z f ( y , z ) + x f ( z , x ) + y f ( x , y ) f ( y , z ) + f ( z , x ) + f ( x , y ) ,
for x , y , z I , and we have the following
Remark 5.
If f : I 2 ( 0 , ) , then M f , 3 = M f , 3 1 , M f , 3 2 , M f , 3 3 and
M f , 3 1 ( x , y , z ) = λ 1 x + λ 2 y + λ 3 z , M f , 3 2 ( x , y , z ) : = λ 1 y + λ 2 z + λ 3 x , M f , 3 3 ( x , y , z ) : = λ 1 z + λ 2 x + λ 3 y
where
λ 1 = f ( y , z ) f ( y , z ) + f ( z , x ) + f ( x , y ) , λ 2 = f z , x f ( y , z ) + f ( z , x ) + f ( x , y ) , λ 3 = f ( x , y ) f ( y , z ) + f ( z , x ) + f ( x , y ) ,
are positive, and
λ 1 + λ 2 + λ 3 = 1 .
The arithmetic mean A 3 x , y , z : = x + y + z 3 is invariant with respect to the mean-type mapping M f , 3 . Moreover, if f is continuous then the sequence M [ f ] , 3 n : n N of iterates of the mean-type map M [ f ] , 3 converges uniformly on compact sets to the mean-type mapping A 3 : = A 3 , A 3 , A 3 .
Proof. of Theorem 6 for k = 3 .
Assume that M f , 3 = M g , 3 . Then M f , 3 1 = M g , 3 1 , M f , 3 2 = M g , 3 2 , M f , 3 3 = M g , 3 3 ; that is, in view of Remark 5, we have
λ 1 x + λ 2 y + λ 3 z = μ 1 x + μ 2 y + μ 3 z λ 1 y + λ 2 z + λ 3 x = μ 1 y + μ 2 z + μ 3 x λ 1 z + λ 2 x + λ 3 y = μ 1 z + μ 2 x + μ 3 y
where
μ 1 = g ( y , z ) g ( y , z ) + g ( z , x ) + g ( x , y ) , μ 2 = g z , x g ( y , z ) + g ( z , x ) + g ( x , y ) , μ 3 = g ( x , y ) g ( y , z ) + g ( z , x ) + g ( x , y ) .
Hence, taking into account that λ 1 + λ 2 + λ 3 = 1 = μ 1 + μ 2 + μ 3 , we see that λ 1 μ 1 , λ 2 μ 2 , μ 1 + μ 2 λ 1 + λ 1 satisfy the system of linear equations
x λ 1 μ 1 + y λ 2 μ 2 + z μ 1 + μ 2 λ 1 + λ 1 = 0 y λ 1 μ 1 + z λ 2 μ 2 + x μ 1 + μ 2 λ 1 + λ 1 = 0 z λ 1 μ 1 + x λ 2 μ 2 + y μ 1 + μ 2 λ 1 + λ 1 = 0 .
Since
det x y z y z x z x y = 3 x y z x 3 y 3 z 3 ,
and the interior of the set where this determinant disappears is empty, the continuity of f and g implies that λ 1 μ 1 = 0 and λ 2 μ 2 = 0 . Hence
μ 1 λ 1 = μ 2 λ 2 ,
and, by the above formulas,
g y , z f y , z = g z , x f z , x , x , y , z I ,
which shows that the second variable’s function g f does not depend on the first variable, as the left-hand side does not depend on y, and it does not depend on the second variable, as the left-hand side does not depend on x . Thus g f = c for a real constant c > 0 . The converse implication is obvious. □
Let us observe that under the assumption that the functions f and g are symmetric the above theorem remains true if we replace M f , k = M [ g ] , k by M f , 3 1 = M g , 3 1 . Namely, we have the following.
Remark 6.
Let I R be an interval and let f , g : I 2 ( 0 , ) be symmetric functions. Then
x f ( y , z ) + y f ( x , z ) + z f ( x , y ) f ( y , z ) + f ( x , z ) + f ( x , y ) = x g ( y , z ) + y g ( x , z ) + z g ( x , y ) g ( y , z ) + g ( x , z ) + g ( x , y ) , x , y , z ( 0 , ) ,
if, and only if, g = c f for a positive constant c .
Proof. 
Assume that equality (7) is satisfied. Then, after simple modifications, we get
f ( x , z ) g ( y , z ) f ( y , z ) g ( x , z ) ( x y ) + f ( x , y ) g ( y , z ) f ( y , z ) g ( x , y ) ( x z )
+ f ( x , y ) g ( x , z ) f ( x , z ) g ( x , y ) ( y z ) = 0 , x , y , z ( 0 , ) .
Putting z : = x in (8) we obtain
f ( x , x ) g ( y , x ) + g ( x , y ) = g ( x , x ) f ( y , x ) + f ( x , y ) , x , y ( 0 , ) ;
therefore, by symmetry of f and g, we get
g ( x , y ) f ( x , y ) = g ( x , x ) f ( x , x ) , x , y ( 0 , ) .
Since the left-hand side is symmetric with respect to x and y , and the right-hand side does not depend on y , it follows that
g ( x , x ) f ( x , x ) = g ( y , y ) f ( y , y ) , x , y ( 0 , ) ,
and consequently, there is a real constant c > 0 such that
g ( x , x ) f ( x , x ) = c , y ( 0 , ) ,
which, by virtue of (9), gives the required claim. Since the reversed implication is obvious, the proof is completed. □

7. Homogeneity of the Mean M f , k

In this section we do not consider the mean-type mappings—therefore, similarly to in Section 5, we omit writing upper indexes.
Theorem 6.
Let f : ( 0 , ) 2 ( 0 , ) be a symmetric function. The following conditions are equivalent: (i) The mean M f , 3 is positively homogeneous; i.e.,
M f , 3 ( t x , t y , t z ) = t M f , 3 ( x , y , z ) , x , y , z , t > 0 ;
(ii) There exists a multiplicative function m : ( 0 , ) ( 0 , ) such that
f ( t x , t y ) = m ( t ) f ( x , y ) , x , y , t > 0 .
Proof. 
We first prove that condition (i) implies (ii). Writing the homogeneity condition of M f , 3 with the aid of the formula (6) for I = ( 0 , ) , and making simple modifications, we obtain
[ f ( t z , t x ) f ( y , z ) f ( t y , t z ) f ( z , x ) ] ( y x ) + [ f ( t x , t y ) f ( y , z ) f ( t y , t z ) f ( x , y ) ] ( z x )
+ [ f ( t x , t y ) f ( z , x ) f ( t z , t x ) f ( x , y ) ] ( z y ) = 0 .
Setting here z : = y gives, for all x , y , t > 0 ,
[ f ( t y , t x ) f ( y , y ) f ( t y , t y ) f ( y , x ) ] ( y x ) + [ f ( t x , t y ) f ( y , y ) f ( t y , t y ) f ( x , y ) ] ( y x ) = 0 .
Hence, by the symmetry of f, we obtain
f ( t x , t y ) f ( y , y ) = f ( t y , t y ) f ( x , y ) , x , y , t > 0 , x y .
Since x and y play a symmetric role, we get
f ( t x , t y ) f ( x , x ) = f ( t x , t x ) f ( x , y ) , x , y , t > 0 , x y .
Dividing these two relations by sides gives
f ( y , y ) f ( x , x ) = f ( t y , t y ) f ( t x , t x ) , x , y , t > 0 ,
and, consequently,
f ( t x , t x ) f ( x , x ) = f ( t y , t y ) f ( y , y ) , x , y , t > 0 .
This relation implies that for every t > 0 there is an m ( t ) > 0 such that
f ( t x , t x ) = m ( t ) f ( x , x ) , x , t > 0 .
An easy argument shows that m : ( 0 , ) ( 0 , ) is multiplicative. Hence, making use of (10), we obtain
f ( t x , t y ) = m ( t ) f ( x , y ) , x , y , t > 0 .
Since the converse implication is obvious, the proof is complete. □
Theorem 7.
Let φ : ( 0 , ) ( 0 , ) and k 2 . Then (i) The mean M [ φ ] , k : ( 0 , ) k ( 0 , ) is positively homogeneous; i.e.,
M [ φ ] , k ( t x 1 , , t x k ) = t M [ φ ] , k ( x 1 , , x k ) , x 1 , , x k , t > 0 ,
if, and only if, there exists a multiplicative function m : ( 0 , ) ( 0 , ) such that
φ ( t x ) = m ( t ) φ ( x ) , x , t > 0 ;
(ii) If φ is measurable or the graph φ is not a dense set in ( 0 , ) 2 , then there is a p > 0 such that
φ ( x ) = φ ( 1 ) x p , x > 0 ;
moreover, M φ = M [ p ] , k where
M [ p ] , k ( x 1 , , x k ) : = x 1 p + 1 + + x k p + 1 x 1 p + + x k p , x 1 , , x k , t > 0 .
The means M [ p ] , k have the following interesting property.
Remark 7.
Let k , m N , 2 m < k .
  • If p 0 then
    lim x m + 1 0 , , x k 0 M [ p ] , k ( x 1 , , x k ) = M [ p ] , k ( x 1 , , x m ) , x 1 , , x k > 0 .
  • if p < 0 then
    lim x m + 1 0 , , x k 0 M [ p ] , k ( x 1 , , x k ) = 0 , x 1 , , x k > 0 .
The first property in this remark can be generalized as follows.
Proposition 1.
Let I R be an open interval and let a [ , + ] be one of its endpoints. If φ : I ( 0 , ) is such that
lim x I , x a φ ( x ) = 0 ,
then for k , m N , 2 m < k ,
lim x m + 1 a , , x k a M [ φ ] , k ( x 1 , , x k ) = M [ φ ] , k ( x 1 , , x m ) , x 1 , , x k I .

8. Invariance of the Arithmetic Mean with Respect to the Mean-Type Mapping with Coordinate B–G–L Means of Different Single Variable Generators

In this section we consider the problem of invariance of the arithmetic mean A k with respect to the B–G–L mean-type mappings ( M [ φ 1 ] , , M [ φ k ] ) .
In the case k = 2 we have the following (cf. [5]).
Theorem 8.
Let I R be an interval and φ , ψ : I ( 0 , ) . Then A 2 is ( M [ φ ] , M [ ψ ] ) invariant if, and only if, there is a constant c > 0 such that
φ ( x ) ψ ( x ) = c , x I .
The next result shows that in the case k 3 the situation is completely different.
Theorem 9.
Let I R be an interval and suppose that φ j : I ( 0 , ) , j = 1 , , k , are twice differentiable. If k 3 then the following conditions are equivalent:
  • A k is invariant with respect to the mean-type mapping ( M [ φ 1 ] , k , , M [ φ k ] , k ) ;
  • There are c j R , c j > 0 ( j = 1 , , k ) , such that φ j = c j ( j = 1 , , k ) ;
  • M [ φ 1 ] = = M [ φ k ] = A k .
Proof. 
Suppose that A k is ( M [ φ 1 ] , , M [ φ k ] ) -invariant; i.e., that
i = 1 k j = 1 k x j φ i ( x j ) j = 1 k φ i ( x j ) = i = 1 k x i , x 1 , , x k I .
Put x : = x 1 and y : = x 2 . Differentiating both sides of this equation first with respect to x gives
i = 1 k [ φ i ( x ) + x φ i ( x ) ] j = 1 k φ i ( x j ) φ i ( x ) j = 1 k x j φ i ( x j ) j = 1 k φ i ( x j ) 2 = 1 ,
and with respect to y gives
i = 1 k [ φ i ( y ) + y φ i ( y ) ] j = 1 k φ i ( x j ) φ i ( y ) j = 1 k x j φ i ( x j ) j = 1 k φ i ( x j ) 2 = 1 .
Subtracting the respective sides of these equalities and then dividing the obtained difference by x y we get
i = 1 k φ i ( x ) + x φ i ( x ) φ i ( y ) y φ i ( y ) x y j = 1 k φ i ( x j ) φ i ( x ) φ i ( y ) x y j = 1 k x j φ i ( x j ) j = 1 k φ i ( x j ) 2 = 0 .
Letting here y x gives
i = 1 k [ 2 φ i ( x ) + x φ i ( x ) ] j = 1 k φ i ( x j ) φ i ( x ) j = 1 k x j φ i ( x j ) j = 1 k φ i ( x j ) 2 = 0 ,
for all x 1 = x 2 = x I and all x 3 , , x k I . Setting here
x 1 = = x k = x ,
we get
2 k i = 1 k φ i ( x ) φ i ( x ) = 0 , x I ,
which easily implies that, for some c R ,
i = 1 k φ i ( x ) = c , x I .
For the simplicity of notation we confine the remaining part of the proof to the case k = 3 . Let φ , ψ , γ : I ( 0 , ) be twice-differentiable. According to what we have shown, the invariance of A 3 with respect to the mapping ( M [ φ ] , M [ ψ ] , M [ γ ] ) , i.e., the relation
M [ φ ] , 3 ( x , y , z ) + M [ ψ ] , 3 ( x , y , z ) + M [ γ ] , 3 ( x , y , z ) = x + y + z , x , y , z I ,
implies that there is a constant c > 0 such that
φ ( x ) ψ ( x ) γ ( x ) = c , x I ,
and consequently,
γ ( x ) = c φ ( x ) ψ ( x ) , x I .
Replacing γ ( x ) , γ ( y ) , γ ( z ) in (11) by the suitable values given by this formula, and then by substituting z = y , we obtain, for all x , y I ,
x φ ( x ) + 2 y φ ( y ) φ ( x ) + 2 φ ( y ) + x ψ ( x ) + 2 y ψ ( y ) ψ ( x ) + 2 ψ ( y ) + x φ ( y ) ψ ( y ) + 2 y φ ( x ) ψ ( x ) φ ( y ) ψ ( y ) + 2 φ ( x ) ψ ( x ) = x + 2 y ,
which reduces to
φ ( x ) 2 ψ ( x ) 2 + φ ( x ) φ ( y ) ψ ( y ) 2 + φ ( y ) 2 ψ ( x ) ψ ( y ) = 3 φ ( x ) φ ( y ) ψ ( x ) ψ ( y ) ,
for all x , y I . Similarly, from (11) and (12), substituting z = x , we obtain
2 x φ ( x ) + y φ ( y ) 2 φ ( x ) + φ ( y ) + 2 x ψ ( x ) + y ψ ( y ) 2 ψ ( x ) + ψ ( y ) + 2 x φ ( y ) ψ ( y ) + y φ ( x ) ψ ( x ) 2 φ ( y ) ψ ( y ) + φ ( x ) ψ ( x ) = 2 x + y ,
which reduces to
φ ( x ) 2 ψ ( x ) ψ ( y ) + φ ( x ) φ ( y ) ψ ( x ) 2 + φ ( y ) 2 ψ ( y ) 2 = 3 φ ( x ) φ ( y ) ψ ( x ) ψ ( y ) ,
for all x , y I . Subtracting (13) and (14) by sides gives
[ φ ( x ) φ ( y ) ] [ ψ ( y ) ψ ( x ) ] [ φ ( x ) ψ ( x ) φ ( y ) ψ ( y ) ] = 0 , x , y I .
It follows that, for all x , y I ,
either φ ( x ) = φ ( y ) or ψ ( y ) = ψ ( x ) or φ ( x ) ψ ( x ) = φ ( y ) ψ ( y ) .
Suppose, for instance, that φ ( x ) = φ ( y ) . Then from (13) we get
φ ( x ) 2 [ ψ ( x ) ψ ( y ) ] 2 = 0 ,
and, consequently, ψ ( x ) = ψ ( y ) as well as φ ( x ) ψ ( x ) = φ ( y ) ψ ( y ) . Repeating this reasoning in two remaining cases we infer that for each x , y I , we have φ ( y ) = φ ( x ) and ψ ( y ) = ψ ( x ) . Thus the functions φ , ψ and γ are constant. This completes the proof. □
Remark 8.
Note that having proved formula (13) one can finish the proof with a shorter argument. Let us fix an arbitrary x 0 I . Without any loss of generality we may assume that
φ ( x 0 ) = ψ ( x 0 ) = 1 .
Hence, setting y = x 0 in (13), we obtain
ψ ( x ) = φ ( x ) 3 φ ( x ) φ ( x ) 2 1 , x I .
Using this formula to eliminate the function ψ in (13) and then setting x = x 0 gives
( φ ( y ) 1 ) [ 2 φ ( y ) 2 2 φ ( y ) + 1 ] = 0 , y I ,
and, consequently, φ ( y ) = 1 for all y I . In the same way one can show that ψ is constant.
An advantage of argument given in the proof is that, with mainly notational difficulties, it can be generalized to the arbitrary k > 3 .

9. An Application

Making use of Theorem 2 we prove the following.
Theorem 10.
Let f : I k 1 ( 0 , ) be an arbitrary continuous function where k N , k 2 . Assume that a function Φ : I k R is continuous on the diagonal
Δ I k : = x = x 1 , , x k I k : x 1 = = x k .
Then the function Φ is invariant with respect to the mean-type mapping M f , k ; that is, Φ satisfies the functional equation
Φ = Φ M f , k 1 , , M f , k k ;
if and only if there is a continuous single variable function φ : I R such that
Φ = φ A k ,
where A k is the k-variable arithmetic mean.
Proof. 
Assume first that Φ : I k R is invariant with respect to M f , k , that is Φ = Φ M f , k . Hence, by induction, we get
Φ = Φ M f , k n , n N ,
where M f , k n is the n-th iterate of M f , k . By virtue of Theorem 2, the sequence of mean-type mappings M [ f ] , k n : n N converges to the mean-type mapping A k : = A k , , A k k t i m e s . Since Φ is continuous on Δ I k , we hence get
Φ = lim n Φ M f , k n = Φ lim n M f , k n = Φ A k = Φ A k , , A k .
Setting
φ t : = Φ t , , t , t I ,
we conclude that Φ = φ A k . To prove the converse implication, take an arbitrary continuous function φ : I R and put Φ : = φ A k . Then Φ is continuous on the diagonal and, for all x = x 1 , , x k I k , making use of the invariance of A k with respect to the mean-type mapping M f , k , we have
Φ M f , k x = φ A k M f , k x = φ A k M f , k x = φ A k x = φ x 1 + + x k k = Φ x ,
which completes the proof. □
Remark 9.
The assumption of the continuity of Φ can be omitted if Φ is a mean (see [8]).

Author Contributions

Conceptualization, J.M.; investigation, J.M. and M.W.; supervision, J.M.; writing—review and editing, J.M. and M.W. 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. Bullen, P.S.; Mitrinović, D.S.; Vasixcx, P.M. Means and Their Inequalities; D. Reidel Publishing Company: Dordrecht, The Netherlands, 1988. [Google Scholar]
  2. Bullen, P.S. Handbook of Means and Their Inequalities; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2003. [Google Scholar]
  3. Toader, G.; Costin, I. Means in Mathematical Analysis. Bivariate Means. In Mathematical Analysis and Its Applications; Academic Press: London, UK, 2018. [Google Scholar]
  4. Matkowski, J. Iterations of Mean-Type Mappings and Invariant Means. Ann. Math. Silesianae 1999, 13, 211–226. [Google Scholar] [CrossRef]
  5. Matkowski, J. On invariant generalized Beckenbach-Gini means. In Functional Equations—Results and Advances; Daróczy, Z., Páles, Z., Eds.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2002; pp. 219–230. [Google Scholar]
  6. Matkowski, J. Invariant and complementary means. Aequ. Math. 1999, 57, 87–107. [Google Scholar] [CrossRef]
  7. Matkowski, J. Iterations of the mean-type mappings. Grazer Math. Ber. 2009, 354, 158–179. [Google Scholar]
  8. 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]

Share and Cite

MDPI and ACS Style

Matkowski, J.; Wróbel, M. On the Beckenbach–Gini–Lehmer Means and Means Mappings. Mathematics 2020, 8, 1569. https://doi.org/10.3390/math8091569

AMA Style

Matkowski J, Wróbel M. On the Beckenbach–Gini–Lehmer Means and Means Mappings. Mathematics. 2020; 8(9):1569. https://doi.org/10.3390/math8091569

Chicago/Turabian Style

Matkowski, Janusz, and Małgorzata Wróbel. 2020. "On the Beckenbach–Gini–Lehmer Means and Means Mappings" Mathematics 8, no. 9: 1569. https://doi.org/10.3390/math8091569

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