File size: 2,998 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
import OAI.AlgebraicGeometry.CycleClass.Thom.Intersection.NormalPair
import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas

/-! # Normal Dimension -/

namespace OAI.AlgebraicGeometry.CycleClass.Thom.Intersection.NormalDimension.Constructions

noncomputable section

/-! The tangent model for a transverse intersection has its expected
dimension. Rank-nullity removes the choice of a kernel identification
from the simultaneous normal-pair construction. -/

open scoped ContDiff _root_.Topology _root_.Manifold

open OAI.AlgebraicGeometry.CycleClass.Thom.Intersection.NormalPair.Constructions

variable {M L T N E F D G : Type} [TopologicalSpace N]
  [NormedAddCommGroup E] [NormedSpace β„‚ E] [FiniteDimensional β„‚ E]
  [NormedAddCommGroup F] [NormedSpace β„‚ F]
  [NormedAddCommGroup D] [NormedSpace β„‚ D] [FiniteDimensional β„‚ D]
  [NormedAddCommGroup G] [NormedSpace β„‚ G] [ChartedSpace G N]
  {p q : β„•} {u : M β†’ N} {v : L β†’ N} {x : M} {y : L}
  (P : ComplexPoints.Analytic.NormalPairRecenter.ImmersionNormalPair E (Fin p β†’ β„‚) u x)
  (Q : ComplexPoints.Analytic.NormalPairRecenter.ImmersionNormalPair F (Fin q β†’ β„‚) v y)
  (e : ((Fin p β†’ β„‚) Γ— (Fin q β†’ β„‚)) ≃L[β„‚] (Fin (p + q) β†’ β„‚))

theorem exists_intersection_normalPair_of_dimension (w : T β†’ N) (z : T)
    (hxy : u x = v y) (hxz : u x = w z)
    (hw : Set.range w = Set.range u ∩ Set.range v)
    (hP : P.ambientChart.MDifferentiable π“˜(β„‚, G) π“˜(β„‚, E Γ— (Fin p β†’ β„‚)))
    (hPi : ContMDiffOn π“˜(β„‚, E Γ— (Fin p β†’ β„‚)) π“˜(β„‚, G) Ο‰
      P.ambientChart.symm P.ambientChart.target)
    (hQ : ContMDiffOn π“˜(β„‚, G) π“˜(β„‚, F Γ— (Fin q β†’ β„‚)) Ο‰
      Q.ambientChart Q.ambientChart.source)
    (hs : Function.Surjective (fderiv β„‚ (NormalPair.Constructions.intersectionEquations P Q e) 0))
    (hd : Module.finrank β„‚ D + (p + q) = Module.finrank β„‚ G) :
    βˆƒ R : ComplexPoints.Analytic.NormalPairRecenter.ImmersionNormalPair D (Fin (p + q) β†’ β„‚) w z,
      R.neighborhood βŠ† P.neighborhood ∩ Q.neighborhood ∧
      R.ambientChart.MDifferentiable π“˜(β„‚, G) π“˜(β„‚, D Γ— (Fin (p + q) β†’ β„‚)) ∧
      βˆ€ a : R.neighborhood, R.normalCoordinate a =
        e ((P.ambientChart a.val).2, (Q.ambientChart a.val).2) := by
  have hdim := (hP.mfderiv P.point_mem_source).toLinearEquiv.finrank_eq
  change Module.finrank β„‚ G = Module.finrank β„‚ (E Γ— (Fin p β†’ β„‚)) at hdim
  have hrank := (fderiv β„‚ (NormalPair.Constructions.intersectionEquations P Q e) 0).toLinearMap.finrank_range_add_finrank_ker
  rw [LinearMap.range_eq_top.mpr hs, finrank_top, Module.finrank_fin_fun] at hrank
  have hk : Module.finrank β„‚ (fderiv β„‚ (NormalPair.Constructions.intersectionEquations P Q e) 0).ker =
      Module.finrank β„‚ D := by omega
  exact NormalPair.Constructions.exists_intersection_normalPair P Q e w z hxy hxz hw hP hPi hQ hs
    (ContinuousLinearEquiv.ofFinrankEq hk)

end

end OAI.AlgebraicGeometry.CycleClass.Thom.Intersection.NormalDimension.Constructions