Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sum of reciprocal square roots of dyadic scales

Proved
LL_Decomp1543a.dyadic_invsqrt_sum

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

number-theory

For every positive real VVV and natural JJJ, ∑0≤j<J1/2jV≤(2+2)/V\sum_{0\le j<J}1/\sqrt{2^jV}\le(2+\sqrt2)/\sqrt V∑0≤j<J​1/2jV​≤(2+2​)/V​. The sum is empty when J=0J=0J=0.

Preamble
import Mathlib

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

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

For every real number VVV with 0<V0 < V0<V and every natural number JJJ, including J=0J = 0J=0, the following holds. Let jjj range over {0,1,…,J−1}\{0, 1, \ldots, J-1\}{0,1,…,J−1}, which is the empty set when J=0J = 0J=0. The left side is the finite sum

∑j=0J−112jV,\sum_{j=0}^{J-1} \frac{1}{\sqrt{2^j V}},j=0∑J−1​2jV​1​,

where 2j2^j2j is the real number two raised to the natural power jjj, and ⋅\sqrt{\cdot}⋅​ is the nonnegative real square root. The assertion is that this sum is at most

2+2V.\frac{2+\sqrt{2}}{\sqrt{V}}.V​2+2​​.

Since V>0V > 0V>0, every radicand is positive and every denominator is nonzero, so no division by zero or truncated subtraction occurs. The only hypothesis is 0<V0 < V0<V, which is satisfiable. For J=0J = 0J=0 the sum equals 000, and the right side is positive, so the bound holds. The bound does not depend on JJJ.

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