Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

theta cert log 4

Proved
TaoFivePrimes.theta_cert_log_4

by andreaskapfer · 1 vote · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorychebyshev-thetanumber-theorynumerical-certificate

Logarithmic table, fourth chunk: for every prime ppp in the fourth block of primes ≤1420\le 1420≤1420, ⌊104log⁡p⌋<104log⁡p\lfloor 10^4 \log p\rfloor < 10^4 \log p⌊104logp⌋<104logp.

Same certified exponential-bound argument as the first chunk, for the 58 primes of the fourth chunk (the largest primes near 1400).

Preamble
import Mathlib.NumberTheory.Chebyshev
import Mathlib.Analysis.Complex.ExponentialBounds
import Mathlib.Tactic
import Definitions.Def_TaoFivePrimes_theta_cert_tables
Formal statement
namespace TaoFivePrimes
theorem theta_cert_log_4 (p : ℕ) (hp : p ∈ plist4) : ((clbZ p : ℕ) : ℝ) < Real.log p * 10 ^ 4 := by sorry
Source
J.B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94; p. 82, Theorem 19 (finite window), used in the '288' chain of the Lemma 15 proof, p. 89. https://doi.org/10.1215/ijm/1255631807

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