File size: 7,108 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 167 168 169 170 171 172 173 174 175 176 | import OAI.AlgebraicGeometry.GroupSchemes.FiniteEtale
/-! # Tower -/
namespace OAI.AlgebraicGeometry.GroupSchemes
noncomputable section
/-!
# FiniteEtale: multiplication and torsion in the geometric tower
Multiplication by p from level n+1 to level n is constructed from the
defining kernel property on the universal affine point. No surjectivity,
Cartier comparison, or classification is assumed.
-/
open _root_.CategoryTheory _root_.AlgebraicGeometry Opposite
open _root_.CategoryTheory.MonoidalCategory _root_.CategoryTheory.CartesianMonoidalCategory
open _root_.CategoryTheory.MonObj
universe u v
section Monoidal
variable {C : Type u} [Category.{v} C] [CartesianMonoidalCategory C]
{A B D : C} [MonObj A] [MonObj B] [MonObj D]
/-- A monomorphism of monoid objects detects the homomorphism laws. -/
theorem Tower.FiniteEtale.isMonHom_of_comp_mono (f : A βΆ B) (g : B βΆ D)
[IsMonHom g] [Mono g] [IsMonHom (f β« g)] : IsMonHom f := by
constructor
Β· apply (cancel_mono g).mp
simp only [Category.assoc, IsMonHom.one_hom]
Β· apply (cancel_mono g).mp
simp only [Category.assoc, IsMonHom.mul_hom]
rw [β Category.assoc, tensorHom_comp_tensorHom]
variable [BraidedCategory C] [IsCommMonObj B]
/-- Pointwise powers of a homomorphism into a commutative group object. -/
theorem Tower.FiniteEtale.isMonHom_pow (f : A βΆ B) [IsMonHom f] (n : β) : IsMonHom (f ^ n) := by
induction n with
| zero =>
change IsMonHom (1 : A βΆ B)
change IsMonHom (toUnit A β« Ξ·[B])
infer_instance
| succ n ih =>
have : IsMonHom (f ^ n) := ih
rw [pow_succ, Hom.mul_def]
infer_instance
end Monoidal
variable {k : Type u} [Field k] {p h : β}
variable (G : FiniteEtale.PDivisibleGroup k p h)
instance FiniteEtale.PDivisibleGroup.inclusion_mono (n : β) : Mono (G.inclusion n) :=
Over.mono_of_mono_left _
/-- The pth-power endomorphism of level n+1 factors through level n. -/
theorem FiniteEtale.PDivisibleGroup.exists_multiplyDown (n : β) :
β f : (G.level (n + 1)).scheme βΆ (G.level n).scheme,
f β« G.inclusion n = (π (G.level (n + 1)).scheme) ^ p := by
apply (G.kernel n (G.level (n + 1)).algebra _).mpr
rw [β pow_mul, β pow_succ']
exact G.annihilated k (n + 1) _ (π _)
/-- Multiplication by p, with codomain lowered by one finite level. -/
def FiniteEtale.PDivisibleGroup.multiplyDown (n : β) : (G.level (n + 1)).scheme βΆ (G.level n).scheme :=
(G.exists_multiplyDown n).choose
@[reassoc]
theorem FiniteEtale.PDivisibleGroup.multiplyDown_inclusion (n : β) :
G.multiplyDown n β« G.inclusion n = (π (G.level (n + 1)).scheme) ^ p :=
(G.exists_multiplyDown n).choose_spec
instance FiniteEtale.PDivisibleGroup.multiplyDown_isMonHom (n : β) : IsMonHom (G.multiplyDown n) := by
have : IsMonHom ((π (G.level (n + 1)).scheme) ^ p) := Tower.FiniteEtale.isMonHom_pow _ _
have : IsMonHom (G.multiplyDown n β« G.inclusion n) := by
rw [G.multiplyDown_inclusion n]
infer_instance
exact Tower.FiniteEtale.isMonHom_of_comp_mono _ (G.inclusion n)
/-- The other composite is multiplication by p on the lower level. -/
@[reassoc]
theorem FiniteEtale.PDivisibleGroup.inclusion_multiplyDown (n : β) :
G.inclusion n β« G.multiplyDown n = (π (G.level n).scheme) ^ p := by
apply (cancel_mono (G.inclusion n)).mp
rw [Category.assoc, G.multiplyDown_inclusion, MonObj.comp_pow, Category.comp_id,
MonObj.pow_comp, Category.id_comp]
/-- Multiplication and the transition maps commute in consecutive levels. -/
theorem FiniteEtale.PDivisibleGroup.multiplyDown_compatible (n : β) :
G.inclusion (n + 1) β« G.multiplyDown (n + 1) =
G.multiplyDown n β« G.inclusion n := by
rw [G.inclusion_multiplyDown, G.multiplyDown_inclusion]
/-- The geometric multiplication map acts as the pth power on every affine point. -/
theorem FiniteEtale.PDivisibleGroup.multiplyDown_points (n : β) (R : CommAlgCat.{u} k)
(x : FiniteEtale.affine k R βΆ (G.level (n + 1)).scheme) :
x β« G.multiplyDown n β« G.inclusion n = x ^ p := by
rw [G.multiplyDown_inclusion, MonObj.comp_pow, Category.comp_id]
/-- Its pointwise kernel consists exactly of the p-torsion. -/
theorem FiniteEtale.PDivisibleGroup.multiplyDown_kernel (n : β) (R : CommAlgCat.{u} k)
(x : FiniteEtale.affine k R βΆ (G.level (n + 1)).scheme) :
x β« G.multiplyDown n = 1 β x ^ p = 1 := by
rw [β cancel_mono (G.inclusion n), Category.assoc,
G.multiplyDown_points, MonObj.one_comp]
/-- The composite of r successive closed transition embeddings. -/
def FiniteEtale.PDivisibleGroup.inclusionIter (n : β) : β r, (G.level n).scheme βΆ (G.level (n + r)).scheme
| 0 => π _
| r + 1 => inclusionIter n r β« G.inclusion (n + r)
instance FiniteEtale.PDivisibleGroup.inclusionIter_isMonHom (n r : β) : IsMonHom (G.inclusionIter n r) := by
induction r with
| zero => change IsMonHom (π _); infer_instance
| succ r ih =>
have : IsMonHom (G.inclusionIter n r) := ih
change IsMonHom (G.inclusionIter n r β« G.inclusion (n + r))
infer_instance
instance FiniteEtale.PDivisibleGroup.inclusionIter_mono (n r : β) : Mono (G.inclusionIter n r) := by
induction r with
| zero => change Mono (π _); infer_instance
| succ r ih =>
have : Mono (G.inclusionIter n r) := ih
change Mono (G.inclusionIter n r β« G.inclusion (n + r))
infer_instance
/-- The n-th level is exactly the p^n-torsion in every later level. -/
theorem FiniteEtale.PDivisibleGroup.inclusionIter_kernel (n r : β) (R : CommAlgCat.{u} k)
(x : FiniteEtale.affine k R βΆ (G.level (n + r)).scheme) :
(β y : FiniteEtale.affine k R βΆ (G.level n).scheme, y β« G.inclusionIter n r = x) β
x ^ (p ^ n) = 1 := by
induction r with
| zero =>
constructor
Β· intro _; exact G.annihilated k n R x
Β· intro _; exact β¨x, Category.comp_id xβ©
| succ r ih =>
constructor
Β· rintro β¨y, rflβ©
rw [β MonObj.pow_comp, G.annihilated k n R y, MonObj.one_comp]
Β· intro hx
have hx' : x ^ (p ^ (n + r)) = 1 := by
obtain β¨d, hdβ© := pow_dvd_pow p (Nat.le_add_right n r)
rw [hd, pow_mul, hx, one_pow]
obtain β¨z, hzβ© := (G.kernel (n + r) R x).mpr hx'
have hzp : z ^ (p ^ n) = 1 := by
apply (cancel_mono (G.inclusion (n + r))).mp
rw [MonObj.pow_comp, hz, MonObj.one_comp]
exact hx
obtain β¨y, hyβ© := (ih z).mpr hzp
refine β¨y, ?_β©
change y β« (G.inclusionIter n r β« G.inclusion (n + r)) = x
rw [β Category.assoc, hy, hz]
/-! Iterated transitions retain the actual closed-immersion property. -/
instance FiniteEtale.PDivisibleGroup.inclusionIter_closed (n r : β) : IsClosedImmersion (G.inclusionIter n r).left := by
induction r with
| zero =>
change IsClosedImmersion (π _)
infer_instance
| succ r ih =>
have := ih
change IsClosedImmersion ((G.inclusionIter n r).left β« (G.inclusion (n + r)).left)
infer_instance
end
end OAI.AlgebraicGeometry.GroupSchemes
|