Development/AutomorphicArithmetic/CharacterBoxes/DesWin.lean
1import Formalism.SharpRestriction.SmoothDesignExistence.DesignExistsDes2import Formalism.SharpRestriction.AdmissibleParameterJoins.SumLogPrimeFactorsLe3import Development.AutomorphicArithmetic.CharacterBoxes.DivinNOfHypV45noncomputable section67namespace UpperTheory.Top89open Formalism.BasicNotions Formalism.MainNotions1011theorem topDesWin (𝒞 𝒞' ℰ : FamClass) (Cabs C0 eD eL : ℝ) (hEx : DesignExists (WithTw (WithSm 𝒞')) C0)12(h1 : ∀ {eps : ℝ} (Fm : FamP eps), 𝒞' Fm → 𝒞 Fm) (h2 : ∀ {eps : ℝ} (Fm : FamP eps), 𝒞' Fm → ℰ Fm)13(hV : ∀ {eps : ℝ} (Fm : FamP eps), ℰ Fm → HypV Fm.toFamCore)14(hN : Closed (Des 𝒞 C0) fun Fm _ => LinkN Fm)15(hEta : Closed (Des 𝒞 C0) fun Fm _ => LinkEta Fm)16(hIRR : Closed (Des 𝒞 C0) fun Fm _ => LinkIRR Fm)17(hZ : Closed (Des 𝒞 C0) fun Fm _ => SmallLevelRankEq Fm)18(hDIV : Closed (Des 𝒞 C0) fun Fm CH => TuSize Fm → DGamSize Fm → LinkDIVt Fm Cabs CH)19(hRk : Closed (Des 𝒞 C0) fun Fm CH => ChosenE Fm C0 CH → NuFullF Fm ∧ J.MuRank Fm)20(hG : Closed (Des 𝒞 C0) fun Fm _ => LinkG Fm)21(hS : Closed (Des 𝒞 C0) fun Fm _ => TuSize Fm → LinkS Fm C0)22(hGL : Closed (Des 𝒞 C0) fun Fm CH => TuSize Fm → DGamSize Fm → LinkGLOBAL Fm Cabs CH C0 eD eL) : FamilyClassConnected ℰ := by23obtain ⟨ε1, hε1, hA⟩ := hN.and (hDIV.and (hEta.and (hIRR.and (hZ.and (hRk.and (hG.and (hS.and hGL)))))))24obtain ⟨ε3, hε3, hEx⟩ := hEx25refine ⟨eD, eL, min ε1 ε3, lt_min hε1 hε3, fun ε h0 hlt => ?_⟩26obtain ⟨K, hK⟩ := hA ε h0 (le_of_lt (lt_of_lt_of_le hlt (min_le_left _ _)))27obtain ⟨Fm, CH, hc, -, hL, hCh, hT, hDG⟩ := hEx ε h0 (le_of_lt (lt_of_lt_of_le hlt (min_le_right _ _))) K28obtain ⟨aN, aD, aE, aI, aZ, aR, aG, aS, aGL⟩ := hK Fm CH ⟨⟨⟨h1 Fm hc.1.1, hc.1.2⟩, hc.2⟩, ⟨CH, hCh⟩, hT, hDG⟩ hL29have hD := aD hT hDG aE (divinN_of_hypV Fm h0 (hV Fm (h2 Fm hc.1.1)) aN aZ)30exact ⟨Fm, h2 Fm hc.1.1, aGL hT hDG hCh ⟨aG, aS hT, aI, hD,31J.linkMu_of_linkDIV Fm hD (aR hCh).1 (aR hCh).2 (muTu_of_tuSize Fm h0 hT) (J.muDGam_of_fact Fm hDG)⟩⟩3233end UpperTheory.Top3435end