File size: 7,653 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
import OAI.AlgebraicGeometry.CycleClass.Thom.PrincipalStepEuler
import OAI.AlgebraicGeometry.CycleClass.Thom.Finite.SectionStepCoefficients

/-! # Section Euler -/

namespace OAI.AlgebraicGeometry.CycleClass.Thom.Finite.SectionEuler.Constructions

noncomputable section

/-! The native local Euler recursion holds for an arbitrary finite
original cycle and its actual section step. Components away from the
point contribute zero on both sides. -/

open _root_.CategoryTheory _root_.AlgebraicGeometry _root_.TopologicalSpace RingTheory.Sequence
open scoped Classical

open OAI.AlgebraicGeometry.CycleClass.Thom.Local.Euler.Constructions OAI.AlgebraicGeometry.CycleClass.Thom.PrincipalStepEuler.Constructions OAI.AlgebraicGeometry.CycleClass.Thom.StalkPrimeQuotient.Constructions.SupportScheme OAI.AlgebraicGeometry.CycleClass.Thom.Section.CupPrincipalGeneral.Constructions.Step
open OAI.AlgebraicGeometry.CycleClass.Thom.Affine.SectionFunction.Constructions OAI.AlgebraicGeometry.CycleClass.Thom.Normalization.GoodSmoothMap.Constructions.AffineOpen OAI.AlgebraicGeometry.CycleClass.Thom.Normalization.AmbientMap.Constructions
open OAI.AlgebraicGeometry.CycleClass.Thom.Finite.CycleSectionClass.Constructions OAI.AlgebraicGeometry.CycleClass.Thom.Finite.SectionStepCoefficients.Constructions OAI.AlgebraicGeometry.CycleClass.Thom.Section.Step.Constructions OAI.AlgebraicGeometry.CycleClass.Thom.Section.AdmissibleLift.Constructions

set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false

variable (V : Foundations.Scheme.IntegralProjective.IntegralProjectiveVariety) (p : β„•) (B : V.carrier.Opens)
  (s : Ξ“((Normalization.GoodSmoothMap.Constructions.AffineOpen.affineBase B).left, ⊀)) (x : V.carrier) (hxB : x ∈ B)

theorem principalStep_euler_of_not_mem (D : Geometric.DimensionCycles.DimensionCycleSupport V p)
    [Nonempty ((Normalization.AmbientMap.Constructions.normalizationToAmbient V D.val).left ⁻¹ᡁ B)] (hs : Affine.SectionFunction.Constructions.parentSectionFunction D B s β‰  0)
    (hxD : x βˆ‰ (D.val : Set V.carrier)) (rs : List (V.carrier.presheaf.stalk x)) (d : β„•) :
    Local.Euler.Constructions.localCycleEuler V (p + 1) x rs d (Section.CupPrincipalGeneral.Constructions.Step.principalStep D B s hs) = 0 := by
  rw [Local.Euler.Constructions.localCycleEuler_eq_sum]
  apply Finset.sum_eq_zero
  intro C hC
  have hc := Finsupp.mem_support_iff.mp hC
  rw [Section.CupPrincipalGeneral.Constructions.Step.principalStep_coefficient] at hc
  have hCD := (Section.ClosedSupport.Constructions.Principal.principalCoefficient_support D B s C.val hc).1
  rw [Local.Euler.Constructions.supportEuler_of_not_mem V (p + 1) x rs d C (fun h => hxD (hCD h)), mul_zero]

theorem supportEuler_eq_principalStep (D : Geometric.DimensionCycles.DimensionCycleSupport V p)
    [Nonempty ((Normalization.AmbientMap.Constructions.normalizationToAmbient V D.val).left ⁻¹ᡁ B)] (hs : Affine.SectionFunction.Constructions.parentSectionFunction D B s β‰  0)
    (rs : List (V.carrier.presheaf.stalk x))
    (hr : IsWeaklyRegular (V.carrier.presheaf.stalk x)
      (V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs))
    (hm : βˆ€ a ∈ V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs,
      a ∈ IsLocalRing.maximalIdeal (V.carrier.presheaf.stalk x))
    (hi : βˆ€ hxD : x ∈ (D.val : Set V.carrier),
      PrimeSpectrum.zeroLocus (Ideal.ofList (V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs) :
        Set (V.carrier.presheaf.stalk x)) ∩
        Module.support (V.carrier.presheaf.stalk x) (StalkPrimeQuotient.Constructions.SupportScheme.quotientRing V.carrier D.val x hxD) βŠ†
          {IsLocalRing.closedPoint (V.carrier.presheaf.stalk x)})
    (d : β„•) (hd : rs.length ≀ d) :
    Local.Euler.Constructions.supportEuler V p x (V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs) d D =
      Local.Euler.Constructions.localCycleEuler V (p + 1) x rs d (Section.CupPrincipalGeneral.Constructions.Step.principalStep D B s hs) := by
  by_cases hxD : x ∈ (D.val : Set V.carrier)
  Β· exact (Local.Euler.Constructions.supportEuler_of_mem V p x _ d D hxD).trans
      (PrincipalStepEuler.Constructions.euler_eq_principalStep V D B s hs x hxD hxB rs hr hm (hi hxD) d hd)
  Β· exact (Local.Euler.Constructions.supportEuler_of_not_mem V p x _ d D hxD).trans
      (principalStep_euler_of_not_mem V p B s x D hs hxD rs d).symm

variable (U : Opens V.analyticSpace) {L : Type} (u : L β†’ U) (c : Geometric.DimensionCycles.RationalDimensionCycle V p)
  (hc : βˆ€ D : Geometric.DimensionCycles.DimensionCycleSupport V p, c D β‰  0 β†’
    (Subtype.val : U β†’ V.analyticSpace) ⁻¹' Set.range D.analyticInclusion βŠ† Set.range u)
  (hne : βˆ€ (D : Geometric.DimensionCycles.DimensionCycleSupport V p), c D β‰  0 β†’ Nonempty ((Normalization.AmbientMap.Constructions.normalizationToAmbient V D.val).left ⁻¹ᡁ B))
  (hs : βˆ€ (D : Geometric.DimensionCycles.DimensionCycleSupport V p) (hD : c D β‰  0), letI := hne D hD
    Affine.SectionFunction.Constructions.parentSectionFunction D B s β‰  0)

def originalPrincipalStepSum : Geometric.DimensionCycles.RationalDimensionCycle V (p + 1) :=
  βˆ‘ D : c.support, letI := hne D.val (Finsupp.mem_support_iff.mp D.property)
    c D.val β€’ Section.CupPrincipalGeneral.Constructions.Step.principalStep D.val B s (hs D.val (Finsupp.mem_support_iff.mp D.property))

theorem cycleSectionStep_eq_sum :
    CycleSectionClass.Constructions.cycleSectionStep V p B s U u c hc hne hs = originalPrincipalStepSum V p B s c hne hs := by
  rw [CycleSectionClass.Constructions.cycleSectionStep, Section.Step.Constructions.stepCycleMap, Section.AdmissibleLift.Constructions.admissibleCycle, Finsupp.linearCombination_mapDomain,
    SectionStepCoefficients.Constructions.linearCombination_nonzeroSubtype_eq_sum]
  rfl

theorem localCycleEuler_sectionStep (rs : List (V.carrier.presheaf.stalk x))
    (hr : IsWeaklyRegular (V.carrier.presheaf.stalk x)
      (V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs))
    (hm : βˆ€ a ∈ V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs,
      a ∈ IsLocalRing.maximalIdeal (V.carrier.presheaf.stalk x))
    (hi : βˆ€ (D : Geometric.DimensionCycles.DimensionCycleSupport V p), c D β‰  0 β†’ βˆ€ hxD : x ∈ (D.val : Set V.carrier),
      PrimeSpectrum.zeroLocus (Ideal.ofList (V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs) :
        Set (V.carrier.presheaf.stalk x)) ∩
        Module.support (V.carrier.presheaf.stalk x) (StalkPrimeQuotient.Constructions.SupportScheme.quotientRing V.carrier D.val x hxD) βŠ†
          {IsLocalRing.closedPoint (V.carrier.presheaf.stalk x)})
    (d : β„•) (hd : rs.length ≀ d) :
    Local.Euler.Constructions.localCycleEuler V p x (V.carrier.presheaf.germ B x hxB (B.topIso.hom s) :: rs) d c =
      Local.Euler.Constructions.localCycleEuler V (p + 1) x rs d (CycleSectionClass.Constructions.cycleSectionStep V p B s U u c hc hne hs) := by
  rw [cycleSectionStep_eq_sum, originalPrincipalStepSum, map_sum]
  refine (Local.Euler.Constructions.localCycleEuler_eq_sum V p x _ d c).trans ?_
  refine (Finset.sum_coe_sort c.support (fun D => c D * Local.Euler.Constructions.supportEuler V p x _ d D)).symm.trans ?_
  apply Finset.sum_congr rfl
  intro D _
  let := hne D.val (Finsupp.mem_support_iff.mp D.property)
  rw [map_smul]
  exact congrArg (fun a : β„š => c D.val β€’ a)
    (supportEuler_eq_principalStep V p B s x hxB D.val (hs D.val (Finsupp.mem_support_iff.mp D.property))
      rs hr hm (hi D.val (Finsupp.mem_support_iff.mp D.property)) d hd)

end

end OAI.AlgebraicGeometry.CycleClass.Thom.Finite.SectionEuler.Constructions