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

Proof-Carrying No-Arbitrage Surfaces: Constructive PCA-Smolyak Meets Chain-Consistent Diffusion with c-EMOT Certificates

Author

Listed:
  • Jian'an Zhang

Abstract

We study the construction of SPX--VIX (multi\textendash product) option surfaces that are simultaneously free of static arbitrage and dynamically chain\textendash consistent across maturities. Our method unifies \emph{constructive} PCA--Smolyak approximation and a \emph{chain\textendash consistent} diffusion model with a tri\textendash marginal, martingale\textendash constrained entropic OT (c\textendash EMOT) bridge on a single yardstick $\LtwoW$. We provide \emph{computable certificates} with explicit constant dependence: a strong\textendash convexity lower bound $\muhat$ controlled by the whitened kernel Gram's $\lambda_{\min}$, the entropic strength $\varepsilon$, and a martingale\textendash moment radius; solver correctness via $\KKT$ and geometric decay $\rgeo$; and a $1$-Lipschitz metric projection guaranteeing Dupire/Greeks stability. Finally, we report an end\textendash to\textendash end \emph{log\textendash additive} risk bound $\RiskTotal$ and a \emph{Gate\textendash V2} decision protocol that uses tolerance bands (from $\alpha$\textendash mixing concentration) and tail\textendash robust summaries, under which all tests \emph{pass}: for example $\KKT=\CTwoKKT\ (\le 4!\!\times\!10^{-2})$, $\rgeo=\CTworgeo\ (\le 1.05)$, empirical Lipschitz $\CThreelipemp\!\le\!1.01$, and Dupire nonincrease certificate $=\texttt{True}$.

Suggested Citation

  • Jian'an Zhang, 2025. "Proof-Carrying No-Arbitrage Surfaces: Constructive PCA-Smolyak Meets Chain-Consistent Diffusion with c-EMOT Certificates," Papers 2511.09175, arXiv.org.
  • Handle: RePEc:arx:papers:2511.09175
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2511.09175
    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:2511.09175. 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.