File size: 4,840 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
import OAI.MathematicalPhysics.DefocusingNLS.Certificates.NormalizedMatchingColumns
import OAI.MathematicalPhysics.DefocusingNLS.Profile.SlowParameterHolomorphy

namespace OAI

/-! # The analytic boundary column and its normalized tail representation -/

open Matrix

namespace DefocusingNLS

/-- The derivative-shift formula gives an explicitly analytic boundary column. -/
noncomputable def slowBoundaryColumn (q : β„‚) (m : β„•) (s : β„‚) : Fin 2 β†’ β„‚ :=
  ![regularizedSlowSolution q m (-s), q * regularizedSlowSolution (q + 1) (m + 1) (-s)]

theorem slowBoundaryColumn_eq_jet (q : β„‚) (m : β„•) (s : β„‚)
    (hq : -1 < q.re) (hsre : s.re = 0) (hsim : s.im β‰  0) :
    slowBoundaryColumn q m s =
      ![regularizedSlowSolution q m (-s), -deriv (regularizedSlowSolution q m) (-s)] := by
  have hs0 : -s β‰  0 := neg_ne_zero.mpr (fun h => hsim (by simp [h]))
  have hd := (hasDerivAt_regularizedSlowSolution_shift_closed q m (-s) hq
    (by simp [hsre]) hs0).deriv
  simp [slowBoundaryColumn, hd]

theorem differentiableAt_slowBoundaryColumn (q : β„‚) (m : β„•) (s : β„‚)
    (hq : -1 < q.re) (hsre : s.re = 0) (hsim : s.im β‰  0) :
    DifferentiableAt β„‚ (fun z => slowBoundaryColumn z m s) q := by
  have hs0 : -s β‰  0 := neg_ne_zero.mpr (fun h => hsim (by simp [h]))
  have hq' : -1 < (q + 1).re := by change -1 < q.re + 1; linarith
  have hβ‚€ := differentiableAt_regularizedSlowSolution_parameter_closed q m (-s) hq
    (by simp [hsre]) hs0
  have h₁ := differentiableAt_regularizedSlowSolution_parameter_closed (q + 1) (m + 1)
    (-s) hq' (by simp [hsre]) hs0
  apply differentiableAt_pi.mpr
  intro i
  fin_cases i
  Β· change DifferentiableAt β„‚ (fun z => regularizedSlowSolution z m (-s)) q
    exact hβ‚€
  Β· change DifferentiableAt β„‚ (fun z => z * regularizedSlowSolution (z + 1) (m + 1) (-s)) q
    convert! differentiableAt_id.mul (h₁.comp q (differentiableAt_id.add_const 1)) using 1

theorem analyticOnNhd_slowBoundaryColumn (m : β„•) (s : β„‚)
    (hsre : s.re = 0) (hsim : s.im β‰  0) :
    AnalyticOnNhd β„‚ (fun q => slowBoundaryColumn q m s) {q : β„‚ | -1 < q.re} := by
  apply DifferentiableOn.analyticOnNhd _ (isOpen_lt continuous_const Complex.continuous_re)
  intro q hq
  exact (differentiableAt_slowBoundaryColumn q m s hq hsre hsim).differentiableWithinAt

theorem slowBoundaryColumn_ne_zero (q : β„‚) (m : β„•) (s : β„‚)
    (hq : -1 < q.re) (hsre : s.re = 0) (hsim : s.im β‰  0) :
    slowBoundaryColumn q m s β‰  0 := by
  rw [slowBoundaryColumn_eq_jet q m s hq hsre hsim]
  intro hz
  have hβ‚€ := congrFun hz 0
  have h₁ := congrFun hz 1
  simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Pi.zero_apply] at hβ‚€ h₁
  have hs0 : -s β‰  0 := neg_ne_zero.mpr (fun h => hsim (by simp [h]))
  exact (regularizedSlowSolution_jet_nonzero q m (-s) hq (by simp [hsre]) hs0).elim
    (fun h => h hβ‚€) (fun h => h (neg_eq_zero.mp h₁))

theorem normalizedMatching_tail_disk (Οƒ : ℝ) (β„“ K : β„•) (q s : β„‚)
    (hΟƒ : -(1 / 32 : ℝ) ≀ Οƒ) (hK : 3 ≀ K)
    (hq : q.re = Οƒ + (β„“ : ℝ) / 2) (hsre : s.re = 0) (hsim : s.im β‰  0) :
    normalizedMatchingC q (β„“ + 6) s K β‰  0 ∧
      Complex.normSq (normalizedMatchingB q (β„“ + 6) s K /
        normalizedMatchingC q (β„“ + 6) s K + s / ((β„“ : ℝ) + 5 : β„‚)) <
          Complex.normSq (s / ((β„“ : ℝ) + 5 : β„‚)) := by
  have hq' : -1 < q.re := by rw [hq]; linarith [Nat.cast_nonneg (Ξ± := ℝ) β„“]
  have hp := shiftedPochhammer_ne_zero q (K - 1) hq'
  obtain ⟨hC, hd⟩ := normalizedSlow_tail_disk Οƒ β„“ K q s hΟƒ hK hq hsre hsim
  refine ⟨div_ne_zero hC hp, ?_⟩
  have he : normalizedMatchingB q (β„“ + 6) s K / normalizedMatchingC q (β„“ + 6) s K =
      normalizedSlowB q (β„“ + 6) s K / normalizedSlowC q (β„“ + 6) s K := by
    unfold normalizedMatchingB normalizedMatchingC
    field_simp
  rwa [he]

/-- The backward image of the ratio column differs from the true analytic
boundary column by the explicit nonzero tail scalar. -/
theorem normalizedMatching_ratio_column (q : β„‚) (M K : β„•) (s : β„‚)
    (hK : 0 < K) (hq : -1 < q.re) (hsre : s.re = 0) (hsim : s.im β‰  0)
    (hC : normalizedMatchingC q (M + 1) s K β‰  0) :
    backwardProduct M s q K *α΅₯
      ![normalizedMatchingB q (M + 1) s K / normalizedMatchingC q (M + 1) s K, 1] =
        (normalizedMatchingC q (M + 1) s K)⁻¹ β€’ slowBoundaryColumn q (M + 1) s := by
  have hv : ![normalizedMatchingB q (M + 1) s K / normalizedMatchingC q (M + 1) s K, 1] =
      (normalizedMatchingC q (M + 1) s K)⁻¹ β€’
        ![normalizedMatchingB q (M + 1) s K, normalizedMatchingC q (M + 1) s K] := by
    ext i
    fin_cases i <;> simp [div_eq_mul_inv, mul_comm, hC]
  rw [hv, Matrix.mulVec_smul, normalizedMatching_backwardProduct q M K s hK hq hsre hsim,
    slowBoundaryColumn_eq_jet q (M + 1) s hq hsre hsim]

end DefocusingNLS

end OAI