Continuous selections avoiding a set (Q1108606)

From MaRDI portal
Revision as of 18:55, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Continuous selections avoiding a set
scientific article

    Statements

    Continuous selections avoiding a set (English)
    0 references
    1988
    0 references
    In great numbers of theorems there are presented conditions under which a set-valued function has a continuous selection avoiding a set or, more generally, a given set-valued function. As usually, let \({\mathcal P}(Y)\) be the power set of Y, \({\mathcal F}(Y)=\{Z\in {\mathcal P}(Y)\), \(Z\neq \emptyset\) and closed\(\}\), \({\mathcal F}_ c(Y)\) be the family of all convex members of \({\mathcal F}(Y)\). A function f: \(X\to Y\) avoids \(\phi\) : \(X\to {\mathcal F}(Y)\) if f(x)\(\not\in \phi (x)\) for all \(x\in X.\) Typical results: Theorem 3.1. Let X be paracompact, Y a Banach space and \(\phi\) : \(X\to {\mathcal F}_ c(Y)\) lower semi-continuous. Let \(\phi\) : \(X\to {\mathcal F}(Y)\) be continuous (with respect to the Hausdorff metric on \({\mathcal F}(Y))\), define Z as the subset of all x from X with the property \(\phi\) (x)\(\cap \phi (x)\neq \emptyset\) and suppose that dim X is lower than the difference dim \(\phi\) (x)-dim conv(\(\phi\) (x)\(\cap \phi (x))\) for all \(x\in Z\). Then \(\phi\) has a \(\psi\)-avoiding selection. Theorem 5.7. Let X, Y be as in the above Theorem 3.1 and \(\phi\) : \(X\to {\mathcal F}(Y)\) lower semi-continuous. Let \(Z\subset X\) with \(\dim_ XZ\leq 0\), let \(\phi\) : \(X\to {\mathcal P}(Y)\) have a closed graph in \(X\times Y\) and suppose that \(\phi\) (x)\(\setminus \psi (x)\) is non-empty for all \(x\in X\) and convex for all \(x\in X\setminus Z\). Then \(\phi\) has a \(\psi\)-avoiding selection. (Here \(\dim_ XZ=\sup \{\dim A\); \(A\subset Z\), A closed in \(X\})\).
    0 references
    0 references
    0 references
    0 references
    0 references