1 Introduction and preliminaries

Throughout this manuscript, X will be a non-empty set and ⪯ will denote a partial order on X. Given nN with n2, let us denote by X n the product space X×X× ( n ) ×X of n identical copies of X.

The study of multidimensional fixed point theorems was initiated by Guo and Lakshmikantham in [1] in the coupled case.

Definition 1.1 (Guo and Lakshmikantham [1])

Let F:X×XX be a given mapping. We say that (x,y)X×X is a coupled fixed point of F if

F(x,y)=xandF(y,x)=y.

In 2006, Bhaskar and Lakshmikantham [2] proved some coupled fixed point theorems for a mapping F:X×XX (where X is a partially ordered metric space) by introducing the notion of mixed monotone mapping.

Definition 1.2 (See [2])

Let (X,) be a partially ordered set. A mapping F:X×XX. F is said to have the mixed monotone property if F(x,y) is monotone nondecreasing in x and is monotone non-increasing in y, that is, for any x,yX,

x 1 , x 2 X , x 1 x 2 F ( x 1 , y ) F ( x 2 , y ) and y 1 , y 2 X , y 1 y 2 F ( x , y 2 ) F ( x , y 1 ) .

Following this paper, Lakshmikantham and Ćirić [3] established coupled fixed/coincidence point theorems for mappings F:X×XX and g:XX by defining the concept of the mixed g-monotone property. Later, Berinde and Borcut studied the tripled case.

Definition 1.3 (Berinde and Borcut [4])

Let F: X 3 X be a given mapping. We say that (x,y,x) X 3 is a tripled fixed point of F if

F(x,y,z)=x,F(y,x,y)=yandF(z,x,y)=z.

Definition 1.4 (See [4])

Let (X,) be a partially ordered set and F: X 3 X. We say that F has the mixed monotone property if F(x,y,z) is monotone non-decreasing in x and z, and it is monotone non-increasing in y, that is, for any x,y,zX,

x 1 , x 2 X , x 1 x 2 F ( x 1 , y , z ) F ( x 2 , y , z ) , y 1 , y 2 X , y 1 y 2 F ( x , y 1 , z ) F ( x , y 2 , z ) and z 1 , z 2 X , z 1 z 2 F ( x , y , z 1 ) F ( x , y , z 2 ) .

Karapınar and Luong studied the quadruple case.

Definition 1.5 (See [57])

An element (x,y,z,w) X 4 is called a quadruple fixed point of F: X 4 X if

F(x,y,z,w)=x,F(y,z,w,x)=y,F(z,w,x,y)=zandF(w,x,y,z)=w.

Definition 1.6 (See [5])

Let (X,) be a partially ordered set and F: X 4 X. We say that F has the mixed monotone property if F(x,y,z,w) is monotone non-decreasing in x and z, and it is monotone non-increasing in y and w, that is, for any x,y,z,wX,

x 1 , x 2 X , x 1 x 2 F ( x 1 , y , z , w ) F ( x 2 , y , z , w ) , y 1 , y 2 X , y 1 y 2 F ( x , y 1 , z , w ) F ( x , y 2 , z , w ) , z 1 , z 2 X , z 1 z 2 F ( x , y , z 1 , w ) F ( x , y , z 2 , w ) and w 1 , w 2 X , w 1 w 2 F ( x , y , z , w 1 ) F ( x , y , z , w 2 ) .

When a mapping g:XX is involved, we have the notion of coincidence point. We will only recall the corresponding definitions in the quadruple case since they are similar in other dimensions.

Definition 1.7 (See [8])

An element (x,y,z,w) X 4 is called a quadrupled coincident point of the mappings F: X 4 X and g:XX if

gx=F(x,y,z,w),gy=F(y,z,w,x),gz=F(z,w,x,y)andgw=F(w,x,y,z).

Definition 1.8 (See [8])

Let (X,) be a partially ordered set, and let F: X 4 X and g:XX be two mappings. We say that F has the mixed g-monotone property if F(x,y,z,w) is g-non-decreasing in x and z and is g-non-increasing in y and w, that is, for any x,y,z,wX,

x 1 , x 2 X , g x 1 g x 2 F ( x 1 , y , z , w ) F ( x 2 , y , z , w ) , y 1 , y 2 X , g y 1 g y 2 F ( x , y 1 , z , w ) F ( x , y 2 , z , w ) , z 1 , z 2 X , g z 1 g z 2 F ( x , y , z 1 , w ) F ( x , y , z 2 , w ) and w 1 , w 2 X , g w 1 g w 2 F ( x , y , z , w 1 ) F ( x , y , z , w 2 ) .

It is very natural to extend the definition of two-dimensional fixed point (coupled fixed point), three-dimensional fixed point (tripled fixed point) and so on to multidimensional fixed point (n-tuple fixed point) (see, e.g., [917]). In this paper, we give some remarks on the notion of n-tuple fixed point given by Ertürk and Karakaya in [18, 19]. Notice that the authors preferred to say ‘n-tuplet fixed point’ instead of ‘n-tuple fixed point’.

Definition 1.9 (See [18])

An element ( x 1 , x 2 , x 3 ,, x n ) X n is called an n-tuple fixed point of the mapping F: X n X if

x 1 = F ( x 1 , x 2 , x 3 , , x n ) , x 2 = F ( x 2 , x 3 , , x n , x 1 ) , x 3 = F ( x 3 , , x n , x 1 , x 2 ) , x n = F ( x n , x 1 , x 2 , , x n 1 ) .

Definition 1.10 (See [18])

Let (X,) be a partially ordered set, and let F: X n X be a mapping. We say that F has the mixed monotone property if F( x 1 , x 2 , x 3 ,, x n ) is non-decreasing in odd arguments and it is non-increasing in its even arguments, that is, for any x 1 , x 2 , x 3 ,, x n X,

y 1 , z 1 X , y 1 z 1 F ( y 1 , x 2 , x 3 , , x n ) F ( z 1 , x 2 , x 3 , , x n ) , y 2 , z 2 X , y 2 z 2 F ( x 1 , y 2 , x 3 , , x n ) F ( x 1 , z 2 , x 3 , , x n ) , y n , z n X , y n z n F ( x 1 , x 2 , x 3 , , y n ) F ( x 1 , x 2 , x 3 , , z n ) if  n  is odd, y n , z n X , y n z n F ( ( x 1 , x 2 , x 3 , , y n ) F ( x 1 , x 2 , x 3 , , z n ) if  n  is even.

Definition 1.11 (See [18])

An element ( x 1 , x 2 , x 3 ,, x n ) X n is called an n-tuple coincidence point of the mappings F: X n X and g:XX if

g x 1 = F ( x 1 , x 2 , x 3 , , x n ) , g x 2 = F ( x 2 , x 3 , , x n , x 1 ) , g x 3 = F ( x 3 , , x n , x 1 , x 2 ) , g x n = F ( x n , x 1 , x 2 , , x n 1 ) .

Definition 1.12 (See [18])

Let (X,) be a partially ordered set, and let F: X n X and g:XX be mappings. We say that F has the mixed g-monotone property if F( x 1 , x 2 , x 3 ,, x n ) is g-non-decreasing in odd arguments and it is g-non-increasing in its even arguments, that is, for any x 1 , x 2 , x 3 ,, x n X,

y 1 , z 1 X , g y 1 g z 1 F ( y 1 , x 2 , x 3 , , x n ) F ( z 1 , x 2 , x 3 , , x n ) , y 2 , z 2 X , g y 2 g z 2 F ( x 1 , y 2 , x 3 , , x n ) F ( x 1 , z 2 , x 3 , , x n ) , y n , z n X , g y n g z n F ( x 1 , x 2 , x 3 , , y n ) F ( x 1 , x 2 , x 3 , , z n ) if  n  is odd, y n , z n X , g y n g z n F ( x 1 , x 2 , x 3 , , y n ) F ( x 1 , x 2 , x 3 , , z n ) if  n  is even.

2 Some remarks

Firstly we notice that in the case n=3, Definitions 1.9 and 1.11,

g x 1 = F ( x 1 , x 2 , x 3 ) , g x 2 = F ( x 2 , x 3 , x 1 ) , g x 3 = F ( x 3 , x 1 , x 2 ) ,

do not extend the notion of tripled coincidence point by Berinde and Borcut [4]. Therefore, their results are not extensions of the well-known results in the tripled case. This fact shows that the odd case is not well posed by Definitions 1.9 and 1.11 or, more precisely, the mixed monotone property is not useful to ensure the existence of coincidence points. In this sense, we have the following result.

Theorem 2.1 Theorem  1 in [18]is not valid if n is odd.

Proof In order not to complicate the proof, we only study the case n=3, which is very illustrative and can be identically extrapolated to the case in which n is odd. Let us follow the lines in the proof of Theorem 1 in [18]. Using the initial points x 0 1 , x 0 2 , x 0 3 X, it is possible to construct three sequences { x k 1 }, { x k 2 } and { x k 3 } recursively defined by:

g x k 1 = F ( x k 1 1 , x k 1 2 , x k 1 3 ) , g x k 2 = F ( x k 1 2 , x k 1 3 , x k 1 1 ) , g x k 3 = F ( x k 1 3 , x k 1 1 , x k 1 2 ) for all  k N , k 1 .

By assumption, we have that

g x 0 1 F ( x 0 1 , x 0 2 , x 0 3 ) = g x 1 1 , g x 0 2 F ( x 0 2 , x 0 3 , x 0 1 ) = g x 1 2 , g x 0 3 F ( x 0 3 , x 0 1 , x 0 2 ) = g x 1 3 .

Then the authors affirmed that these sequences verify, for all k1,

g x k 1 1 g x k 1 , g x k 1 2 g x k 2 , g x k 1 3 g x k 3 .

However, it is impossible to prove that g x 1 2 g x 2 2 because the mixed g-monotone property leads to contrary inequalities. At most, we can deduce the following properties:

g x 1 2 g x 0 2 F ( x 1 2 , x 0 3 , x 0 1 ) F ( x 0 2 , x 0 3 , x 0 1 ) =g x 1 2 .

Moreover,

g x 0 3 g x 1 3 F ( x 1 2 , x 0 3 , x 0 1 ) F ( x 1 2 , x 1 3 , x 0 1 ) .

Joining the two previous inequalities, we obtain

F ( x 1 2 , x 1 3 , x 0 1 ) F ( x 1 2 , x 0 3 , x 0 1 ) F ( x 0 2 , x 0 3 , x 0 1 ) =g x 1 2 .

However, in the third component, the inequality is on the contrary

g x 0 1 g x 1 1 F ( x 1 2 , x 1 3 , x 0 1 ) F ( x 1 2 , x 1 3 , x 1 1 ) =g x 2 2 .

Then we can deduce that

F ( x 1 2 , x 1 3 , x 0 1 ) g x 1 2 andF ( x 1 2 , x 1 3 , x 0 1 ) g x 2 2 .

Since other possibilities yield similar incomparable cases, we cannot get the inequality g x 1 2 g x 2 2 . □

For completeness and to conclude this paper, instead of Definitions 1.9 and 1.11, we recall here the concept of multidimensional fixed/coincidence point introduced by Roldán et al. in [11] (see also [1214]), which is an extension of Berzig and Samet’s notion given in [10].

Fix nN such that n2. To separate the variables, let {A,B} be a partition of Λ n ={1,2,,n}, that is, AB= Λ n and AB=, and suppose that A and B are non-empty. We will define

Ω A , B = { σ : Λ n Λ n : σ ( A ) A  and  σ ( B ) B } and Ω A , B = { σ : Λ n Λ n : σ ( A ) B  and  σ ( B ) A } .

Let σ 1 , σ 2 ,, σ n : Λ n Λ n be n mappings from Λ n into itself, and let Φ be the n-tuple ( σ 1 , σ 2 ,, σ n ).

Let F: X n X and g:XX be two mappings.

Definition 2.2 [11]

A point ( x 1 , x 2 ,, x n ) X n is called a Φ-coincidence point of the mappings F and g if

F( x σ i ( 1 ) , x σ i ( 2 ) ,, x σ i ( n ) )=g x i for all i{1,2,,n}.

If g is the identity mapping on X, then ( x 1 , x 2 ,, x n ) X n is called a Φ-fixed point of the mapping F.

Definition 2.3 [11]

Let (X,) be a partially ordered space. We say that F has the mixed g-monotone property (w.r.t. {A,B}) if F is g-monotone non-decreasing in arguments of A and g-monotone non-increasing in arguments of B, i.e., for all x 1 , x 2 ,, x n ,y,zX and all i,

gygz{ F ( x 1 , , x i 1 , y , x i + 1 , , x n ) F ( x 1 , , x i 1 , z , x i + 1 , , x n ) if  i A , F ( x 1 , , x i 1 , y , x i + 1 , , x n ) F ( x 1 , , x i 1 , z , x i + 1 , , x n ) if  i B .

In order to ensure the existence of Φ-coincidence/fixed points, it is very important to assume that the mixed g-monotone property is compatible with the permutation of the variables, that is, the mappings of Φ=( σ 1 , σ 2 ,, σ n ) should verify:

σ i Ω A , B if iAand σ i Ω A , B if iB.

Notice that, in fact, when n is even, Definitions 1.11 and 1.12 can be seen as particular cases of the previous definitions, when A is the set of all odd numbers and B is the family of all even numbers in {1,2,,n}, and the mappings σ 1 , σ 2 ,, σ n are appropriate permutations of the variables.

Finally, to be fair, we remark that most of multidimensional fixed point theorems can be reduced to one-dimensional (usual) fixed point results (see, e.g., [14, 20]). More precisely, for instance in [14], the authors proved that the first coupled fixed point result, Theorem 2.1 in [2], is a consequence of Theorem 2.1 in [21]. In [20], the authors proved that the initial multidimensional fixed point result, Theorem 9 in [11], can be derived from Theorem 2.1 in [21] either.