Sup-norm stability radii for a nodal face of the spherical discriminant
Version 1 / Nov 18, 2026 / CC BY 4.0
Abstract
How large can a real perturbation be before a nodal line ceases to be a single graph in a fixed spherical sector? We study a truncated face of the degree-nine discriminant, allowing all 100 real spherical polynomial modes of degree at most nine and measuring the supremum norm on the entire closed tube. The failure radius equals the minimum cost of cancelling the field and its normal derivative. We bound it on the full parameter domain and determine it exactly in two sufficient regimes, using an explicit atomic mixed-jet certificate on the sphere. In these exact regimes the unique critical field is a scaled Chebyshev polynomial, and the whole closed radius ball still preserves the graph, although the critical zero level is singular; every larger amplification of that field fails. Two continuous examples separate the limits of a support criterion from those of the radius formula. Below the radius we obtain quantitative graph bounds. In the exact regimes a smooth family approaching the critical field from inside the ball has uniformly convergent graphs and terminal slopes diverging as at the minimizing terminals. Persistence and conditioning therefore separate.
Provenance statement
Tools used
- OpenAI
- Codex
- OpenAI
- GPT-6.2 Sol
- Python Software Foundation
- Python
- SymPy
- SymPyVersion 1.14.0
References
- Oleg Davydov; Robert Schaback. Minimal Numerical Differentiation Formulas. Numerische Mathematik, vol. 140, pp. 555–592. 2018. DOI (https://doi.org/10.1007/s00211-018-0973-3); locators refer to arXiv:1611.05001v2 (https://arxiv.org/html/1611.05001v2)arXivDOI
- Mareike Dressler; Simon Foucart; Mioara Joldes; Etienne de Klerk; Jean-Bernard Lasserre; Yuan Xu. Least Multivariate Chebyshev Polynomials on Diagonally Determined Sets. SIAM Journal on Applied Algebra and Geometry, vol. 10, no. 2, pp. 450–466. 2026. DOI (https://doi.org/10.1137/24M1717853); locators refer to the author manuscript v3 (https://foucart.github.io/publi/LeastCheby_v3.pdf) (also arXiv:2405.19219v3 (https://arxiv.org/abs/2405.19219v3))arXivDOI
- Tamás Erdélyi. Basic Polynomial Inequalities on Intervals and Circular Arcs. Constructive Approximation, vol. 39, pp. 367–384. 2014. DOI (https://doi.org/10.1007/s00365-013-9208-0); locators refer to the 18-page author manuscript (https://people.tamu.edu/~terdelyi/papers-online/BPICA.pdf)DOI
- Khazhgali Kozhasov; Bernard Mourrain; Adam Parusiński. On the Distance to Discriminants and Osculating Varieties. 2026. Version of 5 October 2026. arXiv:2610.06538v1 (https://arxiv.org/html/2610.06538v1)link
- Antonio Lerario; Michele Stecconi. What Is the Degree of a Smooth Hypersurface?. Journal of Singularities, vol. 23, pp. 205–235. 2021. DOI (https://doi.org/10.5427/jsing.2021.23l); publisher PDF (https://www.journalofsing.org/volume23/lerario-stecconi.pdf)DOI
- Christophe Raffalli. Distance to the Discriminant. 2014. Version of 18 June 2014. arXiv:1404.7253v3 (https://arxiv.org/abs/1404.7253v3)link
Version history
- v1 · 33 pagesSubmitted by Oleksiy Babanskyy33 pages, two figures. Manuscript sources and reproducible companion, edition 1.0.1: https://github.com/aconsciousfractal/B3-Nodal-Stability-Radii/tree/f9cfcb9b3162cdf3724e609fcaecbeedc3cce45eCurrentNov 18, 2026