File size: 3,482 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
import OAI.AlgebraicGeometry.DivisorClass.Chern.Complex.LinearOpenPullback
import OAI.AlgebraicGeometry.DivisorClass.Chern.ScalarDolbeaultCommutation

/-! # Linear Pullback Laws -/

namespace OAI.AlgebraicGeometry.DivisorClass.Chern.Complex.LinearPullbackLaws

noncomputable section

/-! Actual complex-linear open pullbacks compose, invert, and preserve scalar zero-forms. -/

open _root_.ContinuousAlternatingMap _root_.TopologicalSpace Set
open scoped ContDiff

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

variable {E F G : Type}
  [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedSpace β„‚ E] [IsScalarTower ℝ β„‚ E]
  [NormedAddCommGroup F] [NormedSpace ℝ F] [NormedSpace β„‚ F] [IsScalarTower ℝ β„‚ F]
  [NormedAddCommGroup G] [NormedSpace ℝ G] [NormedSpace β„‚ G] [IsScalarTower ℝ β„‚ G]
  {U : Opens E} {V : Opens F} {W : Opens G} {n : β„•}

theorem complexLinearOpenPullback_comp (L : E β†’L[β„‚] F) (K : F β†’L[β„‚] G)
    (hL : MapsTo L (U : Set E) (V : Set F)) (hK : MapsTo K (V : Set F) (W : Set G))
    (a : Analysis.DifferentialForms.Manifold.OpenD.SmoothOpenForm W n) :
    LinearOpenPullback.complexLinearOpenPullback L hL (LinearOpenPullback.complexLinearOpenPullback K hK a) =
      LinearOpenPullback.complexLinearOpenPullback (K.comp L) (hK.comp hL) a := by
  apply Analysis.DifferentialForms.Manifold.OpenD.SmoothOpenForm.ext
  intro x
  rw [LinearOpenPullback.complexLinearOpenPullback_apply, LinearOpenPullback.complexLinearOpenPullback_apply, LinearOpenPullback.complexLinearOpenPullback_apply]
  ext v
  rfl

theorem complexLinearOpenPullback_inverse (e : E ≃L[β„‚] F)
    (h : MapsTo e (U : Set E) (V : Set F)) (hi : MapsTo e.symm (V : Set F) (U : Set E))
    (a : Analysis.DifferentialForms.Manifold.OpenD.SmoothOpenForm V n) :
    LinearOpenPullback.complexLinearOpenPullback e.symm.toContinuousLinearMap hi
      (LinearOpenPullback.complexLinearOpenPullback e.toContinuousLinearMap h a) = a := by
  apply Analysis.DifferentialForms.Manifold.OpenD.SmoothOpenForm.ext
  intro x
  rw [LinearOpenPullback.complexLinearOpenPullback_apply, LinearOpenPullback.complexLinearOpenPullback_apply]
  ext v
  change a ⟨e (e.symm x), h (hi x.property)⟩ (fun i => e (e.symm (v i))) = a x v
  simp only [e.apply_symm_apply]

theorem complexLinearOpenPullback_injective (e : E ≃L[β„‚] F)
    (h : MapsTo e (U : Set E) (V : Set F)) (hi : MapsTo e.symm (V : Set F) (U : Set E)) :
    Function.Injective (LinearOpenPullback.complexLinearOpenPullback (n := n) e.toContinuousLinearMap h) := by
  intro a b hab
  have hback := congrArg (LinearOpenPullback.complexLinearOpenPullback e.symm.toContinuousLinearMap hi) hab
  simpa only [complexLinearOpenPullback_inverse e h hi] using hback

theorem complexLinearOpenPullback_scalarZero (L : E β†’L[β„‚] F)
    (hL : MapsTo L (U : Set E) (V : Set F)) {f : F β†’ β„‚}
    (hf : ContDiffOn ℝ ∞ f (V : Set F)) :
    LinearOpenPullback.complexLinearOpenPullback L hL (ScalarDolbeaultCommutation.scalarOpenZeroForm V f hf) =
      ScalarDolbeaultCommutation.scalarOpenZeroForm U (fun x => f (L x)) (hf.comp (L.restrictScalars ℝ).contDiff.contDiffOn hL) := by
  apply Analysis.DifferentialForms.Manifold.OpenD.SmoothOpenForm.ext
  intro x
  rw [LinearOpenPullback.complexLinearOpenPullback_apply]
  ext v
  rfl

end

end OAI.AlgebraicGeometry.DivisorClass.Chern.Complex.LinearPullbackLaws