Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coefficientwise Vaughan identity

Proved
LL_Decomp1543a.vaughan_coeff

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

number-theory

For every real U,VU,VU,V with V≥1V\ge1V≥1 and natural n≥1n\ge1n≥1, Λ(n)=Λ1(U,n)+Λ2(V,n)+Λ3(U,V,n)+Λ4(U,V,n)\Lambda(n)=\Lambda_1(U,n)+\Lambda_2(V,n)+\Lambda_3(U,V,n)+\Lambda_4(U,V,n)Λ(n)=Λ1​(U,n)+Λ2​(V,n)+Λ3​(U,V,n)+Λ4​(U,V,n). No lower bound on UUU is assumed.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543a_lam1
import Definitions.Def_LL_Decomp1543a_lam2
import Definitions.Def_LL_Decomp1543a_lam3
import Definitions.Def_LL_Decomp1543a_am
import Definitions.Def_LL_Decomp1543a_lam4

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543a
theorem vaughan_coeff (U V : ℝ) (hV : 1 ≤ V) (n : ℕ) (hn : 1 ≤ n) :
    (vonMangoldt n : ℝ) = lam1 U n + lam2 V n + lam3 U V n + lam4 U V n := by sorry
end LL_Decomp1543a
Source
M. C. Liu and T. Z. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105, 2002, pp. 168 to 169, equations 6.7 and 6.8. https://doi.org/10.4064/aa105-2-3
Read-back

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

Let U,V∈RU, V \in \mathbb{R}U,V∈R and n∈Nn \in \mathbb{N}n∈N, with hypotheses 1≤V1 \le V1≤V and 1≤n1 \le n1≤n. The statement asserts

Λ(n)=λ1(U,n)+λ2(V,n)+λ3(U,V,n)+λ4(U,V,n),\Lambda(n) = \lambda_1(U, n) + \lambda_2(V, n) + \lambda_3(U, V, n) + \lambda_4(U, V, n),Λ(n)=λ1​(U,n)+λ2​(V,n)+λ3​(U,V,n)+λ4​(U,V,n),

where Λ\LambdaΛ is the von Mangoldt function, already real-valued, so the cast is redundant. Here Λ(m)=log⁡p\Lambda(m) = \log pΛ(m)=logp if m=pkm = p^km=pk for a prime ppp and k≥1k \ge 1k≥1, and Λ(m)=0\Lambda(m) = 0Λ(m)=0 otherwise, so Λ(1)=0\Lambda(1) = 0Λ(1)=0.

The functions λ1,…,λ4\lambda_1, \dots, \lambda_4λ1​,…,λ4​ are defined in other items, and this text does not show their values. UUU is unrestricted, including U≤0U \le 0U≤0. VVV is constrained only by V≥1V \ge 1V≥1. The hypothesis n≥1n \ge 1n≥1 excludes n=0n = 0n=0. The imported module am\mathrm{am}am is not used. The proof is sorry, so the identity is asserted but not proved in this item.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 29, 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