Primorial bound for
ProvedLL_Decomp551a.primorial_c5_upper_firstFor every natural number with , the primorial satisfies . Equivalently, on this range, where .
import Mathlib
namespace LL_Decomp551a
theorem primorial_c5_upper_first (n : ℕ) (hn : 24000000 < n) (hn' : n ≤ 28000000) :
primorial n * 25 ^ n < 68 ^ n := by sorry
end LL_Decomp551aRead-back
What the Lean code literally says, in plain math · claude-haiku
Declaration: LL_Decomp551a.primorial_c5_upper_first, a theorem (proved by sorry, so no proof is given).
The file imports Mathlib and places the theorem in the namespace LL_Decomp551a.
The theorem takes one natural number and two hypotheses:
Together these say is an integer with . The lower bound is strict and the upper bound is non-strict, so is allowed and is not. No other binders or typeclass assumptions are present.
The conclusion is the single inequality, in :
Here is Mathlib's primorial n, which is the product of all primes with . The symbol is raised to the power , and is raised to the power . The inequality is strict. The statement is universally quantified over only, so it claims the inequality holds for every in the stated range, with no existential part.
Concerns for the human auditor. (1) The hypotheses are satisfiable (for example ), so the theorem is not vacuous. Because all quantities are natural numbers, there is no truncated-subtraction or division junk value to worry about. (2) The statement is not trivial: taking logarithms, it is equivalent to , where is the Chebyshev function, so the margin is very small and the content is a sharp analytic estimate on primes in this window. I have not checked whether the claim is true for all in the range, and the formal text currently proves nothing because the proof is sorry. (3) I have no information about the author's intended statement, and I do not judge whether this is the formalization they meant. The name suffix "c5_upper_first" suggests a specific constant or bound, but the Lean text alone does not show what it refers to.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.