Prime-power parts of a least common multiple sum to at most the sum of the set
ProvedLandauExplore.primePow_lcm_sum_lelandau-functionnumber-theorypermutations
For any finite set of positive natural numbers, the sum of the prime-power parts of their least common multiple is at most the sum of the elements of . That is, if is the least common multiple of , then , where is the exponent of the prime in . Replacing a family of integers by the prime powers dividing their least common multiple therefore does not increase the total sum. This is the arithmetic core of the prime-power characterization of permutation orders used in the analysis of Landau's function.
Preamble
import Mathlib.Data.Nat.Factorization.Basic import Mathlib.Algebra.GCDMonoid.FinsetLemmas import Mathlib.RingTheory.Coprime.Lemmas import Mathlib.GroupTheory.Perm.Cycle.Type import Mathlib.GroupTheory.Perm.Cycle.PossibleTypes open Finset
Formal statement
namespace LandauExplore theorem primePow_lcm_sum_le (s : Finset ℕ) (hs : ∀ a ∈ s, a ≠ 0) : ∑ p ∈ (s.lcm id).primeFactors, p ^ (s.lcm id).factorization p ≤ ∑ a ∈ s, a := by sorry end LandauExplore
Source
Newly formalized lemma for the Landau-function route (prime-power maximiser step); classical background in Deléglise–Nicolas, 'The Landau function and the Riemann hypothesis', arXiv:1907.07664
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.