Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Third Vaughan coefficient

Definition
LL_Decomp1543a_lam3

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

For real U,VU,VU,V and natural nnn, define Λ3(U,V,n)=−∑r∣n∑t∣n, r≤U, t≤V, rt∣nΛ(r)μ(t)\Lambda_3(U,V,n)=-\sum_{r\mid n}\sum_{t\mid n,\ r\le U,\ t\le V,\ rt\mid n}\Lambda(r)\mu(t)Λ3​(U,V,n)=−∑r∣n​∑t∣n, r≤U, t≤V, rt∣n​Λ(r)μ(t), with empty divisor sums at n=0n=0n=0.

Definition code
import Mathlib

open Real Finset ArithmeticFunction

namespace LL_Decomp1543a
noncomputable def lam3 (U V : ℝ) (n : ℕ) : ℝ :=
  -∑ r ∈ n.divisors, ∑ t ∈ n.divisors,
    if (r : ℝ) ≤ U ∧ (t : ℝ) ≤ V ∧ r * t ∣ n then vonMangoldt r * (moebius t : ℝ) else 0
end LL_Decomp1543a
Read-back

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

The item defines a real-valued function λ3(U,V,n)\lambda_3(U,V,n)λ3​(U,V,n) for real numbers U,VU,VU,V and a natural number nnn. It equals

λ3(U,V,n)=−∑r∣n∑t∣nT(r,t),\lambda_3(U,V,n) = -\sum_{r\mid n}\sum_{t\mid n} T(r,t),λ3​(U,V,n)=−r∣n∑​t∣n∑​T(r,t),

where rrr and ttt range over the divisors of nnn in N\mathbb{N}N. Here T(r,t)=Λ(r) μ(t)T(r,t)=\Lambda(r)\,\mu(t)T(r,t)=Λ(r)μ(t) if r≤Ur\le Ur≤U, t≤Vt\le Vt≤V and rt∣nrt\mid nrt∣n, and T(r,t)=0T(r,t)=0T(r,t)=0 otherwise. Λ\LambdaΛ is the von Mangoldt function and μ\muμ the Möbius function, with μ(t)\mu(t)μ(t) cast to R\mathbb{R}R. The natural numbers r,tr,tr,t are cast to R\mathbb{R}R for the comparisons with U,VU,VU,V. No hypotheses are imposed on UUU, VVV or nnn. Edge cases: for n=0n=0n=0 the divisor set is empty, so λ3(U,V,0)=0\lambda_3(U,V,0)=0λ3​(U,V,0)=0. If U<1U<1U<1 or V<1V<1V<1, the corresponding condition fails for every divisor, so the value is 000. Since Λ(1)=0\Lambda(1)=0Λ(1)=0, and μ(t)=0\mu(t)=0μ(t)=0 unless ttt is squarefree, many terms vanish. The definition is total and nothing is vacuous.

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