VGPT-RSI for RH-Adjacent Formal Progress: Boundary Certificates, Verified Finite Lagarias Inequalities, and Explicit Failure Localization
Summary
This paper applies the VGPT-RSI AI system to produce formally verified partial results related to the Riemann Hypothesis, including boundary certificates and finite Lagarias inequalities, while explicitly identifying remaining mathematical obstructions.
View Cached Full Text
Cached at: 06/16/26, 11:43 AM
# VGPT-RSI for RH-Adjacent Formal Progress: Boundary Certificates, Verified Finite Lagarias Inequalities, and Explicit Failure Localization Source: [https://arxiv.org/abs/2606.15096](https://arxiv.org/abs/2606.15096) [View PDF](https://arxiv.org/pdf/2606.15096) > Abstract:The Riemann Hypothesis remains one of the central unsolved problems in mathematics\. Rather than claiming proof, we investigate whether a verifiable AI\-assisted reasoning system can produce reliable, formally checked partial progress while explicitly identifying the remaining mathematical obstructions\. We apply the Verifiable Growing Physical Transformer with Recursive Self\-Improvement \(VGPT\-RSI\) to two RH\-adjacent certification tasks\. First, we construct and verify a finite RH\-boundary certificate for inequality on a parameterized safe lower curve over a region\. The numerical boundary curve is converted into a certificate\-backed lower curve, audited using outward\-rounded interval arithmetic and Arb/FLINT ball arithmetic, and then checked in Rocq/CoqInterval for the parameterized theorem\. Second, we initiate a formal Lagarias\-route certificate\. Lagarias criterion states that RH is equivalent to the global inequality\. We formalize the finite quantity and produce a Coq\-checked finite certificate\. The final system identifies the exact unresolved mathematical bottlenecks: formalizing the Lagarias equivalence, proving the global tail theorem beyond any finite cutoff, and potentially reducing counterexamples to colossally abundant or related extremal integers\. These results demonstrate that VGPT\-RSI can produce certified RH\-adjacent formal progress, organize proof dependencies, and avoid overclaiming when the remaining obstruction is genuinely mathematical\. ## Submission history From: Momiao Xiong \[[view email](https://arxiv.org/show-email/f778f593/2606.15096)\] **\[v1\]**Sat, 13 Jun 2026 04:12:25 UTC \(1,169 KB\)
Similar Articles
LLM Framework for Discovering Major Mathematical Conjectures: AI's Quest for the Next Riemann Hypothesis
This paper introduces a three-stage LLM pipeline for systematically generating and validating major mathematical conjectures, using Lean 4 formal verification and reflective validation to discover problems with high 'problem taste'.
From LLM-Generated Conjectures to Lean Formalizations: Automated Polynomial Inequality Proving via Sum-of-Squares Certificates
This paper presents NSPI, a neuro-symbolic framework that combines LLMs and symbolic computation to prove polynomial inequalities. It uses LLM-generated sum-of-squares conjectures, refines them symbolically, and formally verifies the proofs in Lean, demonstrating scalability on polynomials with up to 10 variables.
Theoria: Rewrite-Acceptability Verification over Informal Reasoning States
Theoria is a verification architecture that rewrites AI solutions into auditable state transitions, achieving high precision on HLE problems and detecting subtle errors like hidden premises and fabricated citations.
Autonomous disproofs of the sum-product conjecture over $\mathbb R$ with GPT-5.5 Pro
This paper presents an AI agent built on GPT-5.5 Pro that autonomously generated correct proofs disproving the Erdős–Szemerédi sum-product conjecture over ℝ in 7 out of 8 trials, using a three-stage prompting pipeline.
Evaluating Research-Level Math Proofs via Strict Step-Level Verification
This paper introduces a strict step-level verification framework for evaluating research-level mathematical proofs using LLMs, addressing context poisoning and outperforming global evaluation. The approach shifts focus to deductive constraints and reveals that remaining errors are often due to pedantic hyper-rigor, exposing implicit ambiguities in benchmarks.