Best approximation, coincidence and fixed point theorems for set-valued maps in \(\mathbb R\)-trees (Q1030055)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Best approximation, coincidence and fixed point theorems for set-valued maps in \(\mathbb R\)-trees
scientific article

    Statements

    Best approximation, coincidence and fixed point theorems for set-valued maps in \(\mathbb R\)-trees (English)
    0 references
    0 references
    0 references
    1 July 2009
    0 references
    From the summary: ''Suppose \(X\) is a closed, convex and geodesically bounded subset of a complete \(\mathbb R\)-tree \(M\), and suppose \(F:X\multimap M\) is an almost lower semicontinuous set-valued map whose values are nonempty closed convex. Suppose also \(G:X\multimap X\) is a continuous, onto quasiconvex set-valued map with compact, convex values. Then there exists \(x_{0}\in X\) such that \[ d(G(x_0),F(x_0))= \underset {x\in X} {\text{inf}} d(x,F(x_0)). \] As applications, we give some coincidence and fixed point results for weakly inward set-valued maps.'' The authors also prove that, if both \(F,G:X\multimap M\) are continuous with nonempty compact convex values, and \(G\) is quasiconvex, then there exists \(x_{0}\in X\) such that \[ d(G(x_0),F(x_0))= \underset {x\in X} {\text{inf}} d(G(x),F(x_0)). \]
    0 references
    0 references
    0 references
    0 references
    0 references
    \(\mathbb R\)-tree
    0 references
    best approximation
    0 references
    almost lower semicontinuous map
    0 references
    fixed point
    0 references
    coincidence point
    0 references
    weakly inward map
    0 references
    0 references