File size: 8,076 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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
import OAI.AlgebraicGeometry.PELModuli.IntegralModel.PEL.BaseChange

/-! # Iso -/

namespace OAI.AlgebraicGeometry.PELModuli.IntegralModel.PEL

noncomputable section

/-! Genuine PEL family isomorphisms and their base-change coherence. -/

open _root_.CategoryTheory _root_.AlgebraicGeometry
open _root_.CategoryTheory.MonoidalCategory
open scoped _root_.CategoryTheory.MonObj

variable {E : Type} [Field E] [NumberField E] [Algebra β„š E]
  [NumberField.IsCMField E] {g N : β„•} {Ξ΄ : Fin g β†’ β„•} {S T V : Scheme}

structure Iso.PolarizedActionIso (A B : Has.PolarizedActionData E g Ξ΄ N S) where
  polarized : AbelianModuli.HilbertConstruction.Moduli.Isomorphisms.LevelPreservingIso A.polarized B.polarized
  action : βˆ€ a : NumberField.RingOfIntegers E,
    A.action.map a ≫ polarized.abelian.hom = polarized.abelian.hom ≫ B.action.map a

namespace Iso.PolarizedActionIso

variable {A B C : Has.PolarizedActionData E g Ξ΄ N S}

def refl (A : Has.PolarizedActionData E g Ξ΄ N S) : PolarizedActionIso A A where
  polarized := AbelianModuli.HilbertConstruction.Moduli.Isomorphisms.LevelPreservingIso.refl A.polarized
  action a := by simp [AbelianModuli.HilbertConstruction.Moduli.Isomorphisms.LevelPreservingIso.refl]

def symm (e : PolarizedActionIso A B) : PolarizedActionIso B A where
  polarized := e.polarized.symm
  action a := by
    change B.action.map a ≫ e.polarized.abelian.inv =
      e.polarized.abelian.inv ≫ A.action.map a
    apply (cancel_epi e.polarized.abelian.hom).mp
    rw [← Category.assoc, ← e.action a]
    simp

def trans (e : PolarizedActionIso A B) (f : PolarizedActionIso B C) :
    PolarizedActionIso A C where
  polarized := e.polarized.trans f.polarized
  action a := by
    change A.action.map a ≫ (e.polarized.abelian.hom ≫ f.polarized.abelian.hom) =
      (e.polarized.abelian.hom ≫ f.polarized.abelian.hom) ≫ C.action.map a
    rw [← Category.assoc, e.action a, Category.assoc, f.action a, Category.assoc]

def pullback (e : PolarizedActionIso A B) (f : T ⟢ S) :
    PolarizedActionIso (A.pullback f) (B.pullback f) where
  polarized := e.polarized.pullback f
  action a := ((Over.pullback f).map_comp _ _).symm.trans
    ((congrArg (fun m ↦ (Over.pullback f).map m) (e.action a)).trans
      ((Over.pullback f).map_comp _ _))

def pullbackId (A : Has.PolarizedActionData E g Ξ΄ N S) :
    PolarizedActionIso (A.pullback (πŸ™ S)) A where
  polarized := AbelianModuli.HilbertConstruction.Moduli.Isomorphisms.LevelPreservingIso.pullbackId A.polarized
  action a := by
    change (Over.pullback (πŸ™ S)).map (A.action.map a) ≫
        A.polarized.abelian.pullbackIdIso.hom =
      A.polarized.abelian.pullbackIdIso.hom ≫ A.action.map a
    rw [AbelianModuli.HilbertConstruction.Abelian.Schemes.AbelianScheme.pullbackIdIso_hom]
    exact Over.pullbackId.hom.naturality (A.action.map a)

def pullbackComp (A : Has.PolarizedActionData E g δ N S) (f : T ⟢ S) (h : V ⟢ T) :
    PolarizedActionIso ((A.pullback f).pullback h) (A.pullback (h ≫ f)) where
  polarized := AbelianModuli.HilbertConstruction.Moduli.Isomorphisms.LevelPreservingIso.pullbackComp A.polarized f h
  action a := by
    change (Over.pullback h).map ((Over.pullback f).map (A.action.map a)) ≫
        (A.polarized.abelian.pullbackCompIso f h).inv =
      (A.polarized.abelian.pullbackCompIso f h).inv ≫
        (Over.pullback (h ≫ f)).map (A.action.map a)
    rw [AbelianModuli.HilbertConstruction.Abelian.Schemes.AbelianScheme.pullbackCompIso_inv]
    exact (Over.pullbackComp h f).inv.naturality (A.action.map a)

end Iso.PolarizedActionIso

section

variable {A : Has.PolarizedActionData E g Ξ΄ N S} {B : Has.PolarizedActionData E g Ξ΄ N T}
  {f : V ⟢ S} {h : V ⟢ T}

def Has.PulledBackPELDataIso.toActionIso (e : Has.PulledBackPELDataIso A B f h) :
    Iso.PolarizedActionIso (A.pullback f) (B.pullback h) where
  polarized := {
    abelian := e.abelian
    dual := e.dual
    abelianGroup := e.abelianGroup
    dualGroup := e.dualGroup
    polarization := e.polarization
    poincare :=
      (congrArg (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass (e.dual.hom βŠ—β‚˜ e.abelian.hom).left)
        (BaseChange.poincareClass_pullback B h)).trans
        ((AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass_comp (e.dual.hom βŠ—β‚˜ e.abelian.hom).left
          (AbelianModuli.HilbertConstruction.PolarizationData.poincareBaseChangeMap B.polarized.dual h)
          (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.classOf B.polarized.dual.poincare)).symm.trans
          (e.poincare.trans (BaseChange.poincareClass_pullback A f).symm))
    level := e.level }
  action := e.action

def Has.PulledBackPELDataIso.ofActionIso (e : Iso.PolarizedActionIso (A.pullback f) (B.pullback h)) :
    Has.PulledBackPELDataIso A B f h where
  abelian := e.polarized.abelian
  dual := e.polarized.dual
  abelianGroup := e.polarized.abelianGroup
  dualGroup := e.polarized.dualGroup
  polarization := e.polarized.polarization
  poincare := by
    rw [AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass_comp]
    rw [← BaseChange.poincareClass_pullback B h, ← BaseChange.poincareClass_pullback A f]
    exact e.polarized.poincare
  level := e.polarized.level
  action := e.action

end

variable {s : β„•} {P : AbelianModuli.ReferenceFamily.Datum.RankThreePELDatum E s}
  {K : Type} [Field K] [NumberField K] {iota : E β†’+* K}
  {X Y : Over (Spec (.of K))}

/-- The two presentations use exactly the same isomorphism equations. -/
def Iso.actionIsoOfPELPullback {U : AbelianModuli.ReferenceFamily.PEL.Objects.PELObject P iota N X}
    {A : AbelianModuli.ReferenceFamily.PEL.Objects.PELObject P iota N Y} {f : Y ⟢ X}
    (e : AbelianModuli.ReferenceFamily.Models.PELPullbackIso U A f) :
    Iso.PolarizedActionIso (Has.characteristicZeroPELData P A)
      ((Has.characteristicZeroPELData P U).pullback f.left) where
  polarized := {
    abelian := e.abelian
    dual := e.dual
    abelianGroup := e.abelianGroup
    dualGroup := e.dualGroup
    polarization := e.polarization
    poincare :=
      (congrArg (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass (e.dual.hom βŠ—β‚˜ e.abelian.hom).left)
        (BaseChange.poincareClass_pullback (Has.characteristicZeroPELData P U) f.left)).trans
        ((AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass_comp (e.dual.hom βŠ—β‚˜ e.abelian.hom).left
          (AbelianModuli.HilbertConstruction.PolarizationData.poincareBaseChangeMap U.polarized.dual f.left)
          (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.classOf U.polarized.dual.poincare)).symm.trans e.poincare)
    level := e.level }
  action := e.action

def Iso.pelPullbackOfActionIso {U : AbelianModuli.ReferenceFamily.PEL.Objects.PELObject P iota N X}
    {A : AbelianModuli.ReferenceFamily.PEL.Objects.PELObject P iota N Y} {f : Y ⟢ X}
    (e : Iso.PolarizedActionIso (Has.characteristicZeroPELData P A)
      ((Has.characteristicZeroPELData P U).pullback f.left)) :
    AbelianModuli.ReferenceFamily.Models.PELPullbackIso U A f where
  abelian := e.polarized.abelian
  dual := e.polarized.dual
  abelianGroup := e.polarized.abelianGroup
  dualGroup := e.polarized.dualGroup
  polarization := e.polarized.polarization
  poincare :=
    (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass_comp (e.polarized.dual.hom βŠ—β‚˜ e.polarized.abelian.hom).left
      (AbelianModuli.HilbertConstruction.PolarizationData.poincareBaseChangeMap U.polarized.dual f.left)
      (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.classOf U.polarized.dual.poincare)).trans
      ((congrArg (AbelianModuli.HilbertConstruction.Line.Bundles.LineBundle.pullbackClass
        (e.polarized.dual.hom βŠ—β‚˜ e.polarized.abelian.hom).left)
        (BaseChange.poincareClass_pullback (Has.characteristicZeroPELData P U) f.left).symm).trans
        e.polarized.poincare)
  level := e.polarized.level
  action := e.action

end

end OAI.AlgebraicGeometry.PELModuli.IntegralModel.PEL