- Research
- Open access
- Published:
Approximate selection theorems with n-connectedness
Journal of Inequalities and Applications volume 2013, Article number: 113 (2013)
Abstract
We establish new approximate selection theorems for almost lower semicontinuous multimaps with n-connectedness. Our results unify and extend the approximate selection theorems in many published works and are applied to topological semilattices with path-connected intervals.
MSC:54C60, 54C65, 55M10.
1 Introduction
Since Michael [1] constructed continuous ϵ-approximate selections for the lower semicontinuous maps with convex values in Banach spaces, the result has been improved in many ways. It was extended to lower semicontinuous maps with convex values except on a set of topological dimension less than or equal to zero by Michael and Pixley [2] in 1980. And Ben-El-Mechaiekh and Oudadess [3] generalized the theorem in [2] to a class of lower semicontinuous multimaps with nonconvex values in LC-metric spaces, which have generalized convex metric structures introduced by Horvath [4].
Using the concept of n-connectedness, Kim [5] introduced an LD-metric space and extended the result in [3] to LD-metric spaces which are more general than LC-metric spaces.
On the other hand, in LC-spaces, Wu and Li [6] obtained the approximate selection theorems for quasi-lower semicontinuous multimaps which were generalized by the author and Lee [7] to almost lower semicontinuous multimaps in C-spaces.
In this paper, we establish a new approximate selection theorem for almost lower semicontinuous multimaps with D-set values except on a set of topological dimension less than or equal to zero in LD-spaces. The corollary of this gives a correct and simple proof for the result in [8].
We also establish some approximate selection theorems for almost lower semicontinuous multimaps in D-spaces and apply the results to topological semilattices with path connected intervals. Our results unify and extend the approximate selection theorems in [1–3, 5–9].
2 Preliminaries
A multimap (or simply a map) is a function from a set X into the power set of Y; that is, a function with the values for . For , let . Throughout this paper, we assume that multimaps have nonempty values otherwise explicitly stated or obvious from the context. Let denote the set of all nonempty finite subsets of a set X.
Let X be a topological space. A C-structure on X is given by a map such that
-
(1)
for all , is nonempty and contractible; and
-
(2)
for all , implies .
A pair is then called a C-space by Horvath [4] and an H-space by Bardaro and Ceppitelli [10]. For examples of a C-space, see [4, 10]. For an , a subset C of X is said to be Γ-convex (or a C-set) if implies .
For a uniform space X with a uniform structure , and , the set is defined to be and if , .
A C-space is called an LC-space if X is a uniform space and there exists a base for the uniform structure such that for each , is Γ-convex whenever is Γ-convex.
A C-space is called an LC-metric space if X is equipped with a metric d such that for any , the set is Γ-convex whenever is Γ-convex, and open balls are Γ-convex. For details, see Horvath [4].
A topological space X is said to be n-connected for if every continuous map for has a continuous extension over , where is the unit sphere and is the closed unit ball in . Note that a contractible space is n-connected for every .
The following is introduced by Kim [5]. Let X be a topological space. A D-structure on X is a map such that it satisfies the following conditions:
-
(1)
for each , is nonempty and n-connected for all ;
-
(2)
for each , implies .
The pair is called a D-space; a subset C of X is said to be a -set if for each .
A D-space is called an LD-space if X is a uniform space and if there exists a base for the uniform structure such that for each , the set is a -set whenever is a -set.
A D-space is called an LD-metric space if X is a metric space such that for each , is a -set whenever is a -set and open balls are -sets.
Let X be a topological space and be a D-space with a uniformity . A multimap is called:
-
(1)
lower semicontinuous (lsc) at if for each open set W with , there is a neighborhood of x such that for all ;
-
(2)
quasi-lower semicontinuous (qlsc) at if for each , there are and a neighborhood of x such that for all ;
-
(3)
almost lower semicontinuous (alsc) at if for each , there is a neighborhood of x such that .
If F is lsc (qlsc, alsc, resp.) at each , F is called lsc (qlsc, alsc, resp.). As in [[7], Proposition 3], (1) ⟹ (2) ⟹ (3).
For , a continuous function is called a V-approximate selection of F if for all , .
Let be an LD-metric space. For , f is called an ϵ-approximate selection of F if for all , .
Let X be a topological space. If , then means that for every set which is closed in X, where dimE denotes the covering dimension of E. Note that if , then any locally finite open covering of Z has a disjoint locally finite open refinement.
3 Approximate selection theorems on -spaces
As a main tool, we need Proposition 1 of Kim [5].
Proposition 3.1 Let X be a paracompact topological space and â„› be a locally finite open covering of X, be a D-space, and be a function. Then there exists a continuous function such that
for each .
With Proposition 3.1, we establish the V-approximate selection theorem which is the key result of this paper.
Theorem 3.2 Let X be a paracompact topological space and Z be a closed subset of X with . Let be an LD-space with a uniformity and for all . If is an alsc multimap such that is a -set for all , then F has a V-approximate selection for each .
Furthermore, if X is a precompact uniform space or a compact topological space, there is a subset such that .
Proof For each and , there is a neighborhood of x such that , because F is alsc. Since X is paracompact, the open cover of X has a locally finite refinement . And since , the relatively open cover of Z has a relatively open disjoint refinement . Z is closed in X so the collection forms a locally finite open cover of X.
For each , choose such that and . Define by for all . Then , so for all . By Proposition 3.1, there is a continuous function such that .
We now show that for all . If , there exists a unique such that , that is, is a singleton. So, . If , since is a -set, , that is, .
If X is a precompact uniform space or a compact topological space, ℛ can be chosen finite. Take , then and . □
Remark If , then the condition ‘ for all ’ can be omitted. In that case, if is an LC-space with a uniformity and F is qlsc, then Theorem 3.2 becomes [[6], Theorem 3.1].
Proposition 3.3 Each singleton is a -set in an LD-metric space , so .
Proof For each , . Since all open balls and their intersection are -sets, is a -set. Therefore , i.e., . □
For LD-metric spaces, Theorem 3.2 reduces to the following.
Corollary 3.4 Let X be a paracompact space, be an LD-metric space, and Z be a closed subset of X with . If is an alsc multimap such that is a -set for all , then for , F has an ϵ-approximate selection.
For LC-metric spaces, Corollary 3.4 reduces to the following.
Corollary 3.5 Let X be a paracompact space, be an LC-metric space, and Z be a closed subset of X with . If is an alsc multimap such that is Γ-convex for all , then for , F has an ϵ-approximate selection.
Remark Corollary 3.5 is Theorem 3.2 in [8] which is a partial generalization of Lemma 2 in [3]. In the proof of Lemma 2 in [3] and Theorem 3.2 in [8], for the subset E of Z, it is claimed that is Γ-convex whenever and , but it cannot be analogized from the assumption that is Γ-convex for all .
Theorem 3.3 in [6] shows that if and is a C-space with a uniformity and F has a V-approximate selection for each , then F is qlsc. Using the same pattern of its proof, we also obtain the same result when is a D-space with a uniformity . Since a qlsc map is alsc, so the inverse of Theorem 3.2 also holds.
Theorem 3.6 Let X be a paracompact topological space and Z be a closed subset of X with . Let be an LD-space with a uniformity and for all . And let be a multimap such that is a -set for all . Then F is alsc if and only if F has a V-approximate selection for each .
The following notion is motivated by Hadžić [11]. Let be a D-space with a uniformity and K be a nonempty subset of X. We say that K is of generalized Zima type whenever for every , there exists a such that for every and every -set M of K, the following implication holds:
Note that an LD-space is of generalized Zima type.
If , then the LD-space condition of Y can be weakened in Theorem 3.6.
Theorem 3.7 Let X be a paracompact topological space, be a D-space with a uniformity , and be a multimap with -set values such that is of generalized Zima type. Then F is alsc if and only if F has a V-approximate selection for each .
The proof of Theorem 3.7 proceeds in the same fashion as Theorem 2 in [7], except that all Γ-convex sets in a C-space is replaced by -sets in a -space.
Let X be a topological space and Y be a uniform space with a uniformity . The multimaps are said to be topologically separated if for each , there exist a neighborhood of x and an element such that .
Theorem 3.8 Let X be a compact topological space and Z be a closed subset of X with . And let be an LD-space with a uniformity and for all . If are two multimaps such that
-
(1)
F and T are topologically separated;
-
(2)
T is upper semicontinuous; and
-
(3)
F is an alsc multimap such that is a -set for all .
Then, for each , F has a V-approximate selection such that
for all .
Using Theorem 3.2, the proof of Theorem 3.8 proceeds in precisely the same fashion as Theorem 3.6 in [6].
Particular forms 1. Zheng [[9], Theorem 2.2]: Y is a locally convex space, , and F is sub-lower semicontinuous, that is, for each and each neighborhood V of 0 in Y, there is and a neighborhood of x in X such that for each , . Note that if Y is a topological vector space, then F is sub-lower semicontinuous if and only if F is qlsc; see [[6], Proposition 1.2].
-
2.
Wu and Li [[6], Theorem 3.6]: is an LC-space with a uniformity , , and F is qlsc.
Proposition 3.9 Let X be a topological space and Y be a metric space. If a multimap is alsc at , then F is qlsc at .
Proof For , there is a neighborhood of x such that
Select any . For each , choose such that . Note that and for each . Hence for all . □
The following result is a generalization of Theorem 3.7 in [6].
Theorem 3.10 Let X be a paracompact topological space, be an LD-metric space, and Z be a closed subset of X with . If are two multimaps such that
-
(1)
F and T are topologically separated;
-
(2)
T is upper semicontinuous; and
-
(3)
F is an alsc multimap such that is a -set for all .
Then for each , F has an ϵ-approximate selection such that
for all .
Proof For each fixed and each , by (1) and (2), there exists a neighborhood of x and an such that , , and . Let . For each , we assert . Otherwise, there exist points and such that . Because and , so . Consequently, there is a point such that . Hence , and thus . It is a contradiction.
Let . Obviously, and for each , . Now, we assert that . Otherwise, there exist points and such that . Consequently, there is a number such that and . But , it is a contradiction.
By Proposition 3.9, is qlsc, so there exist a point and an open neighborhood of x in X such that and
for all . Since X is paracompact, the open cover has a locally finite open refinement . Since , the relative open cover of Z has a relatively open disjoint refinement . Z is closed in X, so the collection forms a locally finite open cover of X.
For each , choose a point such that and define by such that satisfying the condition (∗) for all . By Proposition 3.1, there is a continuous function such that . For each and such that , by (∗), we have and because , so .
Note that for , since is a singleton. Hence .
For each ,
since and are -sets.
So, for all and hence
 □
4 Approximate selection theorems on topological ordered spaces
A semilattice is a partially ordered set X, with the partial ordering denoted by ≤, for which any pair of elements has a least upper bound. Any nonempty set has a least upper bound, denoted by sup A. In a partially ordered set , two arbitrary elements x and do not have to be comparable, but, in the case where , the set is called an order interval.
The following is due to Horvath and Ciscar [12]: Let be a semilattice such that for each , is defined by . Then
-
(1)
is well defined;
-
(2)
;
-
(3)
if , then .
A subset is said to be convex if, for any subset , we have .
If X is a topological semilattice with path-connected intervals, then for any and , is n-connected by [[12], Lemma 1], that is, is a D-space.
Note that for all .
In this section, we assume that is a topological semilattice with path-connected intervals. From the results of Section 3, we obtain the following theorems.
Theorem 4.1 Let X be a paracompact topological space, Z be a closed subset of X with , and be a uniformity of such that for each , the set is convex whenever C is a convex subset of Y. And let be a binary relation such that is convex for all . Then F is alsc if and only if F has a V-approximate selection for each .
Theorem 4.2 Let X be a paracompact topological space and be a uniformity of . And let be a binary relation with convex values and be of generalized Zima type. Then F is alsc if and only if F has a V-approximate selection for each .
Theorem 4.3 Let X be a compact topological space and Z be a closed subset of X with . And let be a uniformity of such that for each , the set is convex whenever is convex. If are two binary relations such that
-
(1)
F and T are topologically separated;
-
(2)
T is upper semicontinuous; and
-
(3)
F is an alsc relation such that is convex for all .
Then for each , F has a V-approximate selection such that
for all .
Theorem 4.4 Let X be a paracompact topological space and Z be a closed subset of X with . Assume that is a metric space and has the following properties:
-
(i)
for any , the set is convex whenever C is a convex subset of Y; and
-
(ii)
open balls are convex.
If are two binary relations such that
-
(1)
F and T are topologically separated;
-
(2)
T is upper semicontinuous; and
-
(3)
F is an alsc relation such that is convex for all .
Then for each , F has an ϵ-approximate selection such that
for all .
Abbreviations
- alsc:
-
almost lower semicontinuity
- lsc:
-
lower semicontinuity
- qlsc:
-
quasi-lower semicontinuity.
References
Michael E: Convex structures and continuous selections. Can. J. Math. 1959, 11: 556–575. 10.4153/CJM-1959-051-9
Michael E, Pixley C: A unified theorem on continuous selections. Pac. J. Math. 1980, 87: 187–188. 10.2140/pjm.1980.87.187
Ben-El-Mechaiekh H, Oudadess M: Some selection theorems without convexity. J. Math. Anal. Appl. 1995, 195: 614–618. 10.1006/jmaa.1995.1377
Horvath CD: Contractibility and generalized convexity. J. Math. Anal. Appl. 1991, 156: 341–357. 10.1016/0022-247X(91)90402-L
Kim I-S: Selection theorems with n -connectedness. J. Korean Math. Soc. 1998, 35: 165–175.
Wu X, Li F: Approximate selection theorems in H -spaces with applications. J. Math. Anal. Appl. 1999, 231: 118–132. 10.1006/jmaa.1998.6208
Kim H, Lee SJ: Approximate selections of almost lower semicontinuous multimaps in C -spaces. Nonlinear Anal. 2006, 64: 401–408. 10.1016/j.na.2005.04.037
Chu L-J, Huang C-H: Generalized selection theorems without convexity. Nonlinear Anal. 2010, 73: 3224–3231. 10.1016/j.na.2010.07.002
Zheng X: Approximate selection theorems and their applications. J. Math. Anal. Appl. 1997, 212: 88–97. 10.1006/jmaa.1997.5466
Bardaro C, Ceppitelli R: Some further generalizations of Knaster-Kuratowski-Mazurkiewicz theorem and minimax inequalities. J. Math. Anal. Appl. 1988, 132: 484–490. 10.1016/0022-247X(88)90076-5
Hadžić O: Almost fixed point and best approximation theorems in H -spaces. Bull. Aust. Math. Soc. 1996, 53: 447–454. 10.1017/S0004972700017202
Horvath CD, Ciscar JVL: Maximal elements and fixed points for binary relations on topological ordered spaces. J. Math. Econ. 1996, 25: 291–306. 10.1016/0304-4068(95)00732-6
Acknowledgements
This paper was supported by the Sehan University Research Fund in 2013.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The author declares that she has no competing interests.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Kim, H. Approximate selection theorems with n-connectedness. J Inequal Appl 2013, 113 (2013). https://doi.org/10.1186/1029-242X-2013-113
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-113