File size: 7,402 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 | import OAI.AlgebraicGeometry.GroupSchemes.EtaleCyclic
/-! # Etale Generators -/
namespace OAI.AlgebraicGeometry.GroupSchemes
noncomputable section
/-! Compatible choices of full-order points in a split height-one tower. -/
open _root_.CategoryTheory _root_.AlgebraicGeometry Opposite WithConv _root_.CategoryTheory.MonObj
universe u
variable {k : Type u} [Field k] [IsAlgClosed k]
variable {p : β} [Fact p.Prime]
/-- Multiplication-down on rational points. -/
def FiniteEtale.PDivisibleGroup.downOnPoints (G : FiniteEtale.PDivisibleGroup k p 1) (n : β) :
(G.level (n + 1)).rationalPoints β* (G.level n).rationalPoints :=
((FiniteEtale.FiniteCommGroupScheme.mapPoints (G.multiplyDown n)).app (CommAlgCat.of k k)).hom
/-- Multiplication-down is surjective in the split tower. -/
theorem FiniteEtale.PDivisibleGroup.downOnPoints_surjective (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β) :
Function.Surjective (G.downOnPoints n) := by
have := hsplit n
have := hsplit (n + 1)
have := G.rationalPoints_cyclic hsplit (n + 1)
have hker : (G.downOnPoints n).ker =
(powMonoidHom p : (G.level (n + 1)).rationalPoints β* (G.level (n + 1)).rationalPoints).ker := by
ext x
exact G.multiplyDown_kernel n (CommAlgCat.of k k) x
apply (G.downOnPoints n).surjective_of_card_ker_le_div
rw [hker, IsCyclic.card_powMonoidHom_ker,
(G.level (n + 1)).rationalPoints_card, (G.level n).rationalPoints_card,
G.rank, G.rank, Nat.mul_one, Nat.mul_one, pow_succ]
rw [Nat.gcd_eq_right (dvd_mul_left p (p ^ n)), Nat.mul_div_cancel_left _
(pow_pos (Fact.out : p.Prime).pos n)]
/-- A point of the full prescribed order. -/
def FiniteEtale.PDivisibleGroup.PointGenerator (G : FiniteEtale.PDivisibleGroup k p 1) (n : β) :=
{ x : (G.level n).rationalPoints // orderOf x = p ^ n }
/-- Every generator lifts under multiplication-down to a generator of the next level. -/
theorem FiniteEtale.PDivisibleGroup.generator_lift (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra)
(n : β) (x : G.PointGenerator n) :
β y : G.PointGenerator (n + 1), G.downOnPoints n y.val = x.val := by
cases n with
| zero =>
obtain β¨y, hyβ© := G.exists_point_order hsplit 1
refine β¨β¨y, hyβ©, ?_β©
have hx : x.val = 1 := by
simpa only [pow_zero, pow_one] using G.annihilated k 0 (CommAlgCat.of k k) x.val
have hd : G.downOnPoints 0 y = 1 := by
simpa only [pow_zero, pow_one] using
G.annihilated k 0 (CommAlgCat.of k k) (G.downOnPoints 0 y)
exact hd.trans hx.symm
| succ n =>
obtain β¨y, hyβ© := G.downOnPoints_surjective hsplit (n + 1) x.val
refine β¨β¨y, orderOf_eq_prime_pow ?_
(G.annihilated k (n + 1 + 1) (CommAlgCat.of k k) y)β©, hyβ©
intro hbad
have hxpow : x.val ^ (p ^ n) = 1 := by
apply (cancel_mono (G.inclusion (n + 1))).mp
rw [MonObj.pow_comp, β hy, MonObj.one_comp]
change ((y β« G.multiplyDown (n + 1)) β« G.inclusion (n + 1)) ^ (p ^ n) = 1
rw [Category.assoc, G.multiplyDown_points, β pow_mul, β pow_succ']
exact hbad
exact pow_ne_one_of_lt_orderOf (pow_ne_zero n (Fact.out : p.Prime).ne_zero)
(by rw [x.property]; exact Nat.pow_lt_pow_right (Fact.out : p.Prime).one_lt (Nat.lt_succ_self n)) hxpow
/-- A recursive compatible system of full-order generators. -/
def FiniteEtale.PDivisibleGroup.compatibleGenerators (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) : β n, G.PointGenerator n
| 0 => β¨1, by simpβ©
| n + 1 => Classical.choose (G.generator_lift hsplit n (compatibleGenerators G hsplit n))
/-- The chosen generators lift each other under multiplication-down. -/
theorem FiniteEtale.PDivisibleGroup.compatibleGenerators_down (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β) :
G.downOnPoints n (G.compatibleGenerators hsplit (n + 1)).val =
(G.compatibleGenerators hsplit n).val :=
Classical.choose_spec (G.generator_lift hsplit n (G.compatibleGenerators hsplit n))
/-- The original inclusions send each generator to the pth power of the next one. -/
theorem FiniteEtale.PDivisibleGroup.compatibleGenerators_inclusion (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β) :
(G.compatibleGenerators hsplit n).val β« G.inclusion n =
(G.compatibleGenerators hsplit (n + 1)).val ^ p := by
have hd : (G.compatibleGenerators hsplit (n + 1)).val β« G.multiplyDown n =
(G.compatibleGenerators hsplit n).val := G.compatibleGenerators_down hsplit n
rw [β G.multiplyDown_points n (CommAlgCat.of k k), β Category.assoc, hd]
/-- Each chosen point generates its entire finite point group. -/
theorem FiniteEtale.PDivisibleGroup.compatibleGenerators_generate (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β) :
β x : (G.level n).rationalPoints, x β Subgroup.zpowers (G.compatibleGenerators hsplit n).val := by
have := hsplit n
have htop : Subgroup.zpowers (G.compatibleGenerators hsplit n).val = β€ := by
apply (Subgroup.card_eq_iff_eq_top _).mp
rw [Nat.card_zpowers, (G.compatibleGenerators hsplit n).property,
(G.level n).rationalPoints_card, G.rank, Nat.mul_one]
intro x
rw [htop]
trivial
/-- Cyclic coordinates chosen compatibly with the geometric transitions. -/
def FiniteEtale.PDivisibleGroup.cyclicPointEquiv (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β) :
Multiplicative (ZMod (p ^ n)) β* (G.level n).rationalPoints :=
zmodMulEquivOfGenerator (G.compatibleGenerators_generate hsplit n) (by
have := hsplit n
rw [(G.level n).rationalPoints_card, G.rank, Nat.mul_one])
/-- The cyclic point coordinates evaluate integer classes by powers of the chosen generator. -/
theorem FiniteEtale.PDivisibleGroup.cyclicPointEquiv_intCast (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β) (z : β€) :
G.cyclicPointEquiv hsplit n (Multiplicative.ofAdd (z : ZMod (p ^ n))) =
(G.compatibleGenerators hsplit n).val ^ z :=
zmodMulEquivOfGenerator_apply_ofAdd_intCast _ _ z
/-- The cyclic coordinates respect the original transition inclusions. -/
theorem FiniteEtale.PDivisibleGroup.cyclicPointEquiv_compatibility (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).algebra) (n : β)
(a : ZMod (p ^ n)) :
G.cyclicPointEquiv hsplit n (Multiplicative.ofAdd a) β« G.inclusion n =
G.cyclicPointEquiv hsplit (n + 1) (Multiplicative.ofAdd (FiniteEtale.cyclicInclusion p n a)) := by
obtain β¨z, rflβ© := ZMod.intCast_surjective a
rw [FiniteEtale.PDivisibleGroup.cyclicPointEquiv_intCast, GrpObj.zpow_comp, G.compatibleGenerators_inclusion,
FiniteEtale.cyclicInclusion_intCast]
have hz : p β’ (z : ZMod (p ^ (n + 1))) = (((p : β€) * z : β€) : ZMod (p ^ (n + 1))) := by
simp only [nsmul_eq_mul, Int.cast_mul, Int.cast_natCast]
rw [hz, FiniteEtale.PDivisibleGroup.cyclicPointEquiv_intCast, zpow_mul, zpow_natCast]
end
end OAI.AlgebraicGeometry.GroupSchemes
|