Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Psi lower bound at even natural arguments

Proved
LL_Decomp1528c.psi_two_mul_ge

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

number-theory

For every natural number n≥1n\ge1n≥1, ψ(2n)≥nlog⁡4−log⁡(2n+1)\psi(2n)\ge n\log4-\log(2n+1)ψ(2n)≥nlog4−log(2n+1).

Preamble
import Mathlib

open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528c
theorem psi_two_mul_ge (n : ℕ) (hn : 1 ≤ n) :
    (n : ℝ) * log 4 - log (2 * n + 1) ≤ ψ (2 * n) := by sorry
end LL_Decomp1528c
Source
Lab unit U-1528, classical Chebyshev bounds; source context: P. J. Campbell 2026, https://arxiv.org/abs/2608.09488v1. Chebyshev 1852; Hardy and Wright, Theorem 414 proof, as cited in the lab.
Read-back

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

For every natural number nnn with 1≤n1 \le n1≤n, the statement asserts nlog⁡4−log⁡(2n+1)≤ψ(2n)n \log 4 - \log(2n+1) \le \psi(2n)nlog4−log(2n+1)≤ψ(2n). Here nnn is cast to a real number, log⁡\loglog is the real natural logarithm, and ψ(x)=∑m≤⌊x⌋Λ(m)\psi(x) = \sum_{m \le \lfloor x \rfloor} \Lambda(m)ψ(x)=∑m≤⌊x⌋​Λ(m) is the Chebyshev function, with Λ\LambdaΛ the von Mangoldt function, so ψ(2n)\psi(2n)ψ(2n) sums Λ(m)\Lambda(m)Λ(m) over 1≤m≤2n1 \le m \le 2n1≤m≤2n. The only hypothesis is 1≤n1 \le n1≤n. Because n≥1n \ge 1n≥1, 2n+1≥32n+1 \ge 32n+1≥3 is positive, so no junk value such as log⁡0=0\log 0 = 0log0=0 is reached. The statement is not vacuous: n=1n = 1n=1 gives log⁡4−log⁡3≤ψ(2)=log⁡2\log 4 - \log 3 \le \psi(2) = \log 2log4−log3≤ψ(2)=log2.

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