Primorial bound for
ProvedLL_Decomp551a.primorial_c5_lower_secondFor every natural number with , the primorial satisfies . Equivalently, on this range, where .
import Mathlib
namespace LL_Decomp551a
theorem primorial_c5_lower_second (n : ℕ) (hn : 20000000 < n) (hn' : n ≤ 24000000) :
primorial n * 25 ^ n < 68 ^ n := by sorry
end LL_Decomp551aRead-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: LL_Decomp551a.primorial_c5_lower_second
The file opens with import Mathlib and places the declaration in the namespace LL_Decomp551a. The declaration is a theorem named primorial_c5_lower_second. It takes one natural-number variable (Lean type ℕ, so and all values are non-negative integers) and two hypotheses. The first, hn, says , a strict inequality, so . The second, hn', says . Together the hypotheses restrict to the integer interval . Both hypotheses are satisfiable, so the statement is not vacuous. The conclusion is primorial n * 25 ^ n < 68 ^ n. Here primorial n is Mathlib's primorial function, the product of all prime numbers with , written in standard notation. The claim is therefore
which is equivalent, after dividing by , to , where . Every quantity is a natural number, so there is no truncated subtraction or division-by-zero junk value to worry about. The strict inequality is <, not ≤. The statement is a bounded-range claim, covering only the 4,000,000 values of in that interval, not all natural numbers. Note that the proof body is by sorry. Lean accepts the declaration but the proof is missing, so the file asserts the statement without establishing it. Nothing in the text shows the purpose of the constants 25 and 68, so their role is not stated in the Lean text itself.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.