import Mathlib
import Development.AbelianVarietyTheory.Definitions.AdelicHermitianForms.MemPowSub
import Development.AbelianVarietyTheory.Proofs.AdelicLatticeProofs.ExistsIndependentPrimeRelIndexSubgroups
import Development.AbelianVarietyTheory.Proofs.AdelicLatticeProofs.ExistsPlacePowAndNotPowStatement
import Development.AbelianVarietyTheory.Proofs.AdelicLatticeProofs.ExistsEqPowMulPthPowAdicCompletionUnitStatement
import Development.AbelianVarietyTheory.Proofs.AdelicLatticeProofs.PowsSubgroupOfSelfSPow
open NumberField IsDedekindDomain Polynomial GlobalTheory.QNorm GlobalTheory.CNorm
open scoped WithZero TensorProduct

namespace GlobalTheory.CNorm

theorem relIndex_sup_zpowers_chooseT (p : ℕ) {G : Type} [CommGroup G] (Q : Subgroup G) (d : G)
    (hp : p.Prime) (hd : d ^ p ∈ Q) (hn : d ∉ Q) :
    Q.relIndex (Q ⊔ Subgroup.zpowers d) = p := by
  haveI : Fact p.Prime := ⟨hp⟩
  rw [Subgroup.relIndex_sup_left]
  have h := Subgroup.relIndex_ker (Subgroup.zpowers d) (QuotientGroup.mk' Q)
  rw [QuotientGroup.ker_mk', MonoidHom.map_zpowers, Nat.card_zpowers] at h
  rw [h]
  refine orderOf_eq_prime ?_ ?_
  · rw [← map_pow]
    exact (QuotientGroup.eq_one_iff _).2 hd
  · exact fun e => hn ((QuotientGroup.eq_one_iff _).1 e)

theorem mem_pows_sUnits_chooseT (p : ℕ) (hp : p ≠ 0) (F : Type) [Field F] [NumberField F]
    (S : Finset (HeightOneSpectrum (𝓞 F))) (x : Fˣ) (hx : x ∈ sUnits F S) (r : F)
    (hr : r ^ p = (x : F)) : x ∈ pows p (sUnits F S) := by
  have hr0 : r ≠ 0 := by
    rintro rfl
    exact x.ne_zero (by rw [← hr, zero_pow hp])
  refine ⟨Units.mk0 r hr0, ?_, ?_⟩
  · rw [SetLike.mem_coe, mem_sUnits]
    intro v hv
    have h := (mem_sUnits F S x).1 hx v hv
    rw [← hr, map_pow] at h
    exact (pow_eq_one_iff_of_nonneg zero_le hp).1 h
  · ext
    simp [hr]

theorem exists_auxiliary_places_prime : ∀ (p : ℕ) (F : Type) [Field F] [NumberField F] [IsTotallyComplex F] (ζ : F) (δ : Fˣ) (S : Finset (HeightOneSpectrum (𝓞 F))), p.Prime → IsPrimitiveRoot ζ p → AdmP p F S → δ ∈ sUnits F S → (∀ r : F, r ^ p ≠ (δ : F)) → ∃ T : Finset (HeightOneSpectrum (𝓞 F)), Disjoint S T ∧ T.card + 1 = S.card + Fintype.card (InfinitePlace F) ∧ (∀ v ∈ T, ∃ r : v.adicCompletion F, r ^ p = algebraMap F (v.adicCompletion F) (δ : F)) ∧ ∀ v ∈ T, ∃ u ∈ sUnits F S, u ∉ powSub p (algebraMap F (v.adicCompletion F)) ∧ ∀ v' ∈ T, v' ≠ v → u ∈ powSub p (algebraMap F (v'.adicCompletion F)) := by
  intro p F _ _ _ ζ δ S hp hζ hS hδ hns
  classical
  have hQU : pows p (sUnits F S) ≤ sUnits F S := by
    rintro _ ⟨y, hy, rfl⟩
    exact (sUnits F S).pow_mem hy p
  have hdd : δ ^ p ∈ pows p (sUnits F S) := ⟨δ, hδ, rfl⟩
  have hdn : δ ∉ pows p (sUnits F S) := by
    rintro ⟨y, -, hy⟩
    exact hns (y : F) (by rw [← hy]; simp)
  have hHU : pows p (sUnits F S) ⊔ Subgroup.zpowers δ ≤ sUnits F S :=
    sup_le hQU ((Subgroup.zpowers_le).2 hδ)
  have hpos : 0 < Fintype.card (InfinitePlace F) := Fintype.card_pos
  obtain ⟨m, hm⟩ : ∃ m, m + 1 = S.card + Fintype.card (InfinitePlace F) :=
    ⟨S.card + Fintype.card (InfinitePlace F) - 1, by omega⟩
  have hidx : (pows p (sUnits F S) ⊔ Subgroup.zpowers δ).relIndex (sUnits F S) = p ^ m := by
    have h := Subgroup.relIndex_mul_relIndex _ _ _ le_sup_left hHU
    have h2 : (pows p (sUnits F S)).relIndex (sUnits F S) = _ :=
      (pTor_pIdx_sUnits p F ζ S hp hζ).2
    rw [relIndex_sup_zpowers_chooseT p _ _ hp hdd hdn, h2, ← hm, pow_succ'] at h
    exact Nat.eq_of_mul_eq_mul_left hp.pos h
  have hval : ∀ (v : HeightOneSpectrum (𝓞 F)) (x : F),
      Valued.v (algebraMap F (v.adicCompletion F) x) = v.valuation F x := fun v x =>
    HeightOneSpectrum.valuedAdicCompletion_eq_valuation' v x
  have hpw : ∀ (v : HeightOneSpectrum (𝓞 F)) (x : Fˣ),
      x ^ p ∈ powSub p (algebraMap F (v.adicCompletion F)) := fun v x =>
    ⟨algebraMap F (v.adicCompletion F) x, by rw [Units.val_pow_eq_pow_val, map_pow]⟩
  obtain ⟨T, hT, hgood, hA⟩ := exists_indep_prime_index p Fˣ (HeightOneSpectrum (𝓞 F)) (sUnits F S)
    (pows p (sUnits F S) ⊔ Subgroup.zpowers δ)
    (fun v => powSub p (algebraMap F (v.adicCompletion F)))
    (fun v => v ∉ S ∧ ∃ r : v.adicCompletion F,
      r ^ p = algebraMap F (v.adicCompletion F) (δ : F)) m hp hidx
    (by
      rintro v ⟨-, hv⟩
      refine le_trans inf_le_right (sup_le ?_ ((Subgroup.zpowers_le).2 hv))
      rintro _ ⟨y, -, rfl⟩
      exact hpw v y)
    (fun v _ x _ => hpw v x)
    (by
      rintro v ⟨hv, -⟩ x hx hx' y hy
      obtain ⟨k, r, hr⟩ := GlobalTheory.T.exists_eq_pow_mul_pth_pow_adicCompletion_unit p F v (algebraMap F (v.adicCompletion F) x)
        (algebraMap F (v.adicCompletion F) y) hp (hS.2 v hv)
        (by rw [hval]; exact (mem_sUnits F S x).1 hx v hv)
        (by rw [hval]; exact (mem_sUnits F S y).1 hy v hv)
        (fun r hr => hx' ⟨r, hr⟩)
      refine ⟨k, r, ?_⟩
      have hx0 : algebraMap F (v.adicCompletion F) x ≠ 0 := by simp
      rw [Units.val_div_eq_div_val, Units.val_pow_eq_pow_val, map_div₀, map_pow, hr]
      field_simp)
    (by
      intro x hx hxH
      obtain ⟨v, h1, h2, h3⟩ := GlobalTheory.T.exists_place_pow_and_not_pow' p F ζ δ x S hp hζ δ.ne_zero x.ne_zero hns
        (fun k r h => hxH (by
          have h4 : x / δ ^ k ∈ pows p (sUnits F S) := by
            refine mem_pows_sUnits_chooseT p hp.ne_zero F S _
              ((sUnits F S).div_mem hx ((sUnits F S).pow_mem hδ k)) r ?_
            have hδ0 := δ.ne_zero
            rw [Units.val_div_eq_div_val, Units.val_pow_eq_pow_val, h]
            field_simp
          have h5 := Subgroup.mul_mem_sup h4 (Subgroup.pow_mem _ (Subgroup.mem_zpowers δ) k)
          rwa [div_mul_cancel] at h5))
      exact ⟨v, ⟨h1, h2⟩, fun ⟨r, hr⟩ => h3 r hr⟩)
  refine ⟨T, ?_, by rw [hT, hm], fun v hv => (hgood v hv).2, hA⟩
  rw [Finset.disjoint_right]
  exact fun v hv => (hgood v hv).1

end GlobalTheory.CNorm
