Next Article in Journal
The Randomized First-Hitting Problem of Continuously Time-Changed Brownian Motion
Next Article in Special Issue
Ekeland’s Variational Principle and Minimization Takahashi’s Theorem in Generalized Metric Spaces
Previous Article in Journal
Closing Gaps in Geometrically Frustrated Symmetric Clusters: Local Equivalence between Discrete Curvature and Twist Transformations
Previous Article in Special Issue
Non-Unique Fixed Point Results in Extended B-Metric Space
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Near Fixed Point Theorems in Hyperspaces

Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 802, Taiwan
Mathematics 2018, 6(6), 90; https://doi.org/10.3390/math6060090
Submission received: 26 April 2018 / Revised: 19 May 2018 / Accepted: 24 May 2018 / Published: 28 May 2018
(This article belongs to the Special Issue Fixed Point Theory)

Abstract

:
The hyperspace consists of all the subsets of a vector space. It is well-known that the hyperspace is not a vector space because it lacks the concept of inverse element. This also says that we cannot consider its normed structure, and some kinds of fixed point theorems cannot be established in this space. In this paper, we shall propose the concept of null set that will be used to endow a norm to the hyperspace. This normed hyperspace is clearly not a conventional normed space. Based on this norm, the concept of Cauchy sequence can be similarly defined. In addition, a Banach hyperspace can be defined according to the concept of Cauchy sequence. The main aim of this paper is to study and establish the so-called near fixed point theorems in Banach hyperspace.

1. Introduction

Given a universal set X, the collection of all nonempty subsets of X is called the hyperspace. The topic of set-valued analysis is to study the mathematical properties on hyperspace by referring to the monographs [1,2,3,4,5,6,7]. Especially, the set-valued optimization and differential inclusion have been well-studied. The purpose of this paper is to study the near fixed point theorem in hyperspace. The concept of near fixed point is the first attempt at studying the fixed point theory in hyperspace. The conventional fixed point theorem in normed space can be used to study the existence of solutions for some mathematical problems. Especially, the application of fixed point theorems in economics can refer to the articles [8,9,10]. Therefore, the potential applications of near fixed point theorems established in this paper can be used to study the existence of solutions for the mathematical problems that involve the set-valued mappings. This could be future research.
Let X be a topological vector space, and let K ( X ) be the collection of all nonempty compact and convex subsets of X. Given A , B K ( X ) , the set addition is defined by
A B = a + b : a A   and   b B
and the scalar multiplication in K ( X ) is defined by
λ A = λ a : a A ,
where λ is a constant in R . It is clear to see that K ( X ) cannot be a vector space under the above set addition and scalar multiplication. The main reason is that there is no additive inverse element for each element in K ( X ) .
The substraction between A and B is denoted and defined by
A B A ( B ) = a b : a A   and   b B .
Let θ X be the zero element of the vector space X. It is clear to see that the singleton set { θ X } , denoted by θ K ( X ) , can be regarded as the zero element of K ( X ) since
A θ K ( X ) = A { θ X } = A .
On the other hand, since A A { θ X } , it means that A A is not the zero element of K ( X ) . In other words, the additive inverse element of A in K ( X ) does not exist. This says that K ( X ) cannot form a vector space under the above set addition and scalar multiplication. The following set
Ω = A A : A K ( X )
is called the null set of K ( X ) , which can be regarded as a kind of “zero element” of K ( X ) . We also recall that the true zero element of K ( X ) is θ K ( X ) { θ X } , since (1) is satisfied.
Recall that the (conventional) normed space is based on the vector space by referring to the monographs [11,12,13,14,15,16,17]. Since K ( X ) is not a vector space, we cannot consider the (conventional) normed space ( K ( X ) , · ) . Therefore we cannot study the fixed point theorem in ( K ( X ) , · ) using the conventional way. In this paper, although K ( X ) is not a vector space, we still can endow a norm to K ( X ) in which the axioms are almost the same as the axioms of conventional norm. The only difference is that the concept of null set is involved in the axioms. Under these settings, we shall study the so-called near fixed point theorem in the normed hyperspace ( K ( X ) , · ) .
Let T : K ( X ) K ( X ) be a function from K ( X ) into itself. We say that A K ( X ) is a fixed point if and only if T ( A ) = A . Since K ( X ) lacks the vector structure, we cannot expect to obtain the fixed point of the mapping T using conventional methods. In this paper, we shall try to construct a subset A of X satisfying T ( A ) ω 1 = A ω 2 for some ω 1 , ω 2 Ω . Since the null set Ω can play the role of zero element in K ( X ) , i.e., the elements ω 1 and ω 2 can be ignored in some sense, this kind of subset A is said to be a near fixed point of the mapping T .
In Section 2 and Section 3, the concept of normed hyperspace is proposed, where some interesting properties are derived in order to study the near fixed point theorem. In Section 4, according to the norm, the concept of Cauchy sequence can be similarly defined. In addition, the Banach hyperspace is defined based on the Cauchy sequence. In Section 5, we present many near fixed point theorems that are established using the almost identical concept in normed hyperspace.

2. Hyperspaces

Let X be a vector space with zero element θ X , and let K ( X ) be the collection of all subsets of X. Under the set addition and scalar multiplication in K ( X ) , it is clear to see that K ( X ) cannot form a vector space. One of the reasons is that, given any A K ( X ) , the difference A A is not a zero element of K ( X ) . It is clear to see that the singleton set { θ X } is a zero element, since
A { θ X } = { θ X } A = A
for any A K ( X ) . However, when A K ( X ) is not a singleton set, we cannot have A A = { θ X } . In this section, we shall present some properties involving the null set Ω , which will be used for establishing the so-called near fixed point theorems in K ( X ) .
Remark 1.
For further discussion, we first recall some well-known properties given below:
  • ( A B ) C = A ( B C ) ;
  • λ ( A B ) = λ A λ B for λ R ;
  • λ 1 ( λ 2 A ) = ( λ 1 λ 2 ) A for λ 1 , λ 2 R ;
  • if A is a convex subset of X and λ 1 and λ 2 have the same sign, then ( λ 1 + λ 2 ) A = λ 1 A λ 2 A .
We also recall that the following family
Ω = A A : A K ( X )
is called the null set of K ( X ) . For further discussion, we present some useful properties.
Proposition 1.
The following statements hold true:
  • The singleton set { θ X } θ K ( X ) is in the null set Ω;
  • ω Ω implies ω = ω ;
  • λ Ω = Ω for λ R with λ 0 ;
  • Ω is closed under the set addition; that is, ω 1 ω 2 Ω for any ω 1 , ω 2 Ω .
Since the null set Ω is treated as a zero element, we can propose the almost identical concept for elements in K ( X ) .
Definition 1.
Given any A , B K ( X ) , we say that A and B are almost identical if and only if there exist ω 1 , ω 2 Ω such that A ω 1 = B ω 2 . In this case, we write A = Ω B .
When A, B and C are not singleton sets, if A B = C , then we cannot have A = B C . However, we can have A = Ω B C . Indeed, since A B = C , by adding B on both sides, we obtain A ω = B C , where ω = B B Ω . This says that A = Ω B C .
Proposition 2.
The binary relation = Ω is an equivalence relation.
Proof. 
For any A K ( X ) , A = A implies A = Ω A , which shows the reflexivity. The symmetry is obvious by the definition of the binary relation = Ω . Regarding the transitivity, for A = Ω B and B = Ω C , we want to claim A = Ω C . By definition, we have
A ω 1 = B ω 2   and   B ω 3 = C ω 4
for some ω i Ω for i = 1 , , 4 . Then
A ω 1 ω 3 = B ω 3 ω 2 = C ω 4 ω 2 ,
which shows A = Ω C , since Ω is closed under the set addition. This completes the proof. ☐
According to the equivalence relation = Ω , for any A K ( X ) , we define the equivalence class
[ A ] = B K ( X ) : A = Ω B .
The family of all classes [ A ] for A K ( X ) is denoted by [ K ( X ) ] . In this case, the family [ K ( X ) ] is called the quotient set of K ( X ) . We also have that B [ A ] implies [ A ] = [ B ] . In other words, the family of all equivalence classes form a partition of the whole set K ( X ) . We also remark that the quotient set [ K ( X ) ] is still not a vector space. The reason is
( α + β ) [ A ] α [ A ] + β [ A ]
for α β < 0 , since ( α + β ) A α A + β A for A K ( X ) with α β < 0 .

3. Normed Hyperspaces

Notice that K ( X ) is not a vector space. Therefore we cannot consider the normed space ( K ( X ) , · ) . However, we can propose the so-called normed hyperspace involving the null set Ω as follows.
Definition 2.
Given the nonnegative real-valued function · : K ( X ) R + , we consider the following conditions:
(i)
α A = | α | A for any A K ( X ) and α F ;
( i )
α A = | α | A for any A K ( X ) and α F with α 0 ;
(ii)
A B A + B for any A , B K ( X ) ;
(iii)
A = 0 implies A Ω .
We say that · satisfies the null condition when condition (iii) is replaced by A = 0 if and only if A Ω . Different kinds of normed hyperspaces are defined below.
  • We say that ( K ( X ) , · ) is a pseudo-seminormed hyperspace if and only if conditions ( i ) and (ii) are satisfied.
  • We say that ( K ( X ) , · ) is a seminormed hyperspace if and only if conditions (i) and (ii) are satisfied.
  • We say that ( K ( X ) , · ) is a pseudo-normed hyperspace if and only if conditions ( i ), (ii) and (iii) are satisfied.
  • We say that ( K ( X ) , · ) is a normed hyperspace if and only if conditions (i), (ii) and (iii) are satisfied.
Now we consider the following definitions:
  • We say that · satisfies the null super-inequality if and only if A ω A for any A K ( X ) and ω Ω .
  • We say that · satisfies the null sub-inequality if and only if A ω A for any A K ( X ) and ω Ω .
  • We say that · satisfies the null equality if and only if A ω = A for any A K ( X ) and ω Ω .
For any A , B K ( X ) , since ( B A ) = A B , we have
A B = B A .
Example 1.
We consider the (conventional) normed space ( X , · X ) . For any A K ( X ) , we define
A = sup a A a X .
Then we have the following properties.
  • A = 0 if and only if A = { θ X } Ω . Indeed, if A = { θ X } , then it is obvious that A = 0 . For the converse, if A = 0 , then we have a X = 0 for all a A , i.e., A = { θ X } .
  • We have
    λ A = sup a λ A a X = sup b A λ b X = | λ | sup b A b X = | λ | A .
  • We want to claim A B A + B . We denote by
    ζ 1 = sup { ( a , b ) : a A , b B } a X   and   ζ 2 = sup { ( a , b ) : a A , b B } b X .
Then we see that a X + b X ζ 1 + ζ 2 for all a A and b B .
Therefore we obtain
sup { ( a , b ) : a A , b B } a X + b X ζ 1 + ζ 2 = sup { ( a , b ) : a A , b B } a X + sup { ( a , b ) : a A , b B } b X .
Now we have
A B = sup c A B c X = sup { ( a , b ) : a A , b B } a + b X sup { ( a , b ) : a A , b B } a X + b X sup { ( a , b ) : a A , b B } a X + sup { ( a , b ) : a A , b B } b X = sup a A a X + sup b B b X = A + B .
We conclude that ( K ( X ) , · ) is a normed hyperspace. For ω Ω , it means that ω = B B for some B K ( X ) . Then we have
ω = B B = sup { ( b 1 , b 2 ) : b 1 , b 2 B } b 1 b 2 X .
Since ω is not equal to zero in general, it means that the null condition is not satisfied.
Proposition 3.
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace such that · satisfies the null super-inequality. For any A , C , B 1 , , B m K ( X ) , we have
A C A B 1 + B 1 B 2 + + B j B j + 1 + + B m C .
Proof. 
We have
A C A ( C ) B 1 B m ( B 1 ) ( B m ) ( using   the   null   super - inequality   for   m   times ) = [ A ( B 1 ) ] [ B 1 ( B 2 ) ] + + [ B j ( B j + 1 ) ] + + [ B m ( C ) ] A B 1 + B 1 B 2 + + B j B j + 1 + + B m C ( using   the   triangle   inequality ) .
This completes the proof. ☐
Proposition 4.
The following statements hold true.
(i)
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace such that · satisfies the null equality. For any A , B K ( X ) , if A = Ω B , then A = B .
(ii)
Let ( K ( X ) , · ) be a pseudo-normed hyperspace. For any A , B K ( X ) , A B = 0 implies A = Ω B .
(iii)
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace such that · satisfies the null super-inequality and null condition. For any A , B K ( X ) , A = Ω B implies A B = 0 .
Proof. 
To prove part (i), we see that A = Ω B implies A ω 1 = B ω 2 for some ω 1 , ω 2 Ω . Therefore, using the null equality, we have A = A ω 1 = B ω 2 = B . To prove part (ii), suppose that A B = 0 . Then A B Ω , i.e., A B = ω 1 for some ω 1 Ω . Then, by adding B on both sides, we have A ω 2 = B ω 1 for some ω 2 Ω , which says that A = Ω B . To prove part (iii), for A = Ω B , we have A ω 1 = B ω 2 for some ω 1 , ω 2 Ω . Since Ω is closed under the vector addition, it follows that
A B ω 1 = A ω 1 B = B ω 2 B = ω 3
for some ω 3 Ω . Using the null super-inequality, null condition and (2), we have
A B A B ω 1 = ω 3 = 0 .
This completes the proof. ☐

4. Cauchy Sequences

Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace. Given a sequence { A n } n = 1 in K ( X ) , it is clear that A n A = A A n . The concept of limit is defined below.
Definition 3.
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace. A sequence { A n } n = 1 in K ( X ) is said to converge to A K ( X ) if and only if
lim n A n A = lim n A A n = 0 .
We have the following interesting results.
Proposition 5.
Let ( K ( X ) , · ) be a pseudo-normed hyperspace with the null set Ω.
(i)
If the sequence { A n } n = 1 in ( K ( X ) , · ) converges to A and B simultaneously, then [ A ] = [ B ] .
(ii)
Suppose that · satisfies the null equality. If the sequence { A n } n = 1 in ( K ( X ) , · ) converges to A K ( X ) , then, give any B [ A ] , the sequence { A n } n = 1 converges to B.
Proof. 
To prove the first case of part (i), we have
lim n A A n = lim n A n B = 0 .
By Proposition 3, we have
0 A B A A n + A n B 0 + 0 = 0 ,
which says that A B = 0 . By Definition 2, we see that A B Ω , i.e. A = Ω B , which also says that B is in the equivalence class [ A ] .
To prove part (ii), for any B [ A ] , i.e., A ω 1 = B ω 2 for some ω 1 , ω 2 Ω , using the null equality, we have
0 A n B = B A n = ω 2 B A n = ω 1 A A n = A A n 0 .
This completes the proof. ☐
Inspired by part (ii) of Proposition 5, we propose the following concept of limit.
Definition 4.
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace. If the sequence { A n } n = 1 in K ( X ) converges to some A K ( X ) , then the equivalence class [ A ] is called the class limit of { A n } n = 1 . We also write
lim n A n = [ A ]   or   A n [ A ] .
We need to remark that if [ A ] is a class limit and B [ A ] then it is not necessarily that the sequence { A n } n = 1 converges to y unless · satisfies the null equality. In other words, for the class limit [ A ] , if · satisfies the null equality, then part (ii) of Proposition 5 says that sequence { A n } n = 1 converges to B for any B [ A ] .
Proposition 6.
Let ( K ( X ) , · ) be a pseudo-normed hyperspace such that · satisfies the null super-inequality. Then the class limit is unique.
Proof. 
Suppose that the sequence { A n } n = 1 is convergent with the class limits [ A ] and [ B ] . Then, by definition, we have
lim n A A n = lim n A n A = lim n B A n = lim n A n B = 0 ,
which says that A B = 0 by referring to (3). By part (ii) of Proposition 4, we have A = Ω B , i.e., [ A ] = [ B ] . This shows the uniqueness in the sense of class limit. ☐
Definition 5.
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace. A sequence { A n } n = 1 in K ( X ) is called a Cauchy sequence if and only if, given any ϵ > 0 , there exists N N such that
A n A m = A m A n < ϵ
for m , n > N with m n . If every Cauchy sequence in K ( X ) is convergent, then we say that K ( X ) is complete.
Proposition 7.
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace such that · satisfies the null super-inequality. Then every convergent sequence is a Cauchy sequence.
Proof. 
If { A n } n = 1 is a convergent sequence, then, given any ϵ > 0 , A n A = A A n < ϵ / 2 for sufficiently large n. Therefore, by Proposition 3, we have
A n A m = A m A n A m A + A A n < ϵ 2 + ϵ 2 = ϵ
for sufficiently large n and m, which says that { A n } n = 1 is a Cauchy sequence. This completes the proof. ☐
Definition 6.
Different kinds of Banach hyperspaces are defined below.
  • Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace. If K ( X ) is complete, then it is called a pseudo-semi-Banach hyperspace.
  • Let ( K ( X ) , · ) be a seminormed hyperspace. If K ( X ) is complete, then it is called a semi-Banach hyperspace.
  • Let ( K ( X ) , · ) be a pseudo-normed hyperspace. If K ( X ) is complete, then it is called a pseudo-Banach hyperspace.
  • Let ( K ( X ) , · ) be a normed hyperspace. If K ( X ) is complete, then it is called a Banach hyperspace.
Example 2.
Continued from Example 1, we further assume that ( X , · X ) is a (conventional) Banach space. Then we want to show that the normed hyperspace ( K ( X ) , · ) is complete. Suppose that { A n } n = 1 is a Cauchy sequence in ( K ( X ) , · ) . Let A be the collection of all sequences induced from the sequence { A n } n = 1 . More precisely, each element in A is a sequence { a n } n = 1 with a n A n for all n. Firstly, we need to claim that each sequence in A is convergent. Since { A n } n = 1 is a Cauchy sequence, i.e., A n A m < ϵ for m , n > N with m n , we have
ϵ > A n A m = sup x A n A m x X = sup { ( a n , a m ) : a n A n , a m A m } a n a m X ,
which says that a n a m X < ϵ for any sequence { a n } n = 1 with a n A n for all n, where ϵ is independent of a n and a m . By the completeness of ( X , · X ) , it follows that each sequence { a n } n = 1 is convergent to some a X , i.e., a n a X 0 as n in the uniform sense, which means a n a X < ϵ such that ϵ is independent of a n and a. Indeed, if ϵ is dependent of a n and a, then
a n a m X a n a X + a a m X
says that ϵ is dependent of a n and a m , which is a contradiction. We can define a subset A of X that collects all of the limit points of each sequence in A . Then, finally, we want to claim A n A 0 as n . For any x A n A , we have x = a n a for some a n A n and a A . Since a is a limit point of some sequence { a n } n = 1 , for m > n > N , using (4), we have
a n a X a n a m X + a m a X < ϵ + a m a X ,
where ϵ is independent of a n and a m by referring to (4) again. Since a m a X 0 as m in the uniform sense, it follows that a n a X 0 as n in the uniform sense. Therefore we obtain
A n A = sup x A n A x X = sup { ( a n , a ) : a n A n , a A } a n a X 0   as   n .
This shows that the sequence { A n } n = 1 is convergent, i.e., ( K ( X ) , · ) is a Banach hyperspace.

5. Near Fixed Point Theorems

Let T : K ( X ) K ( X ) be a function from K ( X ) into itself. We say that A K ( X ) is a fixed point if and only if T ( A ) = A . This concept is completely different from the concept of fixed point in set-valued functions. Some conventional fixed point theorems are based on the normed space that is also a vector space. Since ( K ( X ) , · ) is not a vector space, we cannot study the corresponding fixed point theorems based on ( K ( X ) , · ) . However, we can study the so-called near fixed point that is defined below.
Definition 7.
Let T : K ( X ) K ( X ) be a function defined on K ( X ) into itself. A point A K ( X ) is called a near fixed point of T if and only if T ( A ) = Ω A .
By definition, we see that T ( A ) = Ω A if and only if there exist ω 1 , ω 2 Ω such that T ( A ) = A , T ( A ) ω 1 = A , or T ( A ) = A ω 1 or T ( A ) ω 1 = A ω 2 .
Definition 8.
Let ( K ( X ) , · ) be a pseudo-seminormed hyperspace. A function T : ( K ( X ) , · ) ( K ( X ) , · ) is called a contraction on K ( X ) if and only if there is a real number 0 < α < 1 such that
T ( A ) T ( B ) α A B
for any A , B K ( X ) .
Given any initial element A 0 K ( X ) , we define the iterative sequence { A n } n = 1 using the function T as follows:
A 1 = T ( A 0 ) , A 2 = T ( A 1 ) = T 2 ( A 0 ) , , A n = T n ( A 0 ) .
Under some suitable conditions, we are going to show that the sequence { A n } n = 1 can converge to near a fixed point.
Theorem 1.
Let ( K ( X ) , · ) be a Banach hyperspace with the null set Ω such that · satisfies the null equality. Suppose that the function T : ( K ( X ) , · ) ( K ( X ) , · ) is a contraction on K ( X ) . Then T has a near fixed point A K ( X ) satisfying T ( A ) = Ω A . Moreover, the near fixed point A is obtained by the limit
A A n = A n A 0   as   n
in which the sequence { A n } n = 1 is generated according to (5). We also have the following properties.
  • The uniqueness is in the sense that there is a unique equivalence class [ A ] such that any A ¯ [ A ] cannot be near a fixed point.
  • Each point A ¯ [ A ] is also a near fixed point of T satisfying T ( A ¯ ) = Ω A ¯ and [ A ¯ ] = [ A ] .
  • If A ¯ is a near fixed point of T , then A ¯ [ A ] , i.e., [ A ¯ ] = [ A ] . Equivalently, if A and A ¯ are the near fixed points of T , then A = Ω A ¯ .
Proof. 
Given any initial element A 0 K ( X ) , we are going to show that { A n } n = 1 is a Cauchy sequence. Since T is a contraction on K ( X ) , we have
A m + 1 A m = T ( A m ) T ( A m 1 ) α A m A m 1 = α T ( A m 1 ) T ( A m 2 ) α 2 A m 1 A m 2 α m A 1 A 0 .
For n < m , using Proposition 3, we obtain
A m A n A m A m 1 + A m 1 A m 2 + + A n + 1 A n α m + α m + 1 + + α n · A 1 A 0 = α n · 1 α m n 1 α · A 1 A 0 .
Since 0 < α < 1 , we have 1 α m n < 1 in the numerator, which says that
A m A n α n 1 α · A 1 A 0 0   as   n .
This proves that { A n } n = 1 is a Cauchy sequence. Since K ( X ) is complete, there exists A K ( X ) such that
A A n = A n A 0   as   n .
We are going to show that any point A ¯ [ A ] is a near fixed point. Now we have A ¯ ω 1 = A ω 2 for some ω 1 , ω 2 Ω . Using the triangle inequality and the fact of contraction on K ( X ) , we have
A ¯ T ( A ¯ ) = ( A ¯ ω 1 ) T ( A ¯ ) ( since · satisfies   the   null   equality ) ( A ¯ ω 1 ) A m + A m T ( A ¯ ) ( using   Proposition 3 ) = ( A ¯ ω 1 ) A m + T ( A m 1 ) T ( A ¯ ) ( A ¯ ω 1 ) A m + α A m 1 A ¯ = ( A ¯ ω 1 ) A m + α A m 1 A ¯ ( ω 1 ) ( since ω 1 Ω   and   · satisfies   the   null   equality ) = ( A ¯ ω 1 ) A m + α A m 1 ( A ¯ ω 1 ) ( using   Remark 1 ) = ( A ω 2 ) A m + α A m 1 ( A ω 2 ) = A A m + α A m 1 A ( using ω 2 Ω ,   the   null   equality   and   Remark 1 ) ,
which implies A ¯ T ( A ¯ ) = 0 as m . We conclude that T ( A ¯ ) = Ω A ¯ for any point A ¯ [ A ] by part (ii) of Proposition 4.
Now assume that there is another near fixed point A ¯ of T with A ¯ [ A ] , i.e., A ¯ = Ω T ( A ¯ ) . Then
A ¯ ω 1 = T ( A ¯ ) ω 2   and   A ω 3 = T ( A ) ω 4
for some ω i Ω , i = 1 , , 4 . Since T is a contraction on K ( X ) and · satisfies the null equality, we obtain
A ¯ A = ( A ¯ ω 1 ) ( A ω 3 ) ( using ω 3 Ω ,   the   null   equality   and   Remark 1 ) = T ( A ¯ ) ω 2 T ( A ) ω 4 = T ( A ¯ ) T ( A ) ( using ω 4 Ω ,   the   null   equality   and   Remark 1 ) α A ¯ A .
Since 0 < α < 1 , we conclude that A ¯ A = 0 , i.e., A ¯ = Ω A , which contradicts A ¯ [ A ] . Therefore, any A ¯ [ A ] cannot be the near fixed point. Equivalently, if A ¯ is a near fixed point of T , then A ¯ [ A ] . This completes the proof. ☐
Definition 9.
Let ( K ( X ) , · ) be a pseudo-normed hyperspace. A function T : ( K ( X ) , · ) ( K ( X ) , · ) is called a weakly strict contraction on K ( X ) if and only if the following conditions are satisfied:
  • A = Ω B , i.e., [ A ] = [ B ] implies T ( A ) T ( B ) = 0 .
  • A Ω B , i.e., [ A ] [ B ] implies T ( A ) T ( B ) < A B .
By part (ii) of Proposition 4, we see that if A Ω B , then A B 0 , which says that the weakly strict contraction is well-defined. In other words, ( K ( X ) , · ) should be assumed to be a pseudo-normed hyperspace rather than pseudo-seminormed hyperspace. We further assume that · satisfies the null super-inequality and null condition. Part (iii) of Proposition 4 says that if T is a contraction on K ( X ) , then it is also a weakly strict contraction on K ( X ) .
Theorem 2.
Let ( K ( X ) , · ) be a Banach hyperspace with the null set Ω Suppose that · satisfies the null super-inequality and null condition, and that the function T : ( K ( X ) , · ) ( K ( X ) , · ) is a weakly strict contraction on K ( X ) . If { T n ( A 0 ) } n = 1 forms a Cauchy sequence for some A 0 K ( X ) , then T has a near fixed point A K ( X ) satisfying T ( A ) = Ω A . Moreover, the near fixed point A is obtained by the limit
T n ( A 0 ) A = A T n ( A 0 ) 0   a s   n .
Assume further that · satisfies the null equality. Then we also have the following properties.
  • The uniqueness is in the sense that there is a unique equivalence class [ A ] such that any A ¯ [ A ] cannot be a near fixed point.
  • Each point A ¯ [ A ] is also a near fixed point of T satisfying T ( A ¯ ) = Ω A ¯ and [ A ¯ ] = [ A ] .
  • If A ¯ is a near fixed point of T , then A ¯ [ A ] , i.e., [ A ¯ ] = [ A ] . Equivalently, if A and A ¯ are the near fixed points of T , then A = Ω A ¯ .
Proof. 
Since { T n ( A 0 ) } n = 1 is a Cauchy sequence, the completeness says that there exists A K ( X ) such that
T n ( A 0 ) A = A T n ( A 0 ) 0 .
Therefore, given any ϵ > 0 , there exists an integer N such that T n ( A 0 ) A < ϵ for n N . We consider the following two cases.
  • Suppose that T n ( A 0 ) = Ω A . Since T is a weakly strict contraction on K ( X ) , it follows that
    T n + 1 ( A 0 ) T ( A ) = 0 < ϵ
    by part (iii) of Proposition 4.
  • Suppose that T n ( A 0 ) Ω A . Since T is a weakly strict contraction on K ( X ) , we have
    T n + 1 ( A 0 ) T ( A ) < T n ( A 0 ) A < ϵ   for   n N .
The above two cases say that T n + 1 ( A 0 ) T ( A ) 0 . Using Proposition 3, we obtain
A T ( A ) A T n + 1 ( A 0 ) + T n + 1 ( A 0 ) T ( A ) 0   as   n ,
which says that A T ( A ) = 0 , i.e., T ( A ) = Ω A by part (ii) of Proposition 4. This shows that A is a near fixed point.
Assume that · satisfies the null equality. We are going to claim that each point A ¯ [ A ] is also a near fixed point of T . Since A ¯ = Ω A , we have A ¯ ω 1 = A ω 2 for some ω 1 , ω 2 Ω . Then, using the null equality for · , we obtain
T n ( A 0 ) A ¯ = A ¯ T n ( A 0 ) = ( A ¯ ω 1 ) T n ( A 0 ) = ( A ω 2 ) T n ( A 0 ) = A T n ( A 0 ) 0   as   n .
Using the above argument, we can also obtain T n + 1 ( A 0 ) T ( A ¯ ) 0 as n . Using Proposition 3, we have
A ¯ T ( A ¯ ) A ¯ T n + 1 ( A 0 ) + T n + 1 ( A 0 ) T ( A ¯ ) 0   as   n ,
which says that A ¯ T ( A ¯ ) = 0 . Therefore we conclude that T ( A ¯ ) = Ω A ¯ for any point A ¯ [ A ] by part (ii) of Proposition 4.
Suppose that A ¯ [ A ] is another near fixed point of T . Then T ( A ¯ ) = Ω A ¯ and [ A ¯ ] [ A ] , i.e., A Ω A ¯ . Then T ( A ) ω 1 = A ω 2 and T ( A ¯ ) ω 3 = A ¯ ω 4 , where ω i Ω for i = 1 , 2 , 3 , 4 . Therefore we obtain
A A ¯ = ( A ω 2 ) ( A ¯ ω 4 ) ( using ω 4 Ω ,   the   null   equality   and   Remark 1 ) = ( T ( A ) ω 1 ) ( T ( A ¯ ) ω 3 ) = T ( A ) T ( A ¯ ) ( using ω 3 Ω ,   the   null   equality   and   Remark 1 ) < A A ¯ ( since   A Ω A ¯   and   T   is   a   weakly   strict   contraction ) .
This contradiction says that A ¯ cannot be a near fixed point of T . Equivalently, if A ¯ is a near fixed point of T , then A ¯ [ A ] . This completes the proof. ☐
Now we consider another fixed point theorem based on the concept of weakly uniformly strict contraction which was proposed by Meir and Keeler [18].
Definition 10.
Let ( K ( X ) , · ) be a pseudo-normed hyperspace with the null set Ω . A function T : ( K ( X ) , · ) ( K ( X ) , · ) is called a weakly uniformly strict contraction on K ( X ) if and only if the following conditions are satisfied:
  • for A = Ω B , i.e., [ A ] = [ B ] , T ( A ) T ( B ) = 0 ;
  • given any ϵ > 0 , there exists δ > 0 such that ϵ A B < ϵ + δ implies T ( A ) T ( B ) < ϵ for any A Ω B , i.e., [ A ] [ B ] .
By part (ii) of Proposition 4, we see that if A Ω B , then A B 0 , which says that the weakly uniformly strict contraction is well-defined. In other words, ( K ( X ) , · ) should be assumed to be a pseudo-normed hyperspace rather than pseudo-seminormed hyperspace.
Remark 2.
We observe that if T is a weakly uniformly strict contraction on K ( X ) , then T is also a weakly strict contraction on K ( X ) .
Lemma 1.
Let ( K ( X ) , · ) be a pseudo-normed hyperspace with the null set Ω, and let T : ( K ( X ) , · ) ( K ( X ) , · ) be a weakly uniformly strict contraction on K ( X ) . Then the sequence { T n ( A ) T n + 1 ( A ) } n = 1 is decreasing to zero for any A K ( X ) .
Proof. 
For convenience, we write T n ( A ) = A n for all n. Let c n = A n A n + 1 .
  • Suppose that [ A n 1 ] [ A n ] . By Remark 2, we have
    c n = A n A n + 1 = T n ( A ) T n + 1 ( A ) < T n 1 ( A ) T n ( A ) = A n 1 A n = c n 1 .
  • Suppose that [ A n 1 ] = [ A n ] .
    Then, by the first condition of Definition 10,
    c n = T n ( A ) T n + 1 ( A ) = T ( A n 1 ) T ( A n ) = 0 < c n 1 .
    The above two cases say that the sequence { c n } n = 1 is decreasing. We consider the following cases.
  • Let m be the first index in the sequence { A n } n = 1 such that [ A m 1 ] = [ A m ] . Then we want to claim c m 1 = c m = c m + 1 = = 0 . Since A m 1 = Ω A m , we have
    c m 1 = A m 1 A m = 0 .
    Using the first condition of Definition 10, we also have
    0 = T ( A m 1 ) T ( A m ) = T m ( A ) T m + 1 ( A ) = A m A m + 1 = c m ,
    which says that A m = Ω A m + 1 , i.e., [ A m ] = [ A m + 1 ] . Using the similar arguments, we can obtain c m + 1 = 0 and [ A m + 1 ] = [ A m + 2 ] . Therefore the sequence { c n } n = 1 is decreasing to zero.
  • Suppose that [ A m + 1 ] [ A m ] for all m 1 .
    Since the sequence { c n } n = 1 is decreasing, we assume that c n ϵ > 0 , i.e., c n ϵ > 0 for all n. There exists δ > 0 such that ϵ c m < ϵ + δ for some m, i.e.,
    ϵ A m A m + 1 < ϵ + δ .
    By the second condition of Definition 10, we have
    c m + 1 = A m + 1 A m + 2 = T m + 1 ( A ) T m + 2 ( A ) = T ( A m ) T ( A m + 1 ) < ϵ ,
    which contradicts c m + 1 ϵ .
This completes the proof. ☐
Theorem 3.
Let ( K ( X ) , · ) be a Banach hyperspace with the null set Ω. Suppose that · satisfies the null super-inequality, and that the function T : ( K ( X ) , · ) ( K ( X ) , · ) is a weakly uniformly strict contraction on K ( X ) . Then T has a near fixed point satisfying T ( A ) = Ω A . Moreover, the near fixed point A is obtained by the limit
T n ( A 0 ) A = A T n ( A 0 ) 0   a s   n .
Assume further that · satisfies the null equality. Then we also have the following properties.
  • The uniqueness is in the sense that there is a unique equivalence class [ A ] such that any A ¯ [ A ] cannot be a near fixed point.
  • Each point A ¯ [ A ] is also a near fixed point of T satisfying T ( A ¯ ) = Ω A ¯ and [ A ¯ ] = [ A ] .
  • If A ¯ is a near fixed point of T , then A ¯ [ A ] , i.e., [ A ¯ ] = [ A ] . Equivalently, if A and A ¯ are the near fixed points of T , then A = Ω A ¯ .
Proof. 
According to Theorem 2 and Remark 2, we just need to claim that if T is a weakly uniformly strict contraction, then { T n ( A 0 ) } n = 1 = { A n } n = 1 forms a Cauchy sequence. Suppose that { A n } n = 1 is not a Cauchy sequence. Then there exists 2 ϵ > 0 such that, given any N, there exist n > m N satisfying A m A n > 2 ϵ . Since T is a weakly uniformly strict contraction on K ( X ) , there exists δ > 0 such that
ϵ A B < ϵ + δ   implies   T ( A ) T ( B ) < ϵ   for   any   A Ω B .
Let δ = min { δ , ϵ } . We are going to claim
ϵ A B < ϵ + δ   implies   T ( A ) T ( B ) < ϵ   for   any   A Ω B .
Indeed, if δ = ϵ , i.e., ϵ < δ , then ϵ + δ = ϵ + ϵ < ϵ + δ .
Let c n = A n A n + 1 . Since the sequence { c n } n = 1 is decreasing to zero by Lemma 1, we can find N such that c N < δ / 3 . For n > m N , we have
A m A n > 2 ϵ ϵ + δ ,
which implicitly says that A m Ω A n . Since the sequence { c n } n = 1 is decreasing by Lemma 1 again, we obtain
A m A m + 1 = c m c N < δ 3 ϵ 3 < ϵ .
For j with m < j n , using Proposition 3, we have
A m A j + 1 A m A j + A j A j + 1 .
We want to show that there exists j with m < j n such that A m Ω A j and
ϵ + 2 δ 3 < A m A j < ϵ + δ .
Let γ j = A m A j for j = m + 1 , , n . Then (7) and (8) says that γ m + 1 < ϵ and γ n > ϵ + δ . Let j 0 be an index such that
j 0 = max j [ m + 1 , n ] : γ j ϵ + 2 δ 3 .
Then we see that j 0 < n , since γ n > ϵ + δ . By the definition of j 0 , we also see that j 0 + 1 n and γ j 0 + 1 > ϵ + 2 δ 3 , which also says that A m Ω A j 0 + 1 . Therefore expression (10) will be obtained if we can show that
ϵ + 2 δ 3 < γ j 0 + 1 < ϵ + δ .
Suppose that this is not true, i.e., γ j 0 + 1 ϵ + δ . From (9), we have
δ 3 > c N c j 0 = A j 0 A j 0 + 1 γ j 0 + 1 γ j 0 ϵ + δ ϵ 2 δ 3 = δ 3 .
This contradiction says that (10) is sound. Since A m Ω A j , using (6), we see that (10) implies
A m + 1 A j + 1 = T ( A m ) T ( A j ) < ϵ .
Therefore we obtain
A m A j A m A m + 1 + A m + 1 A j + 1 + A j + 1 A j ( by   Proposition 3 ) < c m + ϵ + c j ( by   ( 11 ) ) < δ 3 + ϵ + δ 3 = ϵ + 2 δ 3 ,
which contradicts (10). This contradiction says that the sequence { T n ( A ) } n = 1 = { A n } n = 1 is a Cauchy sequence, and the proof is complete. ☐

Author Contributions

The sole author is responsible for all the works of this paper.

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Agarwal, R.P.; O’Regan, D. Set Valued Mappings with Applications in Nonlinear Analysis; Taylor and Francis: London, UK, 2002. [Google Scholar]
  2. Aubin, J.-P.; Frankowska, H. Set-Valued Analysis; Springer: New York, NY, USA, 2009. [Google Scholar]
  3. Burachik, R.S.; Iusem, A.N. Set-Valued Mappings and Enlargements of Monotone Operators; Springer: New York, NY, USA, 2008. [Google Scholar]
  4. Chen, G.-Y.; Huang, X.; Yang, X. Vector Optimization: Set-Valued and Variational Analysis; Springer: New York, NY, USA, 2005. [Google Scholar]
  5. Hu, S.; Papageorgiou, N.S. Handbook of Multivalued Analysis I: Theory; Kluwer Academic Publishers: Boston, MA, USA, 1997. [Google Scholar]
  6. Hu, S.; Papageorgiou, N.S. Handbook of Multivalued Analysis II: Applications; Kluwer Academic Publishers: Boston, MA, USA, 2000. [Google Scholar]
  7. Tarafdar, E.U.; Chowdhury, M.S.R. Topological Methods for Set-Valued Nonlinear Analysis; World Scientific Publishing Company: Singapore, 2008. [Google Scholar]
  8. Heikkilä, S.; Reffett, K. Fixed Point Theorems and Their Applications to Theory of Nash Equilibria. Nonlin. Anal. 2006, 64, 1415–1436. [Google Scholar] [CrossRef]
  9. Horvath, C.D.; Ciscar, J.V.L. Maximal Elements and Fixed Points for Binary Relations on Topological Ordered Spaces. J. Math. Econ. 1996, 25, 291–306. [Google Scholar] [CrossRef]
  10. Tarafdar, E. A Fixed Point Theorem and Equilibrium Point of an Abstract Economy. J. Math. Econ. 1991, 20, 211–218. [Google Scholar] [CrossRef]
  11. Aubin, J.-P. Applied Functional Analysis, 2nd ed.; John Wiley & Sons: New York, NY, USA, 2000. [Google Scholar]
  12. Adasch, N.; Ernst, B.; Keim, D. Topological Vector Spaces: The Theory without Convexity Conditions; Springer: New York, NY, USA, 1978. [Google Scholar]
  13. Conway, J.B. A Course in Functional Analysis, 2nd ed.; Springer: New York, NY, USA, 1990. [Google Scholar]
  14. Khaleelulla, S.M. Counterexamples in Topological Vector Spaces; Springer: New York, NY, USA, 1982. [Google Scholar]
  15. Schaefer, H.H. Topological Vector Spaces; Springer: New York, NY, USA, 1966. [Google Scholar]
  16. Peressini, A.L. Ordered Topological Vector Spaces; Harper and Row: New York, NY, USA, 1967. [Google Scholar]
  17. Wong, Y.-C.; Ng, K.-F. Partially Ordered Topological Vector Spaces; Oxford University Press: Londn, UK, 1973. [Google Scholar]
  18. Meir, A.; Keeler, E. A Theorem on Contraction Mappings. J. Math. Anal. Appl. 1969, 28, 326–329. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Wu, H.-C. Near Fixed Point Theorems in Hyperspaces. Mathematics 2018, 6, 90. https://doi.org/10.3390/math6060090

AMA Style

Wu H-C. Near Fixed Point Theorems in Hyperspaces. Mathematics. 2018; 6(6):90. https://doi.org/10.3390/math6060090

Chicago/Turabian Style

Wu, Hsien-Chung. 2018. "Near Fixed Point Theorems in Hyperspaces" Mathematics 6, no. 6: 90. https://doi.org/10.3390/math6060090

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