File size: 7,787 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 | import OAI.AlgebraicGeometry.GroupSchemes.CharacterEvaluation
import OAI.AlgebraicGeometry.GroupSchemes.CharacterGenerators
/-! # Multiplicative Classification -/
namespace OAI.AlgebraicGeometry.GroupSchemes
noncomputable section
/-! The multiplicative branch as a natural isomorphism of the original geometric tower. -/
open _root_.CategoryTheory _root_.AlgebraicGeometry Opposite WithConv _root_.CategoryTheory.MonObj
section
universe u
variable {k : Type u} [Field k] [IsAlgClosed k]
/-- A generating coordinate character identifies every affine-valued point with a root of unity. -/
def FiniteEtale.FiniteCommGroupScheme.characterRootsEquiv (G : FiniteEtale.FiniteCommGroupScheme k)
[Algebra.IsFiniteSplit k G.cartierDual.algebra]
(t : G.characterGroup) (N : β) (hgen : β x : G.characterGroup, x β Subgroup.zpowers t)
(horder : orderOf t = N) (R : CommAlgCat.{u} k) :
G.points.obj R β* rootsOfUnity N R :=
(G.coordinatePoints R).symm.trans
(@CharacterEvaluation.FiniteEtale.pointsRootsEquiv k G.algebra _ _ G.coordinateHopf
R _ _ G.characterValue_span t N hgen horder)
/-- This is the evaluation map on the chosen coordinate character. -/
theorem FiniteEtale.FiniteCommGroupScheme.characterRootsEquiv_apply (G : FiniteEtale.FiniteCommGroupScheme k)
[Algebra.IsFiniteSplit k G.cartierDual.algebra]
(t : G.characterGroup) (N : β) (hgen : β x : G.characterGroup, x β Subgroup.zpowers t)
(horder : orderOf t = N) (R : CommAlgCat.{u} k) (f : G.algebra ββ[k] R) :
((G.characterRootsEquiv t N hgen horder R (G.coordinatePoints R (toConv f))).val : R) =
f (G.characterValue t) := by
let : Algebra k G.algebra := G.coordinateHopf.toAlgebra
let := G.coordinateHopf
change ((CharacterEvaluation.FiniteEtale.pointsRootsEquiv k G.algebra R
G.characterValue_span t N hgen horder
((G.coordinatePoints R).symm (G.coordinatePoints R (toConv f)))).val : R) = _
rw [MulEquiv.symm_apply_apply]
exact @CharacterEvaluation.FiniteEtale.pointsRootsEquiv_apply k G.algebra _ _
G.coordinateHopf R _ _ G.characterValue_span t N hgen horder (toConv f)
/-- Character evaluation is natural under every homomorphism of affine test algebras. -/
theorem FiniteEtale.FiniteCommGroupScheme.characterRootsEquiv_naturality (G : FiniteEtale.FiniteCommGroupScheme k)
[Algebra.IsFiniteSplit k G.cartierDual.algebra]
(t : G.characterGroup) (N : β) (hgen : β x : G.characterGroup, x β Subgroup.zpowers t)
(horder : orderOf t = N) {R S : CommAlgCat.{u} k} (a : R βΆ S) (x : G.points.obj R) :
G.characterRootsEquiv t N hgen horder S (G.points.map a x) =
restrictRootsOfUnity a.hom N (G.characterRootsEquiv t N hgen horder R x) := by
obtain β¨f, rflβ© := (G.coordinatePoints R).surjective x
apply Subtype.ext
apply Units.ext
change ((G.characterRootsEquiv t N hgen horder S
((algSpec (CommRingCat.of k)).map a.op β« G.coordinatePoints R f)).val : S) =
a.hom ((G.characterRootsEquiv t N hgen horder R (G.coordinatePoints R f)).val : R)
rw [β G.coordinatePoints_precomp a f.ofConv]
exact (G.characterRootsEquiv_apply t N hgen horder S (a.hom.comp f.ofConv)).trans
(congrArg a.hom (G.characterRootsEquiv_apply t N hgen horder R f.ofConv)).symm
omit [IsAlgClosed k] in
/-- Coordinate restriction evaluates a character after a geometric morphism. -/
theorem FiniteEtale.FiniteCommGroupScheme.characterValue_map {G H : FiniteEtale.FiniteCommGroupScheme k}
(f : G.scheme βΆ H.scheme) [IsMonHom f] (t : H.characterGroup) :
G.characterValue (FiniteEtale.FiniteCommGroupScheme.characterMap f t) = FiniteEtale.FiniteCommGroupScheme.coordinateMap f (H.characterValue t) := rfl
end
universe u
variable {k : Type u} [Field k] [IsAlgClosed k]
variable {p : β} [Fact p.Prime] [CharP k p]
/-- The multiplicative identification at a given level and affine algebra. -/
def FiniteEtale.PDivisibleGroup.multiplicativeLevelPointEquiv (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).cartierDual.algebra)
(n : β) (R : CommAlgCat.{u} k) :
(G.level n).points.obj R β* (FiniteEtale.multiplicativeLevel k p n).obj R := by
have := hsplit n
exact (G.level n).characterRootsEquiv (G.compatibleCharacters hsplit n).val (p ^ n)
(G.compatibleCharacters_generate hsplit n) (G.compatibleCharacters hsplit n).property R
/-- Naturality of the multiplicative identification on all affine algebras. -/
def FiniteEtale.PDivisibleGroup.multiplicativeLevelPointIso (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).cartierDual.algebra) (n : β) :
(G.level n).points β
FiniteEtale.multiplicativeLevel k p n :=
NatIso.ofComponents (fun R => (G.multiplicativeLevelPointEquiv hsplit n R).toCommGrpIso) (by
intro R S a
apply CommGrpCat.hom_ext
apply MonoidHom.ext
intro x
have := hsplit n
exact (G.level n).characterRootsEquiv_naturality (G.compatibleCharacters hsplit n).val
(p ^ n) (G.compatibleCharacters_generate hsplit n)
(G.compatibleCharacters hsplit n).property a x)
/-- Split Cartier-dual levels give the standard multiplicative tower, with original transitions. -/
def FiniteEtale.PDivisibleGroup.multiplicativeTowerIso (G : FiniteEtale.PDivisibleGroup k p 1)
(hsplit : β n, Algebra.IsFiniteSplit k (G.level n).cartierDual.algebra) :
FiniteEtale.GroupTower.Iso k (G.points k) (FiniteEtale.multiplicativeTower k p) where
levelIso := G.multiplicativeLevelPointIso hsplit
compatibility n := by
apply NatTrans.ext
funext R
apply CommGrpCat.hom_ext
apply MonoidHom.ext
intro x
have := hsplit n
have := hsplit (n + 1)
obtain β¨f, rflβ© := ((G.level n).coordinatePoints R).surjective x
apply Subtype.ext
apply Units.ext
change (((G.level (n + 1)).characterRootsEquiv
(G.compatibleCharacters hsplit (n + 1)).val (p ^ (n + 1))
(G.compatibleCharacters_generate hsplit (n + 1))
(G.compatibleCharacters hsplit (n + 1)).property R
((G.level n).coordinatePoints R f β« G.inclusion n)).val : R) =
(((G.level n).characterRootsEquiv (G.compatibleCharacters hsplit n).val (p ^ n)
(G.compatibleCharacters_generate hsplit n) (G.compatibleCharacters hsplit n).property R
((G.level n).coordinatePoints R f)).val : R)
rw [β FiniteEtale.FiniteCommGroupScheme.coordinatePoints_postcomp (G.inclusion n) R f.ofConv]
have hvalue := (FiniteEtale.FiniteCommGroupScheme.characterValue_map (G.inclusion n)
(G.compatibleCharacters hsplit (n + 1)).val).symm.trans
(congrArg (G.level n).characterValue (G.compatibleCharacters_restriction hsplit n))
exact ((G.level (n + 1)).characterRootsEquiv_apply
(G.compatibleCharacters hsplit (n + 1)).val (p ^ (n + 1))
(G.compatibleCharacters_generate hsplit (n + 1))
(G.compatibleCharacters hsplit (n + 1)).property R
(f.ofConv.comp (FiniteEtale.FiniteCommGroupScheme.coordinateMap (G.inclusion n)))).trans
((congrArg f.ofConv hvalue).trans ((G.level n).characterRootsEquiv_apply
(G.compatibleCharacters hsplit n).val (p ^ n)
(G.compatibleCharacters_generate hsplit n) (G.compatibleCharacters hsplit n).property R
f.ofConv).symm)
/-- A connected first level gives the full standard multiplicative tower on all affine algebras. -/
theorem FiniteEtale.PDivisibleGroup.multiplicative_classification_of_first_local (G : FiniteEtale.PDivisibleGroup k p 1)
(hfirst : IsLocalRing (G.level 1).algebra) :
Nonempty (FiniteEtale.GroupTower.Iso k (G.points k) (FiniteEtale.multiplicativeTower k p)) :=
β¨G.multiplicativeTowerIso (G.dual_split_of_first_local hfirst)β©
end
end OAI.AlgebraicGeometry.GroupSchemes
|