Best approximation, coincidence and fixed point theorems for set-valued maps in image-trees Original Research Article

Suppose XX is a closed, convex and geodesically bounded subset of a complete RR-tree MM, and suppose F:X⊸MF:X⊸M is an almost lower semicontinuous set-valued map whose values are nonempty closed convex. Suppose also G:X⊸XG:X⊸X is a continuous, onto quasiconvex set-valued map with compact, convex values. Then there exists x0∈Xx0∈X such that View the MathML sourced(G(x0),F(x0))=infx∈Xd(x,F(x0)). Turn MathJax on As applications, we give some coincidence and fixed point results for weakly inward set-valued maps. Our results generalize some well-known results in literature.