Uniform lower bound for ordinary eligible markers
ProvedErdos390.WholePaper.exists_eventually_bankOrdinary_markerCount_loweranalytic-number-theoryerdos-390erdos390-source-construction
For every there exists such that, for all sufficiently large and every rational , the number of eligible markers for the ordinary relation between and its upper endpoint at tail parameter obeys
This converts donor occurrences into a count of distinct usable markers.
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_006
Formal statement
theorem Erdos390.WholePaper.exists_eventually_bankOrdinary_markerCount_lower :
∀ {c : Real},
LT.lt.{0} (0 : Real) c →
∃ rho,
And (LT.lt.{0} (0 : Real) rho)
(∀ᶠ (n : Nat) in Filter.atTop.{0},
∀ (Q : Rat),
LT.lt.{0} (20 : Rat) Q →
LE.le.{0} Q ↑(Erdos390.Full.ArithmeticModel.yNat n) →
LE.le.{0}
(HDiv.hDiv.{0, 0, 0} (HMul.hMul.{0, 0, 0} rho (Erdos390.WholePaper.secondOrderScale n))
(Max.max.{0} (↑Q) (Real.log ↑n)))
↑(Erdos390.WholePaper.bankEligibleMarkerCount.{0, 0}
(Erdos390.WholePaper.bankOrdinaryEligibleRelation n
(Erdos390.WholePaper.upperEndpoint n (Erdos390.WholePaper.upperTailLength c n)) Q))) := by sorry
Source