1998
DOI: 10.1016/s0166-8641(97)00159-4
|View full text |Cite
|
Sign up to set email alerts
|

A selection theorem for C-spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
31
0

Year Published

1998
1998
2009
2009

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(32 citation statements)
references
References 10 publications
1
31
0
Order By: Relevance
“…He also proved that if f : X → Y is a k-dimensional map between metric compacta, then the following two conditions are equivalent: (i) there exists a map g : X → I k with dim(f g) = 0; (ii) f admits an approximation by k-dimensional simplicial maps (see [32] for this notion).…”
Section: Proof Of Theorem 14mentioning
confidence: 99%
“…He also proved that if f : X → Y is a k-dimensional map between metric compacta, then the following two conditions are equivalent: (i) there exists a map g : X → I k with dim(f g) = 0; (ii) f admits an approximation by k-dimensional simplicial maps (see [32] for this notion).…”
Section: Proof Of Theorem 14mentioning
confidence: 99%
“…We conclude this section with the following special case of a result actually proved by Uspenskij [16]. …”
Section: Preliminariesmentioning
confidence: 70%
“…A space S is called aspherical [16] if every continuous map f : P → S from a compact polyhedron P can be continuously extended over the cone of P. Note that S is aspherical if and only if any continuous image of an n-sphere, n ∈ N, in S is contractible in S, i.e. when S is C n for every n ∈ N. Finally, we say that a set-valued map Φ :…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…It is based on an application of Uspenskij's selection theorem [23] that under the assumptions of Theorem 1.1 there exists a continuous function g : X → [0, 1] which is nonconstant on each fiber of f (see Lemma 2.1). The proof is then accomplished in Section 3 relying on a "parametric" version of an idea in the proof of [13, Theorem 1.3].…”
mentioning
confidence: 99%