1 Introduction

In this section, we recall some basic notions about means in two variables that will be needed later. Throughout the following, we understand by a (bivariate) mean a binary map m between positive real numbers satisfying the following statement:

a,b>0,min(a,b)m(a,b)max(a,b).

Every mean satisfies m(a,a)=a for each a>0. The maps (a,b)min(a,b) and (a,b)max(a,b) are (trivial) means, which will be denoted by min and max, respectively. The standard examples of means are given in the following (see [1] for instance and the related references cited therein):

A : = A ( a , b ) = a + b 2 ; G : = G ( a , b ) = a b ; H : = H ( a , b ) = 2 a b a + b ; L : = L ( a , b ) = b a ln b ln a , L ( a , a ) = a ; I : = I ( a , b ) = e 1 ( b b a a ) 1 / ( b a ) , I ( a , a ) = a

and are known as the arithmetic, geometric, harmonic, logarithmic, and identric means, respectively.

There are more means of interest known in the literature. For instance, the following:

P : = P ( a , b ) = b a 4 arctan b / a π = b a 2 arcsin b a b + a , P ( a , a ) = a ; T : = T ( a , b ) = b a 2 arctan b a b + a , T ( a , a ) = a ; M : = M ( a , b ) = b a 2 arcsinh b a b + a , M ( a , a ) = a ;

are known as the first Seiffert mean [2], the second Seiffert mean [3] and the Neuman-Sándor mean [4], respectively.

A mean m is symmetric if m(a,b)=m(b,a) for all a,b>0, and monotone if (a,b)m(a,b) is increasing in a and in b, that is, if a 1 a 2 (resp. b 1 b 2 ) then m( a 1 ,b)m( a 2 ,b) (resp. m(a, b 1 )m(a, b 2 )). For more details as regards monotone means, see [5].

For two means m 1 and m 2 we write m 1 m 2 if and only if m 1 (a,b) m 2 (a,b) for every a,b>0 and, m 1 < m 2 if and only if m 1 (a,b)< m 2 (a,b) for all a,b>0 with ab. Two means m 1 and m 2 are comparable if m 1 m 2 or m 2 m 1 , and we say that m is between two comparable means m 1 and m 2 if inf( m 1 , m 2 )msup( m 1 , m 2 ). If the above inequalities are strict then we say that m is strictly between m 1 and m 2 . The above means are all comparable with the well-known chain of inequalities

min<H<G<L<P<I<A<M<T<max.

For a given mean m, we set m (a,b)= ( m ( a 1 , b 1 ) ) 1 , and it is easy to see that m is also a mean, called the dual mean of m. Every mean m satisfies m := ( m ) =m, and if m 1 and m 2 are two means such that m 1 < m 2 then m 1 > m 2 . Further, the arithmetic and harmonic means are mutually dual (i.e. A =H, H =A) and the geometric mean is self-dual (i.e. G =G).

Let p be a real number. The next means are of interest.

  • The power (binomial) mean:

    { B p : = B p ( a , b ) : = G p , 0 ( a , b ) = ( a p + b p 2 ) 1 / p , B 1 = H , B 0 = G , B 1 = A , B 2 : = Q .
  • The power logarithmic mean:

    { L p : = L p ( a , b ) = ( a p b p p ( ln a ln b ) ) 1 / p , L p ( a , a ) = a , L 1 = L , L 0 = G , L 1 = L , L 2 = ( A L ) 1 / 2 .

We end this section by recalling the next result which will be needed in the sequel.

Theorem 1.1 The following mean-inequalities hold:

L 2 <P< B 2 / 3 , L 4 <M< B 4 / 3 , L 5 <T< B 5 / 3 .

Further these inequalities are the best possible i.e. L 2 , L 4 , L 5 are the best power logarithmic means lower bounds of P, M, T, while B 2 / 3 , B 4 / 3 , B 5 / 3 are the best power (binomial) means upper bounds of P, M, T, respectively. Otherwise, there is no p>0 such that P, M or T is strictly less that L p .

For some details as regards the above theorem, we refer the reader to [610].

2 Needed tools

For the sake of simplicity for the reader, we recall here more basic notions and results that will be needed in the sequel, see [11] for more details. We begin by the next definition.

Definition 2.1 Let m 1 , m 2 , and m 3 be three given symmetric means. For all a,b>0, define

R( m 1 , m 2 , m 3 )(a,b)= m 1 ( m 2 ( a , m 3 ( a , b ) ) , m 2 ( m 3 ( a , b ) , b ) ) ,

called the resultant mean-map of m 1 , m 2 , and m 3 .

For the computation of R( m 1 , m 2 , m 3 ) when m 1 , m 2 , m 3 belong to the set of the above standard means, some examples can be found in [1114]. Here we state another example which will be of interest.

Example 2.1 It is not hard to verify that

R(A,I,G)= e 1 ( A G + G 2 2 ) 1 / 2 exp A + G 2 L .

A study investigating the elementary properties of the resultant mean-map has been stated in [11]. In particular, if m 1 , m 2 , and m 3 are three symmetric monotone means then the map (a,b)R( m 1 , m 2 , m 3 )(a,b) defines a mean, where we have the relationship

( R ( m 1 , m 2 , m 3 ) ) =R ( m 1 , m 2 , m 3 ) .
(2.1)

We also recall the next result, see [13].

Theorem 2.1 Let m 1 , m 1 , m 2 , m 2 , m 3 , and m 3 be strict symmetric monotone means such that

m 1 m 1 , m 2 m 2 and m 3 m 3 .

Then we have

R( m 1 , m 2 , m 3 )R ( m 1 , m 2 , m 3 ) .

If moreover there exists i=1,2,3 such that m i < m i , then one has

R( m 1 , m 2 , m 3 )<R ( m 1 , m 2 , m 3 ) .

As already proved [1113], the resultant mean-map’s importance stems from the fact that it is a tool for introducing the stability and stabilizability concepts, which we recall in the following.

Definition 2.2 A symmetric mean m is said to be:

  1. (a)

    Stable if R(m,m,m)=m.

  2. (b)

    Stabilizable if there exist two nontrivial stable means m 1 and m 2 satisfying the relation R( m 1 ,m, m 2 )=m. We then say that m is ( m 1 , m 2 )-stabilizable.

A developed study about the stability and stabilizability of the standard means was presented in [11]. In particular the next result has been proved there.

Theorem 2.2 With the above, the following assertions are met:

  1. (1)

    The power binomial mean B p is stable for all real number p. In particular, the arithmetic, geometric, and harmonic means A, G, and H are stable.

  2. (2)

    The power logarithmic mean L p is ( B p ,G)-stabilizable for all real number p.

  3. (3)

    The logarithmic mean L is (H,A)-stabilizable and (A,G)-stabilizable while the identric mean I is (G,A)-stabilizable.

Remark 2.1 The symmetry character of the above involved mean is, by definition, taken as essential hypothesis. In fact, if we attempt to extend the above concepts to non-symmetric means by keeping the same definitions (Definition 2.1 and Definition 2.2), the simple means m= A 1 / 3 , G 1 / 3 , with A 1 / 3 (a,b)=(1/3)a+(2/3)b, G 1 / 3 (a,b)= a 1 / 3 b 2 / 3 , do not satisfy R(m,m,m)=m. In another way, the definition of ℛ, together with that related to the stability and stabilizability concepts, is not exactly the same as above, but must be investigated for non-symmetric means. We leave the details as regards the latter point to a later time.

The next definition is also needed here [13].

Definition 2.3 Let m 1 and m 2 be two symmetric means. The tensor product of m 1 and m 2 is the map, denoted m 1 m 2 , defined by

a,b,c,d>0, m 1 m 2 (a,b,c,d)= m 1 ( m 2 ( a , b ) , m 2 ( c , d ) ) .

A symmetric mean m will be called cross mean if the map m 2 :=mm is symmetric in its four variables.

It is proved in [11] that every cross mean is stable. The reverse of the latter assertion is still an open problem. Otherwise, it is conjectured [13] that the first Seiffert mean P is not stabilizable and such a problem is also still open. We also conjecture here that the second Seiffert mean and the Neuman-Sándor mean are not stabilizable either.

The next result needed here has also been proved in [14].

Theorem 2.3 Let m 1 and m 2 be two nontrivial stable symmetric monotone means such that m 1 m 2 (resp. m 2 m 1 ). Assume that m 1 is moreover a cross mean. Then there exists one and only one ( m 1 , m 2 )-stabilizable mean m such that m 1 m m 2 (resp. m 2 m m 1 ).

Recently, Raïssouli and Sándor [5] introduced a mean-transformation defined in the following way: for a given mean m (symmetric or not) they set

m π (a,b)= n = 1 m ( a 1 / 2 n , b 1 / 2 n ) .
(2.2)

This allowed them to construct a lot of new means and to obtain good relationships between some standard means. In particular, they obtained G π =G, A π =L, S π =I, C π =A and B p π = L p for every real number p, where S and C refer, respectively, to the weighted geometric mean and contra-harmonic mean defined by

S:=S(a,b)= ( a a b b ) 1 / ( a + b ) ,C:=C(a,b)= a 2 + b 2 a + b .

3 Two special subsets of means

Let M s be the set of all symmetric means. For fixed m 1 , m 2 M s , we set

E ( m 1 , m 2 ) = { m M s , R ( m 1 , m , m 2 ) m } , E + ( m 1 , m 2 ) = { m M s , m R ( m 1 , m , m 2 ) } .

It is clear that max E ( m 1 , m 2 ) and min E + ( m 1 , m 2 ), that is, these sets are nonempty. Moreover, by equation (2.1) the relationship

m E ( m 1 , m 2 ) m E + ( m 1 , m 2 )

is obvious. By virtue of this equivalence, it will be sufficient to study the properties of one the sets E ( m 1 , m 2 ) and E + ( m 1 , m 2 ) and to deduce that of the other by duality.

Example 3.1 With the help of Theorem 2.1, it is simple to see that G<R(G,G,A) and A>R(G,A,A). So G E + (G,A) and A E (G,A). We can also verify that T E (A,G) and M E (A,G). Other more interesting examples will be seen later.

The next result is of interest.

Proposition 3.1 Let m 1 , m 2 be two nontrivial monotone (symmetric) stable means where m 1 is a cross mean. Then the intersection between E ( m 1 , m 2 ) and E + ( m 1 , m 2 ) is reduced to the unique mean m which is the ( m 1 , m 2 )-stabilizable mean.

Proof Following Theorem 2.3, let m be the unique ( m 1 , m 2 )-stabilizable mean. Then R( m 1 ,m, m 2 )=m and so m E ( m 1 , m 2 ) and m E + ( m 1 , m 2 ). Inversely, let m E ( m 1 , m 2 ) E + ( m 1 , m 2 ); then R( m 1 ,m, m 2 )=m and so m is the unique ( m 1 , m 2 )-stabilizable mean. □

Now, we are in a position to state the next result ensuring the existence of a maximal super-stabilizable (resp. minimal sub-stabilizable) mean.

Theorem 3.2 Let m 1 , m 2 be two symmetric monotone means. Then the set E + ( m 1 , m 2 ) has at least a maximal element.

Before giving the proof of the last theorem we state the next corollary, which is immediate from the above.

Corollary 3.3 Let m 1 , m 2 be as in the above theorem. Then the set E ( m 1 , m 2 ) has at least a minimal element.

Proof For proving the theorem, we will show that the set E + ( m 1 , m 2 ) is (nonempty) inductively ordered. Let us equip E + ( m 1 , m 2 ) with the point-wise order induced by that of the set of all means. Let E E + ( m 1 , m 2 ) be a nonempty total ordered set and we get E= ( m i ) i J . Then, sup i J m i is a mean. Clearly, sup i J m i is an upper bound of E and we wish to establish that sup i J m i E + ( m 1 , m 2 ). Indeed, for all iJ, we have

m i E m i E + ( m 1 , m 2 ) m i R( m 1 , m i , m 2 ).

Since m 1 and m 1 are monotone, we deduce by Theorem 2.1, m i R( m 1 , sup i J m i , m 2 ) for all iJ and so sup i J m i R( m 1 , sup i J m i , m 2 ), that is, sup i J m i E + ( m 1 , m 2 ). It follows that every nonempty totally ordered subset of E + ( m 1 , m 2 ) has an upper bound in E + ( m 1 , m 2 ), that is, E + ( m 1 , m 2 ) is inductive. We can then apply the classical Zorn lemma to conclude and the proof of the theorem is complete. □

Remark 3.1 A question arises from the above: Let m 1 and m 2 be two given symmetric means. Is it true that

E + ( m 1 , m 2 ) E ( m 1 , m 2 )= M s ?

Proposition 3.4 For all given symmetric mean m, we have:

  1. (1)

    The sets E (A,m) and E + (A,m) are (linearly) convex.

  2. (2)

    The sets E (G,m) and E + (G,m) are geometrically convex.

Proof (1) follows from the linear-affine character of A with the definition of ℛ, while (2) comes from the geometric character of G. The details are simple and omitted here. □

4 Sub-stabilizability and super-stabilizability

The next definition may be stated.

Definition 4.1 Let m 1 , m 2 be two nontrivial stable comparable means. A mean m is called:

  1. (a)

    ( m 1 , m 2 )-sub-stabilizable if R( m 1 ,m, m 2 )m and m is between m 1 and m 2 ,

  2. (b)

    ( m 1 , m 2 )-super-stabilizable if mR( m 1 ,m, m 2 ) and m is between m 1 and m 2 .

Following Theorem 2.3, the above definition extends that of stabilizability in the sense that a mean m is ( m 1 , m 2 )-stabilizable if and only if (a) and (b) hold. It follows that the above concepts bring something new for non-stable and non-stabilizable means. For this, we say that m is strictly ( m 1 , m 2 )-sub-stabilizable if R( m 1 ,m, m 2 )<m and m is strictly ( m 1 , m 2 )-super-stabilizable if m<R( m 1 ,m, m 2 ), with in both cases m being strictly between m 1 and  m 2 .

With the notation of the above section we have

m  is  ( m 1 , m 2 ) -sub-stabilizable m E ( m 1 , m 2 ) , m  is  ( m 1 , m 2 ) -super-stabilizable m E + ( m 1 , m 2 )

and

m is ( m 1 , m 2 )-sub-stabilizable m  is  ( m 1 , m 2 ) -super-stabilizable.

Example 4.1 We can easily see that G is (G,A)-super-stabilizable (but not strictly) while A is (G,A)-sub-stabilizable. However, T and M are not (G,A)-sub-stabilizable, since they are not between G and A. More interesting examples, presented as main results, will be stated in the section below.

Theorem 4.1 Let m be a continuous symmetric mean. Then the following assertions are met:

  1. (1)

    If there exists a symmetric mean m 1 such that m is ( m 1 ,G)-sub-stabilizable then m m 1 π .

  2. (2)

    If there exists a symmetric mean m 1 such that m is ( m 1 ,G)-super-stabilizable then m m 1 π .

Proof (1) Assume that m is m 1 -sub-stabilizable, that is,

a,b>0,R( m 1 ,m,G)(a,b)m(a,b),

or, according to the definition of ℛ,

a,b>0, m 1 ( a , b )m( a , b )m(a,b).

This, with a simple mathematical induction, implies that the inequality

a,b>0, n = 1 N m 1 ( a 1 / 2 n , b 1 / 2 n ) m ( a 1 / 2 N , b 1 / 2 N ) m(a,b)

holds true for each integer N1. Letting N in the latter inequality and using the fact that m is continuous we infer that

n = 1 m 1 ( a 1 / 2 n , b 1 / 2 n ) m(a,b),

which with equation (2.2) means that m m 1 π .

  1. (2)

    It is similar to that the above. The details are omitted here. □

The above theorem has various consequences, which we will state in what follows.

Corollary 4.2 Let m be a continuous symmetric mean. Then the next statements hold true:

  1. (i)

    If m is ( B p ,G)-sub-stabilizable for some p0 then L p m B p . In particular, if m is (A,G)-sub-stabilizable then LmA.

  2. (ii)

    If m is ( B p ,G)-super-stabilizable for some p0 then B p m L p . In particular, if m is (A,G)-super-stabilizable then GmL.

Proof It is immediate by combining the above theorem with the fact that B p π = L p for each real number p, and B 1 =A, L 1 =L. □

Remark 4.1 (i) The above corollary tells us that L is a minimal element of E (A,G) and it is a maximal element of E + (A,G): this rejoins the fact that L is (A,G)-stabilizable.

  1. (ii)

    The above corollary implies that I is not (A,G)-super-stabilizable, but it is perhaps (A,G)-sub-stabilizable. See more details as regards the latter point in the section below.

Corollary 4.3 Let m>G be a strictly ( B p ,G)-sub-stabilizable mean. Then 0<q<p<r, where q is the greatest number such that m> L q and r is the smallest number such that m< B r .

Proof If m>G is strictly ( B p ,G)-sub-stabilizable then, by definition, m< B p and, by the above corollary, m L p . Combining these latter mean-inequalities we deduce the desired result. □

Corollary 4.4 (i) If there exists p such that P is strictly ( B p ,G)-sub-stabilizable then 2/3<p2.

  1. (ii)

    If M is strictly ( B p ,G)-sub-stabilizable for some p then 4/3<p4.

  2. (iii)

    If T is strictly ( B p ,G)-sub-stabilizable then 5/3<p5.

  3. (iv)

    There is no pR such that P, M or T is ( B p ,G)-super-stabilizable.

Proof Combining the above corollary with Theorem 1.1, we immediately deduce the assertions (i), (ii), and (iii).

Assertion (iv) follows from Corollary 4.2(ii) with Theorem 1.1 again. Details are omitted here. □

5 Application to some standard means

This section will be devoted to an application of the above concepts to some known means. We begin with the next result.

Theorem 5.1 The logarithmic mean L is strictly (G,A)-super-stabilizable.

Proof First, the reader will do well to distinguish between the two next statements: ‘L is strictly (G,A)-super-stabilizable’ to prove here and ‘L is (A,G)-stabilizable’ already shown in [11]. By definition and by a simple reduction, we have to prove

( L ( a , b ) ) 2 <L ( a , a + b 2 ) L ( a + b 2 , b )
(5.1)

for all a,b>0 with ab. We will present two different proofs for equation (5.1). By the symmetric character of the involved means, we can assume, without loss the generality, that a<b.

  • The first method is much more natural: Since Aa=bA=(ba)/2, we have

    L(a,A)L(A,b)= ( b a ) 2 4 ln ( A / a ) ln ( b / A ) .

Then by the inequality

xy< ( x + y 2 ) 2

valid for all real numbers x, y with xy, one has

4ln(A/a)ln(b/A)< ( ln ( A / a ) + ln ( b / A ) ) 2 = ( ln ( a / b ) ) 2 .

This gives equation (5.1), so it completes the proof of the first method.

  • The second method is based on the fact that we can always set a= e x G and b= e x G with x>0. A simple computation leads to

    L(a,b)= sh x x G,L ( a , a + b 2 ) = sh x x ln ( ch x ) G,L ( a , a + b 2 ) = sh x x + ln ( ch x ) G.

Substituting these in equation (5.1) we are in a position to show that

sh 2 x x 2 < sh 2 x x 2 ( ln ( ch x ) ) 2

for all x>0, which clearly holds and inequality (5.1) is again proved.

In summary, we have shown that L is strictly (G,A)-super-stabilizable. □

Remark 5.1 We can also see that L is strictly (A,H)-sub-stabilizable. In fact, since L is (A,G)-stabilizable and G>H, we obtain (with the help of Theorem 2.1)

L=R(A,L,G)>R(A,L,H),

which, with H<L<A, means that L is strictly (A,H)-sub-stabilizable.

Theorem 5.2 The identric mean I is strictly (A,G)-sub-stabilizable.

Proof We will present here two different methods for proving our claim: The first is direct and based on some mean-inequalities already stated in the literature, while the second one is similar to above.

  • First method: We have to show

    I(a,G)+I(b,G)<2I(a,b)
    (5.2)

for all a,b>0 with ab. If we recall that [15] the function (x,y)I(x,y) is concave upon both variables, we immediately deduce that

2I(A,G)>I(a,G)+I(b,G).
(5.3)

Otherwise, it is well known that A + G 2 <I (see [13] for example) and I(a,b)<A(a,b):= a + b 2 for all a,b>0, ab. We then obtain

I(A,G)< A + G 2 <I,

which, when combined with equation (5.3), gives equation (5.2), so it completes the proof of the first method.

  • Second method: To show equation (5.2) is equivalent to proving that

    A( a , b )I( a , b )<I(a,b).
    (5.4)

As previously, we can easily verify that

I(a,b)=Gexp x th x ,A( a , b )= G 1 / 2 ch(x/2).

Substituting these in the above and using the identity

thx= 2 th ( x / 2 ) 1 + th 2 ( x / 2 )

valid for each x>0, the desired inequality is reduced to showing that

Φ(x):=ln ( ch ( x / 2 ) ) (x/2)th(x/2)<0

for all x>0. A simple computation leads to

Φ (x)= x 4 ch 2 ( x / 2 ) <0.

It follows that Φ is strictly decreasing for x>0 and so Φ(x)<Φ(0):= lim t 0 Φ(t)=0. The second method is complete. □

Remark 5.2 Another method for proving equation (5.4) can be stated as follows: It is well known (and easy to verify) that I( a 2 , b 2 )=I(a,b)S(a,b) for all a,b>0, where S:=S(a,b)= ( a a b b ) 1 / ( a + b ) is the so-called weighted geometric mean. With this, equation (5.4) is equivalent to A( a , b )<S( a , b ) i.e. A<S, which is a well-known mean-inequality.

As a consequence of the above, the next result gives a double inequality refining L<I and involving the four standard means G, L, I, and A.

Corollary 5.3 We have

2 e 2 L 2 <G(A+G)exp A + G L <2 e 2 I 2 .
(5.5)

Proof The above theorem means that R(A,I,G)<I, which, with Theorem 2.1 and the fact that L is (A,G)-stabilizable, yields

L=R(A,L,G)<R(A,I,G)<I.

This, with Example 2.1 and a simple manipulation, gives the desired result. □

Of course, the above theorems when combined with the properties of sub-super-stabilizability imply that L is, simultaneously, strictly (G,H)-sub-stabilizable and strictly (H,A)-super-stabilizable, while I is strictly (H,G)-super-stabilizable.

As already pointed out before, whether the first Seiffert mean P is stabilizable still is an open problem. However, the next result may be stated.

Theorem 5.4 The first Seiffert mean P is strictly (A,G)-sub-stabilizable.

Proof Explicitly, we have to prove that

A( a , b )P( a , b )<P(a,b)
(5.6)

holds for all a,b>0 with ab. We also present here two different methods.

  • First method: this method is analogous to the above. Simple computation leads to

    P(a,b)=G sh x arcsin ( th x )

for each x>0. After simple substitution and reduction we are in a position to show that

Φ(x):=2arcsin ( th ( x / 2 ) ) arcsin(thx)>0

for every x>0. We can easily obtain (after computation and reduction)

Φ (x)= 1 ch ( x / 2 ) 1 ch x >0

for all x>0. The desired inequality follows in the same way as previously.

  • Second method: this method is based on an integral form of P(a,b). It is easy to see that, for all a,b>0 (with a<b without loss the generality), we have

    P(a,b)= ( 4 b a 1 b / a d x 1 + x 2 ) 1 .
    (5.7)

This, with a simple manipulation, yields

A( a , b )P( a , b )= ( 8 b a 1 b / a 4 d x 1 + x 2 ) 1 .
(5.8)

To show equation (5.6) is equivalent to proving that the second side of equation (5.8) is strictly smaller than that of equation (5.7), or again (after a simple reduction)

1 b / a d x 1 + x 2 <2 1 b / a 4 d x 1 + x 2 .
(5.9)

If we use the variable of change x= t 2 , t>0 in the left integral of equation (5.9) our aim is then reduced to showing that

1 b / a 4 x d x 1 + x 4 < 1 b / a 4 d x 1 + x 2 .
(5.10)

It is very easy to verify that

x>0,x1, x 1 + x 4 < 1 1 + x 2 ,

from which equation (5.10) follows. The proof is complete. □

Remark 5.3 Another way of proving equation (5.6) can be followed: For all a,b>0, ab, we have [16]

P ( a 2 , b 2 ) > ( A ( a , b ) ) 2 > ( P ( a , b ) ) 2 .

This gives

P ( a 2 , b 2 ) > ( A ( a , b ) ) 2 >P(a,b)A(a,b)

which is exactly equation (5.6).

6 Some open problems

In the above section, we have proved that P is strictly (A,G)-sub-stabilizable. The fact that P is strictly (G,A)-super-stabilizable is not proved yet. This is equivalent to showing that

( P ( a , b ) ) 2 <P ( a , a + b 2 ) P ( a + b 2 , b )

holds for all a,b>0 with ab. As above, and setting t=thx, x>0, we are in a position to show that

Φ(t):= ( arcsin t ) 2 4arcsin t 2 + t arcsin t 2 t >0

for all 0<t<1. We then present the following.

Problem 1: Prove or disprove that the first Seiffert mean P is strictly (G,A)-super-stabilizable.

Problem 2: Find the best real numbers p>0 and q>0 for which P is strictly ( B p , B q )-sub-stabilizable.

Problem 3: Are the means T and M strictly ( B p , B q )-sub-stabilizable for some real numbers p>0, q>0?