Next Article in Journal
Comprehensive Evaluation Method for Importance of Epidemic Prevention in Chinese Cities Considering Population Mobility Network
Previous Article in Journal
Toward Adaptive and Immune-Inspired Viable Supply Chains: A PRISMA Systematic Review of Mathematical Modeling Trends
Previous Article in Special Issue
Modeling, Analysis, and Transmission Dynamics of Cassava Mosaic Disease Through Stochastic Fractional Delay Differential Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Properties of Iterations Generated with Composition Maps of Cyclic Contractive Self-Mappings and Strict Contractions in Metric Spaces

Automatic Control Group–ACG and Institute of Research and Development of Processes, Faculty of Science and Technology, Department of Electricity and Electronics, University of the Basque Country (UPV/EHU), 48940 Leioa, Spain
Mathematics 2025, 13(14), 2224; https://doi.org/10.3390/math13142224
Submission received: 17 June 2025 / Revised: 4 July 2025 / Accepted: 7 July 2025 / Published: 8 July 2025
(This article belongs to the Special Issue Applied Mathematical Modelling and Dynamical Systems, 2nd Edition)

Abstract

This paper studies the convergence of distances between sequences of points and that of sequences of points in metric spaces. This investigation is focused on the iterative processes built with composed self-mappings of a cyclic contraction, which can involve more than two nonempty closed subsets in a metric space, which are combined with compositions of a strict contraction with itself, which operates in each of the individual subsets, in any order and any number of mutual compositions. It is admitted, in the most general case, the involvement of any number of repeated compositions of both self-maps with themselves. It is basically seen that, if one of the best-proximity points in the cyclic disposal is unique in a boundedly compact subset of the metric space is sufficient to achieve unique asymptotic cycles formed by a best-proximity point per each adjacent subset. The same property is achievable if such a subset is strictly convex and the metric space is a uniformly convex Banach space. Furthermore, all the sequences with arbitrary initial points in the union of all the subsets of the cyclic disposal converge to such a limit cycle.

1. Introduction

There is an abundant and rich background literature available on contractive cyclic self-mappings defined on subsets of complete metric spaces. See, for instance, [1,2,3] and some of the references therein. In [4], multivalued cyclic self-mappings are investigated while, in [5], Jungck iterative cyclic iterative processes are focused on. In [6], some results for cyclic contractions are obtained, which apply for Banach spaces, geodesic metric spaces and metric spaces. In [7], relatively nonexpansive mappings are investigated on the union of two subsets of a Banach space. If the pair of subsets has a proximal normal structure and a relative nonexpansive mapping, T on A B satisfies T A B and T B A , where A and B are weakly compact and convex subsets of the Banach space X ,   , then there is some proximal point z A B such that z T z = d i s t A , B . The obtained results are also adapted, in particular, for Banach spaces with strictly convex norms and they are valid for uniformly convex Banach spaces. In [8], cyclic ϕ A -contractions defined on partially ordered orbitally complete metric spaces are considered. Some fixed-point and best-proximity-point theorems are stated and certain links between points of coincidence and common best proximal points are investigated. It is also found that there are conditions under which points of coincidence, common best proximal points and common fixed points are coincident. A study on the best-proximity points for cyclic mappings in multiplicative metric spaces is performed in [9]. On the other hand, best-proximity results in b-metric spaces endowed with a graph are established in [10], while, in [11,12], some new results for cyclic mappings in complete b-metric-like space are established. Also, some connections on cyclic contractions and contractive self-mappings with Hardy–Rogers self-mappings are investigated in [13] while proximity results in Busemann convex metric spaces are given in [14]. In [15], a so-called BSS-type cyclic zapping is investigated, which is a pair semi-cycle mapping supported with a special contractive rule. On the other hand, some new best proximity and cyclic mapping results are obtained in [16,17] concerned with S-cyclic mappings.
It can be pointed out the importance of the concept of approximative compactness for the non-emptiness of the sets of best-proximity points of two nonempty subsets A and B of a metric space. In fact, one of the simplest such conditions is that both best proximity sets are nonempty if A is compact and B is approximatively compact with respect to A , that is, every sequence x n n = 0 B such that d y , x n d y , B as n for some y A such that d i s t A , B = d y , B such have a convergent subsequence [1,18,19].
This paper extends the formalism on cyclic contractions to consider the compositions of cyclic self-mappings with usual strict contractions which are integrated in more general iterative processes in the following way. The subsets of the cyclic disposals are assumed to be nonempty and closed and they can be disjointed or not. The contractive cyclic self-mapping T operates over adjacent nonempty closed subsets of the cyclical disposal in the metric space X , d as usual, while the strict contraction S operates over each of the individual subsets. The iterative processes which govern the combinations of both self-mappings are built in general under any order of the contributions of each of the mappings and any number of compositions of the self-mapping T with itself. Also, the iterative processes can include any number of compositions in any order of the sets of compositions of both self-mappings T and S with themselves. The subjacent idea of the proposal is to adequate the evolution of sequences in each of the subsets being governed by the self-mapping S or by compositions of the self-mapping S with itself, with switching actions from the current subset to its adjacent one in the cyclic disposal, governed by the self-mapping T . Each switching in-between adjacent subsets of the cyclic disposal can be addressed from the current subset to another subset distinct to the adjacent one if a number of compositions of the cyclic self-mapping T with itself are combined before the next contribution to the iterative process of the contractive self-mapping S , again, with eventual compositions with itself. Some applications of interest, as exhibited in some of the given worked examples, rely on the solution of differential systems of equations in alternative domains which can also have different parameterizations and are subject to mutual switching actions. For instance, each of the subsets of the cyclic disposal can be associated with a particular parameterization of the differential system, while switching actions can govern the activations of other alternative parameterizations in a different set to the current one among those being integrated in the cyclic disposal. This situation may arise in some processes in the real word as, for instance, in atmospheric models, in distillation column towers, in switching processes in financial markets, etc., and these are also relevant in certain control processes [20,21,22,23].
This paper is organized as follows. Section 2 gives some preliminary definitions and results on the contractive cyclic self-mapping and the strict contraction to be composed in the iterative processes of the third section. It is basically seen that under the condition that just one of the best proximity sets in the cyclic disposal is a singleton together with the bounded compactness of such a set (or its strict convexity if the metric space is, in addition, a uniformly convex Banach space), this suffices to achieve unique asymptotic cycles formed by a best-proximity point per each adjacent subset. All the sequences with arbitrary initial points in the union of all the subsets converge to such a limit cycle. The results also hold for extended cyclic contractions where the product of the different individual constants (one per transition from each subset to its adjacent one) is less than unity which, in fact, only requires that one of such constants be contractive. Section 3 is devoted to the convergence of distances of sequences and sequences when the compositions of the cyclic contraction are combined with compositions of the strict contraction in any order of mutual compositions while possibly involving any number of repeated compositions of both maps with themselves. It is assumed that the subsets of the cyclic disposal are nonempty and closed and that they are subsets of a uniformly convex Banach space. In addition, it is assumed that at least one of the subsets of the cyclic disposal is boundedly compact with its best proximity set to the next adjacent subset being a singleton, or alternatively that, at least one of such subsets is strictly convex. It is also assumed that the unique fixed point of the contractive self-mapping S at each subset belongs to the set of best-proximity points to its next adjacent subset in the cyclic disposal. Section 4 describes some worked examples which illustrate the formal results and, finally, the Conclusions section ends this paper.

2. Preliminary Definitions and Preparatory Results on Cyclic Contractive Self-Mappings and Strict Contractions

Through this paper, p ¯ = 1 , , 2 , ,   p and x y is the logic disjunction “or” of the logic propositions x and y . Also, R + = R 0 + 0 and R 0 + = r R : r 0 are the respective sets of positive and the non-negative real numbers, and Z + = Z 0 + 0 and Z 0 + = z Z   :   z 0 are the respective sets of positive and the non-negative integer numbers.
A positive matrix A R n × m (referred to as A 0 ) is the one with all its entries being non-negative with at least one positive. A 0 is strictly positive (referred to a A 0 ) if all its entries are positive. A vector v R n is positive (referred to as v 0 ) if all its components are non-negative with at least one being positive. Also, v 0 is strictly positive (referred to as v 0 ) if all its components are strictly positive.
Consider self-mappings T , S : i p ¯ A i i p ¯ A i such that A i X for i p ¯ are non-empty closed subsets of a metric space X , d with S A i A i for i p ¯ and T A i A i + 1 for i p ¯ .
d T x ,   T y K T d x ,   y + 1 K T D   for   x A i ,   y A i + 1 ,   any   i p ¯
d S x ,   S y       K S d x ,   y if   d x ,   y > K S 1 D = D if   d x ,   y K S 1 D   for   x A i   ,   y A i + 1 ,   any   i p ¯
d S x ,   S y   K S d x ,   y   if   x ,   y A i   for   any   i p ¯
for some real constants K T ,   K S 0   ,   1 , such that the distances in-between any adjacent subsets A i and A i + 1 for i p ¯ and their respective diameters are, respectively, as below:
The distance in-between adjacent subsets is denoted with D which is zero if such subsets intersect and greater than zero if they do not intersect. More formally,
D = d A i ,   A i + 1 = i n f   d x ,   y : x A i   ,   y A i + 1   and   diam ( A i )     D   ;   i p ¯
(if A i A i + 1 = ; i p ¯ then D = 0 ), with A p + 1 = A 1 then, A n p + l = A l for any integer l 0 ,   p 1 . Unless otherwise be stated, we will refer to as the “adjacent” subset of A i to its next adjacent one A i + 1 in the cyclic disposal rather than to the preceding one A i 1 .
  • Under (1)–(3),
(1) 
T : i p ¯ A i i p ¯ A i is said to be a p 2 -cyclic contractive self-mapping on i p ¯ A i
  • from (2).
(2) 
S : i p ¯ A i i p ¯ A i is:
(1)
Non-expansive from (2)–(3) for any pair x , y , with x , y i p ¯ A i , allocated either in the same A i or in adjacent subsets A i and A i + 1 for i p ¯ of elements allocated in adjacent subsets;
(2)
A (strict) contraction from (3) for any pair x , y of elements x , y i p ¯ A i allocated in the same subset A i for i p ¯ ;
(3)
Contractive for any pair x , y allocated in adjacent subsets A i and A i + 1 for i p ¯ under the constraints of the first equation in (2), that is, if d x , y > K s 1 D .
Remark 1. 
1.1. Note that the constraints d i a m A i D  for any i p ¯   are clearly needed for the coherency of (2). Note that, if D = 0  , then the contractive condition (3) applies for  S : A i A i  for any i p ¯   if x , y A i  , while this contractive condition applies if  x A i , y A i + 1   or if  x A i + 1  and  y A i for D > 0   if if   d x , y > K S 1 D   from (2). Also, if D > 0  , then there exist nonempty closed subsets  A i 0 A i for each i p ¯   which contain the best approximation point(s) of each subset  A i  to its adjacent subset  A i + 1
1.2. Note that T : i p ¯ A i i p ¯ A i  is a p 2  -cyclic contraction from (1), [1,2,3], and S : j p ¯ A j   | A i A i  is a (strict) contraction on  A i  for each  i p  from (3).
1.3.  Note that the second condition of (2) implies that if  D < d x , y K S 1 D  for x , y i p ¯ A i × A i + 1 A i + 1 × A i  then S x , S y i p ¯ A i 0 × A i + 1   , 0 A i + 1 , 0 × A i 0  to accomplish with  d S x   ,   S y = D . In order for that constraint to be feasible, it is necessary that a)  A i 0 ; i p ¯  ; b) S : i p ¯ A i i p ¯ A i  may be multi-valued at some points in order to accomplish with that constraint in the event that distances  d x ,   y  for points of adjacent subsets that exceed the given threshold. That is, d x , y K S 1 D d S x , S y = D  if x , S x A i  and y , S y A i + 1  (or vice versa) for any given  i p ¯  but the above constraint is not requested if  x , y , S x , S y  belong to the same subset  A i  for any given  i p ¯ .
Remark 2. 
Note that, since S : i p ¯ A i i p ¯ A i is subject to the constraint  S : j p ¯ A j   | A i A i ; i p ¯ , this function may be defined by  p functions S i : A i A i ; i p ¯ which are all identical in  i p ¯ A i if such an intersection is non-empty. By virtue of the contraction condition (3), each  S i has a unique fixed point in  A i ; i p ¯ which are all coincident if  i p ¯ A i . Note also that for any  x A i   , y A i + 1 and  i p ¯ with A p + 1 = A 1 :
d T n x ,   T n y K T d T n 1 x   , T n 1 y + 1 K T D
K T K T d T n 1 x   , T n 2 y + 1 K T D + 1 K T D
  K T 2 d T n 2 x   , T n 2 y + 1 K T 2 D
  K T n d x   , y + 1 K T n D
so that d T n x ,   T n y D  as k  and T n x A j  and T n y A j + 1  for some j p ¯  and all n Z 0 + . Since D = i n f d x , y : x A i , y A i + 1  and A i X  for all i p ¯  are closed, then there exist nonempty closed subsets A i 0 A i for each i p ¯  which contain the best approximation point(s) of each subset  A i  to its adjacent subset  A i + 1 . Throughout this paper, it is of interest for the convergence properties the case when  A i 0 = z i  and S i z i = z i  ; i p ¯  , that is, there is a unique best-proximity point at each  A i  which is also the unique fixed point of  S i . Note that since d T n p x ,   T n p + 1 x D  as n  with T n p x n = 0 A i  and T n p + 1 x n = 0 A i + 1  if  A i 0 = z i  and S i z i = z i  ; i p ¯  then the best-proximity point  z i  through T  is jointly the unique fixed point of  S i : A i A i  and that of  T p : j p ¯ A j | A i j p ¯ A j | A i ; i p ¯  , then z i A i  satisfies d z i   , z i + 1 = D  , and
z i = T p z i = T p S i z i = S i z i = S i T p z i ; i p ¯
that is, T p  commutes with S i  at each of the fixed points so that
z i + 1 = T p z i + 1 = T z i = T p + 1 z i = S i z i + 1 = T p S i z i + 1 = T S i z i = T p + 1 S i z i ; i p ¯
In the case when i p ¯ A i  then i p ¯ A i 0 = z  since z i = z  ; i p ¯ .
The next proposed definition leading immediately to an “ad hoc” elementary result refers to the fact that it is only needed a contraction of T : i p ¯ A i i p ¯ A i on one of the transitions from a set A i to its adjacent one A i + 1 to obtain a cyclic contraction under the whole disposal on the p subsets. It is useful if the mapping T : i p ¯ A i i p ¯ A i has different real constants K i for i p ¯ . It is simply necessary for that purpose that one of contractive constants be small enough to deal with other transitions which can be non-contractive or even expansive.
Definition 1. 
The p -cyclic self-mapping T : i p ¯ A i i p ¯ A i with T A i A i + 1 ; i p ¯ is said to be an extended  p 2 -cyclic contraction if it satisfies the following condition:
  • d T x   ,   T y K i d x , y + 1 K i D  for any x A i , y A i + 1  with real constants  K i R 0 + , any i p ¯  and K T = Π i = 1 p K i 0   ,   1 .
The following result relies on the fact that the existence of a unique convex element in the intersection set  i p ¯ A i  of non-disjoint closed sets  A i ; i p ¯  suffices for the convexity of such an intersection.
Lemma 1. 
Assume that all the sets  A i for i p ¯ are nonempty, non-disjointed and closed and that there exists some  j p ¯ such that A j is convex. Then, i p ¯ A i is closed and strictly convex.
Proof. 
i p ¯ A i is closed since A i ; i p ¯ are closed. Also, i p ¯ A i A j and A j is closed and convex then the non-empty closed set i p ¯ A i is also convex and strictly convex since all its boundary points are extreme since all points in any segment in i p ¯ A i are necessarily in its interior since it is closed. □
If the subsets A i intersect, then S and T have unique fixed points in the intersection set. Formally, one has the subsequent result:
Lemma 2. 
Assume that all the sets  A i ; i p ¯ of a complete metric space  X , d are nonempty, closed and non-disjointed. Then, S has a unique fixed point in  i p ¯ A i , and T p and T have an identical unique fixed point in  i p ¯ A i .
Proof. 
Note that i p ¯ A i is nonempty and closed and then D = 0 . Also, one has for any given x i p ¯ A i :
d S n + m x   ,   S n x k = n n + m 1 d S k + 1 x ,   S k x
  j = 0 m 1 K S j d S n + 1 x   ,   S n x
  K S n j = 0 m 1 K S j d S x   ,   x
= K S n j = 0 K S j j = m K S j d S x   ,   x
= K S n 1 1 K S K S m 1 K S d S x   ,   x
= K S n 1 K S 1 K S m d S x   ,   x ;   m Z +
Then, d S n + m x   ,   S n x 0 as n ; m Z + and for any given ε R + , there is some N = N ε Z 0 + such that for any n N Z 0 + and any m Z + such that d S n + m x   ,   S n x < ε , then, S n x n = 0 ω i p ¯ A i . In particular, since S : A i A i is Lipschitz-continuous with Lipschitz constant K S < 1 , one can interchange limit and distance to get:
l i m n d S n + 1 x   ,   S n x = l i m n d S S n x   ,   S n x = d S l i m n S n x   ,   l i m n S n x = d S ω   ,   ω = 0
and ω F i x S . Also, it is the unique fixed point, that is, F i x S = ω . Otherwise, if ω 1 ω F i x S , then, we get the contradiction d ω   ,   ω 1 = d S ω   , S ω 1 K S d ω   ,   ω 1 and 1 K S d ω   ,   ω 1 0 so that ω = ω 1 . All the sequences S n y n = 0 converge to this point. Assume that there is some y i p ¯ A i such that S n y n = 0 ω ´ ω . Thus,
l i m n d S n y   ,   S n ω d y , ω l i m n K S n = 0
Then, ω ´ = ω . A similar reasoning from (1) with D = 0 concludes that T p n x   n = 0 is a Cauchy sequence, T p n x   n = 0 z F i x T p i p ¯ A i , with F i x T p = z ; x i p ¯ A i . It is proved that z is also the unique fixed point of T : i p ¯ A i i p ¯ A i . Otherwise, the following contradiction is obtained if z is not a fixed point, that is, if z T z :
0 d z , T z d z ,   T p z + d T p z   , T z
= 0 + d T p z ,   T z K T T p 1 z ,   z
= K T T p 1 z , T p   z K T K T p 1 d z   ,   T z
= K T p d z   ,   T z < d z , T z
Then, z is a fixed point of T , which is unique under a similar reasoning that the one used before to prove the uniqueness of the fixed point of S since T is also a strict contraction if D = 0 . The proof is complete. The proof is complete. □
Equation (4) of Remark 2 is generalized to an extended p 2 -cyclic contraction as follows:
Theorem 1. 
Assume that all the sets  A i ; i p ¯ of a metric space X , d are nonempty and closed. If T : i p ¯ A i i p ¯ A i is an extended  p 2 -cyclic contraction, then the following properties hold:
(i) There exists  l i m n d T p n x   , T p n y = D  for any  x , y A i × A i + 1 A i + 1 × A i  and any  i p ¯ ; and l i m n d T p n + j x   , T p n + j y = D ; j p ¯  and any given x , y i p ¯ A i × A i + 1 A i + 1 × A i .
(ii)  If  i p ¯ A i , then  l i m n d T p n + j x   , T p n + j y = 0 ;  j p ¯ and any given x , y i p ¯ A i × A i + 1 A i + 1 × A i  ; d T p n + j x   , T p m + n + k x 0  ; x i p ¯ A i  ; j , k p 1 ¯     0  , and T p n + j x z i p ¯ A i  is a Cauchy sequence, then bounded for  x  being finite, and  F i x T p = F i x T = z .
(iii)  The sequences  T n x n = 0  are bounded for any finite  x i p ¯ A i  irrespectively of the subsets of the cyclic disposal being disjoint or non-disjoint.
(iv)  The properties (i)–(iii) also hold if   T : i p ¯ A i i p ¯ A i ; i p ¯  is an extended  p 2 -cyclic contraction.
Proof. 
It follows for x   , y A i × A i + 1 A i + 1 × A i ; i p ¯ that:
d T x   , T y K i d x , y + 1 K i D
d T 2 x   , T 2 y K i + 1 d T x , T y + 1 K i + 1 D K i + 1 K i d x , y + 1 K i D + 1 K i + 1 D
= K i K i + 1 d x , y + 1 K i K i + 1 D
d T p x   , T p y = K T d x , y + 1 K T D
so that
D l i m   s u p n d T p n x   , T p n y K T n d x , y = l i m   s u p n d T p n x   , T p n y D
and then there exists l i m n d T p n x   , T p n y = D for any x , y A i × A i + 1 A i + 1 × A i and any i p ¯ .
Also, note that
d T p n + 1 x   , T p n + 1 y K i d T p n x   , T p n y + 1 K i D
d T p n + 2 x   , T p n + 2 y K i + 1 K i d T p n x   , T p n y + 1 K i + 1 K i D
d T n + 1 p 1 x   , T n + 1 p 1 y Π j = 1 p 1 K j   d T p n x   , T p n y + 1 Π j = 1 p 1 K j   D
Π j = 1 p 1 K j   K T n d T p x   , T p y + K T n 1 Π j = 1 p 1 K j   D
then,
l i m n d T p n + j x   , T p n + j y = D ;   j p ¯ ,   x , y i p ¯ A i × A i + 1 A i + 1 × A i
Property (i) has been proved.
To prove Property (ii), first note that i p ¯ A i implies and it is implied by D = 0 . Thus, (10) holds with D = 0 . This implies for any j = 0 and any x , y i p ¯ A i × A i + 1 A i + 1 × A i that d T p n + m x   , T p n + m y 0 as n ; m Z 0 + , and
d T p n + j x   , T p n + j y Π l = i k K l d T p n x   , T p n y
for j p ¯ where k = j 1 if j i + 1 and k = p + j 1 , otherwise, and then
d T p n + j x   , T p n + j y Π l = i k K l d T p n x   , T p n y
so that one has for any m Z + :
j = 0 m d T p n + j x   , T p n + j y
1 + K T + K T 2 +   + K T m 1 d T p n x   , T p n y = 1 K T m 1 K T d T p n x   , T p n y <
then, for any x , y i p ¯ A i × A i + 1 A i + 1 × A i , any x i p ¯ A i and any j p ¯ , one gets by taking limits in the above expression as n since D = 0 :
l i m n j = 0 m d T p n + j x   , T p n + j y = 0
and by taking y = T p m + 1 x ; m Z + , k p ¯ in the above expression:
l i m n j = 0 m d T p n + j x   , T p m + n + j + 1 x = 0
l i m n j = 0 m d T p n + j x   , T p m + n + j x
j = 0 m d T p n + j x   , T p m + n + j + 1 x + j = 0 m d T p m + n + j + 1 x   , T p m + n + j x
= 0 + 0 = 0
l i m n j = 0 m d T p n + j x   , T p n + k x = l i m n j = 0 m d T p n + j x   , T p n + 1 + k x
l i m n l = 1 k j = 0 m d T p n + j + l 1 x   , T p n + 1 + l x = k .0 = 0
Thus, there is no subsequence T p n k + j x k = 0 T p n + j x n = 0 with n k k Z 0 + Z + being strictly sequence such that there is some ε R + and some N = N ε Z 0 + such that T p n k + j x ε since the following will hold j = 0 m d T p n + j x   , T p n + j + 1 x , a contradiction. Therefore, T p n + j x n = 0 is a Cauchy sequence which converges to some z i p ¯ A i for any given x i p ¯ A i and any j , k p 1 ¯     0 . Since l i m n d T p n + j x   , T p n + j y = 0 , take y = T p x to conclude, after permuting the order of the “limit” and “distance” functions, because of the Lipschitz continuity of T p , that
l i m n d T p n + j x   , T p n + j T p x = l i m n d T p n + j x   , T p T p n + j x
= d l i m n T p n + j x   , l i m n T p T p n + j x = d z   ,   T p z = 0
Then, z = T p z so that z F i x T p . Also, z F i x T p = z . Assume, on the contrary, that F i x T p = z , z 1 . Then, 0 d z 1 , z = d T p z 1   ,   T p z K T d z ,   z 1 < d z ,   z 1 , a contradiction so that z 1 = z and F i x T p = z   . On the other hand, if z F i x T then 0 < d z   ,   T z = d T p z   ,   T p + 1 z K T d z   , T z < d z   ,   T z , a contradiction. Then, z F i x T and it is unique. Assume that F i x T = z   ,   z 0 then 0 d z , z 0 = d T z , T z 0 = d T p z , T p z 0 < d z , z 0 , a contradiction so that F i x T = z   .
Property (iii) follows since by taking y = T x in the previous inequality to (10), which leads to:
d T n + 1 p 1 x   , T n + 1 p x Π j = 1 p 1 K j   d T p n x   , T p n + 1 x + 1 Π j = 1 p 1 K j   D
Π j = 1 p 1 K j   K T n d T p x   , T p + 1 x + K T n 1 Π j = 1 p 1 K j   D
and then d T n + 1 p 1 x   , T n + 1 p x 0 as n if x is finite. For a fixed z i p ¯ A i lying in the same subset as x , one has
d T n + 1 p x   , z d T n + 1 p 1 x   , T n + 1 p x + d T n + 1 p 1 x   , z
If T n + 1 p x n = 0 is unbounded for some x i p ¯ A i then there is some subsequence T n k + 1 p x k = 0 with n k + 1 > n k such that d T n k + 1 + 1 p x   , z > d T n k p x   , z and then
0 < d T n k + 1 + 1 p x   ,   z d T n k p x   ,   z d T n k + 1 + 1 p x   ,   T n k p x + d T n k p x   ,   z d T n k p x   ,   z
= d T n k + 1 + 1 p x   ,   T n k p x
then, the subsequent contradiction is reached:
0 < l i m   i n f k   d T n k + 1 p + 1 x   , z l i m   k d T n k + 1 + 1 p x   , T n k p x = 0 .
Thus, T n + 1 p x n = 0 is bounded for all finite x i p ¯ A i . Property (iii) has been proved.
Property (iv) follows directly from the above properties since a p 2 -cyclic contraction is also an extended p 2 -cyclic contraction. □
Note that, as a consequence of Definition 1 of extended cyclic contractions, Theorem 1 only requires as a necessary condition for its fulfilment that K i < 1 , for some i p ¯ , provided that Π j i = 1 p K j < K i 1 if K i 0   ,   1 . Note also that trivially (1) a p 2 -cyclic contraction is also an extended p -cyclic contraction with all the contraction constants being identical and less than unity; (2) if T is an extended p -cyclic contraction, then T p is a p 2 -cyclic contraction with contractive constant K T = Π i = 1 p K i . In particular, it is seen that the constraint d T p x   , T p y = K T d x , y + 1 K T D in the previous inequality to (9) in the proof of Theorem 1 together with K T = Π i = 1 p K i < 1 ensures an extended cyclic contraction for any built subsequence of p elements on the p adjacent subsets irrespectively of the feature that some of the individual constants are not less than unity. This condition leads to (9) which is the basis to establish that, for positive integers n , sequences of n p elements built through compositions of the extended cyclic mapping T have similar properties as n as those of the sequences of n elements of a cyclic self-mapping T. This point of view is also formally reflected in several of the subsequent results.
Lemma 3. 
Assume that A i are nonempty and closed subsets of a metric space  X   ,   d with D = d A i   ,   A i + 1 0 ; i p ¯ and that T : i p ¯ A i i p ¯ A i is a p 2 -cyclic contraction self-mapping. Assume also that either A i or A i + 1 is boundedly compact; thus, if each ordered par of subsets in the set  A 1 , A 2   , A 3 , A 4   , , A p 1 , A p has either its first element or its second element boundedly compact if  p is even and, if  p is odd, then the same rule applies to the set of pairs  A 1 , A 2   , A 3 , A 4   , , A p 2 , A p 1 and A p is boundedly compact if  A p 1 is not boundedly compact. Then, there is some finite  x i A i such that d x i ,   T x i = D for each  i p ¯ .
The above property also holds if  T : i p ¯ A i i p ¯ A i is an extended  p 2 -cyclic contraction self-mapping.
Proof. 
Since D = d A i   ,   A i + 1 0 , then D = i n f d x   ,   y   :   x A i   ,   y A i + 1 for any i p ¯ and A i 0 A i = x A i   : d x   ,   A i + 1 = D ; i p ¯ so that d A i   , A i + 1 = d A i 0   ,   A i + 1 , 0 ; i p ¯ . If D = 0 then i p ¯ A i and T : i p ¯ A i i p ¯ A i is a (strict) contraction so that any sequence T n x n = 0 z = T z i p A i , that is, z = T z is the unique fixed point of T : i p ¯ A i i p ¯ A i which belongs to any A i for i p ¯ . Since d z   ,   T z = D = 0 , the result follows. Now, consider the case D > 0 for which the subsets of the cyclic disposal do not intersect. Take any x A i for any arbitrary i p ¯ so that T n p + 1 x n = 0 A i + 1 and T n p x n = 0 A i . By the hypothesis that T : i p ¯ A i i p ¯ A i is a p 2 -cyclic contraction self-mapping, it follows that d T n p x   ,   T n p + 1 x D for any x i p ¯ A i as n (see Remark 2), so that for any given arbitrary constant ε R + such that d T n k p x   ,   A i 0 ε / 3 , for a subsequence T n k p k = 0 T n p x n = 0 for any k N 1 Z 0 + , some strictly increasing n k k = 0 Z 0 + and some N 1 = N 1 ε Z 0 + . In the same way, d T n k p + 1 x   ,   A i + 1 , 0 ε / 3 for a subsequence T n k p + 1 k = 0 T n p + 1 x n = 0 , for all k N 2 Z 0 + and some N 2 = N 2 ε Z 0 + . Since either A i or A i + 1 is boundedly compact, the best proximity sets A i 0 A i and A i + 1 , 0 A i + 1 are nonempty. Now, assume that for any z i A i , there exists a real number D i > D such that d z i   ,   T z i = D i so that
D < D i = d z i   ,   T z i d z i   ,   T n k p x + d T n k p x   ,   T n k p + 1 x + d T n k p + 1 x   ,   T z i .
Since d T n p x   ,   T n p + 1 x D as n , then the subsequence of distances d T n k p x   ,   T n k p + 1 x k = 0     d T n p x   ,   T n p + 1 x n = 0 D as k . Then, there is N 3 = N 3 ε such that d T n k p x   ,   T n k p + 1 x D + ε / 3 for any k N 3 Z 0 + . Thus, if N = m a x N 1   ,   N 2   ,   N 3 then, one has D < D i d z i   ,   T z i D + ε , which implies that ε D i D . Since ε is arbitrary, it suffices to take ε 0   ,   D i D to get a contradiction to i n f d z i   ,   T z i   :   z i A i = D i > D for any i p ¯ and then there is x i A i 0 A i such that d x i ,   T x i = D ; i p ¯ . The first part of the result has been proved. Now, if T : i p ¯ A i i p ¯ A i is an extended p 2 -cyclic contraction, then for any integer n p , there exists m Z 0 + such that n = m p + j for some integer j = j n p 1 ¯     0 and m as n for any j p 1 ¯     0 . Then, from the property d T n p x   ,   T n p + 1 x D as n for a p 2 -cyclic contraction and these considerations, it follows that d T m p + j x   ,   T m p + j + 1 x D as m ; j p 1 ¯     0 and any given x i p ¯ A i since:
D d T m p x   ,   T m p + 1 x K T d T m 1 p x   ,   T m 1 p + 1 x + 1 K T D D as m
D d T m p + 1 x   ,   T m p + 2 x K i + 1 d T m p x   ,   T m p + 1 x + 1 K i + 1 D D as m
D d T m p + i x   ,   T m p + i + 1 x K i d T m p x   ,   T m p + 1 x + 1 K i D D as m
and the result follows in the same way as for the case of p 2 -cyclic contractions. The result also holds if T : i p ¯ A i i p ¯ A i is an extended p 2 -cyclic contraction self-mapping by virtue of (10). □
It can be pointed out that the hypothesis of boundedly compactness of the alternate subsets in the cyclical disposal in Lemma 3 is invoked since, although the distances are finite, meaning D = i n f x A i ,   y A i + 1 d x , y < + , it can happen that the set distance can correspond to points at infinity subject to finite mutual distances since the closed subsets are not assumed to be bounded.
The following result relies on the feature that if all the subsets of the cyclic disposal are nonempty and closed, it is only needed for one of the best-proximity points to be a singleton in order to achieve to convergence of the self-mapping T : i p ¯ A i i p ¯ A i to best-proximity points even if the respective best proximity sets (the mentioned one excepted) are not singletons.
Lemma 4. 
The following properties hold:
(i)  Let  X ,   d  be a metric space and let  A i X for  i p ¯ be a set of  p  nonempty closed subsets of  X  such that  D = d A i   , A i + 1 > 0 . Assume that  T : i p ¯ A i i p ¯ A i is a p 2 -cyclic contraction and assume also that, for some  j p ¯ , A j  is boundedly compact and that  A j 0 = z j  is a singleton. Then, the set  z 1 , z 2 , , , z p  of respective fixed points of  T p  from  A i  to  A i + 1  is unique. This set is also the limit set of proximity points of  T  from each subset to its adjacent one to which all the sequences generated by the cyclic contractive self-mapping converge within each subset.
(ii)  Property (i) holds if  T : i p ¯ A i i p ¯ A i  is an extended  p 2 -cyclic contraction self-mapping.
Proof. 
Since T : i p ¯ A i i p ¯ A i is a p 2 -cyclic contraction, then d T p n x   ,   T p n y D as n for all pair x , y i p ¯ A i × A i + 1 A i + 1 × A i . Since all the subsets A i for i p ¯ are nonempty and closed and D = i n f d x , y   : x A i   ,   y A i + 1 > 0 for any i p ¯ , then all the subsets A i have nonempty subsets of best-proximity points A i 0 A i ; i p ¯ . According to the hypothesis, it exists a subset A j X , for some j p ¯ such that A j 0 = z j is a singleton. Also, T : i p ¯ A i i p ¯ A i is trivially nonexpansive and Lipschitz-continuous with unity Lipschitz constant since the constraint d x , y D ; x , y i p ¯ A i × A i + 1 A i + 1 × A i leads to:
d T x   ,   T y K d x , y + 1 K D = K + 1 K D d x   , y d x , y
K + 1 K D D d x , y = d x , y .
The continuity allows for the exchange of the orders of limit and distance functions so that l i m n d T p n x   ,   T p n y = l i m n d l i m n T p n x   ,   T p n y = d l i m n T p n x   ,   l i m n T p n y = D
Take x A j , y = T x A j + 1 ; then, one has this result since A j 0 = z j ,
l i m n d T p n x   ,   T p n + 1 x = d l i m n T p n x   ,   l i m n T p n T x
= d l i m n T p n x   ,   T l i m n T p n x
= d z j   , T z j = D
which follows from the analysis of the three subsequent possible cases for x A j :
Case a: T p n x n = 0 z j = T p z j . Since T is Lipschiz, since it is nonexpansive, it follows that l i m n d T p n x   ,   T p n + 1 x = d z j   ,   T l i m n T p n x = d z j   ,   T z j = D .
Case b:   T p n x n = 0 z j ´ z j A j and since A j 0 = z j then d z j ´   ,   T z j ´   > D for all z j ´ z j . Then, D = l i m n d T p n x   ,   T p n + 1 x = d z j ´   ,   T z j ´   > D is a contradiction and Case b is impossible.
Case c:   T p n x n = 0 does not converge in A j . Since the set A j is boundedly compact, a subsequence T p n k k = 0 T p n n = 0 A j is convergent in the closed set A j to some z ¯ j z j A j for some strictly increasing sequence of nonnegative integers n k k = 0 . Then, the following contradiction follows:
D < l i m k d z ¯ j   ,   T T p n k x = d z ¯ j   ,   T z ¯ j = l i m k d T p n k z ¯ j   ,   T T p n k x
= l i m k d T p n k z ¯ j   ,   T p n k T x 1 l i m k K T n D + l i m k K T n d z ¯ j ,   T x = D .
Thus, Case c is also impossible. As a result,   T p n x n = 0 z j for any x A j . Now, consider, for any x A j , the sequence T p n + k x n = 0 A j + k if 0 k p j and T p n + k x n = 0 A j + k p if p j < k 2 p j . Then, one has for k p 1 ¯ since   T p n x n = 0 z j ,
D = l i m n d T k T p n x   ,   T k + 1 T p n x = d T k l i m n T p n x   ,   T k + 1 l i m n T p n x
= d T k z j   ,   T k + 1 z j = d z j + k m o d   p   ,   z j + k + 1 m o d   p
where z j + k m o d   p = T n p + k z j for any n Z 0 + is a fixed point of T p in A j + k m o d   p
For sequences generated from initial points x , y in adjacent subsets, one has that:
l i m n d T p n x   ,   T p n y = l i m n d l i m n T p n x   ,   T p n y
= l i m n d z j   ,   T p n y = d z j   ,   l i m n T p n y
= D
so that T z j A j + 1 , 0 and l i m n T p n y exists while it is in A j + 1 , 0 . But, since A j 0 = z j , then   T p + 1 l i m n T p n y = l i m n T p n + 1 + 1 y A j 0 = z j and T p + 2 l i m n T p n y = T z j A j + 1 , 0 . Also, one has that
d T p l i m n T p n x   ,   T p + 1 l i m n T p n x = d T p z j , T p + 1 z j = D = d z j ,   T z j
and one concludes for both the sequences initialized in x and T x in x i p ¯ A i and the sequences initialized in x , y i p ¯ A i × A i + 1 A i + 1 × A i that the unique finite best-proximity point z j of A j is the unique fixed point of T p : A j A j + 1 and T z j is a fixed point of T p : A j + 1 A j + 2 which is unique, since T : i p ¯ A i i p ¯ A i is single-valued, and finite since z j is finite and T is continuous. Thus, the image of T z j is a singleton and it is possible to obtain similar conclusions for T i z j for i p 1 ¯   0 . That is, although the only guaranteed singleton set of best-proximity points is A j 0 , the set z 1 , z 2 , , , z p of fixed points of T p is unique, which is also the limit set of proximity points of T to which all the sequences generated by the contractive self-mapping converge at each one of the subsets of the cyclic disposal. Property (i) has been proved.
Property (ii) follows directly from Property (i) since a p 2 -cyclic contraction is also an extended p 2 -cyclic contraction. □
Theorem 2. 
Let X , be a uniformly convex Banach space, let  A i X ; i p ¯ p 2 be nonempty closed strictly convex subsets of  X with d A i , A i + 1 = D > 0 ; i p ¯ , where d : X × X R 0 + is the norm-induced metric defined by  d x , y = x y ; x , y X . Let T : i p ¯ A i i p ¯ A i be a p 2 -cyclic contraction with contractive constant  K 0   ,   1 and take x A l for some arbitrary l p ¯ . Then, the following properties hold:
(i)  T n + 1 p + j + k l x n = 0 A j + k m o d   p ;  T n + m + 1 p + j + k l x n = 0 A j + k m o d   p ;  k p ¯  are Cauchy sequences, and
d T n + m + 1 p + j + k l x   ,   T n + 1 p + j + k l x 0   a s   n ;
d T n + m + 1 p + j + k + 1 l x   ,   T n + 1 p + k + j + 1 l x 0   a s   n ;
d T n + m + 1 p + j + k + 1 l x   ,   T n + 1 p + j + k l x D   a s   n ;
d T n + m + 1 p + j + k l x   ,   T n + 1 p + j + k + 1 l x D   a s   n ,
for any m Z 0 +  and any k p 1 ¯   0 .
(ii) T n + 1 p + j + k l x n = 0 z j + k m o d   p A j + k m o d   p  and  z i A i  are unique best-proximity points in each  A i , that is,  d z i   ,   T z i = d A i   ,   A i + 1 = D ;  i p ¯ .
(iii)  Propositions [(i)–(ii)] also hold if  T : i p ¯ A i i p ¯ A i  is an extended  p 2 -cyclic contraction.
Proof. 
Note that T j l x A j if 1 l j and T j + p l x A j if j < l p . Then, in both cases, T j + p l x A j . Property (i) follows from [1,2], (see Lemmas 3.7 and 3.8 in [1]), and Remark 2, for the norm-induced metric d : X × X R 0 + , d x , y = x y ; x , y X . The fist part of Property (ii) is also direct from ([1], Lemmas 3.7 and 3.8). The convergence of the Cauchy sequences of Property (i) to unique best-proximity points in each subset of the cyclic disposal follows from ([1], Theorem 3.10). Property (iii) follows from Properties (i)–(ii) and Lemma 5(i). □
It is noticed that the part of Theorem 2(i) concerned with the convergence of distances to D for sequences in adjacent subsets holds in any metric space X , d without invoking the uniform convexity of X and the involved sequences are bounded, see Equation (4). Also, the convexity of the sets of the cyclical disposal is invoked in the above theorem for the uniqueness of all the best-proximity points at each subset A i . However, under the convexity of two adjacent subsets A j and A j + 1 , which guarantees the uniqueness of the corresponding best proximity in A j point to its adjacent subset A j + 1 (see [1], Theorem 3.10 for p = 2 ), it is guaranteed the convergence of the distances generated from any initial x i p ¯ A i as well as the convergence of sequences to one of the best-proximity points in the cyclic disposal through the cyclic contractive self-mapping T on i p ¯ A i . This fact is addressed in the subsequent result valid for p 2 :
Corollary 1. 
In Theorem 2, assume that two adjacent subsets  A j and A j + 1 are strictly convex for some  j p ¯ . Then, Property (i) of Theorem 2 holds. Furthermore,
(a) 
There are unique best-proximity points  z j  to  A j + 1  in the strictly convex set  A j  and  z j + 1 = T z j  in  A j + 1  to  A j , that is,  A j 0 = z j  and  A j + 1 , 0 = z j + 1  such that  d z j   ,   T z j = d A j   ,   A j + 1 = D .
(b) 
The best proximity sets  A i 0  for  i p ¯  are nonempty and there exist  z i A i 0 ; i j p ¯   ( A i 0  for  i j , j + 1  are not non-necessarily singletons) such that  d z i   , T z i = D ; i j p ¯ . The set  z 1   ,   z 2   , , z p  is also the unique set of fixed points of   T p  at each of the subsets  A i  for  i p ¯ . The above properties also hold if   T : i p ¯ A i i p ¯ A i  is an extended  p 2 -cyclic contraction.
Sketch of Proof. 
If D = 0 then the mapping T is a strict contraction and z = z j i p ¯ A i is the unique fixed point of T and the set z 1   ,   z 2   , , z p consists of the fixed point z and the proof is immediate. Proceed now with the case D > 0 . Since A j and are strictly convex ([1], Theorem 3.10) then d z j   ,   T z j = d T p z j   ,   T T p z j = d A j   ,   A j + 1 = D for a unique finite best-proximity point z j = T p z j as in the corresponding property of Theorem 2 so that A j 0 = z j is a singleton. Similarly, A j + 1 , 0 is also a singleton. Since A i are all closed for i p ¯ , all the sets of best-proximity points A i 0 are nonempty for any i p ¯ and since T is non-expansive, then Lipschitz continuous, T i z j are finite for i p 1 ¯     0 . Take any x i p ¯ A i which is necessary in some unique A l for some l p ¯ since D > 0 so that T j l x A j if l j p and T p + j l x A j if j < l . Then, from Theorem 2, one has for the given j p ¯ that T n + 1 p + j l x n = 0 z j A j and A j 0 = z j is a singleton. Furthermore, from Property (i) of Theorem 2 and Lemma 4, one has the following convergence properties of distances at each subset of the cyclical disposal: T n + 1 p + j + k l x n = 0 A j + k m o d   p ; d T n + 1 p + j + k l x   ,   T n + 1 p + j + k + 1 l x D as n ; k p 1 ¯   0 and, since z j exists and it is the unique point in A j such that d z j   ,   T z j = d A j   ,   A j + 1 = D .
Then, since z j is unique and the above properties of convergence of distances of sequences irrespective of the initial conditions, it follows that d z i   ,   z i + 1 = d T n p + i j z j   ,   T n p + i + 1 j = d A i   ,   A i + 1 = D for n Z 0 + . Thus, z i A i 0 are the unique best-proximity points in each A i which are reachable through the mapping T , that is, those fulfilling d z i   ,   T z i = d A i   ,   A i + 1 = D ; i p ¯ (irrespective of A i 0 being singletons or not if i j . □
The next auxiliary result concerned with the uniqueness of the best-proximity point of a strictly convex subset to its adjacent one is later used. The result relies only on the (strict) convexity of the subset A j of the uniformly convex Banach space X   ,   and it is not related to the cyclic contractive self-mapping.
Proposition 1. 
Assume that for some j p ¯ , the nonempty and closed adjacent subsets  A j and A j + 1 of the uniformly convex Banach space  X   ,   satisfy, furthermore, that A j is strictly convex. Then, the best proximity set to  A j + 1 in A j is a singleton A j 0 = z j .
Proof. 
Define x A j λ = λ x + 1 λ y for any given x , y A j and λ 0   ,   1 . Since A j is a nonempty, strictly convex and closed, the function x A j λ for λ 0   ,   1 defines a segment x   ,   y of points in A j of given extreme points x and y , such that x ,   y i n t     A j since A j is strictly convex. Note that D = d A j   , A j + 1 = i n f x j A j   , x j + 1 A j + 1 d x j   , y j = i n f x j A j   , x j + 1 A j + 1 x j y j and that the distance of the segment x   ,   y A j , being itself a subset of the uniformly convex Banach space X   ,   , to A j + 1 is d   x   ,   y   ,   A j + 1 = i n f λ   0   ,   1   ,   x j + 1 A j + 1 λ   x   + 1 λ   y     x j + 1 D . Since the absolute value of the derivative of a norm of a differentiable function with respect to an argument is less than or equal to the norm of the derivative, one has that:
m i n λ   0   ,   1 i n f λ   0   ,   1   ,   x j + 1 A j + 1 λ   x   + 1 λ   y     x j + 1 2
satisfies the set of inequalities:
i n f x j + 1 A j + 1 d d λ λ   x   + 1 λ   y     x j + 1 2 λ 0   ,   1
2 i n f λ   0   ,   1   ,   x j + 1 A j + 1 λ   x   + 1 λ   y     x j + 1   m a x λ   0   ,   1 ,   x j + 1 A j + 1   d d λ   λ   x   y   + y   x j + 1
2 i n f λ   0   ,   1   ,   x j + 1 A j + 1 λ   x   + 1 λ   y     x j + 1   m a x λ   0   ,   1   , x j + 1 A j + 1     d d λ λ   x   y   + y   x j + 1
2 i n f λ   0   ,   1   ,   x j + 1 A j + 1 λ   x   + 1 λ   y     x j + 1 m a x x j + 1 A j + 1     x x j + 1
2 i n f λ   0   ,   1   ,   x j + 1 A j + 1 λ   x   + 1 λ   y     x j + 1   x y
which is zero if x = y which gives the minimum of the distance function from x   ,   y to A j + 1 . That, is the minimum distance to A j + 1 from any segment x   ,   y of the nonempty, bounded and strictly convex set A j occurs when the segment is a point x = y = z j . Now, assume that there is z j ´ z j A j such that d z j ´   ,   A j + 1 = d z j   ,   A j + 1 = D and the best proximity set to A j + 1 in A j is a singleton A j 0 = z j . Take the segment z j   ,   z j ´   A j , with z j   ,   z j ´   i n t   A j , the above previous discussion concludes that d   z j   ,   z j   ´ ,   A j + 1 = d A j   ,   A j + 1 = D occurs if and only if z j = z j ´ . Thus, the best proximity set of A j + 1 in A j is a singleton A j 0 = z j . □
Corollary 1 is now re-addressed under Proposition 1, by invoking the strict convexity of just one of the adjacent subsets so that the best proximity set in such a subset to its adjacent one is a singleton A j 0 = z j . Then, Theorem 1(i) holds, the relevant sequences generated through T p in A j from any initial condition in i p ¯ A i are Cauchy and converge to z j . Then, their successive images in A j + l are (non-necessarily unique) best-proximity points z j + l = T l z j in A j + l .
Corollary 2. 
In Theorem 2, assume that A j is strictly convex for some  j p ¯ . Then, Property (i) of Theorem 2 holds and there is a unique best-proximity point  z j to A j + 1 in A j to A j , that is, A j 0 = z j such that d z j   ,   T z j = d A j   ,   A j + 1 = D . Furthermore, the best proximity sets  A i 0 for i p ¯ are nonempty and there exist  z i A i 0 ; i j p ¯ ( A i 0 for i j , j + 1 are not non-necessarily singletons) such that  d z i   , T z i = D ; i j p ¯ . The set z 1   ,   z 2   , , z p is also the unique set of fixed points of   T p at each of the subsets  A i for i p ¯ . These properties also hold if   T : i p ¯ A i i p ¯ A i is an extended  p 2 -cyclic contraction.
Sketch of Proof. 
It follows directly from Corollary 1 and Proposition 1 by using the fact that the p 2 contractive self-mapping is single-valued. Then, A j 0 = z j (Proposition 1), z j + 1 = T z j A j + 1 ,   0 and z i + 1 = T z i for i p with z p + 1 = z p from Corollary 1. □
Corollary 2 is reformulated below leading to achieved similar properties while, instead of assuming that that the space is a uniformly Banach space, this suffices to assume that X ,   d is a metric space, that one of the subsets is boundedly compact, instead of convex, and that its best-proximity point is a singleton. The proof is directly supported by Lemmas 3 and 4, Theorem 2 and Corollary 1.
Corollary 3. 
Assume that A i are nonempty and closed subsets of a metric space  X ,   d with D = d A i   ,   A i + 1 0 ; i p ¯ and that T : i p ¯ A i i p ¯ A i is a p 2 -cyclic contraction self-mapping. Assume also that the subset  A j is boundedly compact for some  j p ¯ and that A j 0 = z j (so that d z j   ,   T z j = d A j   ,   A j + 1 = D and d ω ,   T ω > D ; ω z j A j ). Then, all the best proximity sets  A i 0 for i p ¯ are nonempty and there exist  z i A i 0 ; i j p ¯ ( A i 0 for i j are not non-necessarily singletons) such that  d z i   , z i + 1 = d z i   , T z i = D ; i j p ¯ . The set z 1   ,   z 2   , , z p consists of the unique set of fixed points  z i of T p at each one of the subsets  A i for i p ¯ . The above properties also hold if   T : i p ¯ A i i p ¯ A i is an extended  p 2 -cyclic contraction.
Proof. 
For the case D = 0 , see the sketch of proof of Corollary 1. Consider the case D > 0 . From (4), note that d T n p + 1 x   ,   T n p x D as n ; x i p ¯ A i , that is, for any x in any arbitrary subset A l ; l p ¯ . Also, T n x n = 0 A l is bounded from Theorem 1(iii); for any given x A l and any l p ¯ . For each given l p ¯ such that x A l , it always exists s = s l p ¯ such that T n + s x n = 0 A j and such a sequence is bounded. Since A j is boundedly compact, there exists some subsequence T n k + s x n = 0 A j , for a strictly increasing sequence n k k = 1 Z + , which is convergent T n k + s x n = 0 y = y x A j . Now, proceed by contradiction by assuming that all convergence points for any convergent subsequence of any sequence of the form T n k + s x n = 0 A j for any given x i p ¯ A i are not z j , the unique best-proximity point to A j + 1 in A j . Then, the sequence of distances d T n p + 1 x   ,   T n p x n = 0 would not converge to D , a contradiction. Therefore, d z j   ,   T z j = D . Note that T p z j A j . If T p z j A j 0 then d T p z j   ,   T p + 1 z j > D so that T p z j A j 0 = z j . As a result, z j is the unique fixed point of the composed self-mapping T p in A j . Since d T n p + s x   ,   T n p + s + 1 x n = 0 D for any x i p ¯ A i and any s p 1 ¯ 0 , one gets in a similar way that d T s z j   ,   T s + 1 z j = d z j , T z j = D for s p 1 ¯ 0 . Then, and since T is single-valued, the above set z 1   ,   z 2 , , z p , subject to the property z i + 1 = T z i = T 2 z i 1 = T i z 1 for i p 1 ¯   0 , consists of the unique set of fixed points z i of T p at each of the subsets A i for i p ¯ which are also the best-proximity points reachable through p 2 cyclic contractions on i p ¯ A i . Thus, they fulfil z i A i 0 (but the A i 0 are not necessarily singletons for i j p ¯ .
The above properties also hold if T : i p ¯ A i i p ¯ A i is an extended p 2 -cyclic contraction. □
It is possible to comment the following observations concerned with the feasibility of the best proximity set to be a singleton (see Lemma 4, Theorem 2, Corollary 1 and Corollary 3). The assumption that the distance from any point of the space to one of its nonempty closed subsets is reached at a unique point holds if the metric space is a uniformly convex Banach space and the considered subset is strictly convex, its set of best-proximity points to its adjacent subset A j + 1 is a singleton if such and adjacent subset is also strictly convex. Both proximity sets are singletons which fix the distance between such adjacent subsets while they are the unique points which set such a distance. However, in some cases, the convexity of the considered set may be overcome. For instance, assume that the focused on subset is imperfect, but still closed, that is, it has at least one isolated point which is obviously an adherent point z j A j to the subset A j which is not either, also obviously, an accumulation point. If z j is located in the Banach space such that d z j ,   A j + 1 < d A j \ z j ,   A j + 1 then D = d A j   ,   A j + 1 = d z   ,   A j + 1 and then A j 0 = z j while, obviously, A j is not convex.
The subsequent result is a slight extension of parallel results in [1] when the cyclic contraction involves more than two sunsets of a uniformly convex Banach space.
Lemma 5. 
Let X   , . be a uniformly convex Banach space with nonempty sets  A i for i p ¯ with norm-induced metric d X , X R 0 + defined by d x , y = x y and then satisfying d A i ,   A i + 1 = i n f x A i   ,   y A i + 1 x y = D ; i p ¯ . Then, the following properties hold:
(i)Assume that, for any given  j p ¯ ,  A j  is closed and convex and  A j + 1  is closed. Let  x n j n = 1 and  z n j n = 1  be sequences in  A j  and  y n j n = 1  be a sequence in  A j + 1  satisfying  d x n j , y n j D ;  d z n j , y n j D  as  n . Then,  d x n j , z n j 0  as  n .
(ii)  Assume that  T : i p ¯ A i i p ¯ A i  is an extended  p 2 -cyclic contraction and that, for any given  x A i ,  z A k  and  y A l  for some arbitrary  i , k , l p ¯ , if d T j i + p n x   ,   T j + 1 l + p n + q y D ;  d T j k + p n + m z   ,   T j + 1 l + p n + q y D  as  n for any  m ,     q Z 0 + then
d T j i + p n x   ,   T j k + p n + m z 0   a s   n
for any m Z 0 + .
Proof. 
If x n p n = 0 A j , z n p n = 0 A j y n p n = 0 A j + 1 , the proof of Property (i) follows directly from ([1], Lemma 2.5). The proof of Property (ii) follows from Property (i) as follows. Since x A i then T j i x A j if p j i and T p + j i x A j if 1 j < i . Thus, T j i + p n x n = 1 A j .
Under close reasoning, one concludes that T j k + p n + m x n = 1 A j and T j + 1 l + p n + q x n = 1 A j + 1 .
Then, Property (ii) follows directly from Property (i) since T j i + p n x ,     T j k + p n z A j and T j + 1 l + p n y A j + 1 ; n Z 0 + . □
The next result relies on the fact that the basic results of Lemma 5 hold if just one of the subsets of the cyclic disposal is closed and boundedly compact but not necessarily convex.
Lemma 6. 
Let X   , .  be a uniformly convex Banach space with nonempty sets  A i  for i p ¯ with norm- induced metric d X , X R 0 + defined by d x , y = x y and then satisfying d A i ,   A i + 1 = i n f x A i   ,   y A i + 1 x y = D i p ¯ . Assume that A j  is boundedly compact and that  A j 0 = z j  for some j p ¯ . Then, Property (ii) of Lemma 5 holds,  z j = T p z j  and, furthermore,  z i + 1 = T z i A i + 1 , 0  (which are not necessarily singletons for  i j ) for all  i p 1 ¯   0 .
The result remains valid if T : i p ¯ A i i p ¯ A i is an extended p 2 -cyclic contraction.
Proof. 
First, note that the convergence of distances of sequences allocated in adjacent subsets to D is direct as a result of the first part of Lemma 5 (ii), proved in [1], which does not require the convexity of the subsets.
One proceeds now to prove the convergence to zero of distances of sequences in the same subset whose composition wit their images in adjacent subsets converge to D . First, note that, since A j is boundedly compact since T : i p ¯ A i i p ¯ A i is bounded, A j = z j and there are subsequences T p n k x k = 0 T p n x n = 0 A j and T p m k z k = 0 T p n z n = 0 A j for some strictly increasing subsequences n k k = 0 Z 0 + and m k k = 0 Z 0 + which are convergent in A j to some ω x A j and, respectively, ω z A j . Then, one has from Property (ii), since T : i p ¯ A i i p ¯ A i is non-expansive, then Lipschitz-continuous, that
l i m k d T p n k x   ,   T p m k z = l i m k d ω x , T p m k z   = d ω x , ω z = 0
and
l i m k d T p n k x   ,   T p m k z = l i m k d ω x , T p m k z   = d ω x , ω z = 0
and for z j , being the unique best proximity to A j + 1 in A j , that is, A j 0 = z j , note that T p n k z j k = 0 z ¯ j (at this stage is not still proved that z ¯ j = z j ) since A j is boundedly compact and T p n k z j k = 0 is a convergent subsequence of a bounded sequence, and one has that
l i m   s u p   k d T p n k + 1 ω x , T p n k z ¯ j K T n k d ω x   ,   z ¯ j 1 K T n k D
= l i m   k d T p n k + 1 ω x , z ¯ j D = d l i m k T p n k T ω x , z ¯ j D 0
since K T n k 0 as k   T : i p ¯ A i i p ¯ A i is single-valued then d T ω x   , z ¯ j = D . If ω x z j then ω x A j 0 = z j while T ω x   ,   T z j A j + 1 ,   0 with d T ω x   , z ¯ j = d T z j , z j = D , a contradiction then ω x = z j = z ¯ j , that is, the limit of the convergent subsequence is the next proximity point. Proceeding in a similar way, one concludes that ω z = z j . Thus,
l i m k d T p n k x   ,   T p m k z = l i m k d z j , T p m k z j   = d z j , z j = 0 .
And the above subsequences in A j fulfil the claimed property. Now, note that n k as n , k with n n k ; then,
l i m   s u p   n d T p n x   ,   T p n z j l i m n   , k d T p n x   ,   T p n k x + d T p n k x   ,   T p n z j
= l i m n   , k d T p n x   ,   T p n k x + l i m k d T p n k x   ,   z j = l i m n   , k d T p n x   ,   T p n k x + d l i m k T p n k x   ,   z j
= l i m n   , k d T p n x   ,   T p n k x + d z j   ,   z j
= 0 + 0 = 0
so that l i m n d T p n x   ,   T p n z j = 0 . In the same way, one proves that l i m n d T p n z   ,   T p n z j = 0 and combining this property with the above one and using the triangle inequality for distances yields:
l i m n d T p n x   ,   T p n z l i m n d T p n x   ,   T p n z j + l i m n d T p n z   ,   T p n z j = 0 + 0 = 0 .
Furthermore, z j = T p z j , that is, the best-proximity point of A j + 1 in A j is the fixed point in A j of the composed self-mapping T p . Otherwise, one would get the following contradiction 0 < d z j   ,   T p z j = l i m n d T p n z j   ,   T p n + 1 z j = 0 using the asymptotic regularity, the non-expansivity, and the consequent continuity of the self-mappings T on i p ¯ A i and T p on A j . Thus, Property (iii) is proved if x , z A j and A j 0 = z j . Now, since T : i p ¯ A i i p ¯ A i is single-valued, one has that
l i m k d T p n k + 1 x   ,   T p m k + 1 z = l i m k d T z j , T T p m k z   = d T z j , T z j = d z j + 1   ,   z j + 1 = 0
for any x , z A j with z j + 1 = T z j A j + 1 , 0 and, one has, in a similar way, that for any i p 1 ¯ 0 ,
l i m k d T i + p n k x   ,   T i + p m k z = l i m k d T i z j , T i T p m k z = d T i z j , T i z j = d z j + i   ,   z j + i = 0
if 0 i p and i i p if i > p . □

3. Main Results on Combined Iterative Procedures Involving Mixed Compositions of the Self-Mappings T and S

This section considers the combined application of the self-mappings T and S in any order of composition and with any number of consecutive compositions of any of them before potential switching to the other one. Some of the main obtained results are supported by those given in the former section.
The composed iterations are built by defining recursively the sequence of composed mappings F k : i p ¯ A i i p ¯ A i for any k Z 0 + as follows:
F 0 x = F 0 ,   0 x F 0 y = F 0 ,   0 y = T x = S x = I x = x ,   where   I   is   the   identity   mapping   on   X ;
F k x F k , 0 x = F k , k 1 F k 1 , 0 x = T x S x F k 1 x = T x S x F k 1   ,   0   x
for   any x A i ,   any   i p ¯ ;   k Z +
The above notation reflects that T and S can be applied in any order and under any amount of consecutive applications of any of them along the construction process of the iterations F k ; k Z 0 + .
Consider a k -th iteration F k such that:
k = t k + s k ;   t k = n k p + l k   ;       s k = s k a + s k b
where all the above amounts are non-negative integers, and
n k Z 0 + is the number of iterations happened for T p at the k -th iteration, that is, the number of total complete tours of T on the whole cyclic disposal;
n k p + l k is the number of iterations occurred for T at the k -th iteration F k with 0 l k = t k n k p < p so that l k iterations of T have not completed a whole tour around the complete cyclic disposal;
s k is the number of iterations happened for S up until and included the k -th iteration F k , with s k a being the number of iterations of S fulfilling either the first condition of (2) or (3) up until the k -th iteration F k while s k b being that fulfilling the second condition of (2) up until the k -th iteration F k .
Remark 3. 
It is found that d F k x   ,   F k y denotes that the self-mappings  F j F j , 0 = T x S x F j 1 = T x S x F j 1   ,   0 for all j k ¯ are identical for x and y . If there is, for instance a different mapping  S for the sequence initialized at  x and T for that initialized at  y at the k -th iteration while the preceding ones are generated with the same previous iterative sequence of self-mappings, this is reflected with the notation  d S F k x   ,   T F k y .
Remark 4. 
Note from (20) that k = n k p + l k + s k a + s k b . Thus, if k = 1 , then n k = 0  and l k + s k a + s k b = 1  so that two of the amounts in this sum are null. Note also that if k , then m a x n k , s k ; then, if l i m   s u p   k n k < , l i m k s k = but it can happen that  l i m   s u p   k s k a < and l i m k s k b = . In this last case, the number of contractive iterations of  S : i p ¯ A i i p ¯ A i is finite as  k .
Remark 5. 
Since S : A j A j ; j p ¯ , then if x A i and y A i + 1 then  F k x A i + l k and F k y A i + 1 + l k so that, if p l k > i p , then A i + l k = A i + l k p . In view of (2) and (19), (20), one has:
d F k x   ,   F k y K T n k p + l k d x , y + 1 K T n k p + l k D K S s k a i f s k a s ¯ k a = D o t h e r w i s e ; k Z +
for x , y A i × A i + 1 A i + 1 × A i  , where
s ¯ k a =   l n   K S 1 l n     K T n k p + l k d x , y + 1 K T n k p + l k D l n   D
=   l n   K S 1 l n   K T n k p + l k d x , y D D + 1   ; k Z +
Note from (22) that s ¯ k a 0  as k .
The following result is given without explicit proofs since it is a direct consequence of the definitions of T and S and (19)–(20):
Lemma 7. 
Assume that A i X  for i p ¯ are non-empty closed subsets of a metric space  X , d with S A i A i , and T , S : i p ¯ A i i p ¯ A i  with T A i A i + 1  is a  p 2 -cyclic self-mapping on i p ¯ A i  such that D = d A i   , A i + 1 = i n f   d x , y   :   x A i   ,   y A i + 1 ; i p ¯ . Assume also that x A i for some i p ¯ .
Then, the following properties hold for all  k Z 0 + :
(1) 
F k x A j  for some j = j k p ¯ .
(2) 
S m T n p F k x A j  and T n p S m F k x A j  for the same j p ¯  of Property 1 for any arbitrary  n ,   m Z 0 + .
(3) 
S θ T l p S m T n p F k x A j  and T n p S m T l p S θ F k x A j  for the same j p ¯  of Property 1 for any arbitrary  n ,   m ,   l   ,   θ Z 0 + .
(4) 
S θ T l p + ω S m T n p + δ F k x A j + ω + δ m o d     p  and T n p + δ S m T l p + ω S θ F k x A j + ω + δ m o d     p  for the same j p ¯  of Property 1 for any arbitrary  n ,   m ,   l   ,   θ Z 0 +  and any δ   ,   ω p 1 ¯   0  , where j + ω + δ m o d     p = j + ω + δ  if ω + δ p j  ; j + ω + δ m o d     p = j + ω p  if p j < ω + δ 2 p j  ; and j + ω + δ m o d     p = j + ω 2 p  if 2 p j < ω + δ 3 p j .
(5) 
F k + σ k x = F k + σ k , k F k x A j + ω + δ m o d     p
where  σ k = θ k + m k + l k + n k p + ω k + δ k and n k ,   m k ,   l k   ,   θ k Z 0 + and any δ k   ,   ω k p 1 ¯   0 .
Remark 6. 
Note from Lemma 7 that:
-
Property 1 is a particular version of Property 2 if  n = m = 0 .
-
Property 2 is a particular version of Property 3 if  θ = l = 0 .
-
Property 3 is a particular version of Property 4 if  ω = δ = 0 .
-
Property 5 trivially generalizes Property 4.
The following result establishes that, if either x k = F k x 0 , y k = F k y 0 A i or x k , y k A i × A i + 1 A i + 1 × A i for any i p ¯ , with either F k + 1 , k x k = T x k or F k + 1 , k y k = S y k , then for any k Z 0 + , d F k + 1 x k   ,   F k + 1 y k < d x k   ,   y k if d x k , y k > D 0 . This means that the distances which lie outside the interval   0   ,     D decrease strictly at any iteration performed under any of the two self-mappings irrespective if both distance arguments are either in the same set or in two adjacent subsets of the cyclic disposal. In that way, the distances which lie outside   0   ,   D behave locally as weak contractions. If the mapping S is applied then the contraction is, furthermore, strict for distances of points in the same subset.
Lemma 8. 
Assume that A i X for i p ¯ are non-empty closed subsets of a metric space  X , d , such that d i a m A i D = d A i   , A i + 1 ; i p ¯ , with S A i A i , and T , S : i p ¯ A i i p ¯ A i be self-mappings which satisfy (1)–(3), where  S A i A i is a contraction of contractive constant  K S 0   ,   1 and T A i A i + 1 is a  p 2 -cyclic self-mapping on i p ¯ A i of contractive constant  K T 0   ,   1 ; i p ¯ .
The following properties hold:
(i) Assume that x k = F k x 0 A i , y k = F k y 0 A i  for any i p ¯  and that F k + 1 , k = S  for some k Z 0 +  . Then, d x k + 1   , y k + 1 = d F k + 1 , k x k , F k + 1 , k y k < d x k , y k  if x k y k .
(ii) Assume that x k , y k A i × A i + 1 A i + 1 × A i  for any i p ¯  , and that either F k + 1 , k = S  or F k + 1 , k = T  for some  k Z 0 + , and assume also that D = 0  . Then, d F k + 1 , k x k , F k + 1 , k y k < d x k , y k  if x k y k .
(iii) Assume that  x k , y k A i × A i + 1 A i + 1 × A i  for any i p ¯  , that F k + 1 , k = S  and that D > 0  . If d x k , y k > K S 1 D  then d F k + 1 , k x k , F k + 1 , k y k < d x k , y k  . If d x k , y k K S 1 D  then d F k + 1 , k x k , F k + 1 , k y k = D d x k , y k .
(iv) If x k , y k A i × A i + 1 A i + 1 × A i  for any i p ¯  and F k + 1 , k x k = T x k  , F k + 1 , k y k = T y k  and d x k , y k > D > 0  for some  k Z 0 +  then d F k + 1 , k x k , F k + 1 , k y k < d x k , y k  and if d x k , y k = D  then d F k + 1 , k x k , F k + 1 , k y k = D .
Proof. 
Proof of Property (i): If x k , y k x k A i and F k + 1 , k = S , then, from (3)
d x k + 1 , y k + 1 = d F k + 1   , k x k   , F k + 1   , k y k K S d x k , y k < d x k , y k .
Proof of Property (ii): If x k A i , y k x k A i , note from the first condition of (2) with D = 0 that the above inequality still holds for F k + 1 , k = S and x k , y k x k A i × A i + 1 A i + 1 × A i since D = 0 . Also, if F k + 1 , k = T , it follows from (1) for D = 0 if x k , y k x k A i × A i + 1 A i + 1 × A i for any i p ¯ that
d F k + 1   , k x k   , F k + 1   , k y k K T d x k , y k < d x k , y k
Proof of Property (iii): Note that if F k + 1 , k = S and d x k , y k > K S 1 D , one has under the first condition of (2) that there is some ε k > K S 1 1 D R + such that:
d x k , y k = D + ε k > D > 0
d F k + 1   , k x k   , F k + 1   , k y k K S d x k , y k = K S D + ε k < D + ε k = d x k , y k .
On the other hand, if D d x k , y k K S 1 D , the first constraint arising from x k , y k A i × A i + 1 A i + 1 × A i for any i p ¯ with D > 0 , then d x k , y k K S 1 D d F k + 1 , k x k , F k + 1 , k y k = D d x k , y k from the first condition of (2).
Proof of Property (iv): If F k + 1 , k = T and x k , y k A i × A i + 1 A i + 1 × A i for any i p ¯ with D > 0 , one gets from (1) that if D d x k , y k = D + ε k > D ; then,
D d F k + 1   , k x k   , F k + 1   , k y k K T d x k , y k + 1 K T D
= K T D + K T ε k + D K T D
= K T ε k + D < D + ε k
= d x k , y k .
If d x k , y k = D , then one has from the above set of inequalities for ε k = 0 that d F k + 1   , k x k   , F k + 1   , k y k = D . □
The following result is of interest concerning the convergence of distance sequences of iterations constructed with composite mappings of T and S , (19), (20) and Lemma 8:
Lemma 9. 
Assume that A i X for i p ¯ are non-empty closed subsets of a metric space  X , d , such that d i a m A i D = d A i   , A i + 1 ; i p ¯ , and T , S : i p ¯ A i i p ¯ A i are self-mappings with  S A i A i being a (strict) contraction and  T A i A i + 1 being a p 2 -cyclic self-mapping on i p ¯ A i of contractive constant  K T 0   ,   1 ; i p ¯ . The following properties hold:
(i) If  i p ¯ A i then  l i m k d F k x   ,   F k y = 0 ;  x , y i p ¯ A i .
(ii) If  i p ¯ A i =  and  F k x   ,   F k y A i ;  k Z 0 + for some arbitrary  i p ¯ then  l i m k d F k x   ,   F k y = 0 .
(iii) If  T , S : i p ¯ A i i p ¯ A i commute,  i p ¯ A i = ,  F k x   A i = S k x ;  k Z 0 + ,  G k x = S k x   A i ;  k Ζ 0 + \ j  for some  j Z 0 + ,  G j + 1 , j = T and  G k + 1 , k = F k + 1 , k = S ;  k > j Z + . Then, d F j + l x   ,   G m + 1 + j y = d F j + l , j F j x , F m + j + 1 , j + 1 T F j y = d S l F j x , F m + j + 1 , j + 1 T F j y = d S l + j x , S m T F j y D ;  l i m k , l d F k x   ,   G l y = D . If   T is replaced with   T n p in the above formulas, then the result still holds.
If  i p ¯ A i , then the above limit becomes  l i m k , l d F k x   ,   G l y = 0 .
(iv) Assume  i p ¯ A i =  and  x A i ,  y A i + 1  for some arbitrary  i p ¯ . If  k = n k p + l k + s k a + s k b  with  l k k = 0 p 1 ¯   0 ;  n k = n k Z 0 + , one has that   F k x A i + l k m o d   p ,  F k y A i + 1 + l k m o d   p ;  k Z 0 + , and  l i m k d F k x   ,   F k y = D . If  i p ¯ A i , then the above limit becomes  l i m k d F k x   ,   F k y = 0 .
Also, if,  l = m l p + l l + s l a + s l b ;  n l = n l Z 0 + , one has l i m k . l d F k x   ,   F l y = D , in particular, l i m k , l d F k x   ,   F l y = 0 if i p ¯ A i .
(v)  Assume that  k = n k p + l k + s k ;  s k = s k a + s k b  and  l k p 1   ¯   0 ;  k Z 0 + , where  n k p is the total number of whole iterations of  T on the whole cyclic disposal up until the  k -th iteration in  F k , and  s k a  and  s k b  the number of iterations of  S  fulfilling, respectively, the first condition of (2) or (3) and the second condition of (2) up until the  k -th iteration. Thus, if  x A i  and  y A i + 1 for some  i p ¯  then for any  k Z 0 + , one has  F k x , F k + p x A i + l k m o d   p ;  F k y , F k + p y A i + l k + 1 m o d   p , and
(v.1)  d F n k p + l k + s k x   ,   F n k + m p + l k + s k y D  for any  m Z 0 + as  k if  n k .
(v.2)  d F n k p + l k + s k x   ,   F n k + m p + l k + s k x D  for any  m Z 0 + as  k if  n k .
(v.3) The limits (v.1)–(v.2) also hold as  k ,  s k for  n k = n k Z 0 +  not necessarily diverging, any  m Z 0 + .
Proof. 
To prove Property (i), note that if i p ¯ A i , then D = 0 . Thus, s k b = 0 ; k Z + , and, from (1) and the first condition of (2), or from (3), depending on to which set(s) A i i p ¯ the points F k x and F k y belong to. Thus, one has from (21), (22):
d F k x   ,   F k y K S s k a K T n k p + l k d x , y   ;   x , y i p ¯ A i
Then, if k , m a x n k , s k (Remark 4). Since s k b = 0 ; k Z + , that is the number of iterations involving the mapping S up until the k -th iteration of F k and, since s k a   , s ¯ k a 0 as k from (7), then K S s k a 1 , n k as k and l i m k d F k x   ,   F k y = D = 0 . Property (i) has been proved.
To prove Property (ii), note that if i p ¯ A i = , then D > 0 and x   ,   y A i for some arbitrary i p ¯ , then F k x = S F k 1 x   ,   F k y = S F k 1 y A i ; k Z + (that is, only the self-mapping S is involved in building the whole set of sequences which are in A i for some i p ¯ ) so that one has from (3),
d F k x   ,   F k y K S s k d x , y = K S s k a d x , y
If k , then s k = s k a and, one gets from (24) that
l i m k , l d F k x   ,   F l y = l i m k d F k x   ,   F k y = 0
and Property (ii) has been proved.
To prove Property (iii), note that the conditions of Property (ii) are kept from the initial conditions up until the j 1 -th iteration, while there is an application of the self-mapping T on i p ¯ A i at the j Z + -th iteration for the sequence generated from the initial point y A i . From the hypotheses, for x , y A i , one determines that composite mappings F k and G k for all k Z 0 + only differ in F j + 1 , j = S and G j + 1 , j = T and F k x   ,   F k y A i ; k Z 0 + , G k y A i + 1 for all k > j Z 0 + :
F k x = S k x A i ;   k Z 0 + ,   G k x = S k y A i ;   k < j Z + ;
G k y = G k , j + 1 G j + 1 , j G j y = S k j 1 T S j 1 y A i + 1 ;   k > j Z 0 + for some j Z + .
Since for k j , S k x and S k j 1 T S j y are in disjointed adjacent sets A i and A i + 1 , and since T , S : i p ¯ A i i p ¯ A i commute, one has from (21), which derives from (1)–(3), that
D d S k x   ,   S k j 1 T S j y m a x D   , K S k j 1 d S j + 1 x   ,   T S j y
which implies that d S k x   ,   S k j 1 T S j y D as k with S k x A i ; k Z 0 + , T y A i + 1 and S k j 1 T S j y A i + 1 for sufficiently large k . From the first condition of (2), there is some finite non-negative integer j j 1 j such that for k 1 + j 1 , K S k 1 d S x   ,   T y D ; then, for k 1 + j 1 , one has m a x     D   , D   + K S k 1 1 K T D = D and then d S k x   ,   S k j 1 T S j y = D for k 1 + j 1 so that one gets as a result:
l i m k d F k x   ,   F k , j + 1 T F j y = l i m k d S k x   ,   S k j 1 T S j y = l i m k d S k x   ,   S k 1 T y
= l i m m , k d F k x   ,   F m , j + 1 T F j y = l i m k , l d F k x   ,   G l y = D .
It is obvious that if T is replaced with T n p in the (27), the result still holds. Then, Property (iii) has been proved.
To prove Property (iv), note that x A i     ,     y A i + 1 for some i p ¯ . Take k = n k p + l k + s k a + s k b , F k x A i + l k m o d   p and F k y A i + 1 + l k m o d   p ; k Z 0 + . Then, it follows that
F k x A i + l k if   i p l k and   F k x A i + l k p if i > p l k ;   and
F k y A i + 1 + l k p if   i > p 1 l k and F k y A i + 1 + l k if   i p 1 l k
and one gets from (6), (7) that l i m k , l d F k + n l p x   ,   F k + m k p y = l i m k d F k + n k p x   ,   F k + m k p y = D ;   , m k = m k Z 0 + , since, if k for k = n k p + l k + s k a + s k b then either n k or s k a + s k b for any l k p 1 ¯   0 , and note that
d F k x   ,   F k y d T n k p + l k x   ,   T n k p + l k y K T n k p d T l k x   ,   T l k y + 1 K T n k p D .
Thus, one has
(a)
if n k then
l i m   s u p k d F k x   ,   F k y K T n k p d T l k x   ,   T l k y 1 K T n k p D = l i m   s u p k d F k m x   ,   F k y D 0
  • so that there exists l i m k d F k x   ,   F k y = D ;
(b)
if s k then the above result follows as in Property (iii).
In the same way, it is obtained if, in addition, l = m l p + l l + s l a + s l b ;  n l = n l Z 0 + , that l i m k , l d F k x   ,   F l y = D .
Property (iv) has been proved.
Property (v) is proved easily under a close reasoning as the one used in the proof of Property (iv). □
Remark 7. 
Note that it is relevant in Lemma 9 that:
(a) 
Any two iterative processes which only involve compositions of  S  with itself in the same subset  A i  generate sequences which are contained in this subset.
(b) 
If two iterations only involve compositions of  S  with itself but they are initialized in adjacent subsets, these generate sequences which always remain each in its corresponding subset but the maximum allowed distances at each iteration step is the distance  D  between disjointed adjacent subsets. That means that the self-mapping  S might be non-single valued from the second equation of (2), forced to be applied to this end if the distances exceed  D .
(c) 
Any two iterations with initial points in the same subset generate sequences which lie asymptotically in adjacent subsets in the event that they mutually differ in the concourse of  n p + 1  times the self-mapping  T  for some given  n Z 0 + . The case when both of them just differ in a single contribution in the iterative composition of maps is sufficient for that property to hold. If the initial points are in adjacent subsets then both generated sequences lie asymptotically in adjacent subsets if they mutually differ in the concourse of  n p + 1  times the self-mapping  T  for some given  n Z 0 + . The number of contributions of  S to the composed mappings in any of the mentioned iterations do not modify the above conclusions since the self-mapping  S with domain in any subset has its image in the same subset.
The following assumptions will be invoked in the following as linked to results in the previous section and used to extend them to the iterative processes which involve compositions F k : i p ¯ A i i p ¯ A i for any k Z 0 + of the self-mappings S ,   T : i p ¯ A i i p ¯ A i , subject to (19) and (20), where all the subsets A i of the metric space X , d are nonempty and closed.
Assumption 1. 
A i X for are non-empty closed subsets of a metric space  X , d , where d : X × X R 0 + , with d A i , A i + 1 = D > 0 ; i p ¯ ; and T , S : i p ¯ A i i p ¯ A i are self-mappings which satisfy (1)–(3), where  S A i A i is a contraction of contractive constant  K S 0   ,   1 and T A i A i + 1 is a p 2 -cyclic self-mapping on i p ¯ A i of contractive constant  K T 0   ,   1 ; i p ¯ .
Assumption 2. 
The unique fixed points of the contractive self-mapping  S : i p ¯ A i i p ¯ A i \ A l A l satisfy z l = S z l A l 0 ; l p ¯ .
Assumption 3. 
There is at least one  j p ¯ such that A j is boundedly compact and  A j 0 = z j is a singleton.
Assumption 4. 
At least one of the subsets  A j of X in the cyclic disposal is strictly convex for some  j p ¯ .
Assumption 2 states that the fixed points of S in each subset are also best-proximity points of this subset to its adjacent subset. Also, from Assumption 3 (which holds directly if A j is convex, but it can also hold without convexity need in some cases if A j is not perfect) and Corollary 2, it follows that the best-proximity points z l to A l + 1 of T : i p ¯ A i i p ¯ A i in A l for l p ¯ (also fixed points of S : i p ¯ A i i p ¯ A i \ A l A l ; l p ¯ from Assumption 1) satisfy z j + i = T i z j A j + i , 0 for 1 i p j and z j i = T p i z j A j i   , 0 for 1 i j 1 . That is, if T : i p ¯ A i i p ¯ A i contributes with infinitely many tours on the whole cyclic disposal in iterative processes, the sequences of distances of iteration in adjacent subsets converge to D (Lemma 9(iv)). From Corollary 3, the sequences in adjacent subsets involved in such distances converge to the unique fixed points z l of T p : i p ¯ A i \ A l i p ¯ A i \ A l for all l p ¯ which are the, in general, non unique (except for j p ¯ ) best-proximity points of T : i p ¯ A i i p ¯ A i and the unique fixed points of S : i p ¯ A i i p ¯ A i \ A l A l ; l p ¯ under Assumption 2. Assumption 4 guarantees the uniqueness of z j A j 0 = z j and then that of the fixed points of T p : i p ¯ A i \ A l i p ¯ A i \ A l for all l p ¯ .
The next result establishes the main result of this section which is supported by Theorem 2, Corollarys 1 and 3, Lemmas 4–6 and 9.
Theorem 3. 
Let X , be a uniformly convex Banach space under Assumptions 1–3, where  d : X × X R 0 + is the norm-induced metric defined by  d x , y = x y ; x , y X , and consider an iterative process which involve compositions  F k : i p ¯ A i i p ¯ A i for any k Z 0 + of the self-mappings S ,   T : i p ¯ A i i p ¯ A i , subject to (19)–(20). Then, the following properties hold for any given  x A i and y A i + 1 :
(i) The convergence of distances of Lemma 9(v) holds for  k = n k p + l k + s k ;  s k = s k a + s k b  and  l k p 1   ¯   0 ;  k Z 0 + , that is, irrespective of the order of the contributions of the self-mappings  S  and  T  to the iterative process  F k . = F k , k 1 . F k 1 . k = 0 , the following holds for any  x A i ,  y A i + 1  for any  i p ¯ : d F n k p + l k + s k x   ,   F n k + m p + l k + s k y D for any   m Z 0 + as  k if n k or if   s k . d F n k p + l k + s k x   ,   F n k + m p + l k + s k x 0 for any   m Z 0 + as  k if n k or if   s k provided that   l k = j i if i < j or l k = j i + p , otherwise. d F n k p + l k + s k x   ,   F n k + m p + l k + s k x 0 for any   m Z 0 + as  k if n k or if   s k provided that   l k = j i if i < j or l k = j i + p , otherwise.
Property (i) also holds if   T : i p ¯ A i i p ¯ A i is an extended  p 2 -cyclic contraction self-mapping.
(ii) The set  z 1 , z 2 , , , z p  of respective fixed points of  T p  from  A i  to  A i + 1  is unique and it is also the set of proximity points of  T  to which all the sequences generated by the contractive self-mapping converge at each one of the subset if  n k Z +  (that is, if there is at lest a complete tour of  T  in the iterative process  F k . = F k , k 1 F k 1 . k = 0 as  k .
Property (ii) also holds if  T : i p ¯ A i i p ¯ A i is an extended   p 2 -cyclic contraction.
Proof. 
Property (i) follows directly from Lemma 9(v) since a uniformly convex Banach space is a complete metric space and from Lemma 5(ii). Note that if x A i ,  y A i + 1 for any i p ¯ :
d F n k p + l k + s k x   ,   F n k + m p + l k + s k y D for any m Z 0 + as k if n k or if s k , and
d F n k p + l k + s k x   ,   F n k + m p + l k + s k x 0 for any m Z 0 + as k if n k . If n k 0 then
d F l k + s k x   ,   F m p + l k + s k x 0 for any m Z 0 + as k as s k from (3) since F m p + l k + s k x k = 1 A i z i = S z i since F is a strict contraction. Finally, if n k Ζ + for (at least) a k Z 0 + while l i m   s u p k   n k < , then F m p + l k + s k x k = 1 A l z l = S z l for some l p ¯ from (2), (3) and Assumption 2. The result also holds from Lemma 4(ii) if T : i p ¯ A i i p ¯ A i is an extended p 2 -cyclic contraction.
Property (ii) follows from Assumption 3, Lemma 4(i) and Lemma 6, and from Assumption 3, Lemma 4(ii) and Lemma 6 if T is an extended p 2 -cyclic contraction with at least a contribution of one complete tour of T as k . □
The next result establishes the second main result of this section. The proof is similar by replacing Assumption 3 by Assumption 4, related to the strict convexity of one of the subsets of the cyclic disposal, and by taking into account Lemma 5 and Proposition 1.
Theorem 4. 
Let X , be a uniformly convex Banach space under Assumptions 1, 2 and 4. Assume that A j is strictly convex for some  j p ¯ . Also, let T : i p ¯ A i i p ¯ A i be a p 2 -cyclic contraction with contractive constant  K 0   ,   1 and take x A l for some arbitrary l p ¯ . Then, the following properties hold:
(i) Property (i) of Theorem 3 holds.
(ii) There is a unique best-proximity point  z j  to  A j + 1  in the strictly convex set  A j  (Assumption 4), that is,  A j 0 = z j , such that  d z j   ,   T z j = d A j   ,   A j + 1 = D ; and there exists  z i A i 0 ;  i j p ¯  (such that  A i 0  for  i j  are not empty and non-necessarily singletons) such that  d z i   , T z i = D ;  i j p ¯ .
(iii)  Propositions [(i)–(ii)] also hold if  T : i p ¯ A i i p ¯ A i  is an extended  p 2 -cyclic contraction.

4. Examples

Example 1. 
Consider the metric space R   ,   d , where d : R × R R 0 + is the Euclidean metric, and consider the real intervals  A 1 =   , 1 and A 2 = 1   ,   + such that D = d A 1   ,   A 2 = 2 . Note that the Euclidean metric in this case coincides with the taxi-cab metric and that the metric space is a uniformly convex metric space and then complete. Define the self-mapping T on A 1 A 2 by T x = x which is a non-expansive 2-cyclic self-mapping, since  T x 1 T x 2 = x 2 x 1 = x 1 x 2 for x 1 ,   x 2 A 1 A 2 × A 2 A 1 , with T A 1 = A 2 and T A 2 = A 1 , and z 1 = 1 and z 2 = 1 are the best-proximity points with  T z 1 = z 2 in A 1 to A 2 and T z 2 = z 1 in A 2 to A 1 .
Consider a contractive self-mapping  S  on  A 1 A 2  satisfying  S A 1 A 2  and  S A 2 A 1  such that for some  K S 0   ,   1 , S x 1 S x 2 K S x 1 x 2  if  x 1   ,   x 2 A i  or if  x 1 ,   x 2 A 1 A 2 × A 2 A 1  with  d x 1   , x 2 = x 1 x 2 > 2 K S 1  and  d x 1   , x 2 = z 1 z 2 = 2 , otherwise, with  S z i = z i   for   i = 1 , 2 . Note that the unique best-proximity points Zi in Ai to A i + 1 3 1 m o d     2 are the respective unique fixed points of in S in A i  for  i = 1 ,   2 . Note that:
(1) 
If only composed mappings of  S  contribute in an iteration process  F k x k = 0 , then  F k x k = 0 z i  and  d F k + 1 x   ,   F k x 0  as  k  if  x A i  for  i = 1 , 2 .
(2) 
If only composed mappings of  T  contribute in an iteration process  F k x k = 0 , then  F k x k = 0 x   ,   x , with  F k + 1 x = F k x , for all  k Z 0 +  any  x A 1 A 2  but the iterative process does not converge and  d F k + 1 x   ,   F k x 2  as  k  while  d F 2 k x   ,   F 2 k + 2 x 0  and  d F 2 k + 1 x   ,   F 2 k + 3 x 0  as  k . In particular, if  x = F 0 x z 1   ,   z 2 , then  F 2 k z i = z i  and  F 2 k + 1 z i = z i + 1  for  k Z 0 + ;  i = 1 ,   2 .
(3) 
If a finite even number of compositions of  T  contribute to an iterative process  F k x k = 0  which has infinitely many compositions of  S , and irrespective of the order of occurrence of the whole set of compositions,  F k x k = 0 z i  if  x A i ;  i = 1 , 2 . If a finite odd number of compositions of  T  contribute to the iterative process, then  F 2 k x k = 0 z i + 1  if  x A i ;  i = 1 , 2 . In both cases,  d F k + 1 x   ,   F k x 0  as  k .
(4) 
If infinitely many compositions of  T contribute to an iterative process  F k x k = 0  which has either a finite number or infinitely many compositions, of  S , and irrespective of the order of occurrence of the whole set of compositions,  F 2 k x k = 0 z i  and  F 2 k + 1 x k = 0 z i + 1 if  x A i ;  i = 1 , 2 ; and the sequence  F k x k = 0 z 1   ,   z 2  does not converge while  d F 2 k x   ,   F 2 k + 2 x 0  and  d F 2 k + 1 x   ,   F 2 k + 3 x 0  as  k .
Example 2. 
Modify Example 1 with T x = x + σ λ x , where σ R + , and λ : R R is continuous, with λ x = 0 for x 1   ,   1 . Thus, T ± 1 = 1 , and for  x A 1 and y A 2 , one has that T is 2 -cyclic contractive if
T x   T y = y   x + σ λ x σ λ y = y   x σ λ y λ x = y   + x σ λ y λ x
= y   x σ λ y λ x σ     λ y λ x
Assume that x + σ λ x 1  and y + σ λ y 1  , then σ λ x 1 + x = 1 x  and σ λ y y 1 = y 1  , then y 1 1 x  ; equivalently, the necessary constraint y + x = y x 2  , is guaranteed if y A 2 y A 1 λ y > λ x . Thus, for some real constant  K T 0   ,   1 , one has that T  is 2  -cyclic contractive if
T x   T y = y   x σ λ y λ x K T y x + 2 1 K T
which holds if
1 K T   x   y 2 σ λ y λ x σ σ 1   y + x 2 = y + x 2
Whose second inequality follows since  λ y λ x σ 1 y + x 2  obtained from the former constraints  σ λ x 1 x  and σ λ y y 1 . As a result, T  is 2  -cyclic contractive if for σ R +  , σ 1   1 x λ x σ 1   x 1  for x A 1 A 2  . The properties of Example 1 hold for iterative processes of the above cyclic contractive self-mapping and contractive self-mapping  S , whose fixed points at each subset is the best-proximity point to its adjacent subset as in Example 1.
Examples 1 and 2 are easily extendable to the real vector case as follows:
Example 3. 
Consider the complete metric space  R n   ,   d , where d : R × R R 0 + is the supremum metric of all the  n -vector components obtained from the component-wise taxi-cab metric, and consider the subsets  A i = A i × A i   × n × A i for i = 1 ,   2 of R n   ,   d , where A 1 =   , 1 and A 2 = 1   ,   + such that D = d A 1   ,   A 2 = d A 1   ,   A 2 = 2 . The best-proximity points are real  n -vectors  z i ; i = 1 , 2 with all their respective components being, respectively,  1 and + 1 . The contractive self-mapping S on A i are anyone with fixed points being the best-proximity points between adjacent subsets. Then, the derivations and conclusions of Example 2, inherited from Example 1, hold.
There are dynamic systems present in the real word which have several potential configurations which can be activated at different time instants as long as the process under study evolves in different production phases or because of the concourse of certain events which activate switching. Switching actions can cause instability if they occur repeatedly in very short time intervals even if the various alternative configurations are stable. Also, switching actions can translate into stability of the switched configuration if the switching map runs properly through time or is governed by events, for instance, if signals exceed a certain threshold, the switching might be activate to prevent against instability, even if the individual configurations are instable, [20,21,22,23]. The following two examples link those problems with the combined iterations involving cyclic self-maps and strict contractions. Two sets of the metric space are defined for the state evolution of a time-varying linear dynamic system of n -th order with constant distinct parameterizations in each of both subsets. The two individual parameterizations are assumed to be stable and governed by a strict contraction, while they keep either non-negative solutions or non-positive ones depending on which set has been activated.
Example 4. 
Let A i = A i j k R n × n ; i = 1 , 2 ; j , k m ¯ be real Metzler stability matrices, that is,  A i j k 0 if j k and A i have all their eigenvalues with negative real parts. Since they are Metzler, they are stable iff  A i 1 0 , that is, they are non-singular with non-negative entries, [24,25,26]. Define the n -th order differential systems  x ˙ i t = A i x i t with initial conditions  x i 0 = x i 0 R n ; i = 1 , 2 . Since the matrices of dynamics are Metzler, then the fundamental matrices  e A i t of the corresponding differential systems are non-singular with non-negative entries for all time and the solutions satisfy  x i t 0 for t R 0 + if x i 0 0 . In the same way, x i t 0 for t R 0 + if x i 0 0 . This feature is equivalently denoted by  x i t 0 for t R 0 + if x i 0 0 .
Consider the Banach space  R n   ,   .  and consider also consider the first hyperorthant  R 0 + n  of R n  and its opposed one  R 0 + n  as subsets of R n . Clearly R 0 + n R 0 + n = 0 R n  and both subsets are unbounded, closed and convex if  n 2 . Rename A 1 = R 0 + n  and A 2 = R 0 + n  so that all the solutions  x 1 t of  x ˙ 1 t = A 1 x 1 t  are in  A 1  for all time under any given non-positive initial conditions and all those of  x ˙ 2 t = A 2 x 2 t  are in  A 2  for all time under any given non-negative initial conditions as a result of the properties of Metzler matrices.
Furthermore, as a consequence of the properties of fundamental matrix functions of stability matrices, one has that there exist positive constants  k i 1 and ρ i > 0 for i = 1 ,   2 such that x i t k i e ρ i   t t 0 x i t 0 for all t t 0 and any   t 0 R 0 + , where  k i 1  for  i = 1 ,   2 is norm-dependent and ρ i < 0 is the maximum real part of the dominant eigenvalue of the stability Metzler matrix  A i , for i = 1 ,   2 , if it has multiplicity equal to one, and any greater negative real number, otherwise.
Thus, in terminology of systems theory, note that both differential systems are globally exponentially stable. Note also that R n   ,   . is a complete metric space   R n   ,   d if d : R n × R n R 0 + is the norm-induced metric and that   d A 1   ,   A 2 = 0 . Fix a sampling period T s > 0 for picking-up the discrete samples of the solutions   x i k T s for  i = 1 , 2 and k Z 0 + .
Assume that the initial condition of the differential system   x 0 = x 0 is either in A 1 or in A 2 . Now, define strictly increasing sequences of non-negative integer numbers   n k i k Z 0 +  for  i = 1 , 2 such that a self-mapping   T  from  A 1 A 2 × Z 0 +  to  A 1 A 2 is defined by:
T x j k = x j k + 1
if j k n k i   ,   n k + 1 i Z 0 +    and x n k i A i  for i = 1 ,   2  ;
T x n k + 1 = λ n k + 1   x n k + 1 1
If j k n k   ,   n k + 1 Z 0 +  , for some λ n k + 1 0   ,   K T  , all k Z 0 +  , and some K T < 1  . That is, T  is a non-expansive self-mapping on  R n  which is also a  2 -cyclic contraction in A 1 A 2  at the sampling instants n k T s k = 0  and it governs switching in-between  A 1  and A 2 .
A self-mapping  S  on  R n  which defines the solution trajectory in  A 1 A 2  is contractive in both  A 1  and  A 2  if the sequences  n k i k Z 0 +  for  i = 1 , 2  satisfy  k i e ρ i n k + 1 i n k i T s K S < 1  for  i = 1 , 2 , equivalently, the sampling interval between consecutive values of the sequence  n k i k Z 0 +  is large enough to satisfy the constraints:
n k + 1 i n k i + ρ i 1 T s 1 l n   k i + l n   K S
for i = 1 , 2  and some  K S 0   ,   1 . That is, the restriction of  S  to any of the subsets  A 1  and A 2  is contractive if there is a sufficiently large number of samples at each of the parameterizations  A 1  and A 2  before switching (activated by the mapping  T ), respectively to A 2  and A 1  . The reason for those constraints is that the constants k i might exceed unity so that small residence times at a parameterization before switching in-between  A 1  and A 2  can translate into either expansiveness of the solutions or into the achievement of non-expansive (although non-contractive) properties.
Note by direct inspection that  0 R n  is the unique fixed point of  S and the unique best-proximity point of to  A 1  in  A 2  and vice versa. Note also that because of the definition of the mapping  T  the solution trajectory never switches in-between  A 1  in  A 2  at time instants in an open interval defined by consecutive sampling instants  k T s  and  k + 1 T s  so an identical sign for all the components of  x t  is always kept except at switching time instants which take place at sampling instants accordingly to (28)–(30).
In summary, we have proved the following result:
Proposition 2 (for Example 4). 
Consider a switched linear time-varying dynamic system described by  x ˙ 1 t = A 1 x 1 t when the solution trajectory is in  A 1 and by x ˙ 2 t = A 2 x 2 t when the solution trajectory is in  A 2 , where both matrices of dynamics are stability Metzler matrices and that  x 0 = x 0 is either in A 1 or in A 2 . Assume that the self-mappings  T and S for the discretization of the solution trajectory satisfy (28)–(30) for a given sampling period  T s > 0 . Then, the solution trajectory is bounded for all time for any given finite initial conditions and  x k T s 0 as k and x t 0 as t + .
Example 5. 
In Example 4, the stabilization of the cyclic configuration without requiring convergence can be governed just by monitoring the self-mapping  T without requiring the contractiveness of  S . That is, even if one (or both) differential system(s) is not asymptotically stable (and even if both of them are unstable), that is, if the Metzler matrices of dynamics fail to fulfil  A i 1 0 ; i = 1 , 2 , or if they are still stability matrices while the residence time of the solution trajectory within each of the subsets violates the constraint (30).
The following concerned immediate result is pertinent:
Proposition 3 (for Example 5). 
Assume that at least one of the Metzler matrices  A i (i=1,2) is not a stability matrix and that, for some prefixed arbitrary real constant  M > 0 , the self-mapping  T on A 1 A 2 is defined such as to satisfy: x   k + 1 T s = θ k x k T s  if  x k T s M with θ k k = 0 λ M x k T s k = 0 0   ,   λ 0   ,   1 for any given prescribed minimum sample threshold  z m Z +  for any given real constant  λ   0   ,   1 . Then, there is some real constant    M ´ = M ´ M ,   λ > 0  such that if  x 0 A 1 , or if x 0 A 2  , and x 0 λ M  , then s u p t 0   x t M + M ´ .
Proof. 
x k T s k = 0 is bounded if x 0 λ M since, if x k T s M for some k Z + , then x k + 1 T s λ M < M and x k + 1 T s < m i n M   ,   x k T s . Otherwise, if x k + 1 T s x k T s , then M x k T s x k + 1   T s λ M < M , a contradiction. Since the solution trajectory at sampling instants is uniformly bounded, the solution trajectory in-between consecutive sampling instants is also bounded according to:
x t m a x K 1 , K 2 e m a x ρ 1   ,     ,   ρ 2 T s x k T s m a x K 1 , K 2 e m a x ρ 1   ,     ,   ρ 2 T s M
for all t k T   ,   k + 1 T and any k Z 0 + . Thus, the solution trajectory is uniformly bounded for all time since s u p t 0 x t m a x K 1 , K 2 e m a x ρ 1   ,     ,   ρ 2 T s M . □
Example 6. 
Consider the infinite-dimensional Banach space  L p a   ,   a   ,   of real  n -vector functions  f L p   a   ,   a for any given p Z + and any given real a with + > a > 0 , and consider a set  B = B 1 = B 2 R n . Note that, since B 1 = B 2 , the distance D = d B 1   ,   B 2 = i n f x B 1   , y B 2 x y is zero. Define the two-cyclic self-mapping  T B B by T f x = Λ f   x , for any x a   ,   a , where Λ R n × n is a diagonal matrix with diagonal entries in the interval  β   ,   0 1   ,   0 . Consider the sequence generated by f n + 1 x = T f n x = Λ f n   x ;  x a   ,   a . Then, clearly   T f n x n = 0 0 , for initial value f 0 x = f x ;  x a   ,   a and any f L p a   ,   a , so that f n converges to the null real  p -vector function in   L p a   ,   a   ,    as  n .

5. Conclusions

This paper has dealt with the properties of the convergence of distances between sequences and with the convergence of sequences of points in iterative processes which jointly involve cyclic contractive self-mappings and strict contractions. The cyclic contractions can involve more than two nonempty closed subsets in a metric space. It is assumed, in general, that the compositions of a cyclic contraction are combined with compositions of a strict contraction, which operates in each of the individual subsets. The compositions of both self-mappings can take place in any order and they can involve any number of mutual compositions of each of both contractive self-mappings with themselves and with the other self-mapping. It is proved that if one of the best-proximity points in the cyclic disposal is unique in a boundedly compact subset of the metric space, this suffices to achieve unique asymptotic limit cycles formed by one best-proximity point per each adjacent subset. The same conclusion is reached if one of the subsets is strictly convex and the metric space is a uniformly convex Banach space. That property holds for all the sequences with arbitrary initial points in the union of all the subsets of the cyclic disposal which converge to such a limit cycle.

Funding

Basque Government [IT1555-22].

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors would like to thank MICIU/AEI/10.13039/501100011033 and FEDER/UE for partially funding their research work through grants PID2021-123543OB-C21 and PID2021-123543OB-C22.

Conflicts of Interest

The author declares that he has no competing interests.

References

  1. Eldred, A.A.; Veeramani, P. Existence and convergence of best proximity points. J. Math. Anal. Appl. 2006, 323, 1001–1006. [Google Scholar] [CrossRef]
  2. Karpagam, S.; Agrawal, S. Best proximity point theorems for p-cyclic Meir-Keeler contractions. Fixed Point Theory Appl. 2009, 2009, 197308. [Google Scholar] [CrossRef]
  3. Aslantas, M.; Sahin, H.; Altun, I. Best proximity point theorems for cyclic p-contractions with some consequences and applications. Nonlinear Anal. Model. Control 2021, 26, 113–129. [Google Scholar] [CrossRef]
  4. De la Sen, M.; Singh, S.L.; Gordji, M.E.; Ibeas, A.; Agarwal, R.P. Best proximity and fixed point results for cyclic multivalued mappings under a generalized contractive condition. Fixed Point Theory Appl. 2013, 2013, 324. [Google Scholar] [CrossRef]
  5. De la Sen, M.; Karapinar, E. On a cyclic Jungck modified TS-iterative procedure with application examples. Appl. Math. Comput. 2014, 233, 383–397. [Google Scholar] [CrossRef]
  6. Espínola, R.; Fernandez-Leon, A. On best proximity points in metric and Banach spaces. Can. J. Math. 2011, 63, 533–5550. [Google Scholar] [CrossRef]
  7. Eldred, A.A.; Kirk, W.A.; Veeramani, P. Proximal normal structure and relatively nonexpansive mappings. Stud. Math. 2005, 171, 283–294. [Google Scholar] [CrossRef]
  8. Phatak, H.K.; Shahzad, N. Some results on best proximity points for cyclic mappings. Bull. Belg. Math. Soc. Simon Stevin 2013, 20, 559–572. [Google Scholar]
  9. Fulatan, I.A.; Yahaya, S.; Imam, A.T. Best proximity points for nonlinear cyclic mappings on multiplicative metric spaces. Niger. J. Sci. Res. 2016, 15, 587–590. [Google Scholar]
  10. Fallahi, K.; Rad, G.S. Best proximity points theorem in b-metric spaces endowed with a graph. Fixed Point Theory 2020, 21, 465–474. [Google Scholar] [CrossRef]
  11. Weng, S.; Liu, X.; Chao, Z. Some fixed point theorems for cyclic mapping in a complete b-metric-like space. Results Nonlinear Anal. 2020, 3, 207–213. [Google Scholar]
  12. Gupta, V.; Mani, N.; Ansari, A.J.; Kumari, S. Some fixed point results on C-class functions for generalized cyclic contractive mappings in b-metric spaces. Math. Comput. Sci. 2025, 6, 19–29. [Google Scholar]
  13. Kumari, P.S.; Panthi, D. Connecting various types of cyclic contractions and contractive self-mappings with Hardy-Rogers self-mappings. Fixed Point Theory Appl. 2016, 2016, 15. [Google Scholar] [CrossRef]
  14. Gabeleh, M.; Patle, P.R. Best proximity point (pair) results via MNC in Busemann convex metric spaces. Appl. Gen. Topol. 2022, 23, 405–424. [Google Scholar] [CrossRef]
  15. Wu, D.; Weng, S. A fixed point result involving BSS-type cyclic mapping. ICMMAP-2024. J. Phys. Conf. Ser. 2025, 2964, 012101. [Google Scholar] [CrossRef]
  16. Bassou, A.; Sabar, T.; Mohamed, A. A note on best proximity point for S-cyclic mappings. Fixed Point Theory 2021, 22, 75–82. [Google Scholar] [CrossRef]
  17. Anushia, S.M.; Nelson, S.N.L. Fixed point from Kannan-type S-coupled cyclic mapping in complete S-metric space. Nanotechnol. Percept. 2024, 20, 335–356. [Google Scholar]
  18. Singer, I. Some remarks on approximative compactness. Rev. Roum. De MathéMatiques Pures Et AppliquéEs 1964, 9, 167–177. [Google Scholar]
  19. Pyatyshev, I.A. Operations on approximatively compact sets. Math. Notes 2007, 82, 653–659. [Google Scholar] [CrossRef]
  20. Liberzon, D. Switching in Systems and Control: Foundations & Applications; Birkhäuser: Boston, MA, USA, 2003. [Google Scholar]
  21. Li, Z.; Soh, Y.; Wen, C. Switched and Impulsive Systems; LNCIS, Lecture Notes in Control and Information Sciences, No. 313; Springer: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
  22. De la Sen, M.; Ibeas, A. On the global asymptotic stability of switched linear time-varying systems with point delays. Discret. Dyn. Nat. Soc. 2008, 2008, 231710. [Google Scholar] [CrossRef]
  23. Preiss, T.; Schneider, J.J.; Stanley, H.E. Switching processes in financial markets. Proc. Natl. Acad. Sci. USA 2011, 108, 7674–7678. [Google Scholar] [CrossRef]
  24. De la Sen, M. A method for general design of positive real functions. IEEE Trans. Circuits Syst. I-Regul. Pap. 1998, 45, 764–769. [Google Scholar] [CrossRef]
  25. Farina, L.; Rinaldi, S. Positive Linear Systems; Wiley Interscience: New York, NY, USA, 2000. [Google Scholar]
  26. Kaczorek, T. Positive 1D and 2D Systems; Springer: London, UK, 2002. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

De la Sen, M. On the Properties of Iterations Generated with Composition Maps of Cyclic Contractive Self-Mappings and Strict Contractions in Metric Spaces. Mathematics 2025, 13, 2224. https://doi.org/10.3390/math13142224

AMA Style

De la Sen M. On the Properties of Iterations Generated with Composition Maps of Cyclic Contractive Self-Mappings and Strict Contractions in Metric Spaces. Mathematics. 2025; 13(14):2224. https://doi.org/10.3390/math13142224

Chicago/Turabian Style

De la Sen, Manuel. 2025. "On the Properties of Iterations Generated with Composition Maps of Cyclic Contractive Self-Mappings and Strict Contractions in Metric Spaces" Mathematics 13, no. 14: 2224. https://doi.org/10.3390/math13142224

APA Style

De la Sen, M. (2025). On the Properties of Iterations Generated with Composition Maps of Cyclic Contractive Self-Mappings and Strict Contractions in Metric Spaces. Mathematics, 13(14), 2224. https://doi.org/10.3390/math13142224

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