IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2504.00158.html
   My bibliography  Save this paper

Robust No-Arbitrage under Projective Determinacy

Author

Listed:
  • Alexandre Boistard
  • Laurence Carassus
  • Safae Issaoui

Abstract

Drawing from set theory, this article contributes to a deeper understanding of the no-arbitrage principle in multiple-priors settings and its application in mathematical finance. In the quasi-sure discrete-time frictionless market framework of Bouchard and Nutz, the equivalence between the quasi-sure no-arbitrage condition and the existence of a probability measure for which the local one-prior no-arbitrage condition holds and the affine hull of the support is equal to the quasi-sure support, all of this in a quasi-sure sense, was established by Blanchard and Carassus. We aim to extend this result to the projective setup introduced by Carassus and Ferhoune. This setup allows for standardised measurability assumptions, in contrast to the framework of Bouchard and Nutz, where prices are assumed to be Borel measurable, strategies and stochastic kernels universally measurable, and the graphs of one-step priors analytic sets. To achieve this, we assume the classical axioms of Zermelo-Fraenkel set theory, including the axiom of choice (ZFC), supplemented by the Projective Determinacy (PD) axiom. In ZFC+PD the existence of such probability measures was assumed by Carassus and Ferhoune to prove the existence of solutions in a quasi-sure nonconcave utility maximisation problem. The equivalence with the quasi-sure no-arbitrage was only conjectured.

Suggested Citation

  • Alexandre Boistard & Laurence Carassus & Safae Issaoui, 2025. "Robust No-Arbitrage under Projective Determinacy," Papers 2504.00158, arXiv.org.
    • Handle: RePEc:arx:papers:2504.00158
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2504.00158
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2504.00158. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.