Linear openness of multifunctions in metric spaces (Q2570000): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q587493
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Corneliu Ursescu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009160027 / rank
 
Normal rank

Latest revision as of 09:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Linear openness of multifunctions in metric spaces
scientific article

    Statements

    Linear openness of multifunctions in metric spaces (English)
    0 references
    24 October 2005
    0 references
    The paper deals with multifunctions \(F:X\to Y\) and starts with the definition of two basic concepts; one is openness and the other one is almost openness. The author calls the usual inclusion in the definitions a `nonlinear' openness inclusion and replaces them by two other inclusion relations (which he calls `linear' openness inclusion) which are as follows: \[ (1)\quad B(y,wy)\subseteq F\bigl( B(x,\varepsilon)\bigr)\qquad\text{ and }\qquad (2) \quad B (y,w\varepsilon)\subseteq\overline {F\bigl(B(x,\varepsilon)} \] where \(B(x,\varepsilon)\) has the usual meaning and \((x,y)\in\text{graph}(F)\). The basic results are as follows: 1) For a complete metric space \(X\), a multifunction \(F\) having closed graph and \(w>0\), the following two conditions are equivalent: i) For every \((x,y)\in\text{graph}(F)\) and for every \(\varepsilon>0\), the inclusion (1) holds. ii) For every \((x,y)\in\text{graph}(F)\) and for every \(\varepsilon>0\) the inclusion (2) holds. For the basic result (2) the author defines a metric space \(Y\) to resemble normed spaces if for every \(y\in Y\), for every \(\delta>0\), and for every \(\delta'>0\), the equality \(B(B(y, \delta),\delta')=B(y,\delta+ \delta')\) holds (where \(B(C,r)\) stands for the union of all \(B(c,r)\) with \(c\in C)\). The basic result (2) is as follows: (i) For every \((x,y)\in\text{graph} (F)\) and for every \(\varepsilon>0\), the inclusion (1) above holds; (ii) For every \(\zeta>0\) there exists \(\varepsilon\in(0,\zeta)\) such that for every \((x,y)\in\text{graph}(F)\), the inclusion (2) above holds. (3) If in addition to the hypothesis in (2), \(Y\) is complete, the following two conditions hold: (i) for every \((x,y)\in\text{graph}(F)\) and for every \(\varepsilon >0\) the inclusion (1) holds; (ii) for every \((x,y)\in\text{graph}(F)\) and for every \(\zeta>0\) there exists \(\varepsilon\in(0,\zeta)\) such that inclusion (2) holds.
    0 references
    0 references

    Identifiers