The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function

preprint2011arXivOpen access

Abstract

In this article we treat a notion of continuity for a multi-valued function FF and we compute the descriptive set-theoretic complexity of the set of all xx for which FF is continuous at xx. We give conditions under which the latter set is either a GδG_δ set or the countable union of GδG_δ sets. Also we provide a counterexample which shows that the latter result is optimum under the same conditions. Moreover we prove that those conditions are necessary in order to obtain that the set of points of continuity of FF is Borel i.e., we show that if we drop some of the previous conditions then there is a multi-valued function FF whose graph is a Borel set and the set of points of continuity of FF is not a Borel set. Finally we give some analogous results regarding a stronger notion of continuity for a multi-valued function. This article is motivated by a question of M. Ziegler in [{\em Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability with Applications to Linear Algebra}, {\sl submitted}].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.