How can we recover Baire class one functions?

Dominique Lecomte

Home/Archive/arXiv

arXiv · 0710.0155

How can we recover Baire class one functions?

Dominique Lecomte

View original source ↗Read source document ↗Export metadata ↓

Abstract

Let X and Y be separable metrizable spaces, and f:X-->Y be a function. We want to recover f from its values on a small set via a simple algorithm. We show that this is possible if f is Baire class one, and in fact we get a characterization. This leads us to the study of sets of Baire class one functions and to a characterization of the separability of the dual space of an arbitrary Banach space.

Explore related subjects

math.LO math.FA math.GN

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Dominique Lecomte. 2007-09-30. How can we recover Baire class one functions?. https://arxiv.org/abs/0710.0155

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Dichotomy results for classes of countable graphs

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural dichotomy for such classes: If $\mathcal{G}$ is not an induced subgraph of $\mathcal{P}_4$, then $\mathsf{Free}(\mathcal{G})$ is on top under effective bi-interpretability, implying that the members of $\mathsf{Free}(\mathcal{G})$ exhibit the full range of structural and computational behaviors. In contrast, if $\mathcal{G}$ is an induced subgraph of $\mathcal{P}_4$, then $\mathsf{Free}(\mathcal{G})$ is structurally simple, as witnessed by the fact that every member satisfies the computable embeddability condition. This dichotomy is mirrored in the finite setting when one considers combinatorial and complexity-theoretic properties. Specifically, it is known that $\mathsf{Free}(\mathcal{G})^{fin}$ is complete for graph isomorphism and not a well-quasi-order under embeddability whenever $\mathcal{G}$ is not an induced subgraph of $\mathcal{P}_4$, while in all other cases $\mathsf{Free}(\mathcal{G})^{fin}$ forms a well-quasi-order and the isomorphism problem for $\mathsf{Free}(\mathcal{G})^{fin}$ is solvable in polynomial time.

math.LO↗

arXiv2026

The strength of the minimum principle in constructive reverse mathematics

The minimum principle states that every real-valued uniformly continuous function f : X -> R on a compact metric space X attains its minimum. Working in the base system EL0 of constructive reverse mathematics, we show that the minimum principle is equivalent to weak Konig's lemma and to the Cantor intersection theorem (i.e., the contrapositive of the Heine-Borel theorem). Moreover, the above equivalence naturally extends to the equivalence between the corresponding principles with unique existence assumptions, which are then shown to be equivalent to the Fan theorem for detachable bars and the positivity property for a real-valued uniformly continuous function on a compact space. These results sharpen the equivalence among these principles obtained by Ishihara [Math. Log. Q. (1990), 237-240] and Berger and Ishihara [Math. Log. Q. (2005), 360-364] in Bishop's constructive mathematics.

math.LO↗

arXiv2026

Complexity of deep computations via topology of function spaces

We use topological methods to study complexity of deep computations and limit computations. We use topology of function spaces, specifically, the classification of Rosenthal compacta, to identify new complexity classes. We use the language of model theory, specifically, the concept of \emph{independence} from Shelah's classification theory, to translate between topology and computation. We use the theory of Rosenthal compacta to characterize approximablility of deep computations, both deterministically and probabilistically.

math.LO↗