PNT error for the Dickman Abel weight
ProvedErdos390.Full.FriableAsymptotic.dickmanWeight_pnt_boundanalytic-number-theoryerdos-390erdos390-source-construction
Let , , and with be integers except for . Suppose for every integer , where is the prime logarithmic sum, and throughout . Set . Let be the discrete Abel main term.
This supplies the quantitative prime-sum replacement in the friable-number recurrence.
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
Formal statement
theorem Erdos390.Full.FriableAsymptotic.dickmanWeight_pnt_bound :
∀ (X : Nat),
LE.le.{0} (1 : Nat) X →
∀ {C : Real},
LE.le.{0} (0 : Real) C →
∀ {X₀ z y : Nat},
(∀ (T : Nat),
LE.le.{0} X₀ T →
LE.le.{0} (abs.{0} (HSub.hSub.{0, 0, 0} (Erdos390.Full.FriableAsymptotic.primeLogSumUpTo T) ↑T))
(HMul.hMul.{0, 0, 0} C (HDiv.hDiv.{0, 0, 0} (↑T) (HPow.hPow.{0, 0, 0} (Real.log ↑T) (3 : Real))))) →
LE.le.{0} X₀ z →
LE.le.{0} (2 : Nat) z →
LT.lt.{0} z y →
(∀ (t : Real),
Membership.mem.{0, 0} (Set.Icc.{0} ↑z ↑y) t →
And (LE.le.{0} (1 : Real) (Erdos390.Full.FriableAsymptotic.logRatio (↑X) t))
(LE.le.{0} (Erdos390.Full.FriableAsymptotic.logRatio (↑X) t) (6 : Real))) →
LE.le.{0}
(abs.{0}
(HSub.hSub.{0, 0, 0}
(Erdos390.Full.FriableAsymptotic.primeThetaWeightedInterval
(Erdos390.Full.FriableAsymptotic.dickmanThetaWeight X) z y)
(Erdos390.Full.FriableAsymptotic.integerAbelMain
(Erdos390.Full.FriableAsymptotic.dickmanThetaWeight X) z y)))
(HDiv.hDiv.{0, 0, 0} (HMul.hMul.{0, 0, 0} (HMul.hMul.{0, 0, 0} (500 : Real) C) ↑X) (Real.log ↑z)) := by sorry
Source