Holomorphic certification on real subspaces
Loading original first page…
Abstract
For a family of nonnegative Hermitian quartics on complexifications of real subspaces, we identify the exact failure set of eventual holomorphic squared-norm certification: the subspaces containing a sign vector. At fixed dimensions and positive perturbation, the least norm-multiplier degree grows uniformly as the inverse square of the distance to this set. This geometric law gives exact moment thresholds for random certificate degree. On Haar-distributed real d-planes in ℝ^n, the degree has tail order M^(-(n-d)/2); it is finite almost surely but has infinite mean in codimensions one and two. Soft-constraint matrices with independent uniform entries on [-1,1] give the corresponding threshold in their number of rows. The probability estimates remain valid under changes of density bounded above and away from zero. The same classification yields coNP-hardness for already nonnegative integer quartics with exactly one negative coefficient eigenvalue and cubically bounded coefficients. A sharp uniform inertia threshold strengthens that coefficient restriction. Explicit hierarchy bounds supply global degree upper estimates, while logarithmic curvature gives the matching lower scale. In a weighted two-dimensional restriction we determine both an exact fixed-perturbation leading constant and the joint vanishing-perturbation crossover, including finite degree plateaus. The random and joint-limit results quantify how eventual certification can coexist with large or nonintegrable degree costs.
Read the full paper in the original PDF.
Edition files
- Manuscript.pdf160.4 KiB · pdf
SHA-256
9fc5fb043d0df5a533d7549650d95054eca75a97464a30534edde15ee7058605 - Publication_Package.zip188.8 KiB · package
SHA-256
ed8a3fbdbb409c14ac69b7f15df0ce1b429c92b4120c9cb8a7318c03db1d649b
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 degree, random subspaces, computational complexity
- Manuscript date
- 2026-10-27
- Reader reuse
- none
Disclosures
ChatGPT (OpenAI) assisted with research, mathematical development, drafting and checks. The author is responsible for the statements, proofs and attribution. This research was self-funded and received no external grant or sponsorship. The author owns Luminary Oddities and the Luminary Research Archive; no other competing interests are declared.
Reproduction
The 18-page searchable manuscript is accompanied by complete editable sources, reader instructions, citation metadata and integrity checksums. The manuscript supplies the analytic arguments; accompanying computational materials, where included, check their specified finite certificates.