Projective functions
Logic
2025-10-14 v2
Abstract
We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums, differences, products, finite suprema and infima, sections and compositions. Assuming the set-theoretical axiom of Projective Determinacy, we also prove measurable selection results, stability under integration, and the existence of -optimal selectors. Finally, we illustrate how these results are important in the context of model uncertainty.
Cite
@article{arxiv.2507.12605,
title = {Projective functions},
author = {Laurence Carassus and Massinissa Ferhoune},
journal= {arXiv preprint arXiv:2507.12605},
year = {2025}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2403.11824