File size: 3,783 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 | import OAI.AlgebraicGeometry.PELModuli.IntegralModel.Relative.PELActionBaseChange
import OAI.AlgebraicGeometry.PELModuli.IntegralModel.Integral.ActionFunctorDescent
import OAI.AlgebraicGeometry.PELModuli.IntegralModel.Open.BaseConditions
/-! # Action Functor Descent -/
namespace OAI.AlgebraicGeometry.PELModuli.IntegralModel.Relative.ActionFunctorDescent
noncomputable section
/-! Effective descent of actual PEL-action values over reduced noetherian
tests, including the literal Rosati and arithmetic Lie-rank conditions. -/
set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
open _root_.CategoryTheory _root_.AlgebraicGeometry Opposite
open OAI.AlgebraicGeometry.PELModuli.IntegralModel.Relative.PELActionBaseChange.ActionBaseChange
variable {E R : Type} [Field E] [NumberField E] [Algebra ℚ E] [NumberField.IsCMField E]
[CommRing R] {s N : ℕ} (P : AbelianModuli.ReferenceFamily.Datum.RankThreePELDatum E s)
(iotaO : NumberField.RingOfIntegers E →+* R) (M : Over (Spec (.of R)))
(A : AbelianModuli.HilbertConstruction.PolarizationData.PolarizedAbelianWithFullLevel (3 * s) P.polarizationType N M.left)
{B : Scheme.{0}} (b : B ⟶ M.left) [IsReduced B] [IsNoetherian B] (C : B.OpenCover)
theorem existsUnique_pel_value_of_functor_matching
(u : ∀ i, (ActionFunctor.relativePELActionFunctor P iotaO M A).obj
(op ((Over.map b).obj (Over.mk (C.f i)))))
(hmatch : ∀ i j (T : Over B) [IsReduced T.left]
(f : T ⟶ Over.mk (C.f i)) (h : T ⟶ Over.mk (C.f j)),
(ActionFunctor.relativePELActionFunctor P iotaO M A).map ((Over.map b).map f).op (u i) =
(ActionFunctor.relativePELActionFunctor P iotaO M A).map ((Over.map b).map h).op (u j)) :
∃! q : (ActionFunctor.relativePELActionFunctor P iotaO M A).obj (op (Over.mk b)),
∀ i, (ActionFunctor.relativePELActionFunctor P iotaO M A).map
(ActionCanonicalRestriction.ActionBaseChange.testInclusion b (Over.mk (C.f i))).op q = u i := by
obtain ⟨q, hq, huniq⟩ := Integral.ActionFunctorDescent.existsUnique_action_of_functor_matching A.abelian b C
(fun i => (u i).val) (fun i j T _ f h => congrArg Subtype.val (hmatch i j T f h))
let v := fun i => (PELActionBaseChange.ActionBaseChange.pelEquiv P iotaO M A b (Over.mk (C.f i))).symm (u i)
have hv (i) : Integral.IntegralActionBaseChange.ActionBaseChange.actionEquiv A.abelian b (Over.mk (C.f i)) (v i).val = (u i).val :=
congrArg Subtype.val ((PELActionBaseChange.ActionBaseChange.pelEquiv P iotaO M A b (Over.mk (C.f i))).apply_symm_apply (u i))
have hpull (i) : q.pullback (C.f i) = (v i).val := by
apply (Integral.IntegralActionBaseChange.ActionBaseChange.actionEquiv A.abelian b (Over.mk (C.f i))).injective
exact (ActionCanonicalRestriction.ActionBaseChange.actionEquiv_pullback A.abelian b (Over.mk (C.f i)) q).symm.trans
((hq i).trans (hv i).symm)
have hRos : AbelianModuli.ReferenceFamily.ActionData.RosatiConjugation (A.pullback b) q := by
apply Open.BaseConditions.rosati_of_open_base_cover C (A.pullback b) q
intro i
rw [hpull i]
exact (v i).property.1
have hLie : PEL.Has.HasIntegralLieRanks P R iotaO (Over.mk (b ≫ M.hom)) (A.abelian.pullback b) q := by
apply Open.BaseConditions.integralLieRanks_of_open_base_cover P iotaO (Over.mk (b ≫ M.hom)) C
(A.abelian.pullback b) q
intro i
rw [hpull i]
exact (v i).property.2
let w : (ActionFunctor.relativePELActionFunctor P iotaO M A).obj (op (Over.mk b)) := ⟨q, hRos, hLie⟩
refine ⟨w, fun i => Subtype.ext (hq i), fun z hz => ?_⟩
apply Subtype.ext
exact huniq z.val (fun i => congrArg Subtype.val (hz i))
end
end OAI.AlgebraicGeometry.PELModuli.IntegralModel.Relative.ActionFunctorDescent
|