File size: 11,502 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 | import OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionPairingSourceData
import OAI.AlgebraicGeometry.Isogenies.NeighborCounting.Parameter.KernelIsoComparison
/-! # Action Kernel Comparison -/
namespace OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionKernelComparison.PairingSourceData
noncomputable section
/-! Transport a complete coefficient kernel at the coherent polarized
action-source index. Block squares and pairings are constructed fields;
the active-family equality is the only remaining comparison input. -/
open _root_.CategoryTheory _root_.AlgebraicGeometry
open scoped _root_.CategoryTheory.MonObj _root_.CategoryTheory.Obj
open OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionBlockPairingIso.Polarized
open OAI.AlgebraicGeometry.Isogenies.NeighborCounting.Parameter.KernelIsoComparison
local instance actionKernelPullbackMonoidal {X Y : Scheme} (h : X βΆ Y) :
(Over.pullback h).Monoidal := Over.instBraidedPullback.toMonoidal
variable {E : Type} [Field E] [NumberField E] [Algebra β E] [NumberField.IsCMField E]
{S T Q : Scheme} [IsReduced S] [IsLocallyNoetherian S]
[IsReduced T] [IsLocallyNoetherian T] [IsReduced Q] [IsLocallyNoetherian Q]
{dim level : β} {Ξ΄ : Fin dim β β}
{A : PELModuli.IntegralModel.PEL.Has.PolarizedActionData E dim Ξ΄ level S}
{B : PELModuli.IntegralModel.PEL.Has.PolarizedActionData E dim Ξ΄ level T} {f : Q βΆ S} {g : Q βΆ T}
def _root_.OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionPairingSourceData.ActionPairingSource.fullKernelComparison (C : ActionPairingSourceData.ActionPairingSource A B f g)
(n : β) (hn : 0 < n) {s : β}
(chosen opposite : Fin s β NumberField.RingOfIntegers E)
(D : β v, C.BlockIso n (chosen v)) (H : β v, C.BlockIso n (opposite v))
(active : Fin s) (c : Fin s β Bool)
(Fβ : AbelianScheme.TorsionQuotient.SubgroupFunctor.RelativeSubgroup A.polarized.abelian.scheme (Over.mk f))
(Fβ : AbelianScheme.TorsionQuotient.SubgroupFunctor.RelativeSubgroup B.polarized.abelian.scheme (Over.mk g)) :=
PLift.up (Parameter.KernelIsoComparison.parameter_fullKernel_iso_comparison f g
(Grp.mk A.polarized.abelian.scheme) (Grp.mk B.polarized.abelian.scheme) C.groupIso
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (A.action.map (chosen v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (A.action.map (opposite v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (B.action.map (chosen v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (B.action.map (opposite v))))
(fun v => (D v).iso) (fun v => (H v).iso)
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (A.action.map (chosen v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (B.action.map (chosen v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (A.action.map (opposite v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (B.action.map (opposite v))))
(fun v => ActionBlockPairingIso.Polarized.canonicalActionBlockPairing A.polarized A.action n hn (chosen v) (opposite v))
(fun v => ActionBlockPairingIso.Polarized.canonicalActionBlockPairing B.polarized B.action n hn (chosen v) (opposite v))
active c Fβ Fβ (fun v => (D v).inclusion) (fun v => (H v).inclusion)
(fun v => (C.blockIsoPairing n hn (chosen v) (opposite v) (D v) (H v)).down))
def _root_.OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionPairingSourceData.ActionPairingSource.fullKernelComparisonFromComponents
(C : ActionPairingSourceData.ActionPairingSource A B f g)
(n : β) (hn : 0 < n) {s : β}
(chosen opposite : Fin s β NumberField.RingOfIntegers E)
(D : β v, (Over.pullback f).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (A.action.map (chosen v)))) β
(Over.pullback g).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (B.action.map (chosen v)))))
(H : β v, (Over.pullback f).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (A.action.map (opposite v)))) β
(Over.pullback g).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (B.action.map (opposite v)))))
(hD : β v, (D v).hom.hom.hom β«
(Over.pullback g).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (B.action.map (chosen v))) =
(Over.pullback f).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (A.action.map (chosen v))) β« C.map)
(hH : β v, (H v).hom.hom.hom β«
(Over.pullback g).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (B.action.map (opposite v))) =
(Over.pullback f).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (A.action.map (opposite v))) β« C.map)
(active : Fin s) (c : Fin s β Bool)
(Fβ : AbelianScheme.TorsionQuotient.SubgroupFunctor.RelativeSubgroup A.polarized.abelian.scheme (Over.mk f))
(Fβ : AbelianScheme.TorsionQuotient.SubgroupFunctor.RelativeSubgroup B.polarized.abelian.scheme (Over.mk g)) :=
PLift.up (Parameter.KernelIsoComparison.parameter_fullKernel_iso_comparison f g
(Grp.mk A.polarized.abelian.scheme) (Grp.mk B.polarized.abelian.scheme) C.groupIso
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (A.action.map (chosen v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (A.action.map (opposite v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (B.action.map (chosen v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (B.action.map (opposite v))))
D H
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (A.action.map (chosen v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (B.action.map (chosen v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (A.action.map (opposite v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (B.action.map (opposite v))))
(fun v => ActionBlockPairingIso.Polarized.canonicalActionBlockPairing A.polarized A.action n hn (chosen v) (opposite v))
(fun v => ActionBlockPairingIso.Polarized.canonicalActionBlockPairing B.polarized B.action n hn (chosen v) (opposite v))
active c Fβ Fβ hD hH
(fun v => (C.blockPairingComparison n hn (chosen v) (opposite v)).down
(D v).hom (H v).hom (hD v) (hH v)))
def _root_.OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionKernelComparison.fullKernelComparisonFromPolarizedActions
(Aβ : AbelianModuli.HilbertConstruction.PolarizationData.PolarizedAbelianWithFullLevel dim Ξ΄ level S)
(Bβ : AbelianModuli.HilbertConstruction.PolarizationData.PolarizedAbelianWithFullLevel dim Ξ΄ level T)
(Ο : AbelianModuli.ReferenceFamily.ActionData.IntegralAction (NumberField.RingOfIntegers E) Aβ.abelian)
(Ο : AbelianModuli.ReferenceFamily.ActionData.IntegralAction (NumberField.RingOfIntegers E) Bβ.abelian)
(f : Q βΆ S) (g : Q βΆ T)
(e : AbelianModuli.HilbertConstruction.Moduli.Isomorphisms.LevelPreservingIso (Aβ.pullback f) (Bβ.pullback g))
(groupIso : (Over.pullback f).mapGrp.obj (Grp.mk Aβ.abelian.scheme) β
(Over.pullback g).mapGrp.obj (Grp.mk Bβ.abelian.scheme))
(map_eq : e.abelian.hom = groupIso.hom.hom.hom)
(n : β) (hn : 0 < n) {s : β}
(chosen opposite : Fin s β NumberField.RingOfIntegers E)
(D : β v, (Over.pullback f).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (chosen v)))) β
(Over.pullback g).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (chosen v)))))
(H : β v, (Over.pullback f).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (opposite v)))) β
(Over.pullback g).mapGrp.obj
(Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (opposite v)))))
(hD : β v, (D v).hom.hom.hom β«
(Over.pullback g).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (chosen v))) =
(Over.pullback f).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (chosen v))) β« groupIso.hom.hom.hom)
(hH : β v, (H v).hom.hom.hom β«
(Over.pullback g).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (opposite v))) =
(Over.pullback f).map (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (opposite v))) β« groupIso.hom.hom.hom)
(active : Fin s) (c : Fin s β Bool)
(Fβ : AbelianScheme.TorsionQuotient.SubgroupFunctor.RelativeSubgroup Aβ.abelian.scheme (Over.mk f))
(Fβ : AbelianScheme.TorsionQuotient.SubgroupFunctor.RelativeSubgroup Bβ.abelian.scheme (Over.mk g)) :=
PLift.up (Parameter.KernelIsoComparison.parameter_fullKernel_iso_comparison f g
(Grp.mk Aβ.abelian.scheme) (Grp.mk Bβ.abelian.scheme) groupIso
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (chosen v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (opposite v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (chosen v))))
(fun v => Grp.mk (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlock n (Ο.map (opposite v))))
D H
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (chosen v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (chosen v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (opposite v))))
(fun v => Grp.ofHom (AbelianScheme.IsogenyQuotient.OppositeKernel.Construction.torsionBlockInclusion n (Ο.map (opposite v))))
(fun v => ActionBlockPairingIso.Polarized.canonicalActionBlockPairing Aβ Ο n hn (chosen v) (opposite v))
(fun v => ActionBlockPairingIso.Polarized.canonicalActionBlockPairing Bβ Ο n hn (chosen v) (opposite v))
active c Fβ Fβ hD hH
(fun v => ActionBlockPairingIso.Polarized.polarizedActionBlockPairing_iso
Aβ Bβ Ο Ο f g e groupIso.hom.hom.hom map_eq n hn (chosen v) (opposite v)
(D v).hom (H v).hom (hD v) (hH v)))
end
end OAI.AlgebraicGeometry.Isogenies.NeighborCounting.ActionKernelComparison.PairingSourceData
|