Primorial bound for
ProvedLL_Decomp551a.primorial_c5_lower_firstFor every natural number with , the primorial satisfies . Equivalently, on this range, where .
import Mathlib
namespace LL_Decomp551a
theorem primorial_c5_lower_first (n : ℕ) (hn : 16000000 < n) (hn' : n ≤ 20000000) :
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_first
Source. The file imports Mathlib and declares the theorem primorial_c5_lower_first inside the namespace LL_Decomp551a. There are no other definitions, hypotheses, or typeclass assumptions in the file.
Binders. The theorem takes one binder and two hypotheses:
- , a natural number.
hn : 16000000 < n, that is , a strict lower bound.hn' : n ≤ 20000000, that is , an upper bound.
Together the hypotheses say is an integer with . Both bounds are inclusive or exclusive exactly as written. The lower bound excludes itself.
Conclusion. For every such :
Here is Mathlib's Nat.primorial, defined as the product of all primes with . In standard notation it is written , so the claim reads . The statement is over the natural numbers, with no division and no real-number approximation, so the inequality is exact.
Equivalently, since , the claim is for each in the range.
Proof status. The body is by sorry. The statement is unproved in this file. Nothing in the file establishes it.
Concerns for the human auditor.
- Not vacuous. The hypotheses are satisfiable (for example ), so the statement is not true merely because its premises are impossible.
- Not trivially true. Primorials grow roughly like (by the prime number theorem, ), and is just below . The margin per unit of is only about , so the inequality is a tight, quantitative bound near the edge of what is true. It is not a crude estimate.
- Only a finite window. The claim covers in and says nothing for other . A reader who expects a bound "for all large " should note that this is a bounded-range statement.
- Edge values. Because the range excludes small , the usual edge cases (, , and the total-function behaviour of
primorial) do not arise. - Naming. The name
primorial_c5_lower_firstsuggests a "lower first" step of a larger decomposition. The file gives no information about how this lemma is used, and this read-back does not rely on any such intent.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.