Holomorphic certification on real subspaces
Loading original first page…
Abstract
We study a family of nonnegative Hermitian quartics on complexifications of real linear subspaces of dimension at least two. A certificate expresses the quartic, after multiplication by a power of the squared Euclidean norm, as a sum of squared absolute values of holomorphic polynomials. We characterize certificate existence by a simple geometric condition: the real subspace contains no vector whose coordinates are all plus or minus one. When such a vector exists, every nonzero intrinsic polynomial multiplier is excluded. This classification yields coNP-hardness even for integer quartics with polynomially bounded coefficients and exactly one negative coefficient eigenvalue. For fixed ambient and proper subspace dimensions and a fixed positive parameter, the least certificate degree grows as the inverse square of the distance to the failure set as that distance tends to zero. We identify that distance exactly in the operator norm on subspace projections. A parallel law holds for bounded matrices imposing soft constraints. The lower bounds use logarithmic curvature; classical quantitative stabilization supplies matching upper bounds. A weighted two-dimensional family gives the exact leading constant and an example with short rational input but exponentially growing certificate degree.
Read the full paper in the original PDF.
Edition files
- main.pdf137.0 KiB · pdf
SHA-256
e691f4da68ed450d39db0badef5f7765ebc8bc3cb7a702207b73a19e93aeaab7 - Holomorphic-certification-on-real-subspaces.zip160.3 KiB · package
SHA-256
b27d0d2bfe85fce8bffa813a5642e2683636ca61dee3ca97fdf93b7833d3e9f6
Available editions
Research details
- Subjects
- Mathematics · Computer Science & Software Systems · Linear Algebra and Matrix Theory · Complex Analysis · Algorithms and Complexity
- Keywords
- Hermitian forms, holomorphic squared norms, certificate complexity, stabilization degree, positive polynomials
- Manuscript date
- 2026-10-27
- Reader reuse
- none
Scope
Sign-cube classification, restricted computational hardness and uniform and sharp boundary degree laws for holomorphic squared-norm certification.
Disclosures
OpenAI tools assisted mathematical exploration, proof checks, literature comparison, code and manuscript preparation. The author takes responsibility for the contents.
Reproduction
The 15-page paper, editable LaTeX source, reader instructions and reproduction code are supplied. The general results are proved analytically; programs provide finite reproducible examples.