English

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

Computational Finance 2025-11-13 v1

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\LtwoW. We provide \emph{computable certificates} with explicit constant dependence: a strong\textendash convexity lower bound \muhat\muhat controlled by the whitened kernel Gram's λmin\lambda_{\min}, the entropic strength ε\varepsilon, and a martingale\textendash moment radius; solver correctness via \KKT\KKT and geometric decay \rgeo\rgeo; and a 11-Lipschitz metric projection guaranteeing Dupire/Greeks stability. Finally, we report an end\textendash to\textendash end \emph{log\textendash additive} risk bound \RiskTotal\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 (4! ⁣× ⁣102)\KKT=\CTwoKKT\ (\le 4!\!\times\!10^{-2}), \rgeo=\CTworgeo (1.05)\rgeo=\CTworgeo\ (\le 1.05), empirical Lipschitz \CThreelipemp ⁣ ⁣1.01\CThreelipemp\!\le\!1.01, and Dupire nonincrease certificate =True=\texttt{True}.

Cite

@article{arxiv.2511.09175,
  title  = {Proof-Carrying No-Arbitrage Surfaces: Constructive PCA-Smolyak Meets Chain-Consistent Diffusion with c-EMOT Certificates},
  author = {Jian'an Zhang},
  journal= {arXiv preprint arXiv:2511.09175},
  year   = {2025}
}

Comments

51 pages; includes figures, algorithms, and appendices

R2 v1 2026-07-01T07:33:42.105Z