• Research
• Open Access

Fixed set of set valued mappings with set valued domain in terms of start set on a metric space with a graph

Fixed Point Theory and Applications20172017:5

https://doi.org/10.1186/s13663-017-0598-8

• Accepted: 7 April 2017
• Published:

Abstract

In this article, we define the new concept of a fixed set for a set valued map with set valued domain in the setting of metric space endowed with a directed graph. This notion of fixed set is analogous to the notion of a fixed point for a multivalued map and not for a classical single-valued map. We also introduce the new concept of the start set of a graph whose vertices are closed and bounded subsets of a metric space. Characterizations for such a graph to have a start set are given. Further, the notion of a self-path set valued map is defined and its relation with the start set is established. Finally, the existence of fixed sets is established in this context.

Keywords

• fixed point
• fixed set
• start set
• set valued mapping
• metric space with a graph

• 47H10
• 54H25
• 54E50

1 Introduction

The Banach contraction principle initiated a new era of research in fixed point theory due to its immense applicability in major areas of mathematics like numerical analysis and differential/integral equations. Boyd and Wong  used this principle to investigate the fixed point results of nonlinear contraction maps.

The study of the existence of fixed points in partially ordered sets is interesting due to its applicability in finding new convergence schemes. This was first studied by Ran and Reurings  combining the Banach contraction principle and the Knaster-Tarski fixed point theorem. Ran and Reurings considered a class of mappings $$f:X\rightarrow X$$, with $$(X,d)$$ as a complete metric space and a partial order ≤. The mappings they considered were continuous, monotone with respect to the partial order ≤. Those mappings also satisfy a Banach contraction inequality for every pair $$(x,y)\in X\times X$$ such that $$x\leq y$$. When, for some $$x_{0}\in X$$, the inequality $$x_{0}\leq f(x_{0})$$ is satisfied, they proved that the Picard sequence $$\{f^{n}(x_{0})\}$$ would converge to a fixed point of f. Ran and Reurings also combined this interesting result with the Schauder fixed point theorem and applied it to obtain some existence and uniqueness results to nonlinear matrix equations.

Neito and Rodríguez-López [3, 4] extended the results of Ran and Reurings to functions which were not necessarily continuous. The authors also applied their results to obtain a theorem on the existence of a unique solution for periodic boundary problems relative to ordinary differential equations.

Some important work in this direction that deserves attention is .

Nadler  and Assad and Kirk  established some interesting fixed point results for set valued and multivalued contraction mappings. Meanwhile, Espinola and Kirk  combined the concepts of fixed point theory and graph theory to prove fixed point results in R-trees. In 2008, Jachymski  introduced the interesting idea of using the language of graph theory in the study of fixed points. He was interested in establishing results those would eventually generalize the existing results and also apply the results to the theory of linear operators. So, he studied the class of generalized Banach contractions on a metric space with a directed graph. The advantage of using graph theoretical concepts was that it helped him to describe the results in a unified way and also weaken some conditions significantly. Such work was further extended by Bojor [25, 26]. Very recently, some fixed point results on subgraphs of directed graphs were established by Aleomraninejad, Rezapour and Shahzad [6, 27]. They showed that the Caristi fixed point theorem and a version of Knaster-Tarski fixed point theorem were special cases of their results.

Some influential work on the same subject, which we must take into account, is .

In the present paper, our goal is to consider the mapping $$T : CB(X)\rightarrow CB(X)$$ instead of $$T : X\rightarrow X$$ or $$T : X \rightarrow CB(X)$$ to study fixed point results of set valued mappings. The current corresponding author  generalized some results of Jachymski  by considering maps of the type $$T:CB(X)\rightarrow CB(X)$$, i.e., set valued contraction maps with set valued domain. In a similar setting, recently, more fixed point results were investigated by Abbas et al. [38, 39]. In the current paper, we introduce the new concept of fixed set which is analogous to the concept of fixed point for a multivalued map. We establish some existence results for fixed sets by defining another concept called the start set of a graph whose vertices are closed and bounded subsets of a metric space. Our results generalize and extend some existing results in the literature, especially those of .

Let $$(X,d)$$ be a complete metric space and $$CB(X)$$ be the class of all non-empty closed and bounded subsets of X. For $$A,B\in CB(X)$$, let
$$H(A,B)=\max \Bigl\{ \sup_{b\in B} d(b,A), \sup _{a\in A} d(a,B) \Bigr\} ,$$
where $$d(a,B)=\inf_{b\in B} d(a,b)$$. Then $$(CB(X),H)$$ is a metric space and H is said to be the Pompeiu-Hausdorff metric induced by d.

Let $$(X,d)$$ be a metric space and $$\Delta=\{(x,x):x\in X\}$$ denote the diagonal of the Cartesian product $$X\times X$$. Consider a directed graph G such that the set of its vertices coincides with X (i.e., $$V(G)=X$$) and the set of its edges $$E(G)$$ is such that $$\Delta \subseteq E(G)$$, i.e., G contains all the loops. We assume G has no parallel edges and thus we identify G with the pair $$(V(G),E(G))$$.

If $$x,y\in V(G)$$, then a path in G from x to y is a sequence $$\{ x_{i}\}^{n}_{i=0}$$ of vertices such that $$x_{0}=x$$, $$x_{n}=y$$ and $$(x_{i-1},x_{i})\in E(G)$$ for $$i=1,2,\ldots,n$$. A closed path with at least three distinct vertices is called a cycle.

We assume that a path may be finite or infinite and a cycle may be considered as a finite path. Also we assume that G has no isolated vertex, i.e., a vertex with which no edge is incident. A subgraph of G is a graph having all its vertices and edges in G.

2 Main results

Throughout, by a graph G we mean a directed graph defined via the vertices $$V(G)=CB(X)$$ and edges $$E(G)=\{(A,B): A,B\in CB(X) \text{ and there is an edge for some } a\in A \mbox{ to } b\in B\}$$, unless otherwise specified.

In the study of mappings of the form $$T : CB(X) \rightarrow CB(X)$$, there can be two approaches: (i) equip $$CB(X)$$ with a graph; (ii) first equip X with a graph and then consider the induced graph structure on $$CB(X)$$.

In the present study we have adopted the second approach. The following definitions will be useful in this context.

Definition 2.1



Let A and B be two non-empty subsets of X. Then by the statement ‘there is an edge between A and B’, we mean there is an edge between some $$a \in A$$ and $$b \in B$$ and we write it as $$A\hookrightarrow B$$. Also, by ‘there is a path between A and B’ we mean that there is a path between some $$a \in A$$ and $$b \in B$$ and we write it as $$A\hookrightarrow_{p} B$$

Definition 2.2

Let $$CB(X)$$ be the class of all non-empty closed and bounded subsets of X. For each $$A\in CB(X)$$, the notation $$[A]_{G}$$ denotes a class of non-empty closed and bounded subsets of X such that $$[A]_{G} =\{ B \in CB(X): B\hookrightarrow_{p} A\}$$.

Definition 2.3

The set valued map $$T : CB(X) \rightarrow CB(X)$$ is a self-path map whenever, for each $$A\in CB(X)$$, there is a path from u to v for some $$u \in T(A)$$ and $$v \in A$$, we denote this by $$A \in[T(A)]_{G}$$.

When $$A\neq B$$, by the notation $$A\in[T(B)]_{G}$$ we mean that there is a path from x to y for some $$x\in A$$ and $$y \in T(B)$$.

Also, we define $$[B]_{G^{l}}$$ as
\begin{aligned}{} [B]_{G^{l}}= {}&\bigl\{ A\in V(G)=CB(X): \text{there exists a path from y to x for some y \in B}\\ &\text{and x \in A} \bigr\} . \end{aligned}

Remark 2.4

Next we define the most important concept of this paper which is the notion of a fixed set. Inspired by the definition of a fixed point in multivalued case, we define the analogous concept of fixed set in the current paper. The main motivation for not considering the single-valued analog of a fixed point is that by considering the multivalued analog we can generalize and extend much celebrated work such as that of Nadler  and Asad and Kirk  in the context of mappings of the type $$T:CB(X)\rightarrow CB(X)$$.

Definition 2.5

We say that $$A\in CB(X)$$ is a fixed set of the set valued map $$T : CB(X) \rightarrow CB(X)$$ if $$A\subseteq T(A)$$.

Remark 2.6

Clearly the empty set is always a fixed set. Hence, in the rest of the paper, by a fixed set we mean a non-empty set.

The next example motivates the study of multivalued mappings by showing that control problems may be translated in terms of multivalued maps and, hence, a study of their fixed points could provide new solution schemes to such problems.

Example 2.7

Suppose that the following control problem is to be solved:
\begin{aligned} x^{\prime}(t)=f \bigl(t,x(t),u(t) \bigr) \quad\text{and}\quad x(0)=x_{0}, \end{aligned}
which is controlled by parameters $$u(t)$$ (called the controls), where $$f:[0,a]\times\mathbb{R}^{n} \times\mathbb{R}^{m}\longrightarrow \mathbb{R}^{n}$$.
To solve the above problem we define a multivalued map $$F:[0,a]\times \mathbb{R}^{n}\rightarrow\mathbb{R}^{n}$$ as follows:
$$F(t,x)= \bigl\{ f(t,x,u) \bigr\} _{u\in U}.$$
Then solutions of the above problem are solutions of the following differential inclusions:
\begin{aligned} x^{\prime}(t)\in F \bigl(t,x(t) \bigr)\quad \text{and}\quad x(0)=x_{0}. \end{aligned}

Definition 2.8

Let $$G^{\prime}$$ be a subgraph of the directed graph G. We say that $$M \in CB(X)$$ is a lower bound for $$G^{\prime}$$ whenever $$A \in[M]_{G^{l}}$$ for all $$A \in CB(V(G^{\prime}))$$. Also, we say that $$N \in CB(X)$$ is an infimum of $$G^{\prime}$$ whenever N is a lower bound of $$G^{\prime}$$ and $$N \in [M]_{G^{l}}$$ for all lower bounds M.

Definition 2.9

Let G be a directed graph defined via the vertices $$V(G)=CB(X)$$ and $$D \in CB(X)$$. We say that D is a start set of G whenever there is no $$u\in D$$ and $$x \in X$$ with $$x \neq u$$ such that there is a path from x to u.

Remark 2.10

If $$A\in CB(X)$$ is a start set of a graph G defined via the vertices $$V(G)=CB(X)$$ then, obviously, for any $$a\in A$$, $$\{a\}$$ is also a start set of G.

Definition 2.11

Let H be a subgraph of the directed graph G defined via the vertices $$V(G)=CB(X)$$. We say that $$S \in V(H)$$ is a start set of H if there is no $$U \in V(H)$$ such that there is a path from u to s for some $$u\in U$$ and $$s\in S$$ with $$u\neq s$$.

Definition 2.12

Let $$(X,d)$$ be a metric space and $$\phi: CB(X) \rightarrow(-\infty, \infty)$$ a map. Suppose that G is the directed graph defined by $$V(G)=CB(X)$$ and $$E(G)= \{(A, B): H(A, B) \leq\phi(A) - \phi(B)\}$$. We say that ϕ is upper semi-continuous whenever $$\phi(A_{n}) \leq \phi(A)$$ for all sequences $$\{A_{n}\}$$ in $$CB(X)$$ such that $$\{A_{n}\}$$ converges to A as $$n \rightarrow\infty$$ for some $$A \in CB(X)$$ (here the convergence is defined with respect to the Pompeiu-Hausdorff metric H).

Our first result uses the concept of a minimal path. If Z denotes the set of all paths with at least two edges in a directed graph G, then $$(Z,\subseteq)$$ is a partially ordered set. Also since it is trivially true that every partially ordered set has a minimal element, we can conclude that G has a minimal path.

Definition 2.13

A directed graph G where $$V(G)=CB(X)$$ is said to have the lower bound property if every minimal path P in G has a lower bound $$M\in CB(X)$$ such that $$M\in V(P)$$, i.e., the lower bound of P lies in P itself.

Theorem 2.14

Let G be a directed graph defined via the vertices $$V(G)=CB(X)$$ and having the lower bound property. Then a minimal path in G, considered as a subgraph of G, has a start set or a cycle.

Proof

Let us assume that G has no cycle. Let B be a minimal path in G and $$L \subset B$$ be a lower bound of B. If L is not a start set, there exists $$U\in V(L)$$ and $$V \in V(G)$$ such that $$U \neq V$$ and there is a path from V to U. Then $$B \setminus\{U\}$$ is a path in G and $$B \setminus\{U\} \subset B$$. This contradicts the fact that B is a minimal path. Hence L must be a start set of B. □

Below we give an example to verify Theorem 2.14.

Example 2.15

Let $$X = \{x_{1}, x_{2}, x_{3},\ldots\}$$ and G be a directed graph defined via the vertices $$V(G)=CB(X)$$. Consider the closed and bounded subsets of X as $$A =\{x_{1}\}, B = \{x_{3}, x_{5}, x_{6}\}, C = \{ x_{7}\}, D = \{x_{2}, x_{9}\}$$ and $$E = \{x_{4}, x_{8}\}$$. Also suppose that H is a subgraph of G with vertices $$V(H)=\{A,B,C,D,E\}$$ and edges $$E(H) = \{(A, B), (B, C), (E, C), (D, E)\}$$. Then it is easy to see that H has no cycle and has the lower bound property. Here $$A\rightarrow B\rightarrow C$$ is a minimal path in H, which has a start set A.

Theorem 2.16

Let G be a directed graph defined via the vertices $$V(G)=CB(X)$$. Then G has a start set if and only if each self-path map on G has a fixed set.

Proof

Let A be a start set of the directed graph G and $$T : CB(X) \rightarrow CB(X)$$ be a self-path map on G. We claim that A is a fixed set of T. For any $$a\in A$$, since $$\{a\} \in[T(a)]_{G}$$, there is a path (finite or infinite) from u to a for some $$u \in T(a)$$. But since $$\{a\}$$ is a start set (as per Remark 2.10), this is not possible for any $$u \in T(a)$$ unless $$u=a$$. Thus, we must have $$a\in T(a)$$ and consequently $$A\subseteq T(A)$$ i.e., A is a fixed set of T.

Again, suppose that G is a directed graph and each self-path map on G has a fixed set. If possible assume that G has no start set. Then, for each $$A\in CB(X)$$ and $$x\in A$$, there exists $$y\in V(G)$$ such that $$x\neq y$$ and there is a path from y to x. Now, considering every such pair $$(y,x)$$, for each $$A\in CB(X)$$, we can define a map $$T :CB(X)\rightarrow CB(X)$$ such that $$(T(A), A) \subset E(G)$$. It is, however, easy to see that T is a self-path map because $$A \in [T(A)]_{G}, \text{ for all } A\in CB(X)$$, but T has no fixed set as $$A \nsubseteq T(A)$$ for any $$A\in CB(X)$$. This contradicts our hypothesis and thus G must have a start set. □

Our next example shows that indeed if a directed graph has no start set, then a self-path map may be defined which has no fixed set.

Example 2.17

Let $$X = \{1, 2,\ldots,13\}$$. We consider some closed and bounded subsets of X as $$A =\{1\}, B = \{2, 4\}, C = \{6, 8, 10\}, D = \{5, 7, 11, 13\}$$ and $$E = \{3, 6, 9,12\}$$. Let G be a directed graph with vertices $$V (G) = P(X)$$ (the power set of X), and let H be a subgraph of G with vertices $$V(H)=\{A,B,C,D,E\}$$ and edges $$E(H) = \{(A, B), (B, C), (C, D), (D, B),(D, E),(E, A)\}$$. Define the map $$T: V(H)\rightarrow V(H)$$ such that $$T(A) = E, T(B) = C, T(C) = B, T(D) = A, T(E) = D$$. Then it is easy to see that T is a self-path map but G has no fixed set and no start set either.

Theorem 2.18

Let G be a directed graph defined via the vertices $$V(G)=CB(X)$$ such that every path in G has an infimum within itself and $$T:CB(X)\rightarrow CB(X)$$ be a self-path map on G. Also, let $$G^{\prime}= \{U\in CB(X) : U\in[T(U)]_{G}\}$$ and $$G^{\prime}$$ has no cycle. Then T has a fixed set in $$G^{\prime}$$.

Proof

Let B be a path in $$G^{\prime}$$ and $$D\in CB(X)$$ be its infimum (greatest lower bound). Therefore, from the definition of self-path map, we have $$D\in[T(D)]_{G}$$, which implies that $$D\in G^{\prime}$$. Also, $$G^{\prime}$$ is a subgraph of G. Now, using Theorem 2.14, $$G^{\prime}$$ has a start set. Again, since T may be considered as a self-path map on $$G^{\prime}$$, using Theorem 2.16 we can conclude that T has a fixed set in $$G^{\prime}$$. □

Lemma 2.19

Let X be a complete metric space and $$\phi:CB(X) \rightarrow(-\infty , \infty)$$ a map bounded from above. Suppose that G is the directed graph defined by $$V(G) = CB(X)$$ and $$E(G)=\{(A, B):H(A, B) \leq\phi (A) - \phi(B)\}$$. If ϕ is upper semi-continuous, then G has a start set.

Proof

First we prove that G has no cycle. If G has a cycle, then there exist a finite path $$\{\lambda_{i}\}_{i=1}^{n}$$ for some $$\lambda_{i}\in A_{i}$$ where each $$A_{i} \in CB(X)$$ such that $$\lambda_{1} = \lambda_{n}$$ (for in a cycle initial and terminal vertices are the same).

Now, for $$\lambda_{1} \in A_{1}$$ and $${\lambda_{i}\in A_{i}}, i\geq2$$, we have $$H(A_{i}, A_{1}) \leq\phi(A_{i}) - \phi(A_{1})$$ and also $$H(A_{i}, A_{1}) \leq\phi(A_{1}) - \phi(A_{i}) = -[\phi(A_{i}) - \phi(A_{1})]$$. But this is possible only when $$\phi(A_{i}) = \phi(A_{1})$$, i.e., $$H(A_{i}, A_{1}) \leq0$$. This implies that $$A_{i} = A_{1} \text{ for all } i \geq2$$, which is a contradiction. Thus, G cannot have any cycle.

Next we show that each path in G has a lower bound. Let $$\{A_{\lambda}\} _{\lambda\in\Lambda}$$ be a path in G. As ϕ is bounded from above, we can obtain a decreasing sequence $$\{\lambda_{n}\}_{n \geq1}$$ such that $$\lim_{n\rightarrow\infty} \phi(A_{\lambda_{n}}) = \sup_{\lambda\in\Lambda} \phi(A_{\lambda})$$.

Now,
\begin{aligned} & H(A_{\lambda_{n}}, A_{\lambda_{m}}) \\ &\quad\leq H(A_{\lambda_{n}}, A) + H( A, A_{\lambda_{m}}), \quad\text{for } n, m \geq1 \\ &\quad = \phi(A_{\lambda_{n}}) - \phi(A) + \phi(A) - \phi(A_{\lambda_{m}}), \quad\text{where } (A_{\lambda_{n}}, A)\in E(G) \text{ and } (A, A_{\lambda _{m}})\in E(G) \\ &\quad= \phi(A_{\lambda_{n}}) - \phi(A_{\lambda_{m}}) \\ &\quad \Rightarrow\quad\lim_{n, m\rightarrow\infty} H(A_{\lambda_{n}}, A_{\lambda _{m}}) \leq\lim_{n\rightarrow\infty} \phi(A_{\lambda_{n}}) - \lim _{m\rightarrow\infty} \phi(A_{\lambda_{m}}) \\ &\phantom{\qquad \Rightarrow\lim_{n, m\rightarrow\infty} H(A_{\lambda_{n}}, A_{\lambda _{m}})}= \sup\phi(A_{\lambda}) - \sup\phi(A_{\lambda}) \\ &\phantom{\qquad \Rightarrow\lim_{n, m\rightarrow\infty} H(A_{\lambda_{n}}, A_{\lambda _{m}})}= 0. \end{aligned}
Therefore, we see that $$\{A_{\lambda_{n}}\}_{n \geq1}$$ is a Cauchy sequence in $$CB(X)$$. Since $$(CB(X), H)$$ is complete, we have $$\{ A_{\lambda_{n}}\}$$ must converge to some $$A \in CB(X)$$. As ϕ is upper semi-continuous, we now have $$\phi(A_{\lambda_{n}}) \leq\phi(A)$$ $$\Rightarrow0 \leq\phi(A) - \phi(A_{\lambda_{n}})$$ i.e., $$H(A, A_{\lambda_{n}}) \leq\phi(A) - \phi(A_{\lambda_{n}})$$.

Thus, $$A_{\lambda_{n}} \in[A]_{G^{l}} \text{ for all } n \geq1$$. So, A is a lower bound for $$\{A_{\lambda_{n}}\}_{n \geq1}$$. Now we show that A is a lower bound for $$\{A_{\lambda}\}_{\lambda\in\Lambda}$$. If there exists $$\mu\in\Lambda$$ such that $$A_{\lambda_{n}} \in[A_{\mu}]_{G^{l}}, \text{ for all } n \geq1$$, then $$\phi(A_{\lambda_{n}}) \leq \phi(A_{\mu}) \text{ for all } n \geq1$$, which implies that $$\phi(A_{\mu}) = \sup_{\lambda\in\Lambda} \phi(A_{\lambda})$$. Since $$H(A_{\lambda _{n}}, A_{\mu}) \leq\phi(A_{\lambda_{n}}) - \phi(A_{\mu})$$, from the definition of upper semi-continuous map, we have $$A_{\lambda_{n}} \rightarrow A_{\mu}$$. This implies that $$A_{\mu}= A$$ (for $$A_{\lambda_{n}} \rightarrow A$$). Hence $$\phi(A) = \sup_{\lambda\in\Lambda} \phi (A_{\lambda})$$. We claim that $$A_{\lambda}\in[A]_{G^{l}}$$. In fact, if there is $$\lambda\in\Lambda$$ such that $$A\in[A_{\lambda}]_{G^{l}}$$ then $$H(A_{\lambda}, A) \leq\phi(A_{\lambda}) - \phi(A)$$ $$\leq\phi(A_{\lambda}) - \phi(A_{\lambda}) = 0$$, and so, $$A_{\lambda}= A$$. Since $$\{A_{\lambda}\}_{\lambda\in\Lambda}$$ is a path in G, if the previous case is not true, then, for each $$\lambda\in\Lambda$$, there exists $$n \geq1$$ such that $$A_{\lambda}\in [A_{\lambda_{n}}]_{G^{l}}$$.

Again we have $$A_{\lambda_{n}} \in[A]_{G^{l}}$$. This implies that $$A_{\lambda}\in[A]_{G^{l}}$$. Thus A is a lower bound for $$\{A_{\lambda}\}_{\lambda\in\Lambda}$$. Now, using Theorem 2.14, we can say that G has a start set. □

Theorem 2.20

Let $$(X,d)$$ be a complete metric space, $$\phi: CB(X) \rightarrow (-\infty, \infty)$$ a map bounded from above and upper semi-continuous and $$T: CB(X)\rightarrow CB(X)$$ a self-path map satisfying the condition $$H(C, A) \leq\phi(C) - \phi(A)$$, for all $$C, A \in CB(X)$$ and $$C\subset T(A)$$. Then T has a fixed set.

Proof

Suppose that G is the directed graph via the vertices $$V(G)=CB(X)$$ and the edges $$E(G) = \{(A, B): H(A, B) \leq\phi(A) - \phi(B)\}$$. Using Lemma 2.19, we can conclude that G has a start set. Again, using Theorem 2.16, it is trivial to see that T has a fixed set. □

3 Conclusion

In this paper we introduced the new concept of start set and also a concept called fixed set which is analogous to the concept of fixed point for a multivalued map. Our results unify and extend some existing results in the literature. The results discussed in this paper are mainly concerned with the existence of fixed sets. The study of uniqueness of fixed sets in the current context would be an interesting topic for future study. Some famous theorems such as Nadler’s theorem etc. may also be generalized in the present context so that it would be a special case for mappings of the type $$T:CB(X)\rightarrow CB(X)$$.

Declarations

Acknowledgements

The authors are extremely thankful to the reviewers and the Editor-in-Charge for their excellent comments and suggestions toward the improvement of the paper.

The corresponding author expresses his gratitude to Prof. M.R. Alfuraidan (Department of Mathematics & Statistics, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia) for his constructive feedback regarding some aspects of this paper. 