math / data /lean /OAI /AlgebraicGeometry /Isogenies /NeighborCounting /ActionKernelComparison.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
11.5 kB
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