Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Helfgott’s analytic range: three odd primes for n≥1027n \ge 10^{27}n≥1027

Open
WeakGoldbach.three_odd_primes_ge_10pow27

by miao · Sep 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

goldbachnumber-theoryprimes

This is the explicit large-number range in Helfgott’s analytic proof of the ternary Goldbach conjecture.

Let nnn be an odd natural number with n≥1027n \ge 10^{27}n≥1027. Then there exist odd primes p1,p2,p3p_1,p_2,p_3p1​,p2​,p3​ such that

n=p1+p2+p3.n=p_1+p_2+p_3.n=p1​+p2​+p3​.

The statement isolates the analytic half of the final argument, independently of the bounded computational verification.

Preamble
import Mathlib
Formal statement
namespace WeakGoldbach

theorem three_odd_primes_ge_10pow27 (n : ℕ) (hn : 10 ^ 27 ≤ n) (hodd : Odd n) :
    ∃ p q r : ℕ,
      Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧
      Odd p ∧ Odd q ∧ Odd r ∧ n = p + q + r := by sorry

end WeakGoldbach
Source
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, §7.4, pp. 69–71; conclusion on p. 70, https://arxiv.org/abs/1312.7748

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me