Cauchy bound for a Möbius-weighted sum
ProvedLL_Decomp1543a.block_cauchynumber-theory
For every finite and function , .
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_Decomp1543aSource
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 and any function , with no restriction on its values, the statement asserts:
Here is the Möbius function, with integer values cast into on the left and into inside the first square root. on the left is the complex modulus, and is the nonnegative real square root, so no junk values arise. The only hypothesis is that is finite. The function is arbitrary, and for plays no role. Terms with , including and every non-squarefree , contribute nothing to the sums. If , both sides equal . No hypothesis is vacuous or unsatisfiable.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.