Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fourth Vaughan coefficient

Definition
LL_Decomp1543a_lam4

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

For real U,VU,VU,V and natural nnn, define Λ4(U,V,n)=∑t∣n, V<tμ(t)an/t(U)\Lambda_4(U,V,n)=\sum_{t\mid n,\ V<t}\mu(t)a_{n/t}(U)Λ4​(U,V,n)=∑t∣n, V<t​μ(t)an/t​(U), using natural-number division and an empty divisor sum at n=0n=0n=0.

Definition code
import Mathlib
import Definitions.Def_LL_Decomp1543a_am

open Real Finset ArithmeticFunction

namespace LL_Decomp1543a
noncomputable def lam4 (U V : ℝ) (n : ℕ) : ℝ :=
  ∑ t ∈ n.divisors.filter (fun t : ℕ => V < (t : ℝ)), (moebius t : ℝ) * am U (n / t)
end LL_Decomp1543a
Read-back

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

For n∈Nn \in \mathbb{N}n∈N and U,V∈RU, V \in \mathbb{R}U,V∈R, λ4(U,V,n)\lambda_4(U,V,n)λ4​(U,V,n) is the real number

λ4(U,V,n)=∑t∣nV<tμ(t) aU ⁣(nt),\lambda_4(U,V,n)=\sum_{\substack{t \mid n \\ V<t}} \mu(t)\, a_U\!\left(\tfrac{n}{t}\right),λ4​(U,V,n)=t∣nV<t​∑​μ(t)aU​(tn​),

summed over the positive divisors ttt of nnn with V<tV<tV<t, where V<tV<tV<t is compared in R\mathbb{R}R. Here μ\muμ is the Möbius function, integer valued and read as a real, so μ(t)∈{−1,0,1}\mu(t)\in\{-1,0,1\}μ(t)∈{−1,0,1} and μ(t)=0\mu(t)=0μ(t)=0 when ttt is not squarefree. The quotient n/tn/tn/t is exact natural number division because t∣nt\mid nt∣n. The term aU(m)a_U(m)aU​(m) stands for am(U,m)\mathrm{am}(U,m)am(U,m) from the imported definition, which is not unfolded here.

There are no hypotheses, so the definition is total. If n=0n=0n=0, the divisor set is empty and λ4(U,V,n)=0\lambda_4(U,V,n)=0λ4​(U,V,n)=0. If V≥nV\ge nV≥n, no divisor qualifies and λ4(U,V,n)=0\lambda_4(U,V,n)=0λ4​(U,V,n)=0. If V<1V<1V<1, every positive divisor of nnn is included. No sign or size condition is imposed on UUU or VVV.

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