Development/AutomorphicArithmetic/CharacterBoxes/ZeroFreeAllOfTopG.lean
1import Development.AutomorphicArithmetic.CharacterBoxes.Supply2import Development.AutomorphicArithmetic.CharacterBoxes.DivinNOfHypV3import Development.AutomorphicArithmetic.PrimitiveCosets.LevelGmLeOnFamilyScales4import Development.AutomorphicArithmetic.PrimitiveCosets.Imports56noncomputable section78namespace UpperTheory.Top910open Formalism.BasicNotions Formalism.MainNotions Formalism.HC GlobalTheory.EX1112def TopG : Prop :=13∀ (la : ℝ) (G : FReq), 1 < la → HostExW la G.req →14(∀ {eps : ℝ} (Fm : FamP eps), G.cls la Fm → HypV Fm.toFamCore) → FamilyClassConnected (G.cls la)1516theorem hypV_of_cls (ψ : PChar) (la : ℝ) {eps : ℝ} (Fm : FamP eps) (h : (GChi ψ).cls la Fm) : HypV Fm.toFamCore :=17⟨Fm.x1 + 1, fun x hx i => (h.2 x (by linarith) i).2⟩1819theorem eFamC_of_cls (ψ : PChar) (la : ℝ) {eps : ℝ} (Fm : FamP eps) (h : (GChi ψ).cls la Fm) :20EFamC (Level.cyc ψ) Fm.toFamCore := by21refine ⟨4, Fm.x1 + 1, fun x hx i => ?_⟩22have h1 := (h.2 x (by linarith) i).123rw [Fm.L_x x i (by linarith), Fm.L_eps x i] at h124exact h12526theorem zeroFreeAll_of_topG {la : ℝ} (hla : 1 < la) (h : TopG) (hS : ∀ ψ : PChar, HostExW la (GChi ψ).req) : ZeroFreeAll := by27have key : ZeroFreeOn fun _ => True :=28zeroFreeOn_of_tiedWin_cyc (Fam := FamP) (core := fun Fm => Fm.toFamCore) (Tied := fun Fm => ChainTied Fm) hla29(fun ψ _ => UpperTheory.Comparison₂.level_gm_le_on_family_scales _) (fun ψ _ => UpperTheory.Comparison₂.formB _) fun ψ _ => by30obtain ⟨eD, eL, ε₁, h1, h2⟩ := h la (GChi ψ) hla (hS ψ) (hypV_of_cls ψ la)31refine ⟨eD, eL, ε₁, h1, fun eps a b => ?_⟩32obtain ⟨Fm, c, d⟩ := h2 eps a b33exact ⟨Fm, eFamC_of_cls ψ la Fm c, c.1, d⟩34exact key3536end UpperTheory.Top3738end