Download data/lean/OAI/AlgebraicGeometry/GroupSchemes/Tower.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 7.11 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/GroupSchemes/Tower.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/AlgebraicGeometry/GroupSchemes/Tower.lean
-
curl -L -o Tower.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/GroupSchemes/Tower.lean
7.11 kB
| 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 | |