Rigorous Proof for Reimann Hypothesis Using the Novel Sigma-power Laws and Concepts from the Hybrid Method of Integer Sequence Classification
Bibliographic record
Abstract
Proposed by Bernhard Reimann in 1859, Reimann hypothesis refers to the famous conjecture explicitly equivalent to the mathematical statement that the critical line in the critical strip of Reimann zeta function is the location for all non-trivial zeros. The Dirichlet eta function is the proxy for Reimann zeta function. We treat and closely analyze both functions as unique mathematical objects looking for key intrinsic properties and behaviors. We discovered our key formula (coined the Sigma-power law) which is based on our key Ratio (coined the Reimann-Dirichlet Ratio). We recognize and propose the Sigma-power laws (in both the Dirichlet and Reimann versions) and the Reimann-Dirichlet Ratio, together with their various underlying mathematically-consistent properties, in providing crucial \textit{de novo} evidences for the most direct, basic and elementary mathematical proof for Reimann hypothesis. This overall proof is succinctly summarized for the reader by the sequential Theorem I to IV in the second paragraph of Introduction section. Concepts from the Hybrid method of Integer Sequence classification are important mathematical tools employed in this paper. We note the intuitively useful mental picture for the idea of the Hybrid integer sequence metaphorically becoming the non-Hybrid integer sequence with certain criteria obtained using Ratio study.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".