File size: 5,814 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
import OAI.AlgebraicGeometry.PELModuli.IntegralModel.Coefficient.GenericMorphisms
import OAI.ArithmeticGeometry.Models.SpreadingOut.GroupBaseChange
import Mathlib.CategoryTheory.Monoidal.Cartesian.Over

/-! # Group Operation Descent -/

namespace OAI.AlgebraicGeometry.PELModuli.IntegralModel.Coefficient.GroupOperationDescent.Coefficients

noncomputable section

/-! Generalization of the proved GroupOperationDescent construction to a
general coefficient ring for smooth proper complex group-scheme families.

 The multiplication, identity, and inverse maps descend over one larger
finite coefficient base. -/

open _root_.CategoryTheory _root_.CategoryTheory.Limits _root_.AlgebraicGeometry
open MonoidalCategory CartesianMonoidalCategory MonObj
open _root_.CategoryTheory.Functor
open scoped _root_.NumberField

universe u

open OAI.ArithmeticGeometry.Models.SpreadingOut.GroupBaseChange.Construction

def groupOperationObjects {S : Scheme.{u}} (M : Over S) : Fin 3 → Over S :=
  ![𝟙_ _, M, M ⊗ M]

def groupOperationSources : Fin 3 → Fin 3 := ![0, 2, 1]

theorem groupOperationObjects_finitePresentation
    {S : Scheme.{u}} (M : Over S) [Smooth M.hom] [IsProper M.hom] (i : Fin 3) :
    ArithmeticGeometry.Models.Scheme.Constructions.Foundations.FinitePresentationMorphism (groupOperationObjects M i).hom := by
  fin_cases i <;> dsimp [groupOperationObjects] <;>
    exact ⟨inferInstance, inferInstance, inferInstance⟩

def groupOperationMaps
    {S T : Scheme.{u}} (H : Over S ⥤ Over T) [H.Monoidal]
    (M : Over S) [GrpObj (H.obj M)] :
    ∀ j : Fin 3, H.obj (groupOperationObjects M (groupOperationSources j)) ⟶
      H.obj (groupOperationObjects M 1) :=
  Fin.cases (OplaxMonoidal.η H ≫ η[H.obj M])
    (Fin.cases (OplaxMonoidal.δ H M M ≫ μ[H.obj M])
      (Fin.cases ι[H.obj M] (fun i ↦ Fin.elim0 i)))

theorem group_operations_descend_raw
    {R₀ K : Type u} [CommRing R₀] [Field K] [Algebra R₀ K] {s : Finset K}
    (M : Over (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.coefficientBase R₀ K s)) [Smooth M.hom] [IsProper M.hom]
    [GrpObj ((Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K s)).obj M)] :
    ∃ (t : Finset K) (h : s ⊆ t),
      let F := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.coefficientBaseMap R₀ K h)
      let G := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K t)
      let H := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K s)
      let c := GenericMorphisms.Coefficients.coefficientGenericComparison (R₀ := R₀) h
      ∃ (a : F.obj (𝟙_ _) ⟶ F.obj M) (b : F.obj (M ⊗ M) ⟶ F.obj M)
        (d : F.obj M ⟶ F.obj M),
        (G.map a ≫ (c.app M).hom = (c.app (𝟙_ _)).hom ≫ OplaxMonoidal.η H ≫ η[H.obj M]) ∧
        (G.map b ≫ (c.app M).hom = (c.app (M ⊗ M)).hom ≫ OplaxMonoidal.δ H M M ≫ μ[H.obj M]) ∧
        (G.map d ≫ (c.app M).hom = (c.app M).hom ≫ ι[H.obj M]) := by
  let H := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K s)
  obtain ⟨t, h, b, hb⟩ := GenericMorphisms.Coefficients.finite_generic_morphisms_descend (groupOperationObjects M)
    (groupOperationObjects_finitePresentation M) groupOperationSources (fun _ ↦ 1)
    (groupOperationMaps H M)
  exact ⟨t, h, b 0, b 1, b 2, hb 0, hb 1, hb 2⟩

theorem group_operations_descend
    {R₀ K : Type u} [CommRing R₀] [Field K] [Algebra R₀ K] {s : Finset K}
    (M : Over (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.coefficientBase R₀ K s)) [Smooth M.hom] [IsProper M.hom]
    [GrpObj ((Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K s)).obj M)] :
    ∃ (t : Finset K) (h : s ⊆ t),
      let F := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.coefficientBaseMap R₀ K h)
      let G := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K t)
      let c := GenericMorphisms.Coefficients.coefficientGenericComparison (R₀ := R₀) h
      let N := F.obj M
      letI : GrpObj (G.obj N) := GrpObj.ofIso (c.app M).symm
      ∃ (one : 𝟙_ (Over (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.coefficientBase R₀ K t)) ⟶ N)
        (mul : N ⊗ N ⟶ N) (inv : N ⟶ N),
        G.map one = OplaxMonoidal.η G ≫ η[G.obj N] ∧
        G.map mul = OplaxMonoidal.δ G N N ≫ μ[G.obj N] ∧
        G.map inv = ι[G.obj N] := by
  let H := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K s)
  obtain ⟨t, h, a, b, d, ha, hb, hd⟩ := group_operations_descend_raw M
  let F := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.coefficientBaseMap R₀ K h)
  let G := Over.pullback (ArithmeticGeometry.Models.CoefficientSystem.Constructions.Foundations.genericBaseMap R₀ K t)
  let c := GenericMorphisms.Coefficients.coefficientGenericComparison (R₀ := R₀) h
  refine ⟨t, h, LaxMonoidal.ε F ≫ a, LaxMonoidal.μ F M M ≫ b, d, ?_, ?_, ?_⟩
  · exact ArithmeticGeometry.Models.SpreadingOut.GroupBaseChange.Construction.descended_one_image F G H c M a ha
  · exact ArithmeticGeometry.Models.SpreadingOut.GroupBaseChange.Construction.descended_mul_image F G H c M b hb
  · exact ArithmeticGeometry.Models.SpreadingOut.GroupBaseChange.Construction.descended_inv_image F G H c M d hd

end

end OAI.AlgebraicGeometry.PELModuli.IntegralModel.Coefficient.GroupOperationDescent.Coefficients