Approximate selection theorems with \(n\)-connectedness (Q2636695)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximate selection theorems with \(n\)-connectedness
scientific article

    Statements

    Approximate selection theorems with \(n\)-connectedness (English)
    0 references
    0 references
    31 January 2014
    0 references
    By use of the \(n\)-connectedness property and uniform structures the notions of D-structures, \(\mathcal D\)-sets and LD-spaces were introduced by \textit{I.-S. Kim} [J. Korean Math. Soc. 35, No. 1, 165--175 (1998; Zbl 0911.54016)]. Here the following theorem is proved: Let \(X\) be a paracompact space and \(Z\) be a closed subset of \(X\) whose covering dimension is \(n \geq 0\). Let \((Y,\mathcal D )\) be an LD-space with a uniformity \(\mathcal U\) and \(\mathcal D (\{ y\} )=\{ y\}\) for all \(y\in Y\). Then \(F:X\multimap Y\) is an almost lower semicontinuous multimap such that \(F(x)\) is a \(\mathcal D\)-set for all \(x\in X\setminus Z\), if and only if \(F\) has a V-approximate continuous selection for each \(V\in \mathcal U\). This theorem generalizes some earlier results of this type.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lower semicontinuity
    0 references
    almost lower semicontinuity
    0 references
    quasi-lower semicontinuity
    0 references
    approximate selection theorems
    0 references
    \(LD\)-spaces
    0 references
    \(LC\)-metric spaces
    0 references
    \(n\)-connectedness
    0 references
    0 references