File size: 7,483 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
import OAI.AlgebraicGeometry.AbelianModuli.ReferenceFamily.Polarization.PairSymmetry
import OAI.AlgebraicGeometry.AbelianModuli.ReferenceFamily.PoincareDualPairCoordinates
import OAI.AlgebraicGeometry.AbelianModuli.ReferenceFamily.Polarization.TranslationKernel
import OAI.AlgebraicGeometry.AbelianModuli.HilbertConstruction.Polarized.GraphBundles

/-! # Graph Translation Kernel -/

namespace OAI.AlgebraicGeometry.AbelianModuli.ReferenceFamily.Polarization.GraphTranslationKernel

noncomputable section

/-! The actual polarization graph bundle has infinitesimal
translation class equal to twice the original polarization tangent
class. The proof expands the original multiplicative Poincare pairing. -/

open _root_.CategoryTheory _root_.CategoryTheory.Limits _root_.AlgebraicGeometry
open _root_.CategoryTheory.MonoidalCategory _root_.CategoryTheory.CartesianMonoidalCategory
open scoped _root_.CategoryTheory.MonObj

set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
open OAI.AlgebraicGeometry.AbelianModuli.HilbertConstruction.Polarized.GraphBundles

local instance polarizationGraphPicardGroup (X : Scheme.{0}) : CommGroup (HilbertConstruction.Line.Bundles.LineBundle.IsoClass X) :=
  Quotients.FiniteDescent.LineBundleDual.Construction.LineBundlePicard.instCommGroupIsoClass

variable {g N : β„•} {Ξ΄ : Fin g β†’ β„•} (A : HilbertConstruction.PolarizationData.PolarizedAbelianWithFullLevel g Ξ΄ N Foundations.Scheme.ProjectiveSpace.complexBase)

theorem polarizationGraph_translation_class (t : DualOpen.Lifts.DualSchemePoints A.abelian.scheme 1) :
    HilbertConstruction.Line.Bundles.LineBundle.classOf (A.graphBundle.pullback (Intrinsic.InfinitesimalTranslation.dualInfinitesimalTranslation A.abelian.scheme t).left) =
      RepresentationTheory.Theta.Geometric.ParameterizedPicardClass.parameterLineClass A.dual.poincare (t.val ≫ A.polarization.isogeny.hom) ^ 2 *
        HilbertConstruction.Line.Bundles.LineBundle.classOf (A.graphBundle.pullback (snd (LieRanks.dualNumberTest β„‚) A.abelian.scheme).left) := by
  let T := LieRanks.dualNumberTest β„‚ βŠ— A.abelian.scheme
  let u : T ⟢ A.abelian.scheme := fst (LieRanks.dualNumberTest β„‚) A.abelian.scheme ≫ t.val
  let b : T ⟢ A.abelian.scheme := snd (LieRanks.dualNumberTest β„‚) A.abelian.scheme
  let p := A.polarization.isogeny.hom
  let B := A.dual.poincarePairClass T
  let q := RepresentationTheory.Theta.Geometric.ParameterizedPicardClass.parameterLineClass A.dual.poincare (t.val ≫ p)
  have hβ‚€ : B (u ≫ p) u = 1 := by
    change A.dual.poincarePairClass T ((fst (LieRanks.dualNumberTest β„‚) A.abelian.scheme ≫ t.val) ≫ p) u = 1
    rw [Category.assoc]
    exact PoincareDualPairCoordinates.poincareDualBasePair_trivial A.abelian A.dual (t.val ≫ p) t.val
  have hcross : B (u ≫ p) b = q := by
    change A.dual.poincarePairClass T ((fst (LieRanks.dualNumberTest β„‚) A.abelian.scheme ≫ t.val) ≫ p) b = q
    rw [Category.assoc]
    exact (PoincareDualPairCoordinates.poincareParameterLineClass_eq_pair A.abelian A.dual (t.val ≫ p)).symm
  have hsymm : B (b ≫ p) u = B (u ≫ p) b := PairSymmetry.polarizationPair_class_symm A T b u
  have hb : HilbertConstruction.Line.Bundles.LineBundle.classOf (A.graphBundle.pullback b.left) = B (b ≫ p) b :=
    Quotient.sound ⟨A.dual.poincareGraphPullbackPairIso p b⟩
  calc
    _ = B ((u * b) ≫ p) (u * b) :=
      Quotient.sound ⟨A.dual.poincareGraphPullbackPairIso p (u * b)⟩
    _ = (B (u ≫ p) u * B (u ≫ p) b) * (B (b ≫ p) u * B (b ≫ p) b) := by
      rw [MonObj.mul_comp, B.map_mul]
      change B (u ≫ p) (u * b) * B (b ≫ p) (u * b) = _
      rw [(B (u ≫ p)).map_mul, (B (b ≫ p)).map_mul]
    _ = q ^ 2 * B (b ≫ p) b := by
      rw [hβ‚€, hsymm, hcross, one_mul, pow_two]
      exact (mul_assoc q q (B (b ≫ p) b)).symm
    _ = _ := congrArg (fun z => q ^ 2 * z) hb.symm

theorem polarizationGraphTranslationKernel_eq (t : DualOpen.Lifts.DualSchemePoints A.abelian.scheme 1) :
    Intrinsic.InfinitesimalTranslation.dualTranslationLineKernel A.abelian.scheme A.graphBundle t =
      Dual.ParameterLineKernel.dualParameterLineKernel A.dual.poincare A.dual.normalizedAtDualZero.some
        (Dual.ParameterPoincareSquare.dualPointPostcompose A.polarization.isogeny.hom t) ^ 2 := by
  apply Subtype.ext
  calc
    _ = HilbertConstruction.Line.Bundles.LineBundle.classOf (A.graphBundle.pullback
        (Intrinsic.InfinitesimalTranslation.dualInfinitesimalTranslation A.abelian.scheme t).left) /
        HilbertConstruction.Line.Bundles.LineBundle.classOf (A.graphBundle.pullback
          (snd (LieRanks.dualNumberTest β„‚) A.abelian.scheme).left) :=
      DualLine.PullbackDifference.dualLinePullbackDifferenceKernel_class A.abelian.scheme
        (Intrinsic.InfinitesimalTranslation.dualInfinitesimalTranslation A.abelian.scheme t).left
        (snd (LieRanks.dualNumberTest β„‚) A.abelian.scheme).left
        (Intrinsic.InfinitesimalTranslation.dualInfinitesimalTranslation_equal_reduction A.abelian.scheme t) A.graphBundle
    _ = RepresentationTheory.Theta.Geometric.ParameterizedPicardClass.parameterLineClass A.dual.poincare (t.val ≫ A.polarization.isogeny.hom) ^ 2 :=
      (eq_div_of_mul_eq' (polarizationGraph_translation_class A t).symm).symm
    _ = _ := rfl

local instance graphTranslationIntegral {n : β„•} (G : HilbertConstruction.Abelian.Schemes.AbelianScheme n Foundations.Scheme.ProjectiveSpace.complexBase) :
    IsIntegral G.scheme.left := Abelian.IntrinsicAdapter.AbelianIntrinsicAdapter.carrier_integral G
local instance graphTranslationDiagonal :
    IsAffineHom (pullback.diagonal (terminal.from (LieRanks.dualNumberTest β„‚ βŠ— A.abelian.scheme).left)) :=
  Dual.AffineDiagonal.dualFamily_affineDiagonal A.abelian.scheme
local instance graphTranslationH1Module : Module β„‚ (SheafCohomology.AffineH.Projective.H (HilbertConstruction.Line.Bundles.structureModule A.abelian.scheme.left) 1) :=
  StructureComplexScalars.structureH1ComplexModule A.abelian.scheme

theorem polarizationGraphTranslationClass_native
    (v : Fin (Betti.AffineDimension.Realization.functionFieldDifferentialDimension A.abelian.scheme.hom) β†’ β„‚) :
    DualLine.ClassKernel.dualLineKernelCohomology A.abelian.scheme
      (Intrinsic.InfinitesimalTranslation.dualTranslationLineKernel A.abelian.scheme A.graphBundle
        (Intrinsic.SchemeDualTangent.nativeSchemeTangentDualEquiv A.abelian.scheme 1 v)) =
      (2 : β„‚) β€’ Polarized.TangentEquiv.polarizedStructureH1TangentEquiv A v := by
  let t := Intrinsic.SchemeDualTangent.nativeSchemeTangentDualEquiv A.abelian.scheme 1 v
  let q := Dual.ParameterLineKernel.dualParameterLineKernel A.dual.poincare A.dual.normalizedAtDualZero.some
    (Dual.ParameterPoincareSquare.dualPointPostcompose A.polarization.isogeny.hom t)
  have hq : DualLine.ClassKernel.dualLineKernelCohomology A.abelian.scheme q = Polarized.TangentEquiv.polarizedStructureH1TangentEquiv A v :=
    (congrArg (DualLine.ClassKernel.dualLineKernelCohomology A.abelian.scheme) (TranslationKernel.polarizationLineTranslationKernel_eq A t)).symm.trans
      (TranslationKernel.polarizationLineTranslationClass_native A v)
  rw [polarizationGraphTranslationKernel_eq, pow_two, DualLine.ClassKernel.dualLineKernelCohomology_mul, hq]
  exact (two_smul β„‚ (Polarized.TangentEquiv.polarizedStructureH1TangentEquiv A v)).symm

end

end OAI.AlgebraicGeometry.AbelianModuli.ReferenceFamily.Polarization.GraphTranslationKernel