File size: 4,903 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
import Mathlib
import OAI.Analysis.BiholderTransport.LinearAlgebra.MovingHessianLimit
import OAI.Analysis.BiholderTransport.LinearAlgebra.BilinearCompact
import OAI.Analysis.BiholderTransport.LinearAlgebra.BilinearMatrix
import OAI.Analysis.BiholderTransport.LinearAlgebra.BilinearClose

namespace OAI

section

noncomputable section
open Set Filter
open scoped Topology

namespace WeakMTWTransport
section CenterDetCompact
variable {E:Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
  [FiniteDimensional ℝ E]

local instance centerDetDualGroup : NormedAddCommGroup (E β†’L[ℝ] ℝ) := inferInstance
local instance centerDetDualSpace : NormedSpace ℝ (E β†’L[ℝ] ℝ) := inferInstance
local instance centerDetBilinearGroup : NormedAddCommGroup (E β†’L[ℝ] E β†’L[ℝ] ℝ) := inferInstance
local instance centerDetBilinearSpace : NormedSpace ℝ (E β†’L[ℝ] E β†’L[ℝ] ℝ) := inferInstance

lemma exists_center_matrix_limit {V C:β„• β†’ E β†’L[ℝ] E β†’L[ℝ] ℝ}
    {Cβ‚€:E β†’L[ℝ] E β†’L[ℝ] ℝ} {a:β„• β†’ ℝ} {aβ‚€ kβ‚€:ℝ}
    (hC:Tendsto C atTop (𝓝 Cβ‚€)) (ha:Tendsto a atTop (𝓝 aβ‚€)) (hk:0<kβ‚€)
    (hV:βˆ€αΆ  j in atTop,(βˆ€d e,V j d e=V j e d) ∧
      (βˆ€d,0 ≀ V j d d) ∧ (βˆ€d,V j d d ≀ C j d d) ∧
      0 ≀ a j ∧ kβ‚€ ≀ a j*(bilinearOperator (V j)).det) :
    βˆƒVβ‚€:E β†’L[ℝ] E β†’L[ℝ] ℝ,βˆƒΟƒ:β„• β†’ β„•,StrictMono Οƒ ∧
      Tendsto (V ∘ Οƒ) atTop (𝓝 Vβ‚€) ∧ (βˆ€d e,Vβ‚€ d e=Vβ‚€ e d) ∧
      (βˆ€d,dβ‰ 0 β†’ 0<Vβ‚€ d d) ∧ (βˆ€d,Vβ‚€ d d ≀ Cβ‚€ d d) ∧
      0<aβ‚€ ∧ kβ‚€ ≀ aβ‚€*(bilinearOperator Vβ‚€).det := by
  have hCn : Tendsto (fun j => β€–C jβ€–) atTop (𝓝 β€–Cβ‚€β€–) := hC.norm
  have hCb:βˆ€αΆ  j in atTop,β€–C j‖≀‖Cβ‚€β€–+1:=by
    filter_upwards [hCn.eventually (gt_mem_nhds (show β€–Cβ‚€β€–<β€–Cβ‚€β€–+1 by linarith))] with j hj
    exact hj.le
  have hbound:βˆ€αΆ  j in atTop,β€–V j‖≀‖Cβ‚€β€–+1:=by
    filter_upwards [hCb,hV] with j hj hv
    apply symmetric_bilinear_norm_bound hv.1 (by positivity)
    intro d
    rw [abs_of_nonneg (hv.2.1 d)]
    calc
      V j d d ≀ C j d d:=hv.2.2.1 d
      _ ≀ |C j d d|:=le_abs_self _
      _ ≀ β€–C jβ€–*β€–dβ€–^2:=bilinear_quadratic_norm_bound _ _
      _ ≀ (β€–Cβ‚€β€–+1)*β€–dβ€–^2:=mul_le_mul_of_nonneg_right hj (sq_nonneg _)
  obtain ⟨Vβ‚€,Οƒ,hΟƒ,HV⟩:=exists_bilinear_limit hbound
  have hve:=hσ.tendsto_atTop.eventually hV
  have hvs:βˆ€d e,Vβ‚€ d e=Vβ‚€ e d:=bilinear_limit_symm HV (hve.mono (fun j hj=>hj.1))
  have hvp:βˆ€d,0≀Vβ‚€ d d:=bilinear_limit_nonneg HV (hve.mono (fun j hj=>hj.2.1))
  have hae:0≀aβ‚€:=ge_of_tendsto (ha.comp hΟƒ.tendsto_atTop) (hve.mono (fun j hj=>hj.2.2.2.1))
  have hdet:k₀≀aβ‚€*(bilinearOperator Vβ‚€).det:=ge_of_tendsto
    ((ha.comp hσ.tendsto_atTop).mul (bilinear_det_tendsto HV)) (hve.mono (fun j hj=>hj.2.2.2.2))
  have hdp:0 < (bilinearOperator Vβ‚€).det:=by
    have H:=bilinear_det_nonneg hvs hvp
    nlinarith only [hk,hdet,hae,H]
  have hap:0<aβ‚€:=by nlinarith only [hk,hdet,hae,hdp]
  refine ⟨Vβ‚€,Οƒ,hΟƒ,HV,hvs,bilinear_positive_of_det_ne_zero hvs hvp hdp.ne',?_,hap,hdet⟩
  intro d
  exact le_of_tendsto_of_tendsto
    (tendsto_clm_apply (tendsto_clm_apply HV tendsto_const_nhds) tendsto_const_nhds)
    (tendsto_clm_apply (tendsto_clm_apply (hC.comp hσ.tendsto_atTop) tendsto_const_nhds) tendsto_const_nhds)
    (hve.mono (fun j hj=>hj.2.2.1 d))

lemma exists_center_matrix_limit_variable {V C:β„• β†’ E β†’L[ℝ] E β†’L[ℝ] ℝ}
    {Cβ‚€:E β†’L[ℝ] E β†’L[ℝ] ℝ} {a k:β„• β†’ ℝ} {aβ‚€ kβ‚€:ℝ}
    (hC:Tendsto C atTop (𝓝 Cβ‚€)) (ha:Tendsto a atTop (𝓝 aβ‚€))
    (hk:Tendsto k atTop (𝓝 kβ‚€)) (hk0:0<kβ‚€)
    (hV:βˆ€αΆ  j in atTop,(βˆ€d e,V j d e=V j e d) ∧
      (βˆ€d,0 ≀ V j d d) ∧ (βˆ€d,V j d d ≀ C j d d) ∧
      0 ≀ a j ∧ k j ≀ a j*(bilinearOperator (V j)).det) :
    βˆƒVβ‚€:E β†’L[ℝ] E β†’L[ℝ] ℝ,βˆƒΟƒ:β„• β†’ β„•,StrictMono Οƒ ∧
      Tendsto (V ∘ Οƒ) atTop (𝓝 Vβ‚€) ∧ (βˆ€d e,Vβ‚€ d e=Vβ‚€ e d) ∧
      (βˆ€d,dβ‰ 0 β†’ 0<Vβ‚€ d d) ∧ (βˆ€d,Vβ‚€ d d ≀ Cβ‚€ d d) ∧
      0<aβ‚€ ∧ kβ‚€ ≀ aβ‚€*(bilinearOperator Vβ‚€).det := by
  have HV:βˆ€αΆ  j in atTop,(βˆ€d e,V j d e=V j e d) ∧
      (βˆ€d,0 ≀ V j d d) ∧ (βˆ€d,V j d d ≀ C j d d) ∧
      0 ≀ a j ∧ kβ‚€/2 ≀ a j*(bilinearOperator (V j)).det:=by
    filter_upwards [hV,hk.eventually (lt_mem_nhds (show kβ‚€/2<kβ‚€ by linarith))] with j hj hkj
    exact ⟨hj.1,hj.2.1,hj.2.2.1,hj.2.2.2.1,hkj.le.trans hj.2.2.2.2⟩
  obtain ⟨Vβ‚€,Οƒ,hΟƒ,HV,hVs,hVp,hVC,ha0,_⟩:=
    exists_center_matrix_limit hC ha (half_pos hk0) HV
  refine ⟨Vβ‚€,Οƒ,hΟƒ,HV,hVs,hVp,hVC,ha0,?_⟩
  exact le_of_tendsto_of_tendsto (hk.comp hσ.tendsto_atTop)
    ((ha.comp hσ.tendsto_atTop).mul (bilinear_det_tendsto HV))
    ((hσ.tendsto_atTop.eventually hV).mono (fun j hj=>hj.2.2.2.2))
end CenterDetCompact
end WeakMTWTransport

end
end

end OAI