Extension dimensional approximation theorem

From MaRDI portal



Abstract: Let L be a countable CW-complex and FcolonXoY be upper semicontinuous UV[L]-valued mapping of a paracompact space X to a complete metric space Y. We prove that if X is a C-space of extension dimension edXle[L], then F admits single-valued graph approximations. For L=Sn our result implies well-known approximation theorem for UVn−1-valued mappings of n-dimensional spaces. And for L=mpoint our theorem implies a theorem of Ancel on approximations of UVinfty-valued mappings of C-spaces.


The main result of the paper concerns the existence of graph approximations of set-valued maps defined on the so-called \(C\)-spaces. A topological space \(X\) has property \(C\) if, for each sequence \(\{{\mathcal U}_i\}^\infty_{i=1}\) of open coverings of \(X\), there is an open convex \(\Sigma\) being a countable union of pairwise disjoint families \(\Sigma_i\) such that \(\Sigma_i\) refines \({\mathcal U}_i\), \(i= 1,2,\dots\)\ . The authors, using the concept of the extension dimension with respect to a countable CW-complex \(L\), introduce the notions of \([L]\)-connectedness and \(UV^{[L]}\)-compactum and show that given a paracompact \(C\)-space \(X\) of extension dimension less or equal \([L]\), each upper semicontinuous set-valued map with \(UV^{[L]}\)-values in a complete metric space possesses arbitrarily close graph approximations. This result generalizes by far the well-known theorems on the graph approximability of multivalued maps.











This page was built for publication: Extension dimensional approximation theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862098)