Reciprocal least-common-multiple bound for a forced prime-power row
ProvedErdos390.Full.PrimePowerTaylorLedger.sum_positiveExponents_primePowerModuli_inv_lcm_leanalytic-number-theoryerdos-390erdos390-source-construction
Let be a finite set of primes, , and . Put , and let denote the source-defined positive prime-power least-common-multiple constant. Then
The estimate retains the reciprocal scale of the distinguished prime when summing an entire prime-power score.
Preamble
import Mathlib import Definitions.Def_erdos390_source_bank_interface import Definitions.Def_erdos390_dickman_step_function import Theorems.Thm_MediumPNT import Definitions.Def_erdos390_analytic_foundations_001 import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_product_bound import Theorems.Thm_Erdos390_Full_DickmanBasic_rho_pos_on_zero_five import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_secondDerivative_first_bound import Definitions.Def_erdos390_analytic_foundations_002 import Definitions.Def_erdos390_analytic_foundations_005
Formal statement
theorem Erdos390.Full.PrimePowerTaylorLedger.sum_positiveExponents_primePowerModuli_inv_lcm_le :
∀ (P : Finset.{0} Nat) (M p : Nat),
Membership.mem.{0, 0} P p →
(∀ (q : Nat), Membership.mem.{0, 0} P q → Nat.Prime q) →
LE.le.{0}
(∑ r ∈ Erdos390.Full.ArithmeticModel.positiveExponents M,
∑ a ∈ Erdos390.Full.ValuationScoreDomination.primePowerModuli P M,
HDiv.hDiv.{0, 0, 0} (1 : Real) ↑(Nat.lcm (HPow.hPow.{0, 0, 0} p r) a))
(HDiv.hDiv.{0, 0, 0}
(HAdd.hAdd.{0, 0, 0} (HMul.hMul.{0, 0, 0} (4 : Real) (∑ q ∈ P, HDiv.hDiv.{0, 0, 0} (1 : Real) ↑q))
Erdos390.Full.PrimePowerTaylorLedger.positivePrimePowerLcmConstant)
↑p) := by sorry
Source