Id: palomar/PALOMAR-2026-11-16-000013 Url: https://github.com/sthubbar/goldbach-lean/tree/0e201f43acf714d7821daadf5963c06d961132e8/entries/estermann1938 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-16-000013-v1.json Repo: https://github.com/sthubbar/goldbach-lean Tags: math.NT, msc:11P32, msc:11P55, msc:11N13 Score: 0 Title: On Goldbach's problem: proof that almost all even positive integers are sums of two primes Trust: high Domain: math.NT Source: palomar Authors: Steve Hubbard Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-16 Formalized: true Formalizes: title=On Goldbach's problem: proof that almost all even positive integers are sums of two primes identifier=doi:10.1112/plms/s2-44.4.307 relationship=formalizes Formalizes: title=The ternary Goldbach problem identifier=doi:10.4171/RMI/2 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-16-000013 A Lean 4 proof, with no unproved steps, of the main result of T. Estermann, On Goldbach's problem: proof that almost all even positive integers are sums of two primes, Proc. London Math. Soc. series 2, volume 44, 1938, pages 307-314. Let Q of n be the number of even positive integers less than n that are not sums of two primes. The Introduction on page 307 states that, as n tends to infinity, Q of n is O of n log^-a n for every positive a; this is the compared theorem, LeanLab.Estermann1938.main. The proof is not Estermann's circle method text: it bounds Q of n by E of n plus 1, where E of X…