Talk:Selection theorem

Now we have another selection theorem: Kuratowski and Ryll-Nardzewski measurable selection theorem. Boris Tsirelson (talk) 17:57, 3 November 2015 (UTC)

Moreover, many compactness-type theorems are also called "selection theorems". Boris Tsirelson (talk) 17:59, 3 November 2015 (UTC)

Why is the "approximate selection theorem" here not approximately selecting?
One of the conditions for what this article calls the "approximate selection theorem" is:

> For every $$\varepsilon>0$$ there exists a continuous function $$f: X \rightarrow Y$$ with $$\operatorname{graph}(f) \subset[\operatorname{graph}(F)]_{\varepsilon}$$, where $$[S]_\epsilon$$ is the $$\epsilon$$-dilation of $$S$$, that is, the union of radius-$$\epsilon$$ open balls centered on points in $$S$$.

This actually looks like what an approximate selection should be. Instead, it's one of the conditions. The article claims that the condition is used in the "approximate selection theorem" to imply the existence of a continuous selection. There has to be a mistake here somewhere. This is important because a bug here affects other articles. --Svennik (talk) 13:19, 19 December 2023 (UTC)


 * I just followed the citation to page 68. The bloody article misstated the theorem. Here is the actual statement of the theorem:


 * Theorem 6.5 (The Approximate-Selection Theorem). Suppose X is a compact metric space, Y a nonvoid compact, convex subset of a normed linear space, and Φ: X ⇒ Y a multifunction all of whose values are compact and convex. If graph(Φ) is closed, then for every ε > 0 there exists a continuous function f : X → Y with graph(f) ⊂ [graph(Φ)]ε.


 * This is what I actually expected. FFS!!! --Svennik (talk) 13:28, 19 December 2023 (UTC)