Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cauchy bound for a Möbius-weighted sum

Proved
LL_Decomp1543a.block_cauchy

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

number-theory

For every finite T⊂NT\subset\mathbb NT⊂N and function z:N→Cz:\mathbb N\to\mathbb Cz:N→C, ∣∑t∈Tμ(t)z(t)∣≤∑t∈T∣μ(t)∣∑t∈T∣z(t)∣2\left|\sum_{t\in T}\mu(t)z(t)\right|\le\sqrt{\sum_{t\in T}|\mu(t)|}\sqrt{\sum_{t\in T}|z(t)|^2}​∑t∈T​μ(t)z(t)​≤∑t∈T​∣μ(t)∣​∑t∈T​∣z(t)∣2​.

Preamble
import Mathlib

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543a
theorem block_cauchy (T : Finset ℕ) (z : ℕ → ℂ) :
    ‖∑ t ∈ T, (moebius t : ℂ) * z t‖ ≤
      √(∑ t ∈ T, |(moebius t : ℝ)|) * √(∑ t ∈ T, ‖z t‖ ^ 2) := 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, p. 170, equation 6.11. https://doi.org/10.4064/aa105-2-3
Read-back

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

For a finite set T⊆NT \subseteq \mathbb{N}T⊆N and any function z:N→Cz : \mathbb{N} \to \mathbb{C}z:N→C, with no restriction on its values, the statement asserts:

∣∑t∈Tμ(t) z(t)∣≤∑t∈T∣μ(t)∣⋅∑t∈T∣z(t)∣2\Big|\sum_{t \in T} \mu(t)\, z(t)\Big| \le \sqrt{\sum_{t \in T} |\mu(t)|}\cdot \sqrt{\sum_{t \in T} |z(t)|^2}​t∈T∑​μ(t)z(t)​≤t∈T∑​∣μ(t)∣​⋅t∈T∑​∣z(t)∣2​

Here μ\muμ is the Möbius function, with integer values cast into C\mathbb{C}C on the left and into R\mathbb{R}R inside the first square root. ∣⋅∣|\cdot|∣⋅∣ on the left is the complex modulus, and ⋅\sqrt{\cdot}⋅​ is the nonnegative real square root, so no junk values arise. The only hypothesis is that TTT is finite. The function zzz is arbitrary, and z(t)z(t)z(t) for t∉Tt \notin Tt∈/T plays no role. Terms with μ(t)=0\mu(t) = 0μ(t)=0, including t=0t = 0t=0 and every non-squarefree ttt, contribute nothing to the sums. If T=∅T = \emptysetT=∅, both sides equal 000. No hypothesis is vacuous or unsatisfiable.

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