Development/AutomorphicArithmetic/PrimitiveCosets/WindowInequalityOfArtinInputs.lean
1import Development.AutomorphicArithmetic.PrimitiveCosets.CoreGm2import Development.AutomorphicArithmetic.PrimitiveCosets.Imports3import Formalism.SharpRestriction.RamificationFrobenius.TotientGaloisClasses.TopWin45noncomputable section67namespace UpperTheory.Comparison₂89open Formalism.HC Formalism.MainNotions Formalism.BasicNotions1011def FamCoreConstantBounds {eps : ℝ} (Fm : FamCore eps) (eD eL K cHH eK x : ℝ) : Prop :=12∃ i : Fm.Ix x, CoreAtH (Fm.D x i).host.toHostRaw (Fm.D x i).host.TT eD eL K cHH eK eps x1314variable {Fam : ℝ → Type 1} {core : ∀ {eps : ℝ}, Fam eps → FamCore eps}15{Tied : ∀ {eps : ℝ}, Fam eps → (eD eL K cHH eK CL x : ℝ) → Prop}1617theorem windowInequality_of_artinInputs18(h : ∀ {eps : ℝ} (Fm : Fam eps) (eD eL K cHH eK CL x : ℝ), Tied Fm eD eL K cHH eK CL x → FamCoreConstantBounds (core Fm) eD eL K cHH eK x)19(Λ : Level) : ChebyshevInequalityOnWindows @core @Tied Λ := by20rintro eD eL eps he Fm ⟨C, xE, hE⟩ ⟨K, cHH, eK, CL, x0, hT⟩21obtain ⟨x1, hx1⟩ := core_gm Λ eD eL K cHH eK C eps he22refine ⟨max x1 (max x0 xE), fun x hx hw => ?_⟩23have b := le_of_max_le_right hx24obtain ⟨i, hi⟩ := h Fm _ _ _ _ _ _ _ (hT x (le_of_max_le_left b) hw)25exact hx1 x (le_of_max_le_left hx) _ ((core Fm).D x i).host.toHostAx _ (hE x (le_of_max_le_right b) i) hi2627theorem zeroFreeOn_of_core {Q : PChar → Prop}28(h : ∀ {eps : ℝ} (Fm : Fam eps) (eD eL K cHH eK CL x : ℝ), Tied Fm eD eL K cHH eK CL x → FamCoreConstantBounds (core Fm) eD eL K cHH eK x)29(hW : ∀ ψ, Q ψ → ∃ (Λ : Level) (la : ℝ), ψ ∈ Λ.KEPT ∧ 1 < la ∧ ChebyshevInequalityAtWindowScale @core @Tied la Λ) : ZeroFreeOn Q :=30zeroFreeOn_of_tiedWin fun ψ hψ => by31obtain ⟨Λ, la, a, b, c⟩ := hW ψ hψ32exact ⟨Λ, la, a, b, windowInequality_of_artinInputs h Λ, formB Λ, c⟩3334end UpperTheory.Comparison₂3536end