Projective functions
Laurence Carassus, Massinissa Ferhoune

TL;DR
This paper investigates projective functions, demonstrating their generalization of semianalytic functions, their stability under various operations, and their applications in model uncertainty, with results contingent on the axiom of Projective Determinacy.
Contribution
It establishes the stability properties of projective functions under multiple operations and explores their measurable selection and integration properties under Projective Determinacy.
Findings
Projective functions generalize lower and upper-semianalytic functions.
They are stable under composition, difference, sum, product, and other operations.
Results depend on the axiom of Projective Determinacy.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
