Next Article in Journal
Perovskite Solar Cells and Thermoelectric Generator Hybrid Array Feeding a Synchronous Reluctance Motor for an Efficient Water Pumping System
Next Article in Special Issue
A Derivative-Free MZPRP Projection Method for Convex Constrained Nonlinear Equations and Its Application in Compressive Sensing
Previous Article in Journal
The Spillover Effects of Chinese Shocks on the Belt and Road Initiative Economies: New Evidence Using Panel Vector Autoregression
Previous Article in Special Issue
Fixed Point Results for Perov–Ćirić–Prešić-Type Θ-Contractions with Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Some Properties of a Class of Eventually Locally Mixed Cyclic/Acyclic Multivalued Self-Mappings with Application Examples

1
Institute of Research and Development of Processes, Department of Electricity and Electronics, Faculty of Science and Technology, University of the Basque Country (UPV/EHU), 48940 Leioa, Bizkaia, Spain
2
Department of Telecommunications and Systems Engineering, Universitat Autònoma de Barcelona (UAB), 08193 Barcelona, Catalonia, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(14), 2415; https://doi.org/10.3390/math10142415
Submission received: 23 June 2022 / Revised: 7 July 2022 / Accepted: 9 July 2022 / Published: 11 July 2022
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)

Abstract

:
In this paper, a multivalued self-mapping is defined on the union of a finite number of subsets p 2 of a metric space which is, in general, of a mixed cyclic and acyclic nature in the sense that it can perform some iterations within each of the subsets before executing a switching action to its right adjacent one when generating orbits. The self-mapping can have combinations of locally contractive, non-contractive/non-expansive and locally expansive properties for some of the switching between different pairs of adjacent subsets. The properties of the asymptotic boundedness of the distances associated with the elements of the orbits are achieved under certain conditions of the global dominance of the contractivity of groups of consecutive iterations of the self-mapping, with each of those groups being of non-necessarily fixed size. If the metric space is a uniformly convex Banach one and the subsets are closed and convex, then some particular results on the convergence of the sequences of iterates to the best proximity points of the adjacent subsets are obtained in the absence of eventual local expansivity for switches between all the pairs of adjacent subsets. An application of the stabilization of a discrete dynamic system subject to impulsive effects in its dynamics due to finite discontinuity jumps in its state is also discussed.

1. Introduction

There are abundant results on the best proximity points available in the background literature for different kinds of cyclic contractions and quasi-contractions. For instance, in [1], an important investigation is performed for 2-cyclic contractive self-mappings on the union of a set of non-empty, closed and convex subsets, which do not necessarily intersect at a uniformly convex Banach space. It is also found that the sequences built with the iterations of the self-mapping converge to unique best proximity points. On the other hand, an algorithm is provided to find the best proximity points in [2]. See also [3] for some related discussion on best proximity point results for some contractive mappings in uniform spaces. Some results on cyclic quasi-contractions and strong-quasi-contractions are given in [4,5,6,7,8,9] and some of the references therein. On the other hand, in [10], quasi non-expansive results for metric-like spaces were obtained. Additionally, best proximity point theorems for p 2 -cyclic Meir–Keeler contractions are given in [11] for uniformly convex Banach spaces. Sufficient-type conditions for the existence of a best proximity point and the convergence of sequences to it are also given in this paper. Furthermore, a useful notion of cyclic orbital Meir–Keeler contractions is given together with sufficient conditions for the existence of best proximity points and fixed points in [12]. This work generalizes previous results obtained in [13], which, in turn, generalizes some mentioned results of [1] to Meir–Keeler cyclic contractions. On the other hand, some general cyclic contraction mappings of the rational type are discussed in [14,15], including a particular study of the case when the involved subsets intersect. Additionally, the problem of the existence of best proximity point results in multivalued non-self-mappings is focused on in [16,17] by using optimization tools. In particular, this problem is investigated in [17] for contraction multivalued non-self-mappings in metric spaces as well as for non-expansive ones in Banach spaces which have an appropriate geometric property.
On the other hand, a solution of a Fredholm integral equation in b-metric-like spaces is found in [18] through the involvement of a particular of a technique based on the use of rational contractive mappings.
In [19], an existence and uniqueness result for a common solution of a second-order two-point boundary differential system based on the properties of the study’s newly introduced concept of cyclic p -contraction pairs. Additionally, best proximity results are proved in that paper concerned with mappings defined on proximally complete pairs of subsets of a metric space. This research extends a previous one reported in [20] on the proposed new concept of p -contractions. It is also proved in [20] that any p -contraction self-mapping possesses a unique fixed point in a complete metric space.
It is well-known that sometimes differential or difference dynamic systems can be subject to different parameterizations which describe the dynamical behavior around different operation points. When the parameterization of the differential system changes abruptly, there are discontinuities in the differential equations which describe the system dynamics. If the state has finite jump-type discontinuities, then the differential system is impulsive and vice-versa. See, for instance, [21]. Therefore, some typical control problems, such as, for instance, controllability or stabilization, become much more difficult to solve in the presence of either state discontinuities or impulsive controls at certain time instants. Some phenomena are sometimes associated with parameterization jumps or state discontinuities related to practical requirements. This often happens, for instance, in dynamics of chemical engineering processes along different phases of processing and monitoring a complete complex process or in discrete dynamic systems when the sampling rate is non-uniform, as in [22,23]. Therefore, the stabilization problem under either configurations or state switches has received important attention in the study of continuous-time, discrete-time, hybrid and time-delayed systems. Close problems often appear concerning the properties of the controllability and reachability of dynamic systems. See, for instance, [24,25,26,27,28] and some of the references therein as well as the recent works [29,30,31,32,33,34].
In this paper, we define and study a very general class of multivalued self-mappings defined on the union of a finite set of subsets of a metric space which is of a mixed cyclic and acyclic nature. The mixed nature is that the mappings can generate iterations in one of the subsets before eventual switching to their right adjacent one. The main purpose of defining and addressing such a mapping is to have in mind its potential application to the stabilization of dynamic systems submitted to state discontinuities in their state, which causes the differential systems of the equations which describe their dynamics to become impulsive at certain time instants.
The considered self-mapping has the following specific characteristics in the most general formal setting:
(a)
It is multivalued since it applies to each subset in the union set of itself with its right adjacent one and each domain point can have, in general, several image points in both such subsets;
(b)
It is of mixed cyclic and acyclic nature since it can perform several consecutive iterations within each of the subsets before switching to its right adjacent one;
(c)
The number of such consecutive iterations within each of the subsets before switching to its right adjacent one may vary dynamically around each cycle of complete running of the self-mapping on all the subsets. This fact facilitates the formal use of monitored iteration-dependent switches in stabilization applications;
(d)
It is not necessarily contractive between all the pairs of adjacent subsets of the configuration, although the most relevant properties are proved if the switches related to at least one of the pairs of adjacent subsets are contractive;
(e)
It can have also local non-expansive (being, furthermore, non-contractive) local properties between some of the pairs of adjacent subsets or even local expansive ones for some of the switches between the pairs of adjacent subsets;
(f)
The contractive, non-expansive or expansive constants associated with each of the subsets and in-between adjacent subsets which characterize the mapping are not necessarily identical and the distances between each pair of adjacent subsets are not necessarily identical either. Some of the results concerning the boundedness and the asymptotic boundedness of the distances between orbital points generated by the self-mapping iteration do not require specific conditions such as closeness or convexity on the involved subsets of the metric space or the uniform convexity of this one.
The paper is organized as follows. Section 2 gives a preliminary study for the mixed 2-cyclic/acyclic multivalued mapping (that is, being defined on two subsets of the metric space). The asymptotic boundedness of distances in the orbits from initial points in the union of sets are proved under certain global contractivity conditions of the whole mapping for groups of non-necessarily constant numbers of consecutive iterations. That property is proved without requiring that the involved subsets are closed. Section 3 extends and completes the former results for mixed p 2 -cyclic/acyclic multivalued mappings. Some specific related results are presented in Section 4 on the convergence of iterated sequences to best proximity points. The particular cases focused on in this section are that of the absence of local expansivity and the one of potential statement of monitored switching between adjacent subsets. Such a monitoring process is governed by a switching rule which operates in tandem with mixed p -cyclic/acyclic self-mapping and which establishes the iterations for switching between adjacent subsets to take place. Afterwards, some numerical examples concerned with an application for the stabilization of a discrete dynamic system subject to impulsive controls with monitored switching are discussed in Section 5. Finally, our conclusions end the paper.

Notation

Z 0 + = z Z : z 0 ,   Z + = z Z : z > 0 ,   n ¯ = 1 , 2 , , n ;
R 0 + = r R : r 0 ,   R + = r R : r > 0 ;
  • c l A denotes the closure of a set A and c a r d A is the cardinal of the set A ;
  • if T : i p ¯ A i i p ¯ A i is multivalued then T x is the image set of x i p ¯ A i through T which is, in particular, a singleton if T is single-valued. In the same way, T x i A i is the image set of x in A i through T ;
  • distances between points and distances between sets under a metric d : X × X R 0 + in a metric space X , d are denoted with the same notation, i.e., d x , y for x , y X and d A , B = i n f x A , y B d x , y for A , B being subsets of X .

2. Problem Statement for Two Subsets of Metric Space

Following [1], we define the following concepts for non-empty subsets A 1 , A 2 X , where X , d is a metric space:
P A i x = y X : d x , y = d x , A i   for   i = 1 , 2
D = d A 1 , A 2 = i n f d x , y : x A 1 , y A 2
A 01 = x A 1 : d x , y = D for some y A 2
A 02 = y A 2 : d x , y = D for some x A 1
Thus, P A 1 A 02 = y X : d A 02 , y = d A 02 , A 1 and P A 2 A 01 = y X : d A 01 , y = d A 01 , A 2 . Note that, for the sake of simplicity, the distances between sets and the distances from a point to a set via the d -metric are referred to with the same notation d . , . as the one used for distance between points. The sets of best proximity points A 01 A 1 and A 02 A 2 are non-empty if A 1 is compact and A 2 is approximatively compact with respect to A 1 , that is, every sequence x n n = 0 A 2 , such that d y , x n d y , A 2 as n for some y A 1 , has a convergent subsequence. It can be pointed out that there are examples where A 02 or B 02 may be empty even if A 1 and A 2 are non-empty. See, for instance, [2,3]. The following definition is quoted from the cyclic mappings in [1,2,3,4,5,6,7,8,9,10,11,12,13] and renamed “ad hoc” by indicating with “2” the particular cyclic context involving just two subsets of the metric space and the contraction constant.
Definition 1
([3,4,5,6]). Let A 1 and A 2 non-empty subsets of a metric space X , d and let T : A 1 A 2 A 1 A 2 , such that D = d A 1 , A 2 , and T A 1 A 2 and T A 2 A 1 . Then, T is said to be a 2 -cyclic contraction if, for all x A 1 and y A 2 and some k 0 , 1 ,
d T y , T x k d y , x + 1 k D
In the same way, if k = 1 then d T x , T y d x , y and T : A 1 A 2 A 1 A 2 is non-expansive and if d T x , T y > d x , y , then T : A 1 A 2 A 1 A 2 is expansive.
We now investigate some properties of boundedness and convergence of sequences of a multi-valued self-mapping T : A A , where A = A 1 A 2 with non-empty sets A 1 and A 2 being subsets of a metric space X , d . Note that self-mapping T : A A is not, in general, cyclic since the constraints T A 1 A 2 and T A 2 A 1 do not hold in such a way that each generated sequence through T from any initial point in A can have several successive iterated points in either A 1 or A 2 before switching either to A 2 or to A 1 . Therefore, the mapping is mixed cyclic and acyclic. Assume through the manuscript that T : A A satisfies the subsequent stipulations for x , y A :
T x = T x 1 , T x 2 ;   T x i A i   for   i = 1 , 2 ;   x A
k 0 d y , x d x 1 , y 1 = d T y 1 , T x 1 k 1 d y , x
for some k 0 , k 1 k 0 > 1 if x , y A 1 for some x 1 T x 1 , y 1 T y 1 ,
d x 2 , y 2 = d T y 2 , T x 2 k 2 d y , x
for some k 2 0 , 1 if x , y A 2 for some x 2 T x 2 , y 2 T y 2 ,
d x 3 , y 3 = d T y 2 , T x 1 k 12 d y , x + 1 k 12 D
for some k 12 0 , 1 if x , y A 1 for some x 3 , y 3 T x 1 × T y 2 T x 2 × T y 1 provided that d x , y D ,
d x 4 , y 4 = d T y 1 , T x 2 k 21 d y , x + 1 k 21 D
for some k 21 0 , 1 if x , y A 2 for some x 4 , y 4 T x 1 × T y 2 T x 2 × T y 1 provided that d x , y D ,
d x 5 , y 5 = d T y 1 , T x 2 k c d y , x + 1 k c D
for some k c 0 , 1 if x , y A 1 × A 2 A 2 × A 1 for some x 5 , y 5 T x 1 × T y 2 T x 2 × T y 1 .
Then, given x , y A × A , we can choose x , y T x i × T x j T x × T y A 1 × A 2 A 2 × A 1 for i , j = 1 , 2 , which satisfies one of the inequalities (3) to (6). The constraint (2) implies that each point in A has at least one image in A 1 and one image in A 2 through T : A A .
It is also assumed in the sequel that the best proximity sets of A i with respect to A j ; i , j i = 1 , 2 are non-empty, that is, A 0 j = x A j : d x , y = D for some y A i ; i , j i = 1 , 2 ; j = 1 , 2 .
The following technical assumption is made through the manuscript:
Assumption 1.
The metric d : X × X R 0 + of the metric space X , d is assumed to be homogeneous.
The above assumption is not necessary for the whole set of obtained results, in particular, for those referred to the upper-bounds of the distances associated with the mappings through the iterated calculations. However, it facilitates some of the mathematical proofs, in particular, those referred to excluding potential asymptotic unboundedness of distances from the implication that bounded distances can imply that of the sequences of points of X involved in the calculations of such distances. In particular, it can be pointed out that homogeneous and translation-invariant distances are norm-induced distances. A metric is said to be homogeneous if d α x , α y = α d x , y for α R and x , y X . It is said to be translation-invariant if d x + z , y + z = d x , y ; x , y , z X properties are jointly fulfilled, for instance, by norm-induced metrics on linear or vector spaces X since:
d α x + z , α y + z = α x + z y + z = α d x , y = α x y ;   x , y , z X ,   α R .
Typical widely-used metrics in applications such as, for instance, Euclidean and taxi-cab metrics fulfill those joint properties. Note also that the property that distances can asymptotically grow, leading to infinity limits (if some of the involved sequence of the points of X involved in their calculations is unbounded), is intuitively attractive and very useful in practical problems. This property is fulfilled by many usual distances, such as Euclidean distance, taxi-cab distance, Minkowski’s distance and others, but it is not inherent to the definition of distance. For instance, the discrete metric is never unbounded, irrespective of the involved pairs of points, since it is not greater than unity by definition. However, a homogenous distance is characterized by the property d α x , α y = α d x , y so that d α x , y = α d x , y / α α d x , 0 = α x and to infinity as α ± . Note that homogeneous distances are termed as absolutely homogeneous distances in some of the background literature.
Remark 1.
The above constraints (2)–(7) imply that the mapping is expansive on A 1 , contractive on A 2 and cyclic contractive for switchings between both sets if both k i j 0 , 1 . If k i j = 1 , then the switching from A i to A j when building the iteration step is not necessarily contractive, but it is non-expansive. Note that d T i + 2 x , T i + 1 x = m i n 1 i , j 2 d T i + 1 x i , T i + 1 x j ; i Z 0 + ; j , k = 1 , 2 for any x A . In particular, (3) is expansive, which applies to the images in A 1 of T : A A of the couples of the points x , y in A 1 , while (4) is a contraction which applies to the images in A 2 of T : A A of the couples of the points x , y in A 2 . Equation (5) is non-expansive, since k 12 1 , in particular, contractive if k 12 < 1 , for the images of two points x , y in A 1 , which are one in A 1 and the other one in A 2 . In the same way, the non-expansive (6) applies for images of the two points x , y in A 2 , which are one in A 1 and the other one in A 2 . Finally, (7) is a non-expansive or contractive rule which applies to points x , y , each in one of the sets A 1 and A 2 with images each in one of the sets but not necessarily alternated with respect to each of the original points. In the particular case that the images are alternated, the mapping is also cyclic according to (7).
Remark 2.
The various orbits O x 0 = x 0 , x 1 , x 2 , of initial point x 0 A might be generated according to x i + 1 T x i j T x i T i + 1 x 0 for some j 1 , 2 , i Z 0 + with T : A A being subject to one of the stipulations (2)–(7) for each successive iteration.
Note from (5) and (6) that if x , y A 1 or if x , y A 2 , then switches of T : A A the form T x , T y A 1 × A 2 do not take place if d x , y < D , implying that both x and y are either in A 1 or in A 2 , since, in this case, (5) and (6) would lead to the contradiction d T x , T y < D if k 12 0 , 1 or, respectively, k 21 0 , 1 . In order to also allow switchings of T : A A when d x , y < D (requiring necessarily x , y A or x , y B ) so that the constraint d x , y D is removed from (5) and (6) while keeping T : A A to be non-expansive at x , y , except if d x , y < D , the stipulations (5) and (6) on T : A A can be changed to the following ones:
x , y A T x 1 , T y 2 A 1 × A 2 d x , y D d T y 2 , T x 1 k 12 d y , x + 1 k 12 D for   some   k 12 0 , 1
x , y A T x 2 , T y 1 A 2 × A 1 d x , y D d T y 1 , T x 2 k 21 d y , x + 1 k 21 D for   some   k 21 0 , 1
x , y A x , y T x × T y d x , y < D x , y T x 1 × T x 2 T x 2 × T x 1
Note that, since d x , y < D implies that both T x and T y are in the same subset A 1 or A 2 , Equation (9) is identically expressed as follows:
x , y A 1 × A 1 A 2 × A 2 T x , T y A 1 × A 2 A 2 × A 1 d x , y < D d T y , T x D .
In the following, the main results are conducted under the stipulations (2)–(6) for the sake of exposition simplicity. Let us denote the sequel K i as the i -iteration constant for a sequence generated from any initial point in A and which can take any of the values k 1 , k 2 , k 12 and k 21 . Then, the following result holds for boundedness and convergence of distances between iterates of an orbit O x 0 = x 0 , x 1 , x 2 , of x 0 A for some sequence x i + 1 T x i i = 0 ; i Z 0 + .
Theorem 1.
Consider the orbits O x 0 = x 0 , x 1 , x 2 , of x 0 A = A 1 A 2 generated according to x i + 1 T x i j T x i T i + 1 x 0 for some j 1 , 2 , i Z 0 + with T : A A being subject to the stipulations (2)–(7). Then, the following properties hold:
(i) 
d x i + 1 , x i K i , 1 d x 0 , x 1 + M i , 1 K i , 1 d x 0 , x 1 + 1 K i , 1 D ;   i Z +
where
K i , 1 = k = 1 i K k ;   M i , 1 = k = 1 i = k + 1 i K M k ;   i Z +
where:
(a) 
K i = k j and M i = 0 if x i , x i + 1 A j ; j = 1 , 2 ,
(b) 
K i = k j and M i = 1 k j D if x i , x i + 1 A j and x i + 1 , x i T x i j × T x i 1 A j × A ; , j 1 , 2 ,
(c) 
K i = k c and M i = 1 k D if x i 1 , x i A 1 × A 2 A 2 × A 1 and x i + 1 , x i T x i 1 × T x i 1 2 T x i 1 2 × T x i 1 A 1 × A 2 A 2 × A 1 .
(ii) 
If Assumption 1 holds, then   d x i + 1 , x i i = 0 is bounded for x 0 A such that d x 0 , x 1 is finite and
m a x s u p i Z + K i , 1 , s u p i Z + M i , 1 < + ;   m a x l i m   s u p i K i , 1 , l i m   s u p i M i , 1 < +
(iii) 
If Assumption 1 holds and d x 0 , x 1 is finite, then d x i + 1 , x i i = 0 is bounded if it does not exist, a strictly increasing sequence of positive integers N k k = 1 with N 1 finite such that d x N k + 1 , x N k > d x N k + 1 , x N k ; N j N j j = 1 . Otherwise, if one such a sequence N k k = 1 exists, then d x i + 1 , x i i = 0 is unbounded.
(iv) 
Under Assumption 1, assume that d x 0 , x 1 is finite. Then d x i + 1 , x i i = 0 is bounded if the following constraints hold:
(C1) it exists a finite set or a sequence N k k = 1 χ Z + , with N 1 being finite and 1 χ such that
(C1a) the incremental sequence N k + 1 N k k = 1 χ 1 is bounded if χ , and N χ N χ 1 is bounded if χ < , while N χ N χ 1 is infinity if χ = (implying that N χ = ) and
( C 1 b ) M N k + 1 , N k 1 K N k + 1 , N k D 1 K N k + 1 , N k d x N k + 1 , x N k ;   k χ ¯
under the necessary condition K N k + 1 , N k 1 ; k χ ¯ . A sufficient condition for (14) to hold if D 0 is
M N k + 1 , N k / D 1 K N k + 1 , N k ;   k χ ¯
where
K N k + 1 , N k = j = N k N k + 1 K j ;   M N k + 1 , N k = i = N k N k + 1 = N k + 1 N k + 1 K M i ;   k χ ¯
(C2) Furthermore, if χ < then T i x i N χ + m A B 0 for some positive integer m .
(v) 
If d x 0 , x 1 is finite for a given x 0 A 2 , x 1 T x 0 2 A 2 and x i + 1 T x i 2 T i + 1 x 0 2 A 2 ; i Z 0 + then d x i + 1 , x i i = 0 is bounded and d x i + 1 , x i 0 as i . The same property holds for the sequence of distances between consecutive points on an orbit O x 0 = x 0 , x 1 , , x N , x N + 1 , if x 0 A 2 is such that d x 0 , T x 0 2 is finite with x i T i x 0 1 T i x 0 2 for i N and x i T i x 0 2 ; i > N Z 0 + for some finite nonnegative integer N .
Proof. 
One obtains from (2)–(7) that
d y i , x i = d T i y 0 j , T i x 0 k K i d y i 1 , x i 1 + M i ;   i Z + ;   x , y A ;   j , k = 1 , 2
where T 0 is the identity map and
(1)
K i = k j and M i = 0 if x i 1 T x i 2 j T i 1 x 0 j A j , y i 1 T y i 2 j T i 1 y 0 j A j with x i T x i 1 j T i x 0 j A j , y i T y i 2 j T i y 0 j A j for some j = 1 , 2 .
(2)
K i = k j and M i = 1 k j D if x i 1 T x i 2 j T i 1 x 0 j A j , y i 1 T y i 2 j T i 1 y 0 j A j for some j = 1 , 2 with x i , y i T i x 0 1 × T i y 0 2 T i x 0 2 × T i y 0 1 A 1 × A 2 A 2 × A 1
(3)
K i = k c and M i = 1 k D if x i 1 , y i 1 T x i 2 1 × T y i 2 2 T x i 2 2 × T y i 2 1 A 1 × A 2 A 2 × A 1 with x i , y i T x i 1 1 × T y i 1 2 T x i 1 2 × T y i 1 1 T i x 0 1 × T i y 0 2 T i x 0 2 × T i y 0 1 A 1 × A 2 A 2 × A 1
In the same way, one obtains by taking y 0 T x 0 ,
d x i + 1 , x i = d T i + 1 x 0 j , T i x 0 k K i d x i , x i 1 + M i = K i d x i 1 , T x i 1 k + M i ; x 0 A ,   i Z + ;   j , k = 1 , 2
where x i T i x 0 k and x i + 1 T i + 1 x 0 j for j , k 1 , 2 and M i = 0 and K i = k j if j = k and M i = 1 k k j D or M i = 1 k j k D or M i = 1 k c D if j k in view of (5)–(7) depending on the allocations in A 1 or in A 2 of the images of the original points and on the fact that those original points are in the same or in distinct sets A 1 or A 2 according to (5)–(7). Then, one obtains recursively from (17) that:
d y i , x i K i K i 1 d y i 2 , x i 2 + M i 1 + M i = K i K i 1 d T i 1 y j , T i 1 x k + M i 1 + M i
d y i , x i K i i , i 1 d y i 2 , x i 2 + M i , i 1 K i , 1 d x 0 , y 0 + M i , 1 ;   x 0 , y 0 A ,   i Z + ;   j , k = 1 , 2
with K i , i 1 = K i K i 1 and M i , i 1 = K i 1 M i 1 + M i and one obtains (11), from (20) via (14), by taking y 0 = x 1 T x 0 j , some j 1 , 2 . Then, properties (i) and (ii) follow directly. Property (iii) is direct since if N j j = 1 exists with d x N k + 1 + 1 , x N k > d x N k + 1 , x N k , then d x i + 1 , x i i = 0 is unbounded since it has one strictly increasing subsequence d x N k + 1 , x N k k = 0 . Otherwise, if no such a sequence N j j = 0 exists such that d x N k + 1 + 1 , x N k > d x N k + 1 , x N k , then d x i + 1 , x i i = 0 is bounded if d x 0 , x 1 = d x 0 , T x 0 j is finite for some x 1 T x 0 j and some j 1 , 2 , being the second point of the orbit of x 0 since all its subsequences are bounded. To prove property (iv), note that if d x i + 1 , x i i = 0 is bounded, then it has (at least) a finite maximum d x N 1 + 1 , x N 1 at a finite iteration step N 1 . If such a maximum is zero, then the sequence is identically zero and the proof follows directly. Assume now that d x N 1 + 1 , x N 1 , while it also has to exist that either a finite set or an infinity sequence of nonnegative integers N k k = 1 χ Z + 1 χ , with the incremental sequence N k + 1 N k k = 1 χ being bounded if χ = and N k + 1 N k k = 1 χ 1 being bounded and N χ = , is bounded if χ < so that
d x N k + 1 + 1 , x N k K N k + 1 , N k d T N k + 1 x 0 j , T N k x 0 + M N k + 1 , N k d x N k + 1 , x N k d x N 1 + 1 , x N 1 = m a x i Z 0 + d x 0 , x 1 ;   k χ ¯
for some j , 1 , 2 since d x N 1 + 1 , x N 1 is the finite maximum of consecutive distances between points of the orbit O x 0 = x 0 , x 1 , x 2 , of the initial point x 0 , where K N k + 1 , N k and M N k + 1 , N k are defined in (17). In order that (21) holds, the following constraint is required:
M N k + 1 , N k 1 K N k + 1 , N k d x N + 1 , x N k ;   k χ ¯
Since M N k + 1 , N k 0 with M N k + 1 , N k = 0 if and only if D = 0 , that is, if and only if c l A 1 c l A 2 = ; k χ ¯ and then (22) also holds under the stronger condition:
M N j + 1 , N j 1 K N j + 1 , N j D 1 K N j + 1 , N j d T N j + 1 x , T N j x ;   j χ 1 ¯
then, if K N k + 1 , N k 1 ; k χ ¯ and, furthermore, M N k + 1 , N k / D 1 K N k + 1 , N k ; j χ ¯ if D 0 . Property (iv) has been proved. The proof of property (v) follows directly from property (iv) since there is no switch from A 2 to A 1 , then K i , 1 = k 2 i < 1 , M i , 1 = 0 ; i Z + , K i , 1 0 as i . The same property also holds for any orbit which does not contain points of the mapping iterates in A 2 , after some finite number of iterations, for any given initial point x 0 in A such that d x , T x 2 is finite generates the sequence. □
Remark 3.
For the distance sequences generated from any finite initial point x 0 A 1 A 2 , some intuitive consequences of Theorem 1 are:
(1) 
It is not relevant that the sets A 1 and A 2 be necessarily either bounded or closed for the eventual boundedness of any iterated sequence of distances generated from any point x 0 A 1 A 2 such that d x 0 , x 1 = d x 0 , T x 0 j is finite for some x 1 T x 0 j and some j 1 , 2 . This is an “a priori” hypothesis, equivalent in fact to the initial distance to be defined in order to give conditions for the sequence of distances between consecutive iterates not to be unbounded.
(2) 
The distance sequences is unbounded if x 0 A 1 and T A 1 A 1 , i.e., all the iterations are in A 1 from (3) since, from (14), K i , 1 = k 1 i > 1 and M i , 1 = 0 ; i Z + and K i , 1 as i . The same happens if all the iterations are in A 1 after a finite iteration step N .
(3) 
The distance sequence is bounded and convergent to zero if x 0 A 2 and T A 2 A 2 , i.e., all the iterations are in A 2 from (4) since, from (14), K i , 1 = k 2 i 1 < 1 and M i , 1 = 0 ; i Z + and K i , 1 0 as i . The same happens if all the iterations are in A 2 after a finite step N .
(4) 
The distance sequence is bounded if, after some finite iteration step N , each member alternates switches iteration-to-iteration from A 1 to A 2 and from A 2 to A 1 since the distance is bounded after the finite number N of iterations prior to the first switching (if the initial generating point x 0 is such that d x 0 , x 1 is finite) and since the mapping T : A 1 A 2 A 1 A 2 is both non-expansive and cyclic for the successive iterations i > N from (5) and (6) since k i j 1 for i , j = 1 , 2 so that
D d x i + 1 , x i = d x i , T x i j = d T x i 1 k , T x i j d x i , x i 1 = d T x i 1 k , x i 1 D x i + 1 T x i j ,   x i T x i 1 ,   x 0 A ,   j , k j 1 , 2 , i > N Z + .
(5) 
In order for (15) to hold for some sequence N k k = 1 χ Z + with N 1 finite, 1 χ , with the incremental sequence N k + 1 N k k = 1 χ being bounded such that the distance sequence boundedness conditions (15) or (16) hold, it is sufficient that:
(a) 
either the mapping becomes cyclic after a finite number of steps (see the above Remark 3(4)), or
(b) 
it remains confined to iterations within A 2 after a finite number of steps or, if there are non-successive switches from A 1 to A 2 and from A 2 to A 1 , then switches are ruled to satisfy the conditions (15) or (16) of Theorem 1 (iv).
(6) 
The condition C2 of Theorem 1(iv), T i x 0 i N χ + m A 2 A 01 if χ < , means that, after a finite number of iterations, the successive iterates only are in A or in the best proximity set of A 1 with respect to A 2 . In other words, if infinitely many iterates of T i x 0 are alternated in A 2 and A 1 \ A 01 , then χ = , that is, the sequence N k k = 1 χ is infinite to ensure the boundedness of the distance sequence.
The following result gives explicit conditions on particular conditions for successive iterates for Theorem 1 (iv) to hold:
Proposition 1.
Under Assumption 1, assume also that d x 0 , x 1 is finite for a given x 0 A and consider orbits O x 0 = x 0 , x 1 , x 2 , of x 0 A generated by x i + 1 T x i j T x i T i + 1 x 0 for some j 1 , 2 , i Z 0 + , with T : A A being subject to the stipulations (2)–(7).
(1) 
Let p j k Z 0 + be the total number of (non-necessarily consecutive) iterations T i x 0 j from x i 1 , x i A j to x i + 1 A j ; j 1 , 2 for iteration indices i N k , N k + 1 , k χ ¯ according to (3) and (4);
(2) 
let p j k Z 0 + be the total number of iterations from x i 1 , x i A to x i + 1 A j for , j = 1 , 2 for iteration indices i N k , N k + 1 , k χ ¯ satisfying the constraints (5) and (6); and
(3) 
let p c k Z 0 + be the total number of (non-necessarily consecutive) iterations T i x 0 j from x i 1 , x i A 1 × A 2 to x i + 1 A 1 and from x i 1 , x i A 2 × A 1 to x i + 1 A 2 for iteration indices i N k , N k + 1 , k χ ¯ according to (7).
Then, d x i + 1 , x i i = 0 is bounded if, for some real constant 0 a 1 , there exists a non-negative real sequence a k k = 1 χ 0 , a such that
p 1 k 1 l n k 1 p 2 k l n k 2 + p 12 k l n k 12 + p 21 k l n k 21 + p c k l n k c l n a k ;   k χ ¯
if D = 0 or if D > 0 and p 12 k = p 21 k = p c k = 0 ; k χ ¯ , and
p 1 k < 1 l n k 1 p 2 k l n k 2 + p 12 k l n k 12 + p 21 k l n k 21 + p c k l n k c l n a k ;   k χ ¯
if D > 0 and p 12 k + p 21 k + p c k > 0 ; k χ ¯ .
Proof. 
Note from (12) and (17), and K N k + 1 , N k 1 ; k χ ¯ in Theorem 1 (iv) that
K N k + 1 , N k = j = N k N k + 1 K j = k 1 p 1 k k 2 p 2 k k 12 p 12 k k 21 p 21 k k c p c k 1 ;   k χ ¯
subject to the constraint:
N k + 1 N k + 1 = p 1 k + p 2 k + p 12 k + p 21 k + p c k ;   k χ ¯
where p 1 k , p 2 k , p 12 k , p 21 k , p c k N k + 1 N k + 1 ¯ 0 are the respective non-necessarily consecutive numbers of iterations T i x 0 j for i N k , N k + 1 , j 1 , 2 ; k χ ¯ satisfying the constraints (1)–(7). Define also:
K ¯ N k + 1 , N k = k ¯ 1 p 1 k k ¯ 2 p 2 k k ¯ 12 p 12 k k ¯ 21 p 21 k k ¯ c p c k ;   k χ ¯
with k ¯ j = 1 , k ¯ c = k c , k ¯ j = k l j ; , j = 1 , 2 , which allows us to rewrite compactly M N k + 1 , N k as
M N k + 1 , N k = k 1 p 1 k k 2 p 2 k 1 K ¯ N k + 1 , N k D = k 1 p 1 k k 2 p 2 k 1 k ¯ 12 p 12 k k ¯ 21 p 21 k D ;   k χ ¯
after rewriting the upper-bounds of (2)–(7) under the equivalent forms:
k j d y , x + 1 k ¯ j D ;   k j d y , x + 1 k ¯ j D ;   , j = 1 , 2 ;   k c d y , x + 1 k ¯ c D
since K ¯ N k + 1 , N k = k 12 p 12 k k 21 p 21 k if p 12 k + p 21 k + p c k > 0 and K ¯ N k + 1 , N k = 1 if p 12 k + p 21 k + p c k = 0 p 12 k = p 21 k = p c k = 0 ; k χ ¯ .
The constraint (15) with K N k + 1 , N k 1 of Theorem 1 (iv) for guaranteeing the boundedness of the distance sequences are k 1 p 1 k k 2 p 2 k k 12 p 12 k k 21 p 21 k k c p c k a N k a 1 , from (26) by taking into account that l n k 2 = l n k 2 , l n k c = l n k c and l n k j = l n k l j for j , j 1 , 2 , or equivalently from (24), provided that D = 0 , that is, c l A 1 c l A 2 , or under the strict inequality k 1 p 1 k k 2 p 2 k k 12 p 12 k k 21 p 21 k k c p c k < a N k < a 1 , equivalent to (25), provided that both D > 0 , that is, c l A 1 c l A 2 = , and p 12 j = p 21 j = p c k = 0 , so that K ¯ N k + 1 , N k = 0 in (27), implying that there is no crossed iteration from A 1 to A 2 or vice-versa. □
It turns out that Proposition 1 still holds under the non-strict inequality (24) if the total number of crossed iterations from A 1 to A 2 or vice-versa are finite. Thus, one has the subsequent direct extension of Proposition 1:
Proposition 2.
Under Assumption 1, d x i + 1 , x i i = 0 is bounded under the stipulations of Proposition 1 if, for some real constant 0 a 1 , there exists a non-negative real sequence a k k = 1 χ 0 , a such that (24) holds and D = 0 or, if D > 0 and k = 1 p 12 k + p 21 k < .
It turns out that, in order for the sequences of distances between consecutive points of any orbit for some initial point x 0 A , it is necessary that T : A A can have image points in A 2 for such a x 0 A 1 .
Proposition 3.
A multi-valued mapping T : A A which has bounded distance sequences according to Proposition 1, or to Theorem 1(iv), for any orbit O x 0 = x 0 , x 1 , x 2 , from some given initial point x 0 A 1 has to fulfill T N 1 x 0 A 2 for some finite integer N 1 = N 1 x 0 . The above property holds for any orbit O x 0 = x 0 , x 1 , x 2 , from any given initial point x 0 A 1 if and only if T N 1 x 0 x 0 A 2 for finite integer N 1 = N 1 x 0 depending on each x 0 A 1 .
Proof. 
It follows since if T n x 0 A 1 for x 0 F T A 1 , n N and any finite non-negative integer N , then d T i + 1 x 0 1 , T i x 0 1 i = 0 , since k 0 i N d T N x 0 1 , T N + 1 x 0 1 as i N so that it is not possible to fulfill either the constraints (24) and (25) of Proposition 1 or the conditions of Theorem 1 (iv). □
Definition 2.
The partial orbit O 0 , i x 0 of the orbit O x 0 of x 0 A through T : A A is an ordered set defined recursively by O 0 , i x 0 = O 0 , i x 0 , x i for some x i T i x 0 with O 0 , 0 x 0 = x 0 = T 0 x 0 ; i Z + .
Remark 4.
Note that if T i x 0 belongs to A and T i + 1 x 0 belongs to A j ; j , j 1 , 2 , then the partial orbit O 0 , i + 1 x 0 = O i x 0 , x i + 1 x i + 1 T i + 1 x 0 j T i + 1 x 0 with O 0 , 0 x 0 = x 0 = T 0 x 0 ; i Z 0 + has a switch of set in the generation of its last member. Thus, one of the non-expansive constraints (5) or (6) has been used to incorporate the new element of the orbit. Note also that unconditional switchings from A 1 to A 2 or vice-versa are not allowed at any arbitrary iteration if T : A A is single-valued. Therefore, the results of Theorem 1 and Propositions 1–3 concerning the boundedness and the convergence of the distance sequences cannot be monitored towards the fulfilment of Theorem 1or Propositions 1–3.
It turns out that the particular cases k 21 = k 1 > 1 and k 12 = k 2 = k c < 1 are also covered by the above more general formulation. This suggests that switchings from A 2 to A 1 are expansive as they are the successive iterates within A 1 , while switchings from A 1 to A 2 are contractive as they are the successive iterates within A 2 . The lost on non-expansivity of switches from A 2 to A 1 does not modify the essence of the above given results. This is seen in short as follows. Assume that k 21 = k 1 > 1 and take x 0 A , x 1 T x 0 2 and x 2 T x 1 1 that satisfy:
d x 2 , x 1 k 1 d x 1 , x 0 + 1 k 1 D = k 1 d x 1 , x 0 k 1 1 D
The necessary condition d x 2 , x 1 D is compatible with the above upper-bound since k 1 d x 1 , x 0 k 1 1 D D k 1 1 D 0 . At the same time the fact that the mapping is expansive from x 1 to x 2 such that
d x 1 , x 0 < d x 2 , x 1 k 1 d x 1 , x 0 k 1 1 D
agrees with d x 1 , x 0 > D , while it keeps as locally non-expansive if d x 2 , x 1 = d x 1 , x 0 = D , i.e., if x 1 T x 0 2 A 02 , and x 2 T x 1 1 A 01 under the necessary assumption that T x 0 j A 0 j for j = 1 , 2 . Thus, once a switching to A 2 holds which is expansive if d x 1 , x 0 > D , it can remain in A 2 leading to the orbit to be contractive in A 2 and converging to some x 2 F T if F T A 2 and A 2 is closed.

3. Problem Statement for p Subsets of a Metric Space

Now, define p non-empty subsets A i X with D i = d A i , A i + 1 for i p ¯ and A p + 1 A p p 2 , where X , d is a metric space and consider a self-mapping T : i p ¯ A i i p ¯ A i . The terminology is used such that A i and A i + 1 are adjacent subsets, A i + 1 is the right adjacent subset to A i , while A i is the left adjacent subset to A i + 1 ; i p ¯ . In order to keep a simple notation, we will denote in the sequel by T : A i A i A i + 1 for any given i p ¯ the restricted multivalued map from a set to the union to itself with its right adjacent one T : j p ¯ A j | A i j p ¯ A j | A i A i + 1 .
Through this section, the main ideas of the former section are kept but, in order to simplify the exposition, the following assumptions are made:
(A1) The multivalued mapping T : i p ¯ A i i p ¯ A i is mixed p -cyclic/acyclic in the sense that T A i A i A i + 1 for i p ¯ with A p + 1 A 1 such that for each x 0 A i and each i p ¯ , T x 0 = T x 0 i , T x 0 i + 1 with T x 0 i A i .
(A2) A finite number n i Z 0 + of iterated images of x 0 in A i may happen before switching to its right adjacent subset A i + 1 when constructing an orbit. That is, a partial orbit O 0 , n i + 1 x 0 with initial point x 0 in A i is O i x 0 = x 0 , x 1 , , x n i , x n i + 1 , where x j T j x 0 i for j n ¯ i , x 0 = T 0 x 0 i and x n i + 1 T n i + 1 x 0 i + 1 . If n i is infinity, then A i is the terminal set with no further switchings of T : A i A i A i + 1 | A i to its right adjacent subset.
The number n i is admitted to be varying for each cycle of T : i p ¯ A i i p ¯ A i running all the subsets A i ; i p ¯ .
(A3) p ¯ = p c p n e p e with p e , p n e and p c being pair-wise disjoint defined by:
p c = i p ¯   such   that   T : A i A i A i + 1   satisfies   condition   C c p ¯
p n e = i p ¯   such   that   T : A i A i A i + 1   satisfies   condition   C n e p ¯
p e = i p ¯   such   that   T : A i A i A i + 1   satisfies   condition   C e p ¯
which are indexing the disjoint subsets S c = A i : i p c , S n e = A i : i p n e and S e = A i : i p e , where T : A i A i A i + 1 | A i are contractive, non-expansive being non-contractive and expansive, respectively, where:
(a)
the contraction condition C c is defined as follows:
d T x i , T y i k i d x , y ;   m a x d T x i + 1 , T y i , d T x i , T y i + 1 k i d x , y + 1 k i D i ; x , y A i   for   i p c   and   some   real   constants   k i 0 , 1 ,   k i k i , k ¯ i ;   i p c
(b)
the non-expansivity condition is defined as follows:
d T x i , T y i k i d x , y ;   m a x d T x i + 1 , T y i , d T x i , T y i + 1 k i d x , y + 1 k i D i ; x , y A i   for   i p n e   and   some   real   constants   k i = 1 ,   k i 1 , k ¯ i ;   i p n e
(c)
the expansivity condition C e is defined as follows:
k 0 i d x , y d T x i , T y i k i d x , y ; k 0 i d x , y + k 0 i 1 D i min d T x i + 1 , T y i , d T x i , T y i + 1 m a x d T x i + 1 , T y i , d T x i , T y i + 1 k i d x , y + k i 1 D i ; x , y A i   for   i p e   and   some   real   constants   k 0 i , k i k 0 i > 1 ,   k i k i , k ¯ i ,   k 0 i k i , k ¯ 0 i ;   i p e
(d)
The switching from A i to its right adjacent subset A i + 1 in (33), and in (31) and (32) if k i > 1 , are performed only provided that d x , y > k i 1 k i D i if x , y A i for any i p ¯ .
Note that, in order to simplify the exposition, the contractive or expansive constants for iterations within subsets k . are assumed identical to their counterparts related to switching from a subset to its right adjacent one. Note also that, although contractive conditions are also inherently non-expansive, we consider each one of them, in the above characterization, specifically as “contractive· or as “non expansive” according to the constant k i being either less than unity or unity. Thus, by convenience, the set S c is not included in the set S n e so that S c S n e . It turns out that from the above constraints the restricted images of T : A i A i A i + 1 | A i (i.e., the mapping T from the respective subset Ai to itself) are contractive, non-expansive and expansive, respectively. However, the respective restrictions to each reach right adjacent subset T : A i A i A i + 1 | A i + 1 are not guaranteed to be contractive or non-expansive since k ¯ i can exceed unity. This tries to reflect the practical fact that switching actions from a subset to its right adjacent one can have an instability cost due to the switching itself even if iterations within that right adjacent subset are contractive. We can think here, for instance, about the modeling through ordinary differential equations of a dynamical system subject to impulsive controls which can make the state norm to grow by huge amounts at the sampling instants where impulses happen.
Note that the condition d x , y > k i 1 k i D i if x , y A i for switching to A i + 1 any i p ¯ ensures that the upper-bounds in the conditions (31)–(33) are well posed since k i d x , y + 1 k i D i > 0 for any i p ¯ .
Proposition 4.
A sufficient condition guaranteeing that the expansivity condition C e is well posed is that, for any A i S e , Assumption A4 below holds:
(A4) d i a m A i + 1 k 0 i d i a m A i if k 0 i = 2
D i m a x 0 , k 0 i d i a m A i d i a m A i + 1 2 k 0 i   if   k 0 i 2
Proof. 
It follows since, for the first inequality of (33) to hold in the worst case, that is, for the largest possible value of d x , y for x , y A i , which is d x , y = s u p x , y A i d x , y = d i a m A i , it is sufficient that for i P e A i S e : k 0 i d i a m A i + k 0 i 1 D i d i a m A i + 1 + D i which gives the result. □
Remark 5.
Since we will usually work only with conditions for the boundedness and convergence of sequences, only the upper-bound of (24) will be addressed through the constants k i and k i . However, note that the upper-bound does not guarantee directly that the mapping T : A i A i A i + 1 is expansive but just that it is not guaranteed to be non-expansive.
Now, consider an orbit O x 0 from an initial point x 0 i p ¯ A i such that x 0 = T 0 x 0 , x j + 1 T x j i T x j i + 1 T j x 0 i p ¯ A i provided that x j A i for some i p ¯ ; j Z 0 + . Denote the partial orbit of O k , k + N k x 0 on k , k + N k for some N k Z 0 + and a given k Z 0 + as O k , k + N k x 0 = x k , x k + 1 , , x k + N k . Then, all the points of the partial orbit belong to A , A l + 1 , , A j for some , j p ¯ with eventual n i = n i x 0 Z 0 + iterations within of the various sets A i , for each i , j , together with eventual iteration switches i i + 1 to their right adjacent ones.
The following result holds which implies that the sequence of distances is bounded provided that p e is non-empty, that is, there is at least one subset A i for i p ¯ , where T : A i A i A i + 1 | A i is contractive, according to (31), and that each cycle has a sufficiently large number of iterations in S c = A i : i p c .
Theorem 2.
Under Assumptions A1 to A4, the following properties hold:
(i) 
Consider a complete cycle of N k consecutive iterations on all the subsets A i , i p ¯ on the integer interval k , k + N k starting from x k T k x 0 T k x 0 A for some x 0 i p ¯ A i , some = k p ¯ and some k Z 0 + which has n i k , k + N k consecutive iterations within A i before switching to A i + 1 for each i p ¯ . Thus, one has for the partial orbit O k , k + N k x 0 on k , k + N k the following relation of distances:
d x k + N k + 1 , x k + N k K 1 k , k + N k d x k + 1 , x k + i = 1 p K i + k , k + N k 1 k i + 1 D i + 1
K 1 k , k + N k d x k + 1 , x k + D ^ i = 1 p 1 / j = 1 i 1 k j n j k , k + N k k j
under the identities k i + = k i + p , k i + = k i + p and D i + = D i + p , if i + > p ; i , p ¯ , where N k = p + i = 1 p n i k , k + N k and
K i k , k + N k = j = i p k j n j k , k + N k k j = K 1 k , k + N k / j = 1 i 1 k j n j k , k + N k k j ;   i p ¯
(ii) 
Assume, in addition, that N k + j 1 j = 0 χ Z + χ with N k 1 = k for the given k Z 0 + is the sequence of integers with the associated incremental sequence N k + j N k + j 1 j = 0 χ , which contains element-to-element the number of iterations, each of them being associated with a complete cycle on all the subsets A i for i p ¯ , that is, N k + 1 = N k + p + i = 1 p n i N k , N k + 1 with N k , N k + 1 , N k + 2 N k + j 1 j = 0 χ and
1 δ k = δ + i = + δ n i N k + 1 , N k + 1 + δ k < N k + 2 N k + 1
where δ p 1 ¯ contains δ switches between right adjacent subsets and δ k is the total number of switches which have happened since the iteration N k + 1 .
Then, the distances d x N k + 1 + 1 , x N k + 1 and d x N k + 1 + δ , x N k + 1 + 1 for δ p 1 ¯ , related to the two pairs of elements x N k + 1 + 1 , x N k + 1 and x N k + 1 + δ , x N k + 1 + 1 of the partial orbit O N k , N k + 1 + δ x 0 on N k , N k + 1 + δ , satisfy the constraints:
d x N k + 1 + 1 , x N k + 1 K 1 N k , N k + 1 d x N k + 1 , x N k + i = 1 p K i + N k , N k + 1 1 k i + 1 D i + 1 = K 1 N k , N k + 1 d x k + 1 , x k + i = + p 1 K i + 1 N k , N k + 1 1 k i D i
d x N k + 1 + δ k , x N k + 1 + δ k 1 K 1 N k + 1 , N k + 1 + δ k d x N k + 1 + 1 , x N k + 1 + i = 1 δ K i + N k + 1 , N k + 1 + δ 1 k i + 1 D i + 1 = K 1 N k + 1 , N k + 1 + δ k d x N k + 1 + 1 , x N k + 1 + i = + δ 1 K i + 1 N k + 1 , N k + 1 + δ k 1 k i D i
for x N k , x N k + 1 T N k x 0 T N k x 0 A ; some p ¯ , k Z 0 + , where:
K i + N k , N k + 1 = j = i + + p 1 k j n j N k , N k + 1 k j ;   i p ¯ ,   p ¯
K i + N k + 1 , N k + 1 + δ k = j = i + + δ 1 k j n j N k + 1 , N k + 1 + δ k k j ;   i p ¯ , p ¯ ,   δ p 1 ¯
(iii) 
Assume furthermore that, for the sequence N k + j 1 j = 0 χ Z + of property (ii), s u p Z 0 + K 1 N j + 2 , N j + 1 1 ε , for some ε 0 , 1 , and assume also that
d x k + 1 , x k s u p Z 0 + K 1 N k + 2 , N k + 1 D ^ 1 K 1 N k + 2 , N k + 1 j = 1 i 1 1 j = 1 i 1 k j n j N k + 2 , N k + 1 k j
with N k 1 = k for the given k Z 0 + such that x k T k x 0 T k x 0 A for some = k p ¯ and assume also that d x 0 , x k is finite. Then, s u p Z 0 + d x N k + l + 1 , x N k + l d x k + 1 , x k . If s u p j Z 0 + d x N k + j + 1 , x N k + j d x k + 1 , x k and if
(1) 
either s u p j Z 0 +   i = 1 p n i N k + j 2 , N k + j + 1 n ¯ < and χ = (i.e., there are infinity many switches from a subset to its right adjacent one but not infinitely many iterations in a subset A i prior to switching to the right adjacent one), or
(2) 
if χ < and there are infinitely many iterations n i within in a final set A i being either non-expansive (including the contractive case) subject, furthermore, to k i 1 ,
Then the sequence of distances d x i , x i + 1 i = 0 for adjacent points of the orbit O x 0 is bounded. Furthermore,
l i m   s u p j d x N k + j + 1 , x N k 1 ε i = 1 p s u p j χ ¯ K i + N j , N j + 1 1 k i + 1 D i + 1 < +
As a result, all sequences of distances d x i , x i + j i = 0 ; j Z 0 + are also bounded.
Proof. 
Properties [(i) and (ii)] follow directly from the application of (31)–(34) where k Z 0 + is arbitrary, with d x 0 , x k , being finite and = k p ¯ is such that x k T k x 0 T k x 0 A , and N j j = 0 χ Z + χ , with N 0 = k , is the sequence of complete iterations along the p subsets A i . Property (iii) follows since (42) under the constraint K 1 N k + 2 , N k + 1 1 ε yields s u p Z 0 + d x N k + + 1 , x N k + d x k + 1 , x k . Furthermore, if s u p j Z 0 + i = 1 p n i N k + j 2 , N k + j + 1 n ¯ < and χ = , then the sequence of distances d x i , x i + 1 i = 0 cannot be unbounded for intermediate iterations within the sequence of finite intervals N k + 1 N k k = 0 χ so that it is bounded. It also follows from (38) that
d x N k + j + 1 , x N k K 1 j N k , N k + 1 d x N k + 1 , x N k + = 1 j 1 i = 1 p K 1 N k , N k + 1 s u p j χ ¯ K i + N j , N j + 1 1 k i + 1 D i + 1 1 ε j d x N k + 1 , x N k
+ 1 1 ε j ε i = 1 p s u p j χ ¯ K i + N j , N j + 1 1 k i + 1 D i + 1
and (43) holds since 1 ε j 0 as j . A similar result is found if χ < , that is there is some subset A i for i p ¯ where infinitely many terminal iterations take place with no later switch to its right adjacent one A i + 1 under the assumption that m a x k i , k i 1 , that is, the terminal iterations are non-expansive (eventually contractive) with k i 1 . □
Note that the conditions s u p Z 0 + K 1 N j + 2 , N j + 1 1 ε and s u p j Z 0 + i = 1 p n i N k + j 2 , N k + j + 1 n ¯ < are key stipulations for the boundedness of the distances between consecutive points of the orbit O x 0 in Theorem 2 (iii). This can be fulfilled with at least one of the subsets in S c = A i : i p c and a sufficiently large n i , for A i S c , compared to n ¯ being dependent on the value of the contractivity condition k i 0 , 1 . On the other hand, note that any distances d x i , x i + j + 1 i = 0 for any finite j Z 0 + are bounded from the use of the triangle inequality for distances and the above proved property s u p Z 0 + d x N k + + 1 , x N k + d x k + 1 , x k for the given k Z 0 + since for some finite real constant M > 1 :
d x i + j + 1 , x i = 0 j d x i + + 1 , x i + M d x N k + m + 1 , x N k + m M d x k + 1 , x k < +
for some m = m i , j Z 0 + and some N k N k k = 0 χ ¯ . However, according to (43), the above result also holds for any (even infinity) j Z 0 + .
Example 1.
Note that d x N k + j + 1 , x N k in (43) has to be not smaller than the corresponding distance between adjacent subsets provided that the involved points belong to adjacent subsets. For instance, assume that p = 2 , k 1 = k 1 k 01 > 1 and k 2 = k 2 < 1 , that is, the mapping T : A 1 A 2 A 1 A 2 is expansive in A 1 and contractive in A 2 . Assume that all the cycles have the same number of iterations en each of the subsets taken as n 1 = 0 within A 1 and n 2 = 1 within A 2 . Under Theorem 2 (iii), K 1 = k 2 2 k 1 < 1 for each cycle of iterations on both subsets to be contractive. Identifying d x N k + j + 1 , x N k with d x j + 1 , x j with one of each points within one subset, one obtains from (43) that
l i m s u p j d x j + 1 , x j D ^ = k 2 2 k 1 1 + 1 k 2 1 k 2 2 k 1 D d A 1 , A 2 = D
under the necessary assumption that k 2 2 k 1 1 1 , which, together with k 2 2 k 1 < 1 , yields 1 / k 1 > k 2 1 / 2 k 1 1 , subject to 1 < k 1 < 2 k 1 1 2 .
Now, consider the alternative problem without iterations within neither A 1 nor A 2 so that n 1 = n 2 = 0 . In this case, k 2 < 1 / k 1 and an “ad hoc” redefinition of D ^ leads to D ^ = k 2 k 1 1 + 1 k 2 1 k 2 k 1 D D under the necessary condition k 2 2 k 1 2 0 , which holds since k 1 > 1 if k 2 < 1 / k 1 < 1 . It turns out that the maximum allowable k 2 is smaller than the one for the above case.
Example 2.
Consider p = 3 for subsets A i with none internal iterations within any of the subsets before switching to each right adjacent subset, i.e., n i = 0 for i 3 ¯ , subject to k 1 = k 1 k 01 > 1 and 0 < k i = k i < 1 for i = 2 , 3 . Assume four possible cases to guarantee that D ^ = m a x 1 i 3 D i :
(a) 
D i = D = d A i , A i + 1 ; i 3 ¯ with A 4 A 1 . Then,
D ^ = k 3 k 2 k 1 1 + k 3 1 k 2 + 1 k 3 1 k 3 k 2 k 1 D D
which holds trivially identical to 2 k 3 k 2 k 1 1 0 since k 1 > 1 .
(b) 
D i = d A i , A i + 1 can be eventually distinct subject to D 1 D 2 = D 3 so that
D ^ = k 3 k 2 k 1 1 D 1 + 1 k 3 k 2 D 2 1 k 3 k 2 k 1 D 1
which holds if
k 3 k 2 k 1 1 + k 3 k 2 k 1 1 D 1 + 1 k 3 k 2 D 2 0
for which it is sufficient that, since D 1 D 2 , k 3 k 2 k 1 1 + k 3 k 2 k 1 k 3 k 2 0 , which holds directly since k 1 > 1 .
(c) 
D 1 < D 2 = D 3 so that D ^ D 2 > D 1 so that
D ^ = k 3 k 2 k 1 1 D 1 + 1 k 3 k 2 D 2 1 k 3 k 2 k 1 D 2 > D 1
which holds if
k 3 k 2 k 1 1 D 1 + 1 k 3 k 2 D 2 D 2 + k 3 k 2 k 1 D 2 0
for which it is sufficient, since D 2 > D 1 , k 3 k 2 k 1 1 D 1 + k 3 k 2 D 1 + k 3 k 2 k 1 D 1 0 , which holds directly since 2 k 1 D 1 0 .
(d) 
Now assume that k i = k i = k < 1 for i 3 ¯ so that the redefined D ^ is
D ^ = k 2 1 k + k 1 k + 1 k 1 k 3 D = k 2 k 3 + k k 2 + 1 k 1 k 3 D = 1 k 3 1 k 3 D = D
which is a known property of 3 -cyclic contractions.
Example 3.
The convergence of the distances to the best proximity points is not possible if the mapping is expansive for switching actions from a set to its adjacent one, and there is one expansive contraction that is not possible for the case of only two sets A 1 and A 2 , i.e., p = 2 when the closures of such sets (or themselves if they are closed) do not intersect; i.e., the constraint D ^ = D 1 = D is not feasible. Note that at the limit for infinitely many iterations, the subsequent relations
k 01 D + k 01 1 D D ^ m i n i = 1 , 2 k i D + 1 k i D = k 2 D + 1 k 2 D = D
should hold, that is 2 k 01 1 D 0 , which only holds if and only if D = 0 , i.e., if and only if c l A 1 c l A 2 since k 01 > 1 .
If there are three involved sets A 1 , A 2 and A 3 , i.e., p = 3 , with one expansive mapping T : A 1 A 2 A 3 A 1 A 2 A 3 for the switches from A 1 to A 2 , while those from A 2 to A 3 and from A 1 to A 3 are contractive, one has the following limit constraint relations to guarantee the eventual convergence of the distances for D ^ = D 2 if D 2 = D 3 = λ D , D 1 = D :
k 01 D + k 01 1 D D ^ λ m i n i = 1 , 2 k i D + 1 k i D = λ k 2 D + 1 k 2 D = λ D
implying that 2 k 01 λ D 0 so that either D = 0 , that is, c l A 1 c l A 2 , or λ > k 01 so that D 2 = D 3 = λ D > k 01 D so that, even, if D ^ = D 2 = D 3 , then D ^ D 1 = D , and then the convergence of the distances to D 1 or that of the involved points to the best proximity points of A 1 and A 2 is not possible.
Note that Theorem 2 (iii) also implies the boundedness of the elements of any orbit O x 0 , what is now termed as such an orbit being bounded, as it is now specifically addressed:
Theorem 3.
Under Assumptions A1 to A4, consider any orbit O x 0 with bounded initial point x 0 = T 0 x 0 i p ¯ A i , x j + 1 T x j i T x j i + 1 T j x 0 i p ¯ A i . If Theorem 2 (iii) holds, then such an orbit O x 0 is bounded.
Proof. 
It is obvious from generation of the orbit O x 0 , for some given initial point x 0 i p ¯ A i , that x j T j x 0 T j x 0 A j for some j = j p ¯ , j k ¯ and any given finite k Z 0 + . The partial orbit O 0 , k x 0 = O k 1 x 0 , x k is bounded since k Z 0 + is finite and x 0 is bounded. Since k is finite then d x 0 , x k is finite. Now, assume that there is some sequence x n n = 0 i p ¯ A i which has an unbounded subsequence x n m m = 0 with n 0 k . Since l i m   s u p j   d x N k + j + 1 , x N k < , take N k to be sufficiently closer to n k by taking the advantage that the incremental sequence N k + j N k + j 1 j = 0 χ with N k 1 = k , for the given k Z 0 + , is bounded and one obtains also from (43) that if the subsequence x n m m = 0 x n n = 0 is unbounded, then the following contradiction holds since x k T k x 0 T k x 0 A for some = k p ¯ and some finite k Z 0 + , so that x k is finite:
+ = l i m s u p m d x n m , x k l i m s u p m d x n m , x N m + l i m   s u p m , j d x k , x N n m l i m   s u p m d x n m , x N m + C < +
Therefore, any sequence x n n = 0 i p ¯ A i is bounded. □
Note that Theorem 2 (iii) assumes that d x 0 , x k is finite as an “a priori” stipulation for the boundedness of the sequence of distances in-between adjacent elements of the orbit O x 0 . However, Theorem 3 assumes that the initial point x 0 of the considered orbits is finite in order to guarantee that the partial orbit of a finite number of elements starting by x 0 is bounded. This assumption would not be invoked if the subsets A i for i p ¯ were bounded.

4. Some Particular Results: The Case of Non-Expansivity and That of Monitored Switching

It is proved for p = 2 in [1] (Lemma 3.8 based on Lemma 3.8), irrespective of the properties of the single-valued contractive 2-cyclic mapping T : A 1 A 2 A 1 A 2 , that if X , is an uniformly convex Banach space and the subsets A 1 and A 2 of X are non-empty, closed and convex then:
x n n = 0 A i z n n = 0 A i y n n = 0 A 2 x n y n n = 0 D , z n y n n = 0 D z n y n n = 0 0 ;   i p ¯
Such a property holds irrespective of the mapping being single-valued or multivalued and without invoking whether it is contractive or not. It is also proved in [1] that if, furthermore, T : A 1 A 2 A 1 A 2 is single-valued and 2-cyclic contractive then there is a unique best proximity point z A 1 such that z T z = D and if z 0 A 1 then T 2 n z 0 n = 0 z and T 2 n + 1 z 0 n = 0 T z , and T 2 n z 0 n = 0 and T 2 n + 1 z 0 n = 0 are Cauchy sequences.
The subsequent result firstly establishes some best proximity results in the case that there are no iterations of the mixed p -cyclic/acyclic multivalued mapping T : i p ¯ A i i p ¯ A i , p 2 , within each of the subsets A i provided that the complete metric space that the subsets A i for i p ¯ belong to is a uniformly convex Banach space and that the mapping is contractive at least from one switching of one of the subsets to its right adjacent one in the event that it is not expansive from any of the subsets to its right adjacent one. Since there are no iterations between each subset before switching to its right adjacent one, the p -cyclic/acyclic mapping T : i p ¯ A i i p ¯ A i is, in particular, a multivalued p -cyclic mapping due to the absence of internal iterations within each of the subsets. Later on, in the second property of the theorem, a new result generalizes the results to the case when T : i p ¯ A i i p ¯ A i has iterations within the subsets before switching to the right adjacent ones (i.e., it is of cyclic/acyclic nature) under certain conditions of Theorem 2.
Theorem 4.
Assume that:
(A1) A i : i p ¯ are non-empty closed and convex subsets of a uniformly convex Banach space X , .
(A2) Assume that T : i p ¯ A i i p ¯ A i is a mixed p -cyclic/acyclic mapping, subject to T A i A i A i + 1 ; p ¯ with respect to the norm-induced metric d : X × X R 0 + ; i p ¯ , by the norm of X , , which satisfies (31) and (32), under the constraints S c = A i : i p c , S e = A i : i p e = (so that i p ¯ A i = S c S n e and p ¯ = p c p n e ), k i = k i < 1 ; i p c , D i = D , n i k , N k = 0 ; i p ¯ , k Z 0 + such that for each x A i and each i p ¯ , T x = T x i + 1 with T x i + 1 A i + 1 ; i p ¯ .
Then, the following properties hold:
(i) 
There is a best proximity point z i in A i with respect to A i + 1 , that is, d z i , T z i i + 1 = D ; i p ¯ . Furthermore, for any i p ¯ , if x A i , then T p n + j x i + j n = 0 z i + j A i + j for j p 1 ¯ is a best proximity point in A i + j with respect to A i + j + 1 , and z i T p z i i is also a fixed point in A i of the composite mappings T p : i p ¯ A i | A j i p ¯ A i | A j ; j p ¯ .
(ii) 
If Assumption A2 holds under the subsequent generalizations: (a) n i N k , N k + 1 0 ; i p ¯ , for some given k Z 0 + with N k 1 = k , N j j = 0 Z 0 + being strictly increasing and the incremental sequence N j N j 1 j = 0 Z 0 + being uniformly bounded and covering a whole cycle of iterations covering all the subsets A i for i p ¯ , such that for each x A i and each i p ¯ , T x = T x i , T x i + 1 with T x i + 1 A i + 1 , i p ¯ and T x i 1 A i in the case when n i N k , N k + 1 > 0 for some N k N k k = 0 ; and
s u p N k N j j = 0 l n K 1 N k , N k + 1 p < 0
where K 1 N k , N k + 1 = j = 1 p k j n j N k , N k + 1 + 1 .
Proof. 
Since S c = A j : j P c , it exists A i S c for some i p ¯ . Consider, with no loss in generality, initial points x 1 , y 1 A i of the sequences T n p + j x 1 n = 0 A i + j and T n p + j y 1 n = 0 A i + j ; j p 1 ¯ 0 generated by T : i p ¯ A i i p ¯ A i under the constraint n i = 0 ; i p ¯ , which makes T A i A i A i + 1 become T A i A i + 1 ; i p ¯ . The choice of x 1 and y 1 in A i is without loss of generality since for any given x 01 , y 01 i p ¯ A i , there are nonnegative integers j , k p ¯ such that one can fix x 1 T j x 01 A i and y 1 T k x 01 A i for any prefixed subset A i S c of i p ¯ A i . Since A i S c , k j = k j , j p ¯ and i p ¯ A i = S c S n e , it turns out that j = 1 p k j k i < 1 so that:
d T n p + j x 1 , T n p + j + 1 y 1 k i n d x 1 , y 1 + 1 k i n D
d T n + k p + j y 1 , T n + k p + j + 1 y 1 k i n + k d T y 1 , y 1 + 1 k i n + k D
Then, d T n p + j x 1 , T n p + j + 1 y 1 n = 0 D and d T n + k p + j y 1 , T n + k p + j + 1 y 1 n = 0 D for any given x 1 , y 1 x 1 A i , k Z 0 + with T n + k p + j + 1 x 1 k = 0 A i + j + 1 and T n + k p + j + 1 y 1 k = 0 A i + j + 1 for any k Z 0 + . Since X , is a uniformly Banach space, and A j j p ¯ are closed and convex and A i S c , one concludes also that d T n p x 1 , T n + k p y 1 n = 0 0 and that T n + k p x 1 n = 0 z i A i is a Cauchy sequence. It also holds that z i A i is a fixed point of the composite mapping T p : j p ¯ A j | A j j p ¯ A j | A i , then z i T p z i i . As a result, z i + j T p + j z i i + j = T p T j z i i + j = T p z i + j i + j A i + j ; j p ¯ and z i + j T j z i i + j T p z i + j i + j is a fixed point of T p : k p ¯ A k | A i + j k p ¯ A k | A i + j in A i + j and also a best proximity point in A i + j of A i + j 1 since d z i + j 1 , z i + j = D because A j S n e S c ; j p ¯ implies that D = d A i , A i + 1 d A i j , A i j + 1 = D ; j p ¯ and the given i p ¯ c such that A i S c .
T n + k p + j x 1 n = 0 z i + j A i + j and that T n + k p + j x 1 n = 0 are convergent and Cauchy sequences; j p ¯ . Note that, since T n + k p x 1 z i A i if A i S c since A i is closed, and the sequences T n + k p 1 x 1 and T n + k p 1 y 1 for any given k Z 0 + fulfill that d T n + k p 1 x 1 , T n + k p x 1 n = 0 D and d T n + k p 1 y 1 , T n + k p x 1 k = 0 D , one obtains that d T n + k p 1 x 1 , T n + k p 1 y 1 n = 0 0 for any given x 1 , y 1 A 1 and T n + k p 1 x 1 n = 0 is convergent to z i 1 A i 1 A p + i 1 since A i 1 is closed. Continuing with this process, one obtains that T n + k p j x 1 n = 0 z i j A i j A p + i j ; j p 1 ¯ . Assume that z i 1 z i 1 A i . Then, one obtains that d T n + k p 1 y 1 , T n + k p x 1 k = 0 D and d T n + k p 1 x 1 , T n + k p 1 y 1 n = 0 0 with convergent sequences T n + k p 1 x 1 n = 0 z i 1 and T n + k p 1 y 1 n = 0 z i 1 . However, then l i m   i n f n d T n + k p 1 x 1 , T n + k p 1 y 1 n = 0 > 0 which is a contradiction to d T n + k p 1 x 1 , T n + k p 1 y 1 n = 0 0 then z i 1 = z i 1 . Continuing in the same way with this process for i p + 1 j i 1 , one concludes that z i A i are unique best proximity points in A i of A i + 1 , which are fixed points of the composite mapping T p . As a result, property (i) is proved.
To prove property (ii), note that under Assumption 1 and the given generalized Assumption 2, and, since k j = k j 1 ; j p ¯ and s u p N k N j j = 0 l n K 1 N k , N k + 1 p < 0 , then
K 1 N k , N k + 1 = j = 1 p k j n j N k , N k + 1 k j = j = 1 p k j n j N k , N k + 1 + 1 k i n i N k , N k + 1 + 1 < 1
since A i S c then K 1 N k , N k + 1 K p < 1 for some real constant K 0 , 1 and any given k Z 0 + . According to Theorem 2, Equations (35) and (36), one concludes in the same way as getting (48) and (49) that, for any given x 1 , y i A i S c ,
d T = k 1 k + n N + 1 N + j x 1 , T = k 1 k + n N + 1 N + j + 1 y 1 K n d x 1 , y 1 + 1 K n D ;   j p ¯ , n Z 0 +
d T = k 1 k + n N + 1 N + j y 1 , T = k 1 k + n N + 1 N + j + 1 y 1 K n d x 1 , y 1 + 1 K n D ;   j p ¯ , n Z 0 +
so that
l i m j p ¯ n d T = k 1 k + n N + 1 N + j x 1 , T = k 1 k + n N + 1 N + j + 1 y 1 = l i m n d T = k 1 k + n N + 1 N + j y 1 , T = k 1 k + n N + 1 N + j + 1 y 1 = D
l i m m Z 0 + , n d T = k 1 k + n N + 1 N x 1 , T = k 1 k + m n N + 1 N y 1 = 0
The remaining of the proof of property (ii) follows in a similar way to that of property (i). □
Remark 6.
If S e in Theorem 4 so that values of the constants k j > 1 for A j S e are compensated by other contractive constant values k j < 1 for A j S c S n e while (47) holds then (53) and (54) in Theorem 4 (ii) still hold. H, it cannot be proved, in general, the convergence of sequences to the best proximity points of adjacent subsets A i and A i + 1 for i p ¯ of X .
The statements of the given results until now consider the event that the number of consecutive iterations within each subset A i before switching to A i + 1 is either pre-designed, including a fixed number of iterations, eventually being iteration-dependent, within each A i , or monitored in the sense that the switching be decided by a switching rule σ : Z 0 + p ¯ such that if σ k = σ k + 1 = i p ¯ , then there is not a switch at the k -th iteration of T from A i to A i + 1 for some i p ¯ and the partial orbit of any x 0 i p ¯ A i fulfills O 0 , k + 1 x 0 = O 0 , k x 0 , x k + 1 with O 0 , k x 0 = x 0 , x 1 , , x k satisfying x k T x k 1 i A i , x k + 1 T x k i T 2 x k 1 i A i .
On the other hand, if p ¯ i = σ k σ k + 1 = i + 1 p ¯ , the mapping T switches from A i to A i + 1 at the k -th iteration so that the partial orbit O 0 , k + 1 x 0 = O 0 , k x 0 , x k + 1 = O 0 , k 1 x 0 , x k , x k + 1 exhibits a switch in the allocation set from x k A i to x k + 1 A i + 1 .
The monitored strategy of switching between the subsets A i ; i p ¯ of X according some rule σ : Z 0 + p ¯ is of interest in certain applications. For instance, if the stabilization of a discrete dynamic system cannot be achieved for successive iterations within a set because of inherent instability within it, then it is convenient to assign it along certain transients. Additionally, an instability problem could arise if a discrete system becomes unstable under its current parameterization. This drawback can be eventually solved by generating switches in its state, together eventually with parameterization switches, which lead again the trajectory to a stable region. See, for instance, [24,25,26,27,28,29,30]. The following immediate result establishes the convergence of sequences to a fixed point of any subset A i , where the mapping is contractive, under any monitored switching rule which confines the successive iterations within such a subset after a finite number of iterations.
Theorem 5.
Consider a pair T , σ , where T : i p ¯ A i i p ¯ A i is a self-mapping under assumptions A1 and A2 of Theorem 4 and σ : Z 0 + p ¯ is a monitored switching rule between a subset A j and its right adjacent one A j + 1 ; j p ¯ . Assume that for some finite k 0 Z 0 + , σ k 0 + = σ k 0 p ¯ ; Z 0 + such that A σ k 0 S c . Then, any sequence T n x 0 n = 0 g i where g i T g i i T g i A i is a fixed point of T for any given x 0 i p ¯ A i .
Proof. 
It is obvious since the monitored switching rule σ : Z 0 + p ¯ determines that any partial orbit O k 0 , k x 0 = x k 0 , x k 0 + 1 , , x k of the orbit O x 0 is confined within A i S c , which has a fixed point from since A i is closed and T x i is closed for any x A i . If T : j p ¯ A j | A i j p ¯ A j | A i A i + 1 is single-valued, then g i = T g i is unique since A i is closed and convex. □

5. Numerical Simulations

This section is aimed at illustrating the previous obtained results concerning the boundedness of sequences and orbits of cyclic/acyclic contractive/non-contractive self-mappings. To this end, the case of a discrete-time dynamical system is discussed. Thus, consider the dynamic system given by:
x k + 1 = x k y k
y k + 1 = x k y k
; k Z 0 + . The system is described by the self-mapping T ( x k , y k ) = x k y k ( 1 , 1 ) . This self-mapping has a different behavior depending on x k y k > 1 , x k y k = 1 or x k y k < 1 , generating the following three subsets:
A 1 = ( x , y ) R 2 | x y > 1 = A 11 A 21 A 31 A 41
A 2 = ( x , y ) R 2 | x y < 1 = A 12 A 22 ;   A 3 = ( x , y ) R 2 | x y = 1
with
A 11 = ( x , y ) R 2 | x y > 1 , x > 0 , y > 0 ;   A 21 = ( x , y ) R 2 | x y > 1 , x < 0 , y > 0
A 31 = ( x , y ) R 2 | x y > 1 , x < 0 , y < 0 ;   A 41 = ( x , y ) R 2 | x y > 1 , x > 0 , y < 0
A 12 = ( x , y ) R 2 | 1 + 5 2 < x < 2 1 + 5 , y = 1 / x 2 1 + 5 x 0 , y = 1 + 5 2 ;   A 22 = A 2 A 12
The set A1 is disconnected and can be represented by the union of four connected disjoint subsets. These subsets are called A 11 , A 21 , A 31 and A 41 as is displayed in Figure 1 where the blue lines depict the hyperbola y = 1 / x . On the other hand, the set A2 is connected and it is split into two subsets, namely A 12 and A 22 , as in Figure 1.
Note that A 1 , A 2 and A 3 are disjoint unbounded subsets of R 2 , with A 1 and A 2 being open and A 3 being closed. Since those sets are disjoint, the sets of best proximity points between each pair of them are empty, but because of the asymptotes defined in blue lines which define the boundaries, the distances between adjacent subsets are zero. Note that T is a self-mapping on R 2 = A 1 A 2 A 3 so that T : A 1 A 2 A 3 A 1 A 2 A 3 and T A 3 A 3 . Note also from (55) and (56) that, for any given initial point z 0 = x 0 , y 0 R 2 , the Euclidean distance between consecutive points of iterations through T satisfies with z k = x k , y k R 2 ; k Z 0 + :
d z k + 1 , z k = x k + 1 x k 2 + y k + 1 y k 2 = y k y k + 1 2 + y k + 1 y k 2 = 2 y k + 1 y k = 2 y k + x k y k = 2 y k 1 + x k = 2 x k 1 + x k = 2 y k 1 y k ;   k Z +
which becomes asymptotically unbounded as k if x k , or if y k , as k . We can define the contractivity-, non-expansivity- and expansivity-point-dependent constants as:
k z k 1 , z k = d z k + 1 , z k d z k , z k 1 = x k 1 + x k x k 1 1 + x k 1 ;   k Z +
Thus, the Euclidean distances between consecutive points of arbitrary orbits being calculated via iterations through T from finite initial points in R 2 are not necessarily asymptotically bounded. Then, some monitoring of switching between the three subsets A 1 , A 2 and A 3 should be performed to guarantee their asymptotic boundedness. Note the following facts:
Fact 1.
One obtains from (55) and (56) that x k 0 and y k = x k 0 ; k Z + . Therefore, the second semi-open quadrant 0 , 1 × 0 , 1 of R 2 is unreachable (or forbidden) for any sequence solution of (55) and (56) except for initial points x 0 , y 0 . As a result, there are forbidden subsets of A 11 and A 22 (see (57) and (58) and Figure 1) which are unreachable except for the initial conditions.
Fact 2.
If x k 1 , y k 1 A 2 , then x k 1 y k 1 < 1 and x k 1 2 = y k 1 2 < 1 since x k = y k , and then x k 1 1 , 0 ; k 2 Z + . Thus, x k x k 1 since x k = x k 1 2 1 ; k Z + . Additionally, x k < x k 1 and x k 1 1 , 0 ; k Z + imply that 1 < x k 1 < x k < 0 ; k Z + . Then, the sequence x k k = 1 is non-positive and convergent to zero under a weak contraction. Since x k k = 1 is non-positive convergent to zero, y k k = 1 is non-negative and convergent to zero from (55) and (56).
Fact 3.
( T is weakly contractive in A 22 and a strict contraction in A 12 ): One obtains from (55), (56), (60) that
k z k 1 , z k = x k 1 x k x k 1 1 x k 1 = x k x k 2 x k 1 x k 1 2 = x k 1 2 x k 1 4 x k 1 x k 1 2 = x k 1 + x k 1 2
Since x k k = 1 is convergent for any initial condition in A 22 , from Fact 2, for any given real constant k c 0 , 1 , there is some finite r = r k c Z + such that k z k 1 , z k k c < 1 ; k r Z + . By checking the inequality p x k 1 = x k 1 + x k 1 2 1 < 0 with and since p x k 1 is a convex parabola, one concludes that p x k 1 < 0 with x k 1 0 if x k 1 1 + 5 2 , 0 . As a result, any sequence x k k = 0 , with x 0 , y 0 A 22 , is non-positive with strictly decreasing modulus and, from (55) and (56), y k k = 0 is non-negative and strictly decreasing, both sequences being convergent to zero. This implies that T is weakly contractive in A 22 and it enters into A 12 after a finite number of iterations, where T is a (strict) contraction with the solution x k , y k k = 0 0 for any x 0 , y 0 A 2 .
Fact 4.
( 0 , 0 is a fixed point of T and a global attractor of the solution for any initial condition in A 22 ). Additionally, if initial conditions are in the set A1, then the self-mapping is expansive. The blue lines (set A3) define the boundaries between regions, where the self-mapping is neither expansive nor contractive. The equilibrium points, which are the fixed points of T , are 0 , 0 and 1 , 1 . Figure 2 displays the time evolution of the system when the initial conditions are in A 22 and given by x 0 = 0.2 , y 0 = 4.5 . It is observed in Figure 2 how the sequence of iterates enters into A 12 and converges to the equilibrium point (0, 0).
Fact 5.
( T is expansive in A 1 ): For all k Z + , if x k 1 , y k 1 A 1 , then x k 1 y k 1 = 1 , x k 1 2 = y k 1 2 > 1 since x k = y k , which implies that x k 1 < 1 and x k 1 > 1 . Therefore, x k = x k = x k 1 2 < x k 1 = x k 1 so that x k x k 1 > 1 ; k Z + . It can also be concluded that y k > y k 1 and y k k k 1 > 1 ; k Z + . Additionally, x k < x k 1 < 1 that 1 + x k < 1 + x k 1 < 0 and 1 + x k > 1 + x k 1 . Thus, one obtains from (60) that T is expansive in A 1 since
k z k 1 , z k = x k 1 + x k x k 1 1 + x k 1 > 1 + x k 1 + x k 1 > 1 + x k 1 1 + x k 1 i n f k Z + 1 + x k 1 1 + x k 1 = 1 ;   k Z + .
Fact 6.
( T is non-expansive and non-contractive in A 3 ). For all k Z + , if x k 1 , y k 1 A 3 , then x k 1 y k 1 = 1 , x k 1 2 = y k 1 2 = 1 since x k = y k , which implies that x k = x k 1 2 = x k 1 = 1 , x k 1 = x k < 0 and x k x k 1 = 1 . Then,
k z k 1 , z k = x k 1 + x k x k 1 1 + x k 1 = 1 + x k 1 + x k 1 = 1 x k 1 x k 1 = 1 x k 1 1 x k 1 = 1 ;   k Z +
It is also observed that when the image of the self-mapping is included in A 2 , the Euclidean distance between two consecutive iterations is bounded and the orbit converges to the origin, as corresponds to a contractive self-mapping, in accordance with Theorem 1. It should be to pointed out here that the distance between two consecutive iterations of the self-mapping is given by the length of the arrow depicted in Figure 2, which corresponds to the Euclidean distance. On the other hand, if initial conditions are in A 31 A 1 , for instance, the self-mapping is expansive and the orbit diverges, as Figure 3 shows. Figure 3 displays how the length of the arrow increases resulting in an unbounded distance between consecutive iterations. This happens because the value K(i, 1) in Equation (12) from Theorem 1 is unbounded due to the expansive properties of the self-mapping.
It can also be seen that the image of the self-mapping changes the subset from A 31 to A 34 and then to A 32 , where it remains afterwards. This system can be stabilized in different ways. The clue to stabilizing this system is to include a mechanism in (55) and (56) to force the self-mapping to be cyclic, that is, to include a mechanism to make the self-mapping change its image from A1 to A2 so that any condition from Propositions 1, 2 or 3 is met. For instance, if we force the system to change its image to the set A2 where it remains after a finite number of changes, then the orbit of the system and the distance between two consecutive iterations will both be bounded (Propositions 2 and 3, and their extensions to the general case, Theorems 2 and 3). Two mechanisms are presented in this section for this purpose: a feedback term added to this system and the impulsive control of states. Thus, a feedback term working in the following way is added:
x k + 1 = x k y k δ k x k 2 y k 2 1 + x k y k
x k + 1 = x k y k + δ k x k 2 y k 2 1 + x k y k
with
δ k = 1 , x k y k > 1 0 , o t h e r w i s e
If the above feedback term is included in the system, the evolution of (55) and (56) changes to the one depicted in Figure 4.
It is observed in Figure 4 that the feedback term acts moving the iteration from the set A 31 A 1 , where the self-mapping is expansive, to the set A 22 A 2 , and finally to A 12 A 2 , where the self-mapping is contractive and where it remains. Consequently, according to Theorem 5, the distance between two consecutive iterations is bounded and converges to zero asymptotically, as seen in Figure 4 by the length of the arrows. Furthermore, this system could also be stabilized by applying an impulsive action to the states so that the controlled system reads:
x k + 1 = x k y k
y k + 1 = x k y k
x k + = 0.4 x k y k + = 0.6 y k ,   x k y k > 1 ,   k   is   even
where the value x k stands for the value of the state prior to the impulse, while x k + represents the value immediately after the impulse. This case corresponds to the situation when the states of the system suffer an impulsive change whenever they are out of A 2 and the iteration is even. This is not the only impulsive action that could stabilize the system, but it is certainly one able to do so. Similarly, the effect of feedback, the impulsive action, causes the self-mapping to become cyclic, changing its image from set A1 to A2. The result of applying this impulsive action is portrayed in Figure 5.
It is observed in Figure 5 how the impulsive action changes the image of the self-mapping and moves it from A 31 to A 41 and then to A 21 until it ends up in A 12 , where it remains and the contractivity of the mapping causes the orbit to converge to the origin (0, 0). Since A 31 A 41 A 21 A 1 and A 12 A 2 then the monitored mixed cyclic/acyclic self-mapping T on A 1 A 2 A 3 satisfies T A 1 A 1 A 2 , T A 2 A 2 and T A 3 A 3 . It is also observed that the length of the arrows is bounded and converges to zero, as Theorem 5 predicts. Finally, we may consider the multivalued self-mapping given by:
x k + 1 = ± x k y k
y k + 1 = x k y k
There are two branches in (67), one corresponding to the positive sign for the square root and another corresponding to the negative one. Figure 6 displays the evolution of the two images of the self-mapping when the initial conditions are given by x 0 = 0.5 , y 0 = 4.5 . The positive branch is depicted by asterisks in red, while the negative branch is portrayed with plus symbols.
As Figure 6 shows, the multivalued mapping diverges and the distance between two successive iterations increases and is not asymptotically bounded. However, if an impulsive action is added to this system as:
x k + 1 = ± x k y k
y k + 1 = x k y k
x k + = 0.4 x k y k + = 0.6 y k ,   x k y k > 1 ,   k   is   even
Then, the system stabilizes, as Figure 7 depicts:
The effect of the impulsive action is to force the image of the mapping to move from A 31 A 1 to A 12 A 2 , where the mapping is contractive. Under these circumstances, we are in the condition of applying Theorem 5, and the distance between two successive points reduces and the orbit converges to the origin and the stable equilibrium point of the system (0, 0) which is in A 2 . There is another fixed point, 1 , 1 , which is an unstable equilibrium point.

6. Conclusions

A multivalued self-mapping on the union of a finite number of subsets p 2 of a metric space has been considered. Such a mapping might be of a mixed cyclic and acyclic nature being able to perform some iterations within each of the subsets before switching to its right adjacent one when generating orbits. The self-mapping is admitted to be either locally contractive, non-expansive/non-contractive and even locally expansive for different combinations of pairs of adjacent subsets. The properties of asymptotic boundedness of the distances associated with the elements of the orbits are proved under certain conditions of the global dominance of the contractivity for groups of consecutive iterations of the self-mapping, each of those groups of non-necessarily fixed size. If the metric space is a uniformly convex Banach space and the subsets are closed and convex, then some particular results on the convergence of the sequences of iterates to the best proximity points of the adjacent subsets are obtained in the absence of eventual local expansivity for switches between all the pairs of adjacent subsets. An application for the stabilization of a discrete dynamic system subject to impulsive effects in its dynamics due to finite discontinuity jumps in its state is also discussed. For that purpose, the iterations being run by the cyclic/acyclic self-mapping are subject to a monitoring process which is governed by a switching rule between adjacent subsets of the configuration in order to compensate for eventual instability of the solution under different system parameterizations and impulsive controls. Numerical examples were also given and discussed.

Author Contributions

Formal analysis, M.D.l.S.; Funding acquisition, M.D.l.S.; Investigation, M.D.l.S. and A.I.; Methodology, M.D.l.S. and A.I.; Project administration, M.D.l.S.; Software, A.I.; Supervision, A.I.; Validation, A.I.; Visualization, A.I.; Writing—original draft, M.D.l.S. All authors have read and agreed to the published version of the manuscript.

Funding

Basque Government, Grant IT1555-22.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are grateful to the Spanish Government and the European Commission for its support through grant RTI2018-094336-B-I00 (MCIU/AEI/FEDER, UE) and to the Basque Government for its support through grants IT1207-19 and IT1555-22. They are also grateful to the referees by their useful suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

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] [Green Version]
  2. Kim, W.K.; Lee, K.H. Existence of best proximity pairs and equilibrium pairs. J. Math. Anal. Appl. 2006, 316, 433–446, Corrigendum in J. Math. Anal. Appl. 2007, 329, 1482–1483. [Google Scholar] [CrossRef] [Green Version]
  3. Olisama, V.; Olareru, J.; Akewe, H. Best proximity point results for some contractive mappings in uniform spaces. Int. J. Anal. 2017, 2017, 16173468. [Google Scholar] [CrossRef]
  4. Dung, N.V.; Radenovic, S. Remarks on theorems for cyclic quasi-contractions in uniformly convex Banach spaces. Kragujev. J. Math. 2016, 40, 272–279. [Google Scholar] [CrossRef]
  5. Dung, N.V.; Hang, V.T.L. Best proximity point theorems for cyclic quasi-contraction maps in uniformly convex Banach spaces. Bull. Aust. Math. Soc. 2017, 95, 149–156. [Google Scholar] [CrossRef]
  6. Amini-Harandi, A. Best proximity point theorems for cyclic strongly quasi-contraction mappings. J. Glob. Optim. 2013, 56, 1667–1674. [Google Scholar] [CrossRef]
  7. He, F.; Zhao, X.Y.; Sun, Y.Q. Cyclic quasi-contractions of Ciric type in b-metric spaces. J. Nonlinear Sci. Appl. 2017, 10, 1075–1088. [Google Scholar] [CrossRef] [Green Version]
  8. Fisher, B. Quasi-contractions on metric spaces. Proc. Am. Math. Soc. 1979, 75, 321–325. [Google Scholar] [CrossRef]
  9. Gautam, P.; Singh, S.R.; Kumar, S.; Verma, S. On nonunique fixed point theorems via interpolative Chatterjea type Suzuki contraction in quasi-partial b-metric space. J. Math. 2022, 2022, 2347294. [Google Scholar] [CrossRef]
  10. Sastry, K.P.R.; Vali, S.K.; Rao, C.S.; Rahamatulla, M.R. Quasi nonexpansive sequences in dislocated quasi-metric spaces. Int. J. Eng. Res. Technol. (IJERT) 2013, 2, 826–833. [Google Scholar]
  11. Karpagam, S.; Agrawal, S. Best proximity point theorems for p-cyclic Meir-Keeler contractions. Fixed Point Theory Appl. 2009, 2009, 197308. [Google Scholar] [CrossRef] [Green Version]
  12. Karpagam, S.; Agrawal, S. Best proximity point theorems for cyclic orbital Meir-Keeler contraction maps. Nonlinear Anal. 2011, 74, 1040–1046. [Google Scholar] [CrossRef]
  13. di Bati, C.; Suzuki, T.; Vetro, C. Best proximity points for cyclic Meir-Keeler contractions. Nonlinear Anal. 2008, 89, 3790–3794. [Google Scholar] [CrossRef]
  14. de la Sen, M. On a general contractive condition for cyclic self-mappings. J. Appl. Math. 2011, 2011, 542941. [Google Scholar] [CrossRef]
  15. de la Sen, M.; Agarwal, R.P. Some fixed point-type results for a class of extended cyclic self-mappings with a more general contractive condition. Fixed Point Theory Appl. 2011, 2011, 59. [Google Scholar] [CrossRef] [Green Version]
  16. Abkar, A.; Gabeleh, M. The existence of best proximity points for multivalued non-self-mappings. Rev. Real Acad. Cienc. Exactas Fís. Naturales. Ser. A Mat. 2013, 107, 319–325. [Google Scholar] [CrossRef]
  17. Sahin, H.; Aslantas, M.; Altun, I. Feng-Liu type approach to best proximity point results for multivalued mappings. J. Fixed Point Theory Appl. 2019, 22, 11. [Google Scholar] [CrossRef]
  18. Hammad, H.A.; de la Sen, M. A solution of Fredholm integral equation by using the cyclic eta(q)(s)-rational contractive mappings technique in b-metric-like spaces. Symmetry 2019, 11, 1184. [Google Scholar] [CrossRef] [Green Version]
  19. Aslantas, M.; Sahin, H.; Altun, I. Best proximity point theorems for cyclic p-contractions with some consequences and applications. Nonlinear Anal. Model. Control 2021, 265, 113–129. [Google Scholar] [CrossRef]
  20. Popescu, O. A new type of contractive mappings in complete metric spaces. Bull. Transilv. Univ. Brasov. Ser. III Math. Inform. Phys. 2008. preprint. [Google Scholar]
  21. Kailath, T. Linear Systems; Prentice-Hall: Englewood Cliffs, NJ, USA, 1980. [Google Scholar]
  22. Delasen, M. A method for improving the adaptation transient using adaptive sampling. Int. J. Control. 1984, 40, 639–665. [Google Scholar]
  23. Delasen, M. Application of the non-periodic sampling to the identifiability and model matching problems in dynamic systems. Int. J. Syst. Sci. 1983, 140, 367–383. [Google Scholar]
  24. Ibeas, A.; de la Sen, M. Exponential stability of simultaneously triangularizable switched systems with explicit calculation of a common Lyapunov function. Appl. Math. Lett. 2009, 22, 1549–1555. [Google Scholar] [CrossRef] [Green Version]
  25. de la Sen, M.; Ibeas, A. Stability results for switched linear systems with constant discrete delays. Math. Probl. Eng. 2008, 2008, 543145. [Google Scholar] [CrossRef]
  26. Ji, H.; Shao, J.H.; Xi, F.B. Stability of regime-switching jump diffusion processes. J. Math. Anal. Appl. 2020, 484, 123727. [Google Scholar] [CrossRef]
  27. Zhu, X.A.; Liu, S.T. Reachable set estimation for continuous-time impulsive switched nonlinear time-varying system with delay and disturbance. Appl. Math. Comput. 2022, 420, 126910. [Google Scholar]
  28. Zhang, J.E.; Xing, X.R. Stabilization of uncertain switched systems with frequent asynchronism via event-triggered dynamic output-feedback control. Discret. Dyn. Nat. Soc. 2022, 2022, 6509213. [Google Scholar] [CrossRef]
  29. Liang, J.T. Semi-time-dependent stabilization for a class of continuous-time impulsive switched linear systems. Syst. Sci. Control Eng. 2022, 10, 517–527. [Google Scholar] [CrossRef]
  30. Meng, F.; Shen, X.Y.; Li, X.H. Stability analysis ands synthesis for 2-D switched systems with random disturbance. Mathematics 2022, 10, 810. [Google Scholar] [CrossRef]
  31. Taghieh, A.; Mohammadzadeh, A.; Tavoosi, J.; Mobayen, S.; Rojsiraphisal, T.; Asad, J.H.; Zhilenkov, A. Observer-based control for nonlinear time-delayed asynchronously switching systems: A new LMI approach. Mathematics 2021, 9, 2968. [Google Scholar] [CrossRef]
  32. Mouktonglang, T.; Poochinapan, K.; Yimnet, S. Robust finite-time control of discrete-time switched positive time-varying delay systems with exogenous disturbance and their application. Symmetry 2022, 14, 735. [Google Scholar] [CrossRef]
  33. Mouktonglang, T.; Yimnet, S. Global exponential stability of both continuous-time and discrete-time switched positive time-varying delay systems with interval uncertainties and all unstable subsystems. J. Funct. Spaces 2022, 2022, 3968850. [Google Scholar] [CrossRef]
  34. Yimnet, S.; Niamsup, P. Finite-time stability and boundedness for linear switched singular positive time-delay systems with finite-time unstable subsystems. Syst. Sci. Control Eng. 2020, 8, 541–568. [Google Scholar] [CrossRef]
Figure 1. Different regions on the plane for the self-mapping (55) and (56).
Figure 1. Different regions on the plane for the self-mapping (55) and (56).
Mathematics 10 02415 g001
Figure 2. Evolution of the discrete-time dynamic system (55) and (56), when the initial conditions are x 0 = 0.2 , y 0 = 4.5 .
Figure 2. Evolution of the discrete-time dynamic system (55) and (56), when the initial conditions are x 0 = 0.2 , y 0 = 4.5 .
Mathematics 10 02415 g002
Figure 3. Evolution of the discrete-time dynamics system (55) and (56), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 .
Figure 3. Evolution of the discrete-time dynamics system (55) and (56), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 .
Mathematics 10 02415 g003
Figure 4. Evolution of the discrete-time dynamic system (61)–(63), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 and the feedback gain (63) is employed.
Figure 4. Evolution of the discrete-time dynamic system (61)–(63), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 and the feedback gain (63) is employed.
Mathematics 10 02415 g004
Figure 5. Evolution of the discrete-time dynamics system (64)–(66), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 and the impulsive action (66) is included in the system.
Figure 5. Evolution of the discrete-time dynamics system (64)–(66), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 and the impulsive action (66) is included in the system.
Mathematics 10 02415 g005
Figure 6. Evolution of the multi-valued discrete-time dynamic system (67) and (68), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 . The positive branch is depicted by asterisks in red, while the negative branch is portrayed in blue plus symbols.
Figure 6. Evolution of the multi-valued discrete-time dynamic system (67) and (68), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 . The positive branch is depicted by asterisks in red, while the negative branch is portrayed in blue plus symbols.
Mathematics 10 02415 g006
Figure 7. Evolution of the multi-valued discrete-time dynamic system (69)–(71), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 and the impulsive action (71) is included in the system. The positive branch is depicted by asterisks in red, while the negative branch is portrayed in blue plus symbols.
Figure 7. Evolution of the multi-valued discrete-time dynamic system (69)–(71), when the initial conditions are x 0 = 0.5 , y 0 = 4.5 and the impulsive action (71) is included in the system. The positive branch is depicted by asterisks in red, while the negative branch is portrayed in blue plus symbols.
Mathematics 10 02415 g007
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

De la Sen, M.; Ibeas, A. On Some Properties of a Class of Eventually Locally Mixed Cyclic/Acyclic Multivalued Self-Mappings with Application Examples. Mathematics 2022, 10, 2415. https://doi.org/10.3390/math10142415

AMA Style

De la Sen M, Ibeas A. On Some Properties of a Class of Eventually Locally Mixed Cyclic/Acyclic Multivalued Self-Mappings with Application Examples. Mathematics. 2022; 10(14):2415. https://doi.org/10.3390/math10142415

Chicago/Turabian Style

De la Sen, Manuel, and Asier Ibeas. 2022. "On Some Properties of a Class of Eventually Locally Mixed Cyclic/Acyclic Multivalued Self-Mappings with Application Examples" Mathematics 10, no. 14: 2415. https://doi.org/10.3390/math10142415

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