File size: 5,474 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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
import Mathlib.Analysis.Normed.Operator.Compact.FredholmAlternative
import Mathlib.Analysis.InnerProductSpace.Adjoint

/-! # Compact Energy -/

namespace OAI.AlgebraicGeometry.ComplexMultiplication.HodgeComparison.CompactEnergy.CM.Construction

noncomputable section

/-! Weak elliptic inversion from a compact lower-order inclusion and the graph inner product. -/

open _root_.Module InnerProductSpace _root_.ContinuousLinearMap
open scoped InnerProduct

variable {๐•œ V H W : Type*} [RCLike ๐•œ]
  [NormedAddCommGroup V] [InnerProductSpace ๐•œ V] [CompleteSpace V]
  [NormedAddCommGroup H] [InnerProductSpace ๐•œ H] [CompleteSpace H]
  [NormedAddCommGroup W] [InnerProductSpace ๐•œ W] [CompleteSpace W]

local notation "โŸช" x ", " y "โŸซ" => inner ๐•œ x y

/-- In a graph Hilbert norm, the energy operator is identity minus a compact operator. -/
theorem graphEnergy_eq_identity_sub (J : V โ†’L[๐•œ] H) (D : V โ†’L[๐•œ] W)
    (hgraph : โˆ€ u v, โŸชu, vโŸซ = โŸชJ u, J vโŸซ + โŸชD u, D vโŸซ) :
    D.adjoint.comp D = 1 - J.adjoint.comp J := by
  ext u
  apply ext_inner_right ๐•œ
  intro v
  simp only [comp_apply, sub_apply, inner_sub_left, adjoint_inner_left]
  change โŸชD u, D vโŸซ = โŸชu, vโŸซ - โŸชJ u, J vโŸซ
  rw [hgraph]
  abel

/-- Compactness supplies invertibility of the energy operator once its derivative has zero kernel. -/
theorem graphEnergy_bijective (J : V โ†’L[๐•œ] H) (D : V โ†’L[๐•œ] W)
    (hJ : IsCompactOperator J) (hD : Function.Injective D)
    (hgraph : โˆ€ u v, โŸชu, vโŸซ = โŸชJ u, J vโŸซ + โŸชD u, D vโŸซ) :
    Function.Bijective (D.adjoint.comp D) := by
  let K : V โ†’L[๐•œ] V := J.adjoint.comp J
  have hK : IsCompactOperator K := hJ.clm_comp J.adjoint
  have hno : ยฌ Module.End.HasEigenvalue (K : Module.End ๐•œ V) 1 := by
    intro heigen
    obtain โŸจu, huโŸฉ := heigen.exists_hasEigenvector
    have heq : K u = u := by
      have h := hu.apply_eq_smul
      change K u = (1 : ๐•œ) โ€ข u at h
      simpa only [one_smul] using h
    have hzero : (D.adjoint.comp D) u = 0 := by
      rw [graphEnergy_eq_identity_sub J D hgraph]
      change u - K u = 0
      rw [heq, sub_self]
    have hinj := (D.adjoint_comp_self_injective_iff).mpr hD
    apply hu.2
    apply hinj
    change (D.adjoint.comp D) u = (D.adjoint.comp D) 0
    simpa only [map_zero] using hzero
  have hres := (hK.hasEigenvalue_or_mem_resolventSet (by norm_num : (1 : ๐•œ) โ‰  0)).resolve_left hno
  have hunit : IsUnit (1 - K) := by
    simpa only [spectrum.mem_resolventSet_iff, map_one] using hres
  rw [graphEnergy_eq_identity_sub J D hgraph]
  exact ContinuousLinearMap.isUnit_iff_bijective.mp hunit

/-- Every bounded functional has a unique weak solution when the energy derivative is injective. -/
theorem graphEnergy_weak_existsUnique (J : V โ†’L[๐•œ] H) (D : V โ†’L[๐•œ] W)
    (hJ : IsCompactOperator J) (hD : Function.Injective D)
    (hgraph : โˆ€ u v, โŸชu, vโŸซ = โŸชJ u, J vโŸซ + โŸชD u, D vโŸซ)
    (โ„“ : V โ†’L[๐•œ] ๐•œ) : โˆƒ! u : V, โˆ€ v : V, โŸชD u, D vโŸซ = โ„“ v := by
  obtain โŸจu, huโŸฉ := (graphEnergy_bijective J D hJ hD hgraph).surjective
    ((InnerProductSpace.toDual ๐•œ V).symm โ„“)
  refine โŸจu, ?_, ?_โŸฉ
  ยท intro v
    rw [โ† adjoint_inner_left D, โ† comp_apply, hu, InnerProductSpace.toDual_symm_apply]
  ยท intro u' hu'
    apply (graphEnergy_bijective J D hJ hD hgraph).injective
    apply ext_inner_right ๐•œ
    intro v
    rw [hu, InnerProductSpace.toDual_symm_apply]
    simpa only [comp_apply, adjoint_inner_left] using hu' v

omit [CompleteSpace V] [CompleteSpace W] in
/-- The derivative is injective on the orthogonal complement of its actual kernel. -/
theorem derivative_injective_on_kernel_orthogonal (D : V โ†’L[๐•œ] W) :
    Function.Injective (D.comp (D.ker)แ—ฎ.subtypeL) := by
  have hzero : โˆ€ u : (D.ker)แ—ฎ, D u.val = 0 โ†’ u = 0 := by
    intro u hu
    apply Subtype.ext
    apply (inner_self_eq_zero (๐•œ := ๐•œ)).mp
    exact Submodule.inner_right_of_mem_orthogonal (show u.val โˆˆ D.ker from hu) u.property
  intro u v huv
  apply sub_eq_zero.mp
  apply hzero
  change D (u.val - v.val) = 0
  rw [map_sub]
  exact sub_eq_zero.mpr huv

/-- A functional vanishing on the derivative kernel has a unique normalized weak solution. -/
theorem graphEnergy_weak_existsUnique_orthogonal (J : V โ†’L[๐•œ] H) (D : V โ†’L[๐•œ] W)
    (hJ : IsCompactOperator J)
    (hgraph : โˆ€ u v, โŸชu, vโŸซ = โŸชJ u, J vโŸซ + โŸชD u, D vโŸซ)
    (โ„“ : V โ†’L[๐•œ] ๐•œ) (hโ„“ : โˆ€ u โˆˆ D.ker, โ„“ u = 0) :
    โˆƒ! u : (D.ker)แ—ฎ, โˆ€ v : V, โŸชD u.val, D vโŸซ = โ„“ v := by
  let Q := (D.ker)แ—ฎ
  let JQ := J.comp Q.subtypeL
  let DQ := D.comp Q.subtypeL
  let โ„“Q := โ„“.comp Q.subtypeL
  have hgraphQ : โˆ€ u v : Q, โŸชu, vโŸซ = โŸชJQ u, JQ vโŸซ + โŸชDQ u, DQ vโŸซ := by
    intro u v
    exact hgraph u.val v.val
  obtain โŸจu, hu, huniqโŸฉ := graphEnergy_weak_existsUnique JQ DQ
    (hJ.comp_clm Q.subtypeL) (derivative_injective_on_kernel_orthogonal D) hgraphQ โ„“Q
  refine โŸจu, ?_, ?_โŸฉ
  ยท intro v
    have : CompleteSpace D.ker := D.isClosed_ker.completeSpace_coe
    obtain โŸจk, hk, q, hq, rflโŸฉ := D.ker.exists_add_mem_mem_orthogonal v
    have hkD : D k = 0 := hk
    have hqeq : โŸชD u.val, D qโŸซ = โ„“ q := hu โŸจq, hqโŸฉ
    rw [map_add, hkD, zero_add, map_add, hโ„“ k hk, zero_add]
    exact hqeq
  ยท intro u' hu'
    apply huniq
    intro v
    exact hu' v.val

end

end OAI.AlgebraicGeometry.ComplexMultiplication.HodgeComparison.CompactEnergy.CM.Construction