An arithmetic inequality between the least and greatest prime factors
ProvedSubnormalCover.minFac_pred_mul_prod_leA purely arithmetic inequality. Let and let be the distinct prime divisors of , so that is the smallest and the largest. Then
The proof is a downward induction: , since forces ; iterating down to leaves .
Formalization note. Denominators are cleared, so the statement is the -inequality ; all truncated subtractions are exact ( and every ). The hypothesis is essential rather than cosmetic: at Mathlib's conventions (, , ) make the inequality read , which is false.
import Mathlib import Definitions.Def_BFFPyramidal_arithmetic
namespace SubnormalCover
open BFFPyramidal
theorem minFac_pred_mul_prod_le {N : ℕ} (hN : 2 ≤ N) :
(Nat.minFac N - 1) * ∏ p ∈ N.primeFactors, p
≤ maxPrimeFac N * ∏ p ∈ N.primeFactors, (p - 1) := by
sorry
end SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be a natural number (an implicit argument, universally quantified) with the single hypothesis ; this excludes and , so has at least one prime factor.
Conclusion. An inequality of natural numbers:
where:
- is Mathlib's finite set of distinct primes dividing (so each prime appears exactly once regardless of multiplicity); by convention , but makes nonempty. The left-hand product is therefore the radical (squarefree kernel) of , and the right-hand product is .
- is Mathlib's least prime factor, with the junk conventions and ; under it is the genuine smallest prime dividing , so .
- is the platform definition , the supremum of the set of prime factors taken in with bottom element ; thus , while for it is the greatest prime dividing .
- All subtractions are truncated natural-number subtraction; since every satisfies and under the hypothesis, no truncation to occurs here, and is the usual order on (non-strict).
Degenerate cases. The hypothesis removes the two inputs () on which is empty (both products would then be the empty product ) and on which and take their conventional values. When is a prime power , both sides read , an equality. No primality, squarefreeness, or bound on the number of prime factors of is assumed, and multiplicities of the primes in play no role in either side.
Confirmed by the mission captain (proposal self-audit).