Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Major and minor arc bounds give every odd N at least C as a sum of three primes

Proved
LL_Decomp1535a.ternaryAbove_of_arcs

by sthubbar · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Let CCC be real. Suppose that for every odd natural number N≥CN\ge CN≥C there are a measurable set M⊆RM\subseteq\mathbb RM⊆R and reals AAA, BBB with B≥0B\ge0B≥0, A≤Re⁡∫(0,1]∩MFN(α) dαA\le\operatorname{Re}\int_{(0,1]\cap M}F_N(\alpha)\,d\alphaA≤Re∫(0,1]∩M​FN​(α)dα, ∣SN(α)∣≤B|S_N(\alpha)|\le B∣SN​(α)∣≤B for every α∈(0,1]∖M\alpha\in(0,1]\setminus Mα∈(0,1]∖M, and B⋅log⁡N⋅(log⁡4⋅N)<AB\cdot\log N\cdot(\log 4\cdot N)<AB⋅logN⋅(log4⋅N)<A. Then every odd natural number n≥Cn\ge Cn≥C is a sum of three primes.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1535a_IsTernarySum
import Definitions.Def_LL_Decomp1535a_S
import Definitions.Def_LL_Decomp1535a_F
import Definitions.Def_LL_Decomp1535a_TernaryAbove

open MeasureTheory
Formal statement
namespace LL_Decomp1535a
theorem ternaryAbove_of_arcs {C : ℝ}
    (h : ∀ N : ℕ, Odd N → C ≤ N → ∃ M : Set ℝ, MeasurableSet M ∧ ∃ A B : ℝ, 0 ≤ B ∧
      A ≤ (∫ α in Set.Ioc (0 : ℝ) 1 ∩ M, F N α).re ∧
      (∀ α ∈ Set.Ioc (0 : ℝ) 1 \ M, ‖S N α‖ ≤ B) ∧
      B * (Real.log N * (Real.log 4 * N)) < A) :
    TernaryAbove C := by sorry
end LL_Decomp1535a
Source
Liu and Wang 2002, Section 3, pp. 145 to 146, the circle method route of eqs. 3.9 and 3.10
Read-back

What the Lean code literally says, in plain math · claude-haiku

Read-back: LL_Decomp1535a.ternaryAbove_of_arcs

Let CCC be a real number. The statement is an implication: if the hypothesis hhh below holds, then TernaryAbove(C)\mathrm{TernaryAbove}(C)TernaryAbove(C) holds.

Hypothesis hhh. For every odd natural number NNN with C≤NC \le NC≤N, there exist a measurable (Borel) set M⊆RM \subseteq \mathbb{R}M⊆R and real numbers AAA and BBB such that:

  • 0≤B0 \le B0≤B;
  • A≤Re⁡∫(0,1]∩MFN(α) dαA \le \operatorname{Re}\displaystyle\int_{(0,1]\cap M} F_N(\alpha)\,d\alphaA≤Re∫(0,1]∩M​FN​(α)dα, with Lebesgue integration in α\alphaα;
  • for every α∈(0,1]\alpha \in (0,1]α∈(0,1] with α∉M\alpha \notin Mα∈/M, ∥SN(α)∥≤B\lVert S_N(\alpha)\rVert \le B∥SN​(α)∥≤B;
  • B Nlog⁡Nlog⁡4<AB\,N\log N\log 4 < ABNlogNlog4<A, where log⁡\loglog is the natural logarithm.

Symbols. FNF_NFN​ and SNS_NSN​ are the functions FFF and SSS at index NNN, taken from bundle definitions. FNF_NFN​ is complex-valued, and the statement uses its real part. TernaryAbove(C)\mathrm{TernaryAbove}(C)TernaryAbove(C) is a predicate from a separate bundle definition. None of FFF, SSS or TernaryAbove\mathrm{TernaryAbove}TernaryAbove is unfolded here, so the conclusion is recorded by name only.

Edge cases.

  • The right-hand side B Nlog⁡Nlog⁡4B\,N\log N\log 4BNlogNlog4 is nonnegative for odd N≥1N \ge 1N≥1, so hhh forces A>0A > 0A>0.
  • If FNF_NFN​ is not integrable on (0,1]∩M(0,1]\cap M(0,1]∩M, the integral takes the value 000. That cannot satisfy A≤0<AA \le 0 < AA≤0<A, so non-integrability does not make hhh hold.
  • If MMM contains all of (0,1](0,1](0,1], the bound on SNS_NSN​ is vacuous.
  • If M∩(0,1]M \cap (0,1]M∩(0,1] is empty, the integral term is 000, so hhh fails.
  • Only odd N≥CN \ge CN≥C are constrained.
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me