import Mathlib
import Development.AbelianVarietyTheory.Proofs.DivisorProofs.ExistsPdivGroupTateLie
import Mathlib
import Development.AbelianVarietyTheory.Proofs.DivisorProofs.SpecialFibreNotInClosure
import Development.AbelianVarietyTheory.BlockTheory.DivisorBase.EpsilonPairingZeta
import Development.AbelianVarietyTheory.BlockTheory.DivisorBase.HodgeTateKernel
open GlobalTheory GlobalTheory.HTLat GlobalTheory.PDivGroup GlobalTheory.WeilIntegral GlobalTheory.IndefiniteRowSideFullHecke.HodgeTateKernel TensorProduct CategoryTheory ReciprocityTheory.ChartRestriction.G ReciprocityTheory.ChartRestriction.G.Pdiv ReciprocityTheory.ChartRestriction.G.Geo.Tor GlobalTheory.ChTor CategoryTheory.MonObj
set_option maxHeartbeats 1000000 in
theorem _root_.GlobalTheory.T.exists_pdiv_group_tate_lie : ∀ (p : ℕ) [Fact p.Prime] (C : Type) [Field C] [IsAlgClosed C] [CharZero C] (v : Valuation C NNReal) (O : Type) [CommRing O] [Algebra O C] [Fact ¬IsUnit (p : O)] [IsAdicComplete (Ideal.span {(p : O)}) O] [Algebra ℤ_[p] O] [Algebra ℤ_[p] C] [IsScalarTower ℤ_[p] O C] (Λ : Type) [CommRing Λ] [StarRing Λ] (P : Point p v O Λ), ∃ (G : PDivGroup p O) (e : G.Tate ≃ₗ[ℤ_[p]] P.tateGt) (l : LieG P.Gt ≃ G.Lie) (c : P.T →ₗ[ℤ_[p]] G.dual.Tate) (ζ : (PDivGroup.mu p O).Tate) (tw : G.TorsionTower P.Gt), Function.Bijective (fun a : ℤ_[p] => a • ζ) ∧ (∀ s t, pairing G O s (c t) = pairT P.A P.eps (e s : P.T) t • ζ) ∧ (∀ x t, l x (dlog (G := G) (c t)) = (P.al₀ t).1 x) ∧ (∀ (s : G.Tate) (n : ℕ), (e s : P.T).lev n = (P.toA (GlobalTheory.DeRham.spOver (s.pt n) ≫ tw.y n))) ∧ ∀ n : ℕ, algebraMap O C (muRoot ζ n) = (P.eps.1.lev n : C) := by
  first | exact @GlobalTheory.RaynaudTower.exists_pDivGroup_raynaud_tower | exact GlobalTheory.RaynaudTower.exists_pDivGroup_raynaud_tower | (intros; apply GlobalTheory.RaynaudTower.exists_pDivGroup_raynaud_tower <;> assumption)
