Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Absorbing S1S_1S1​ into the middle term

Proved
LL_Decomp1543c.S1_absorb

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

number-theory

For natural NNN with log⁡N≥3100\log N\ge3100logN≥3100 and U=N2/5(log⁡N)−4/5U=N^{2/5}(\log N)^{-4/5}U=N2/5(logN)−4/5, one has 1.02 U≤0.38 N4/5(log⁡N)1.41.02\,U\le0.38\,N^{4/5}(\log N)^{1.4}1.02U≤0.38N4/5(logN)1.4.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543c_Uf

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem S1_absorb (N : ℕ) (hL : 3100 ≤ Real.log N) :
    1.02 * Uf N ≤ 0.38 * (N : ℝ) ^ ((4 : ℝ) / 5) * Real.log N ^ (1.4 : ℝ) := by sorry
end LL_Decomp1543c
Source
M. C. Liu and T. Z. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105, 2002, p. 168, absorption of S1 in the middle term of (6.2). https://doi.org/10.4064/aa105-2-3
Read-back

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

For every natural number NNN with log⁡N≥3100\log N \ge 3100logN≥3100, where log⁡\loglog is the real natural logarithm applied to NNN cast to a real number, the statement asserts

1.02⋅Uf(N)≤0.38⋅N4/5⋅(log⁡N)1.4.1.02 \cdot U_f(N) \le 0.38 \cdot N^{4/5} \cdot (\log N)^{1.4}.1.02⋅Uf​(N)≤0.38⋅N4/5⋅(logN)1.4.

The numerals are exact reals, 1.02=51/501.02 = 51/501.02=51/50 and 0.38=19/500.38 = 19/500.38=19/50, and both powers are real powers with real exponents 4/54/54/5 and 1.41.41.4. The hypothesis log⁡N≥3100\log N \ge 3100logN≥3100 gives N≥e3100N \ge e^{3100}N≥e3100, so N=0N = 0N=0 and N=1N = 1N=1 are excluded, both bases are positive, and no junk values from division or natural subtraction arise. The hypothesis is satisfiable. Uf(N)U_f(N)Uf​(N) is a real-valued function of NNN from an imported module, and this text says nothing further about it. Rewritten, the conclusion is Uf(N)≤1951N4/5(log⁡N)1.4U_f(N) \le \frac{19}{51} N^{4/5} (\log N)^{1.4}Uf​(N)≤5119​N4/5(logN)1.4, a one-sided upper bound only. The proof is sorry, so the declaration is unproven.

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