Research Article · Preprint Mathematics
Finite certificates for the lower edge of a weighted Weil operator
- Primary subject
- Mathematics
- Subject subfields
- Spectral Theory · Functional Analysis · Number Theory
- Paper type
- Research Article
- Manuscript stage
- Preprint
- Manuscript
- Archived
- Edition
- 2 · Permanent link
Overview
Abstract
We characterize the reach of complete finite lower certificates for the original minimal weighted Weil operator. The infimum of their certified negative allowances equals the operator's actual negative spectral depth, and a computable constrained core supplies rigorous two-sided approximations to its lower edge at every prescribed positive accuracy. The proof combines logarithmic form-core density with compact domination of a monotone frequency limit. Exact derivative-null vectors allow finite deflation without changing the original form or discarding mixed terms. An executed certificate with eight such vectors proves I+H≥0.999999978600004918685 I, with a retained positive potential on the null complement. All arithmetic, frequency, spatial, quadrature and finite-matrix errors are included; directed ball arithmetic verifies both signed matrices of order 4085. We also prove that, at fixed arithmetic cutoff and positive multiplication reference, boundedly many constraints cannot maintain the required cap as the regularization decreases, even with an arbitrary growing frequency band. The quantitative obstruction forces growing constraint dimension and identifies the continuation mechanism that the adaptive framework must control.
Keywords Weil positivity · Riemann xi-function · spectral lower bounds · exact null-space deflation · signed Gram certificates · rigorous computation
Scope of the work
Complete finite certificates characterize and computably approximate the actual lower edge of the specified minimal weighted Weil operator; exact-null deflation gives an executed eight-null bound, and fixed arithmetic cutoff forces constraint growth.
Reproduction notes
The 26-page manuscript and editable LaTeX sources are supplied in this 18-member package. README.md gives build instructions. code/verify_bounds.py, code/verify_certificate.py reconstruct the analytic bounds and complete finite signed certificate using NumPy and python-flint. The executable covers the finite eight-null instance; the arbitrary-precision lower-edge search is a mathematical construction.
The manuscript
Read the paper
The complete manuscript, as published in this edition.
If the reader is unavailable on your device, open or download the PDF directly.
Author disclosures
AI assistance was used in mathematical development, literature comparison, manuscript preparation and computational verification.
A stable scholarly record
Cite this edition
Scott Schubr. (2026). Finite certificates for the lower edge of a weighted Weil operator (Version 2). Luminary Research Archive. https://research.luminaryoddities.com/finite-certificates-lower-edge-weighted-weil-operator/v/2
BibTeX
@techreport{luminary_finite_certificates_lower_edge_weighted_weil_operator_v2,
title = {Finite certificates for the lower edge of a weighted Weil operator},
author = {Scott Schubr},
year = {2026},
institution = {Luminary Research Archive},
type = {Research Article},
note = {Version 2},
url = {https://research.luminaryoddities.com/finite-certificates-lower-edge-weighted-weil-operator/v/2}
}Loading discussion…