Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sum of square roots of dyadic scales

Proved
LL_Decomp1543a.dyadic_sqrt_sum

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

number-theory

For natural NNN, positive real U,VU,VU,V and natural J≥1J\ge1J≥1 satisfying 2J−1V≤N/U2^{J-1}V\le N/U2J−1V≤N/U, ∑0≤j<J2jV≤(2+2)N/U\sum_{0\le j<J}\sqrt{2^jV}\le(2+\sqrt2)\sqrt{N/U}∑0≤j<J​2jV​≤(2+2​)N/U​.

Preamble
import Mathlib

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543a
theorem dyadic_sqrt_sum (N : ℕ) (U V : ℝ) (hU : 0 < U) (hV : 0 < V) (J : ℕ) (hJ : 1 ≤ J)
    (hJV : 2 ^ (J - 1) * V ≤ N / U) :
    ∑ j ∈ range J, √(2 ^ j * V) ≤ (2 + √2) * √(N / U) := 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. 174, first line. https://doi.org/10.4064/aa105-2-3
Read-back

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

For natural NNN, natural J≥1J \ge 1J≥1, and reals U>0U > 0U>0, V>0V > 0V>0, assume 2J−1V≤N/U2^{J-1} V \le N/U2J−1V≤N/U. Here J−1J-1J−1 is a natural number, harmless since J≥1J \ge 1J≥1, and N/UN/UN/U is real division with NNN cast to R\mathbb{R}R, harmless since U>0U > 0U>0. The conclusion is

∑j=0J−12jV≤(2+2) N/U\sum_{j=0}^{J-1} \sqrt{2^j V} \le (2+\sqrt{2})\,\sqrt{N/U}j=0∑J−1​2jV​≤(2+2​)N/U​

where 2j2^j2j is a real power of 222 and ⋅\sqrt{\cdot}⋅​ is the real square root. All square-root arguments are nonnegative, so no junk values arise. The case N=0N=0N=0 is excluded by the hypothesis, since then 2J−1V≤02^{J-1} V \le 02J−1V≤0 contradicts V>0V>0V>0. The hypothesis is satisfiable for large NNN, so the statement is not vacuous. The file contains no proof, only sorry.

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