Publication

Closing the Finite Gap: From Finite Pick Positivity to Analytic Rigidity

The SEERAVERSE Research Initiative has published the SEERAVERSE RH PROGRAM research note v1.1, titled “Closing the Finite Gap: From All-Depth Pick Positivity to Analytic Rigidity,” on Zenodo.

This paper is a preprint documenting one potential research path toward the Riemann Hypothesis (RH). It records a dependency chain involving the positivity of finite Pick matrices, positive real interpolation, compactness of analytic function families, uniqueness, analytic continuation, and the exclusion of poles. Both English and Japanese versions are published in the same record, with DOI 10.5281/zenodo.23145297, a publication date of October 5, 2026, and version 1.1.

What is the “Finite Gap” Closed Here

In this research program, we reduce the problem not by dealing directly with infinite claims, but by examining the positivity of finite Pick matrices constructed at each depth. In previous stages, there remained a central region that required separate control—though finite in size—between the prefix, which strictly verifies the initial range, and the effective restart, which operates from a sufficiently large depth. The “finite gap” referred to in this paper is precisely this finite central region.

In v1.1, we introduce a centrality evaluation that provides a stage-dependent reflection cap, controlling how much the reflection coefficient can increase at each new stage where a reflection factor is added. Furthermore, we rigorously factorize the propagation factors that carry this influence to the next stage and organize them into geometric terms that can be partially canceled by a telescopic structure. The Zenodo abstract reports combining the contraction of the threshold ratio with proof-grade base margin, resulting in a conservative uniform margin exceeding $10^{507}$ over the range from 4053 to 10148.

Connecting Three Ranges into One

The dependency structure is divided into three parts. The first is the proof-grade prefix up to $n=4052$; the second is the finite central region, $4053 \le n \le 10148$, which we have analytically processed; and the third is the effective restart for $n \ge 10149$. The core of this work is not merely filling the central region with large-scale numerical sweeps, but treating it based on the structure of upper bounds and propagation across stages.

The document claims that when these three regions are connected, all-depth finite Pick positivity is achieved within the program. Subsequently, we move beyond just the positivity of finite matrices by extracting limit functions from interpolation problems, utilizing uniqueness on non-Blaschke lattices, leading to identity analytic continuation and pole exclusion. The term “analytic rigidity” in the title refers to this downstream stage where degrees of freedom are lost and the analytic object becomes strongly constrained.

A Brief Glossary of Terms

Pick positivity relates to a classical framework that determines whether an analytic function can satisfy specified conditions at given points by examining the positive definiteness of a matrix. A Schur parameter is a coefficient appearing in iterative processes, and controlling its magnitude is directly linked to stability. Montel compactness is a tool for extracting convergent subsequences from an appropriately uniformly bounded family of analytic functions. Nevanlinna-class uniqueness relates to the stage where functions that agree on a sufficiently strong zero set are shown to be identical.

Simply listing these classical tools is insufficient for a proof. The crucial point is whether the conditions obtained at finite stages truly connect to the desired analytic object through limits and uniqueness, and whether any unproven assumptions have crept into this connection. This paper attempts to present that dependency order in an auditable form.

What This Announcement Means and What It Does Not Mean

The Zenodo record positions this research note as a significant internal milestone for the SEERAVERSE RH PROGRAM. However, it is not a peer-reviewed paper; it is a preprint. Furthermore, as explicitly stated by the authors, it is not a document making the public claim that the Riemann Hypothesis has been proven. The results presented here must be read in the scope of analytically processing the obstacle within the finite central region of the program and organizing its dependencies into a single chain.

Therefore, “closing the dependency chain internally” must be distinguished from “the mathematical community independently verifying and accepting it as a proof.” SRI seeks verification at every stage—from definitions, lemmas, constants, boundary conditions, and finite checks—to the analytic conclusion, rather than merely strengthening the conclusion with computational values or large safety margins.

Points for Independent Verification

Whether the centrality evaluation and upper bounds on reflection coefficients used in the variable reflection-cap argument hold across the entire stated range.
Whether there are any gaps in the rigorous factorization of propagation factors and the handling of telescopic geometric terms.
Whether a uniform margin for the entire central region can be derived from the threshold contraction $\mathbf{T}_{\mathbf{n+1}}/\mathbf{T}_\mathbf{n} < 4/9$ and the base margin.
Whether the downstream logic—from finite Pick positivity to positive real interpolation, Montel compactness, Nevanlinna class uniqueness, continuous extension, and pole exclusion—is valid.
Whether the boundaries between finite computation, interval evaluation, and analytic arguments are clear and reproducible.

The value of this research lies not in declaring a strong conclusion quickly, but in presenting the subject matter in a falsifiable form that leaves behind structure to pinpoint errors if they exist.

Research Materials

The LinkedIn background article explains SEERAVERSE’s concerns regarding symmetry, stability, and boundary conditions for a general audience. For the technical basis of v1.1 presented here, please refer exclusively to the Zenodo document.

How Verification Should Proceed

For independent verification, one must not evaluate the impression by working backward from the final conclusion; rather, one must check the dependency chain step-by-step from the beginning. First, fix the definitions of symbols, matrices, lattices, normalization, and target intervals. Next, list all assumptions referenced by each lemma. After that, confirm whether the three regions—the finite prefix, the central region, and the restart—cover the entire depth without overlap or gaps. In the central region, it is crucial to track not only whether the upper bounds are applicable at every stage but also details such as rounding, inequality direction, and handling of endpoints.

In the downstream analysis, separate checks must be made for: (1) conditions allowing the construction of interpolation functions from finite-stage positivity; (2) local boundedness when taking limits; (3) whether the lattice is sufficient as a uniqueness set; (4) the domain covered by continuous extension; and (5) the location of poles that must be excluded. Even if there are large numerical margins, they cannot compensate for assumptions in other logical stages. Conversely, it is necessary to distinguish between minor descriptive errors and fundamental errors that break the dependency chain.

Reproducibility and Revision Policy

The Zenodo record contains both English and Japanese versions. When citing or verifying, please record not only the record number but also the version (v1.1), publication date, and language of the referenced PDF. In the future, if changes occur to constants, lemmas, notation, or verification scope, we plan to issue a new version showing the differences rather than overwriting previous versions.

SRI does not only seek agreement. Potential counterexamples, overlooked boundary conditions, inconsistencies with existing theorems, shorter proof paths, and equivalent but easier-to-verify reformulations are also important outcomes. Verification results can connect to future revisions by clearly stating which version’s definition, lemma, or equation was targeted.

AI Assistance and Human Responsibility

In this research program, AI can be utilized for literature review, comparing equations, extracting dependencies, searching for candidate counterexamples, and creating explanatory diagrams. However, generated explanations or calculations must never be adopted as mathematical fact. Humans bear responsibility for the scope of claims published, fulfilling proof obligations, responding to external critiques, and making decisions regarding withdrawal or revision.

The title image also adheres to this principle. While it illustrates the progression from finite structure through constraint propagation to analytic rigidity, the figure is not a substitute for proof. It serves as navigation, helping the reader understand the overall relationship and determine where in the text they should read.

Readers are encouraged not to judge the conclusion based solely on the abstract, but if possible, to compare corresponding sections between the Japanese and English versions. If there are questions regarding translational differences, symbol definitions, reference numbers, or endpoint conditions, please do not speculate; instead, refer to the relevant version in Zenodo for confirmation. Valid critiques received after publication will be organized based on whether they improve the precision of the dependency chain, rather than whether they are convenient for the conclusion.