A lower explicit threshold for Chen's theorem under GRH

Steve Hubbard

PAPER · v1.8 · 2026-11-05 · human

Formal Sciences Mathematics Number theory

Abstract

Assume the Generalized Riemann Hypothesis (GRH). We show that every even integer N >= exp(exp(13.375)) can be written as N = p + P_2, where p is a prime and P_2 is either a prime or a product of two primes. The result is conditional on GRH and on Theorems 5, 6, 7 and Lemma 9 of Bordignon and Starichkova, Ramanujan J. 64 (2024), together with the auxiliary lemmas, Table 1 and display (6) that their Section 5.4 uses, at new parameter values; they obtain exp(exp(14)). It is not a new method: it is a re-choice of the parameters u and alpha in their argument, combined with the observation that Chen's theorem needs only that the Section 5.4 main-term combination be positive, not that it exceed 4*10^-3, because the inequality pi_2'(N) >= pi_2(N) - sqrt(N) - 1 from the proof of their Corollary 1 gives N = p + P_2 as soon as pi_2(N) > sqrt(N) + 1. In Lean 4 the threshold statement itself is stated with GRH as an explicit hypothesis and proved conditional on the journal's Theorems 5, 6, 7 and the linear sieve Theorem 4 at the constants used; Lemma 9, the Section 5.5 step, epsilon(1500) < 1/8349 and the Section 5.4 bracket arithmetic are proved in Lean. Theorems 5, 6, 7 and Theorem 4 are not formalized. v1.4 corrects the Lean transcription of Theorems 5 to 7, which in v1.3 omitted the premises 0 < epsilon < 1/63 and N even and so made the conditional theorem vacuous. Lean source and build logs: github.com/sthubbar/lean-lab-preprints, commit 2fdf0dc; registered in the Palomar registry as PALOMAR-2026-10-28-000016. The linear sieve is used in the printed fixed level form; see Remark 1.

Keywords

Chen's theorem Generalized Riemann Hypothesis sieve methods explicit number theory Lean 4 formalization

Download PDF