Formalism/SharpRestriction/RamificationFrobenius/TotientGaloisClasses/TopWin.lean
101theorem TiedAll.tiedEvOf {Λ : Level} (h : TiedAll @core @Tied Λ) : ChebyshevInequalityEventual @core @Tied Λ := by102obtain ⟨eD, eL, ε₁, h1, h⟩ := h103refine ⟨eD, eL, ε₁, h1, fun eps a b => ?_⟩104obtain ⟨Fm, c, ⟨y, d⟩, K, cHH, eK, CL, x0, e⟩ := h eps a b105exact ⟨Fm, c, K, cHH, eK, CL, max y x0, fun x hx => e x (le_of_max_le_right hx) (d x (le_of_max_le_left hx))⟩106107theorem ChebyshevInequalityOnWindows.chebyshevInequality_of_windowed {Λ : Level} (h : ChebyshevInequalityOnWindows @core @Tied Λ)108(hT : ∀ {eps : ℝ} (Fm : Fam eps), ∃ y : ℝ, ∀ x ≥ y, ∀ eD eL K cHH eK CL : ℝ, Tied Fm eD eL K cHH eK CL x → x ∈ (core Fm).Win) :109ChebyshevInequalityForFamily @core @Tied Λ := by110rintro eD eL eps he Fm hE ⟨K, cHH, eK, CL, x0, hx⟩111obtain ⟨y, hy⟩ := hT Fm112obtain ⟨x1, h1⟩ := h eD eL eps he Fm hE ⟨K, cHH, eK, CL, x0, fun x a _ => hx x a⟩113refine ⟨max x1 (max x0 y), fun x a => h1 x (le_of_max_le_left a) ?_⟩114have b := le_of_max_le_right a115exact hy x (le_of_max_le_right b) _ _ _ _ _ _ (hx x (le_of_max_le_left b))116117theorem level_of_tiedAll {Λ : Level} (h112 : ChebyshevInequalityOnWindows @core @Tied Λ) (h : TiedAll @core @Tied Λ) : Λ.ZeroFreeLevel := by118obtain ⟨eD, eL, ε₁, h1, h⟩ := h119intro ψ hψ s hs120have hm1 : min (s.re - 1 / 2) (1 / 2) ≤ s.re - 1 / 2 := min_le_left _ _121have hm2 : min (s.re - 1 / 2) (1 / 2) ≤ 1 / 2 := min_le_right _ _122have hm0 : 0 < min (s.re - 1 / 2) (1 / 2) := lt_min (by linarith) (by norm_num)123obtain ⟨ε, hε0, hεlt, hCe⟩ := exists_small_eps (eD + eL + 7) (half_pos hm0) h1124obtain ⟨Fm, hE, ⟨y0, hW⟩, hT⟩ := h ε hε0 hεlt125obtain ⟨x1, hx⟩ := h112 eD eL ε hε0 Fm hE hT126refine Landau.zero_free_of_Chebyshev_growth Λ (1 / 2 + min (s.re - 1 / 2) (1 / 2) / 2) (by linarith) (by linarith) (max (max x1 y0) 1)127(fun y hy => ?_) ψ hψ s (by linarith)128have a := le_of_max_le_left hy129exact (hx y (le_of_max_le_left a) (hW y (le_of_max_le_right a))).trans130(Real.rpow_le_rpow_of_exponent_le (le_of_max_le_right hy) (by linarith))131132theorem zeroFreeOn_of_tiedAll {Q : PChar → Prop} (h112 : ∀ ψ, Q ψ → ChebyshevInequalityOnWindows @core @Tied (Level.cyc ψ))133(h : ∀ ψ, Q ψ → TiedAll @core @Tied (Level.cyc ψ)) : ZeroFreeOn Q :=134zeroFreeOn_of_cyc fun ψ hψ => level_of_tiedAll (h112 ψ hψ) (h ψ hψ)135136end137138end Formalism.HC139140end