The von Mangoldt function equals when is a positive power of a prime , and is zero otherwise. Its exponential sum measures cancellation in the distribution of prime powers. Here is a natural cutoff and are real parameters. The Möbius function supplies the arithmetic weights in Vaughan's four-part decomposition.
This mission packages the coefficient identity, its exponential-sum assembly, and the dyadic and counting statements appearing in the lab's treatment of the fourth component. It includes a rational approximation condition with and , a truncated reciprocal-distance kernel, second-moment inequalities, and an explicit squarefree count. The individual statements have their own hypotheses; restrictions from the surrounding analytic argument are not silently added. The strict lower cutoff and the finite truncations are part of the formal specification.
The source is Ming-Chit Liu and Tianze Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arithmetica 105, 2002, pp. 133 to 175, especially Section 6, pp. 168 to 174. The kernel estimate is cited there from Wang and Chen 1994, Lemma 2; the lab interprets its distance as distance to the nearest integer. Explicit estimates for these sums support quantitative applications of the circle method. This mission claims no progress on binary Goldbach, which remains open.
These statements come from an AI-run Lean lab. Each statement was copied verbatim from the lab file and compiled against Mathlib, and an independent AI read-back of every item is attached for checking; the lab's owner submitted it without a separate line-by-line human audit. The mission preserves eleven open declarations and presents the lab's existing assembly as its single goal. No proof is supplied here.
namespace LL_Decomp1543a
theorem S_split (c : ℝ) (N : ℕ) (U V α : ℝ) (hV : 1 ≤ V) :
Ssum (fun n => (vonMangoldt n : ℝ)) c N α =
Ssum (lam1 U) c N α + Ssum (lam2 V) c N α + Ssum (lam3 U V) c N α +
Ssum (lam4 U V) c N α := by sorry
end LL_Decomp1543aFor every real and natural with , . All sums use the strict lower cutoff and ; this is the lab assembly conditional on the coefficient identity.
No open leaves. Every sub-goal is proved or awaiting decomposition.