File size: 7,197 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
import OAI.AlgebraicGeometry.DivisorClass.Chern.Relative.CrossRepresentatives
import OAI.AlgebraicGeometry.DivisorClass.Chern.DiskTensorCycle

/-! # Cross Filling -/

namespace OAI.AlgebraicGeometry.DivisorClass.Chern.Relative.CrossFilling

noncomputable section

section

/-! The original relative homology cross class equals the class of any
displayed projected disk-cross-filling representative, including after
identifying its support with the actual puncture. -/

open _root_.CategoryTheory _root_.CategoryTheory.MonoidalCategory _root_.HomologicalComplex
open scoped TensorProduct

set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
set_option backward.defeqAttrib.useBackward true

theorem relativeClass_transport_projection (X : TopCat.{0}) (A A' : Set X) (h : A = A')
    (n : β„•) (B : (AlgebraicTopology.Cohomology.Singular.Evaluation.singularScalarChains (R := β„š) X).X n)
    (z : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š X A) n)
    (z' : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š X A') n)
    (hz : z.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š X A).f n B)
    (hz' : z'.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š X A').f n B) :
    eqToHom (congrArg (fun U => CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarHomology β„š X U n) h)
      (AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ n z) = AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ n z' := by
  subst A'
  have he : z = z' := Subtype.ext (hz.trans hz'.symm)
  subst z'
  rfl

theorem relativeDiskCrossClass_eq_filling (X Y : TopCat.{0}) (A : Set X) (B : Set Y)
    (U : Set (X Γ— Y)) (hU : HodgeConjecture.DegreeTwo.RelativeCrossSupport.Constructions.crossSupportComplement X Y A B = U) (q : β„•)
    (D : (AlgebraicTopology.Cohomology.Singular.Evaluation.singularScalarChains (R := β„š) X).X 2)
    (E : (AlgebraicTopology.Cohomology.Singular.Evaluation.singularScalarChains (R := β„š) Y).X q)
    (x : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š X A) 2)
    (y : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š Y B) q)
    (hx : x.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š X A).f 2 D)
    (hy : y.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š Y B).f q E)
    (z : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š (TopCat.of (X Γ— Y)) U) (2 + q))
    (hz : z.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š (TopCat.of (X Γ— Y)) U).f (2 + q)
      (Singular.CrossBoundary.singularCrossChain β„š X Y 2 q (2 + q) rfl D E)) :
    eqToHom (congrArg (fun V => CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarHomology β„š (TopCat.of (X Γ— Y)) V (2 + q)) hU)
      (HodgeConjecture.DegreeTwo.RelativeCrossNonvanishing.Constructions.relativeHomologyCrossClass X Y A B 2 q (AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ 2 x) (AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ q y)) =
      AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ (2 + q) z := by
  let t := DiskTensorCycle.diskTensorCycle (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š X A) (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š Y B) q x y
  rw [CrossRepresentatives.relativeHomologyCrossClass_of_tensor_cycle X Y A B 2 q x y t rfl]
  apply relativeClass_transport_projection (TopCat.of (X Γ— Y))
    (HodgeConjecture.DegreeTwo.RelativeCrossSupport.Constructions.crossSupportComplement X Y A B) U hU (2 + q)
    (Singular.CrossBoundary.singularCrossChain β„š X Y 2 q (2 + q) rfl D E) _ z _ hz
  change (HodgeConjecture.DegreeTwo.RelativeCrossProduct.Constructions.relativeSingularChainCross β„š X Y A B).f (2 + q)
    (ΞΉTensorObj (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š X A) (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š Y B) 2 q (2 + q) rfl
      (x.val βŠ—β‚œ[β„š] y.val)) = _
  rw [hx, hy]
  exact CrossRepresentatives.relativeSingularCross_quotient_representatives X Y A B 2 q D E

end

/-! Explicit degree transport for the original relative cross-filling comparison. -/

open _root_.CategoryTheory

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

theorem relativeDiskCrossClass_eq_filling_at (X Y : TopCat.{0}) (A : Set X) (B : Set Y)
    (U : Set (X Γ— Y)) (hU : HodgeConjecture.DegreeTwo.RelativeCrossSupport.Constructions.crossSupportComplement X Y A B = U) (q n : β„•) (hn : 2 + q = n)
    (D : (AlgebraicTopology.Cohomology.Singular.Evaluation.singularScalarChains (R := β„š) X).X 2)
    (E : (AlgebraicTopology.Cohomology.Singular.Evaluation.singularScalarChains (R := β„š) Y).X q)
    (x : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š X A) 2)
    (y : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š Y B) q)
    (hx : x.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š X A).f 2 D)
    (hy : y.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š Y B).f q E)
    (z : AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainCycles (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChains β„š (TopCat.of (X Γ— Y)) U) n)
    (hz : z.val = (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarChainProjection β„š (TopCat.of (X Γ— Y)) U).f n
      (Singular.CrossBoundary.singularCrossChain β„š X Y 2 q n hn D E)) :
    eqToHom (congrArg (CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarHomology β„š (TopCat.of (X Γ— Y)) U) hn)
      (eqToHom (congrArg (fun V => CycleClass.Geometric.RelativeScalarChains.Cycles.relativeScalarHomology β„š (TopCat.of (X Γ— Y)) V (2 + q)) hU)
        (HodgeConjecture.DegreeTwo.RelativeCrossNonvanishing.Constructions.relativeHomologyCrossClass X Y A B 2 q (AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ 2 x) (AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ q y))) =
      AlgebraicTopology.Cohomology.Singular.ChainRepresentatives.chainClass _ n z := by
  subst n
  exact relativeDiskCrossClass_eq_filling X Y A B U hU q D E x y hx hy z hz

end

end OAI.AlgebraicGeometry.DivisorClass.Chern.Relative.CrossFilling