Skip to main content

Approximate selection theorems with n-connectedness

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) F:X⊸Y is a function from a set X into the power set of Y; that is, a function with the values F(x)⊂Y for x∈X. For A⊂X, let F(A):=⋃{F(x)∣x∈A}. Throughout this paper, we assume that multimaps have nonempty values otherwise explicitly stated or obvious from the context. Let 〈X〉 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 Γ:〈X〉⊸X such that

  1. (1)

    for all A∈〈X〉, Γ A =Γ(A) is nonempty and contractible; and

  2. (2)

    for all A,B∈〈X〉, A⊂B implies Γ A ⊂ Γ B .

A pair (X,Γ) 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 (X,Γ), a subset C of X is said to be Γ-convex (or a C-set) if A∈〈C〉 implies Γ A ⊂C.

For a uniform space X with a uniform structure U, A⊂X and U∈U, the set U(A) is defined to be {y∈X:(x,y)∈U for some x∈A} and if x∈X, U(x)=U({x}).

A C-space (X,Γ) is called an LC-space if X is a uniform space and there exists a base { V i :i∈I} for the uniform structure such that for each i∈I, {x∈X:C∩ V i (x)≠∅} is Γ-convex whenever C⊂X is Γ-convex.

A C-space (X,Γ) is called an LC-metric space if X is equipped with a metric d such that for any ϵ>0, the set B(C,ϵ)={x∈X:d(x,C)<ϵ} is Γ-convex whenever C⊂X is Γ-convex, and open balls are Γ-convex. For details, see Horvath [4].

A topological space X is said to be n-connected for n≥0 if every continuous map f: S k →X for k≤n has a continuous extension over B k + 1 , where S k is the unit sphere and B k + 1 is the closed unit ball in R k + 1 . Note that a contractible space is n-connected for every n≥0.

The following is introduced by Kim [5]. Let X be a topological space. A D-structure on X is a map D:〈X〉⊸X such that it satisfies the following conditions:

  1. (1)

    for each A∈〈X〉, D(A) is nonempty and n-connected for all n≥0;

  2. (2)

    for each A,B∈〈X〉, A⊂B implies D(A)⊂D(B).

The pair (X,D) is called a D-space; a subset C of X is said to be a D-set if D(A)⊂C for each A∈〈C〉.

A D-space (X,D) is called an LD-space if X is a uniform space and if there exists a base { V i :i∈I} for the uniform structure such that for each i∈I, the set {x∈X:C∩ V i (x)≠∅} is a D-set whenever C⊂X is a D-set.

A D-space (X,D) is called an LD-metric space if X is a metric space such that for each ϵ>0, B(C,ϵ) is a D-set whenever C⊂X is a D-set and open balls are D-sets.

Let X be a topological space and (Y,D) be a D-space with a uniformity U. A multimap F:X⊸Y is called:

  1. (1)

    lower semicontinuous (lsc) at x∈X if for each open set W with W∩F(x)≠∅, there is a neighborhood U(x) of x such that F(z)∩W≠∅ for all z∈U(x);

  2. (2)

    quasi-lower semicontinuous (qlsc) at x∈X if for each V∈U, there are y∈F(x) and a neighborhood U(x) of x such that F(z)∩V(y)≠∅ for all z∈U(x);

  3. (3)

    almost lower semicontinuous (alsc) at x∈X if for each V∈U, there is a neighborhood U(x) of x such that ⋂ z ∈ U ( x ) V(F(z))≠∅.

If F is lsc (qlsc, alsc, resp.) at each x∈X, F is called lsc (qlsc, alsc, resp.). As in [[7], Proposition 3], (1) ⟹ (2) ⟹ (3).

For V∈U, a continuous function f:X→Y is called a V-approximate selection of F if for all x∈X, f(x)∈V(F(x)).

Let (Y,D) be an LD-metric space. For ϵ>0, f is called an ϵ-approximate selection of F if for all x∈X, f(x)∈B(F(x),ϵ).

Let X be a topological space. If Z⊂X, then dim X Z≤0 means that dimE≤0 for every set E⊂Z which is closed in X, where dimE denotes the covering dimension of E. Note that if dim X Z≤0, then any locally finite open covering of Z has a disjoint locally finite open refinement.

3 Approximate selection theorems on D-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, (Y,D) be a D-space, and η:R→Y be a function. Then there exists a continuous function f:X→Y such that

f(x)∈D ( { η ( O ) : O ∈ R , x ∈ O } )

for each x∈X.

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 dim X Z≤0. Let (Y,D) be an LD-space with a uniformity U and D({y})={y} for all y∈Y. If F:X⊸Y is an alsc multimap such that F(x) is a D-set for all x∈X∖Z, then F has a V-approximate selection for each V∈U.

Furthermore, if X is a precompact uniform space or a compact topological space, there is a subset A∈〈Y〉 such that f(X)⊂D(A).

Proof For each V∈U and x∈X, there is a neighborhood U(x) of x such that ⋂ z ∈ U ( x ) V(F(z))≠∅, because F is alsc. Since X is paracompact, the open cover {U(x):x∈X} of X has a locally finite refinement { U ˜ (x):x∈X}. And since dim X Z≤0, the relatively open cover { U ˜ (x)∩Z:x∈Z} of Z has a relatively open disjoint refinement {W(x):x∈Z}. Z is closed in X so the collection R={ U ˜ (x)∩(W(x)∪(X∖Z)):x∈X} forms a locally finite open cover of X.

For each O∈R, choose x o such that O⊂U( x o ) and y o ∈ â‹‚ z ∈ U ( x o ) V(F(z)). Define η:R→Y by η(O)= y o for all O∈R. Then η(O)∈ â‹‚ z ∈ U ( x o ) V(F(z))⊂ â‹‚ z ∈ O V(F(z)), so {η(O):O∈R,x∈O}⊂V(F(x)) for all x∈X. By Proposition 3.1, there is a continuous function f:X→Y such that f(x)∈D({η(O):O∈R,x∈O}).

We now show that f(x)∈V(F(x)) for all x∈X. If x∈Z, there exists a unique O∈R such that x∈O, that is, {η(O):O∈R,x∈O} is a singleton. So, f(x)∈D({η(O):O∈R,x∈O})={η(O)}⊂V(F(x)). If x∈X∖Z, since F(x) is a D-set, D({η(O):O∈R,x∈O})⊂V(F(x)), that is, f(x)∈V(F(x)).

If X is a precompact uniform space or a compact topological space, ℛ can be chosen finite. Take A={η(O):O∈R}, then A∈〈Y〉 and f(X)⊂D(A). □

Remark If Z=∅, then the condition ‘D({y})={y} for all y∈Y’ can be omitted. In that case, if (Y,D) is an LC-space with a uniformity U and F is qlsc, then Theorem 3.2 becomes [[6], Theorem 3.1].

Proposition 3.3 Each singleton is a D-set in an LD-metric space (X,D), so D({x})={x}.

Proof For each x∈X, {x}= ⋂ ϵ > 0 B(x,ϵ). Since all open balls and their intersection are D-sets, {x} is a D-set. Therefore D({x})⊂{x}, i.e., D({x})={x}. □

For LD-metric spaces, Theorem 3.2 reduces to the following.

Corollary 3.4 Let X be a paracompact space, (Y,D) be an LD-metric space, and Z be a closed subset of X with dim X Z≤0. If F:X⊸Y is an alsc multimap such that F(x) is a D-set for all x∈X∖Z, then for ϵ>0, 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, (Y,Γ) be an LC-metric space, and Z be a closed subset of X with dim X Z≤0. If F:X⊸Y is an alsc multimap such that F(x) is Γ-convex for all x∈X∖Z, then for ϵ>0, 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 B(F(x),ϵ) is Γ-convex whenever x∈E and x∈X∖E, but it cannot be analogized from the assumption that F(x) is Γ-convex for all x∉Z.

Theorem 3.3 in [6] shows that if X=Z and (Y,Γ) is a C-space with a uniformity U and F has a V-approximate selection for each V∈U, then F is qlsc. Using the same pattern of its proof, we also obtain the same result when (Y,D) is a D-space with a uniformity U. 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 dim X Z≤0. Let (Y,D) be an LD-space with a uniformity U and D({y})={y} for all y∈Y. And let F:X⊸Y be a multimap such that F(x) is a D-set for all x∈X∖Z. Then F is alsc if and only if F has a V-approximate selection for each V∈U.

The following notion is motivated by Hadžić [11]. Let (X,D) be a D-space with a uniformity U and K be a nonempty subset of X. We say that K is of generalized Zima type whenever for every V∈U, there exists a V 1 ∈U such that for every N∈〈K〉 and every D-set M of K, the following implication holds:

M∩ V 1 (z)≠∅,∀z∈N⟹M∩V(u)≠∅,∀u∈D(N).

Note that an LD-space (X,D) is of generalized Zima type.

If Z=∅, then the LD-space condition of Y can be weakened in Theorem 3.6.

Theorem 3.7 Let X be a paracompact topological space, (Y,D) be a D-space with a uniformity U, and F:X⊸Y be a multimap with D-set values such that F(X) is of generalized Zima type. Then F is alsc if and only if F has a V-approximate selection for each V∈U.

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 D-sets in a D-space.

Let X be a topological space and Y be a uniform space with a uniformity U. The multimaps F,T:X⊸Y are said to be topologically separated if for each x∈X, there exist a neighborhood U(x) of x and an element V∈U such that F(U(x))∩V(T(x))=∅.

Theorem 3.8 Let X be a compact topological space and Z be a closed subset of X with dim X Z≤0. And let (Y,D) be an LD-space with a uniformity U and D({y})={y} for all y∈Y. If F,T:X⊸Y are two multimaps such that

  1. (1)

    F and T are topologically separated;

  2. (2)

    T is upper semicontinuous; and

  3. (3)

    F is an alsc multimap such that F(x) is a D-set for all x∈X∖Z.

Then, for each V∈U, F has a V-approximate selection f:X→Y such that

f(x)∉T(x)

for all x∈X.

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, Z=∅, and F is sub-lower semicontinuous, that is, for each x∈X and each neighborhood V of 0 in Y, there is z∈F(x) and a neighborhood U(x) of x in X such that for each y∈U(x), z∈F(y)+V. 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].

  1. 2.

    Wu and Li [[6], Theorem 3.6]: (Y,D) is an LC-space with a uniformity U, Z=∅, and F is qlsc.

Proposition 3.9 Let X be a topological space and Y be a metric space. If a multimap F:X⊸Y is alsc at x∈X, then F is qlsc at x∈X.

Proof For ϵ>0, there is a neighborhood U(x) of x such that

⋂ z ∈ U ( x ) B ( F ( z ) , ϵ / 2 ) ≠∅.

Select any y∈ ⋂ z ∈ U ( x ) B(F(z),ϵ/2). For each z∈U(x), choose y z ∈F(z) such that d(y, y z )<ϵ/2. Note that y x ∈F(x) and d( y x , y z )≤d( y x ,y)+d(y, y z )<ϵ for each z∈U(x). Hence y z ∈B( y x ,ϵ)∩F(z) for all z∈U(x). □

The following result is a generalization of Theorem 3.7 in [6].

Theorem 3.10 Let X be a paracompact topological space, (Y,D) be an LD-metric space, and Z be a closed subset of X with dim X Z≤0. If F,T:X⊸Y are two multimaps such that

  1. (1)

    F and T are topologically separated;

  2. (2)

    T is upper semicontinuous; and

  3. (3)

    F is an alsc multimap such that F(x) is a D-set for all x∈X∖Z.

Then for each ϵ>0, F has an ϵ-approximate selection f:X→Y such that

f(x)∉T(x)

for all x∈X.

Proof For each fixed ϵ>0 and each x∈X, by (1) and (2), there exists a neighborhood U(x) of x and an η(x)>0 such that η(x)<ϵ, F(U(x))∩B(T(x),η(x))=∅, and T(U(x))⊂B(T(x),η(x)/2). Let ζ(x)=η(x)/2. For each y∈U(x), we assert F(y)∩B(T(y),ζ(x))=∅. Otherwise, there exist points p∈T(y) and z∈F(y) such that d(p,z)<ζ(x). Because y∈U(x) and T(y)⊂B(T(x),ζ(x)), so p∈B(T(x),ζ(x)). Consequently, there is a point b∈T(x) such that d(p,b)<ζ(x). Hence d(b,z)<η(x), and thus z∈F(y)∩B(T(x),η(x))⊂F(U(x))∩B(T(x),η(x))=∅. It is a contradiction.

Let δ(x)=sup{r:0<r<ϵ and F(x)∩B(T(x),r)=∅}. Obviously, δ(x)≤ϵ and for each y∈U(x), δ(y)≥ζ(x). Now, we assert that F(x)∩B(T(x),δ(x))=∅. Otherwise, there exist points y∈F(x) and z∈T(x) such that d(y,z)<δ(x). Consequently, there is a number r>d(y,z) such that 0<r<ϵ and F(x)∩B(T(x),r)=∅. But y∈F(x)∩B(T(x),r), it is a contradiction.

By Proposition 3.9, F:X⊸Y is qlsc, so there exist a point y x ∈F(x) and an open neighborhood N(x) of x in X such that N(x)⊂U(x) and

for all z∈N(x). Since X is paracompact, the open cover {N(x):x∈X} has a locally finite open refinement {V(x):x∈X}. Since dim X Z≤0, the relative open cover {V(x)∩Z:x∈Z} of Z has a relatively open disjoint refinement {W(x):x∈Z}. Z is closed in X, so the collection R={V(x)∩(W(x)∪(X∖Z)):x∈X} forms a locally finite open cover of X.

For each O∈R, choose a point x o such that O⊂V( x o ) and define η:R→Y by η(O)= y x o such that y x o ∈F( x o ) satisfying the condition (∗) for all z∈V( x o ). By Proposition 3.1, there is a continuous function f:X→Y such that f(x)∈D({η(O):O∈R,x∈O}). For each x∈X and O∈R such that x∈O, by (∗), we have F(x)∩B(η(O),ζ( x o ))≠∅ and δ(x)≥ζ( x o ) because x∈O⊂V( x o )⊂N( x o ), so F(x)∩B(η(O),δ(x))≠∅.

Note that for x∈Z, f(x)=η(O)= y x o since {O∈R:x∈O} is a singleton. Hence f(x)∈{y∈Y:F(x)∩B(y,δ(x))≠∅}.

For each x∈X∖Z,

f(x)∈D ( { η ( O ) : O ∈ R , x ∈ O } ) ⊂ { y ∈ Y : F ( x ) ∩ B ( y , δ ( x ) ) ≠ ∅ }

since F(x) and B(F(x),δ(x)) are D-sets.

So, F(x)∩B(f(x),δ(x))≠∅ for all x∈X and hence

F(x)∩B ( f ( x ) , ϵ ) ≠∅andf(x)∉T(x).

 □

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 (x, x ′ ) of elements has a least upper bound. Any nonempty set A∈〈X〉 has a least upper bound, denoted by sup A. In a partially ordered set (X,≤), two arbitrary elements x and x ′ do not have to be comparable, but, in the case where x≤ x ′ , the set [x, x ′ ]={y∈X:x≤y≤ x ′ } is called an order interval.

The following is due to Horvath and Ciscar [12]: Let (X,≤) be a semilattice such that for each A∈〈X〉, Δ(A) is defined by ⋃ a ∈ A [a,supA]. Then

  1. (1)
    Δ(A)

    is well defined;

  2. (2)
    A⊂Δ(A)

    ;

  3. (3)

    if A⊂B, then Δ(A)⊂Δ(B).

A subset E⊂X is said to be convex if, for any subset A∈〈E〉, we have Δ(A)⊂E.

If X is a topological semilattice with path-connected intervals, then for any A∈〈X〉 and n≥0, Δ(A) is n-connected by [[12], Lemma 1], that is, (X,≤,Δ) is a D-space.

Note that Δ({x})={x} for all x∈X.

In this section, we assume that (Y,≤,Δ) 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 dim X Z≤0, and U be a uniformity of (Y,≤,Δ) such that for each V∈U, the set {y∈Y:C∩V(y)≠∅} is convex whenever C is a convex subset of Y. And let F⊆X×Y be a binary relation such that F(x) is convex for all x∈X∖Z. Then F is alsc if and only if F has a V-approximate selection for each V∈U.

Theorem 4.2 Let X be a paracompact topological space and U be a uniformity of (Y,≤,Δ). And let F⊆X×Y be a binary relation with convex values and F(X) be of generalized Zima type. Then F is alsc if and only if F has a V-approximate selection for each V∈U.

Theorem 4.3 Let X be a compact topological space and Z be a closed subset of X with dim X Z≤0. And let U be a uniformity of (Y,≤,Δ) such that for each V∈U, the set {x∈X:C∩V(x)≠∅} is convex whenever C⊂X is convex. If F,T⊆X×Y are two binary relations such that

  1. (1)

    F and T are topologically separated;

  2. (2)

    T is upper semicontinuous; and

  3. (3)

    F is an alsc relation such that F(x) is convex for all x∈X∖Z.

Then for each V∈U, F has a V-approximate selection f:X→Y such that

f(x)∉T(x)

for all x∈X.

Theorem 4.4 Let X be a paracompact topological space and Z be a closed subset of X with dim X Z≤0. Assume that (Y,≤,Δ) is a metric space and has the following properties:

  1. (i)

    for any ϵ>0, the set B(C,ϵ) is convex whenever C is a convex subset of Y; and

  2. (ii)

    open balls are convex.

If F,T⊆X×Y are two binary relations such that

  1. (1)

    F and T are topologically separated;

  2. (2)

    T is upper semicontinuous; and

  3. (3)

    F is an alsc relation such that F(x) is convex for all x∈X∖Z.

Then for each ϵ>0, F has an ϵ-approximate selection f:X→Y such that

f(x)∉T(x)

for all x∈X.

Abbreviations

alsc:

almost lower semicontinuity

lsc:

lower semicontinuity

qlsc:

quasi-lower semicontinuity.

References

  1. Michael E: Convex structures and continuous selections. Can. J. Math. 1959, 11: 556–575. 10.4153/CJM-1959-051-9

    Article  MathSciNet  Google Scholar 

  2. Michael E, Pixley C: A unified theorem on continuous selections. Pac. J. Math. 1980, 87: 187–188. 10.2140/pjm.1980.87.187

    Article  MathSciNet  Google Scholar 

  3. Ben-El-Mechaiekh H, Oudadess M: Some selection theorems without convexity. J. Math. Anal. Appl. 1995, 195: 614–618. 10.1006/jmaa.1995.1377

    Article  MathSciNet  Google Scholar 

  4. Horvath CD: Contractibility and generalized convexity. J. Math. Anal. Appl. 1991, 156: 341–357. 10.1016/0022-247X(91)90402-L

    Article  MathSciNet  Google Scholar 

  5. Kim I-S: Selection theorems with n -connectedness. J. Korean Math. Soc. 1998, 35: 165–175.

    MathSciNet  Google Scholar 

  6. 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

    Article  MathSciNet  Google Scholar 

  7. 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

    Article  MathSciNet  Google Scholar 

  8. Chu L-J, Huang C-H: Generalized selection theorems without convexity. Nonlinear Anal. 2010, 73: 3224–3231. 10.1016/j.na.2010.07.002

    Article  MathSciNet  Google Scholar 

  9. Zheng X: Approximate selection theorems and their applications. J. Math. Anal. Appl. 1997, 212: 88–97. 10.1006/jmaa.1997.5466

    Article  MathSciNet  Google Scholar 

  10. 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

    Article  MathSciNet  Google Scholar 

  11. Hadžić O: Almost fixed point and best approximation theorems in H -spaces. Bull. Aust. Math. Soc. 1996, 53: 447–454. 10.1017/S0004972700017202

    Article  Google Scholar 

  12. 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

    Article  Google Scholar 

Download references

Acknowledgements

This paper was supported by the Sehan University Research Fund in 2013.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hoonjoo Kim.

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.

Reprints and permissions

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2013-113

Keywords