File size: 7,227 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
import OAI.MeasureTheory.Falconer.Estimates.ComparableComplexRebin
import OAI.MeasureTheory.Falconer.Angular.ActualStationaryProductKernel
import OAI.MeasureTheory.Falconer.Angular.ActualFourStationarySupport
import OAI.MeasureTheory.Falconer.Angular.AngularComparableCarrier

namespace OAI

namespace PlanarFalconer
open Set MeasureTheory
open scoped ENNReal ContDiff
attribute [local instance] Classical.propDecidable

theorem uniform_actual_comparable_shell_rebin {Ξ¨ : ℝ β†’ ℝ}
    (hΞ¨ : ContDiff ℝ ∞ Ξ¨) (hsΞ¨ : βˆ€ t, Ξ¨ t β‰  0 β†’ t ∈ Ioo (1/4:ℝ) 4)
    {sig : ℝ} (hsig : 0 < sig) (K o : β„•) {J : β„•} (hJ : 0 < J) :
    βˆƒ H : ℝ, 0 ≀ H ∧ βˆƒ Nβ‚€ : β„•, βˆ€ N β‰₯ Nβ‚€,
    βˆ€ (Q : Fin 2 β†’ DyadicSquare), (βˆ€ l, (Q l).side = 1) β†’
    βˆ€ (ρ : Fin 2 β†’ Measure Plane) [βˆ€ l, IsFiniteMeasure (ρ l)],
    (βˆ€ l, ρ l (Q l).carrierᢜ = 0) β†’
    βˆ€ (m : Fin 2 β†’ ℝ β†’ ℝ) (q aβ‚€ tβ‚€ a d n v : β„•),
    0 < q β†’ aβ‚€ ≀ a+n β†’ v ≀ tβ‚€ β†’ v ≀ N β†’
    βˆ€ (S : Fin 2 β†’ Finset PolicyDescriptor) (k : Fin 2 β†’ PolicyDescriptor β†’ β„•),
    (βˆ€ l, remainingPolicyDescriptors (fun t => m l t-(t:ℝ)/(N:ℝ)) N q aβ‚€ tβ‚€ a βŠ† S l) β†’
    (βˆ€ l, (S l).card ≀ (N+1)^3+1) β†’ (βˆ€ l, βˆ‘ t ∈ S l, k l t ≀ K) β†’
    βˆ€ L : β„•, (βˆ€ l t, t ∈ S l β†’ descriptorLength t ≀ L) β†’
    βˆ€ Lβ‚€ : ℝ, (v:ℝ)-(a+d:β„•) = 2*Lβ‚€ β†’ (L:ℝ) ≀ Lβ‚€ β†’ 10*sig*(N:ℝ) ≀ Lβ‚€ β†’
    βˆ€ (lam : Fin 2 β†’ ℝ) (i : Fin 2 β†’ β„•) (hsp : Fin 2 β†’ Plane β†’ β„‚),
    (βˆ€ l x, β€–hsp l xβ€– ≀ 1) β†’
    βˆ€ A B : CellPath, A.length = a β†’ B.length = a β†’
    let β := fun l => inheritedCircleSymbol (S l) id (k l) (Q l) (ρ l) (m l)
      N (lam l) sig J (i l) (hsp l)
    let good := fun l => positiveDistanceGoodSet (Q l) (ρ l) (m l) N q (a+n) v (lam l) sig J (i l+1)
    β€–βˆ‘ row ∈ sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B d,
      βˆ‘ col ∈ sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B d,
        if Β¬ angularNear (Q 0) (Q 1) (a+d) row col then
          ∫ x in angularLengthShell (a+n), angularStationarySpatialKernel (β 0) (β 1) o v Ψ x
            βˆ‚angularFourCellMeasure (Q 0) (Q 1) (ρ 0) (ρ 1) row col
        else 0β€–β‚‘ ≀
    (ENNReal.ofReal H * ENNReal.ofReal ((2:ℝ)^(-((v:ℝ)-(a+n:β„•))))) *
      βˆ‘ row ∈ sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B n,
        βˆ‘ col ∈ sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B n,
          if angularSeparated (Q 0) (Q 1) (a+n) row col then
            ∫⁻ x in angularLengthShell (a+n),
              (fourPairGood (good 0) (good 1)).indicator (distanceDifferenceKernel v) x
                βˆ‚angularFourCellMeasure (Q 0) (Q 1) (ρ 0) (ρ 1) row col
          else 0 := by
  obtain ⟨H,hH,N₁,hβ‚βŸ© := uniform_actual_stationary_product_kernel hΞ¨ hsΞ¨ hsig K o
  obtain ⟨Nβ‚‚,hβ‚‚βŸ© := uniform_actual_four_approximant_good hsig hJ
  refine ⟨H,hH,max N₁ Nβ‚‚,?_⟩
  intro N hN Q hQ ρ inst hcarry m q aβ‚€ tβ‚€ a d n v hq haβ‚€ ht hv S k hS hcard hK L hL
    Lβ‚€ hvh hLL hLβ‚€ lam i hsp hspb A B hA hB
  let β := fun l => inheritedCircleSymbol (S l) id (k l) (Q l) (ρ l) (m l)
    N (lam l) sig J (i l) (hsp l)
  let good := fun l => positiveDistanceGoodSet (Q l) (ρ l) (m l) N q (a+n) v (lam l) sig J (i l+1)
  have hQp (l : Fin 2) : 0 < (Q l).side := by rw [hQ l]; norm_num
  dsimp only
  convert angular_complex_shell_rebin (Q 0) (Q 1) (hQ 0) (hQ 1) (ρ 0) (ρ 1) A B a d n hA hB
    (fun row col => Β¬ angularNear (Q 0) (Q 1) (a+d) row col)
    (angularStationarySpatialKernel (Ξ² 0) (Ξ² 1) o v Ξ¨) (distanceDifferenceKernel v)
    (fourPairGood (good 0) (good 1))
    (measurable_fourPairGood (measurable_positiveDistanceGoodSet _ _ _ _ _ _ _ _ _ _ _)
      (measurable_positiveDistanceGoodSet _ _ _ _ _ _ _ _ _ _ _))
    (ENNReal.ofReal H * ENNReal.ofReal ((2:ℝ)^(-((v:ℝ)-(a+n:β„•))))) (by finiteness) ?_ ?_ using 1
  Β· congr 1
    apply Finset.sum_congr rfl
    intro row hr
    apply Finset.sum_congr rfl
    intro col hc
    by_cases hg : Β¬ angularNear (Q 0) (Q 1) (a+d) row col <;> simp only [hg,↓reduceIte,Ξ²]
  Β· intro row hr col hc hfar
    have hf := angular_comparable_far_ae (Q 0) (Q 1) (hQ 0) (hQ 1) (ρ 0) (ρ 1) (a+d) row col
      (sourceProductVertices_subset _ _ _ _ _ _ a d hA hB hr)
      (sourceProductVertices_subset _ _ _ _ _ _ a d hA hB hc) hfar
    have hf' := ae_restrict_of_ae_restrict_of_subset (show angularLengthShell (a+n) βŠ†
      angularLengthComparable from inter_subset_left) hf
    filter_upwards [hf',ae_restrict_mem (measurable_angularLengthShell (a+n))] with x hx hs
    have hl := angularLengthShell_lengths (a+n) hs
    have hd : βˆ€ l : Fin 2, (2:ℝ)^(-(a+n:β„•):ℝ) ≀ β€–(![x 0,x 2] : Fin 2 β†’ Plane) l-(![x 1,x 3] : Fin 2 β†’ Plane) lβ€– := by
      intro l
      have hp : 0 < (2:ℝ)^(-(a+n:β„•):ℝ) := by positivity
      fin_cases l
      Β· change (2:ℝ)^(-((a+n:β„•):ℝ)) ≀ β€–x 0-x 1β€–
        rw [← dist_eq_norm]
        linarith [hl.1.1]
      Β· change (2:ℝ)^(-((a+n:β„•):ℝ)) ≀ β€–x 2-x 3β€–
        rw [← dist_eq_norm]
        linarith [hl.2.1]
    have hD : βˆ€ l : Fin 2, sourceSymbolScale N sig L^2 ≀
        (2:ℝ)^(v:ℝ)*β€–(![x 0,x 2] : Fin 2 β†’ Plane) l-(![x 1,x 3] : Fin 2 β†’ Plane) lβ€– := by
      intro l
      apply sourceSymbolScale_far_frequency_le hsig.le N L hvh hLL hLβ‚€
      fin_cases l
      Β· exact hx.1
      Β· exact hx.2
    have he := h₁ N ((le_max_left _ _).trans hN) S (fun _ => id) k hcard hK L hL
      Q hQp ρ m lam (fun _ => J) i hsp ![x 0,x 2] ![x 1,x 3]
      (fun l => hspb l _) (fun l => hspb l _) v (a+n:β„•) hd hD
    have hxvec : (![x 0,x 1,x 2,x 3] : Fin 4 β†’ Plane) = x := by ext j; fin_cases j <;> rfl
    simp only [Matrix.cons_val_zero,Matrix.cons_val_one,hxvec,← dist_eq_norm] at he
    rw [← ofReal_norm]
    have he' := ENNReal.ofReal_le_ofReal he
    convert he' using 1
    dsimp [distanceDifferenceKernel]
    rw [← ENNReal.ofReal_mul hH,← ENNReal.ofReal_mul (mul_nonneg hH (by positivity))]
    congr 1
    ring
  Β· intro row hr col hc hfar
    let X : Fin 4 β†’ Set Plane := ![((Q 0).descendant row.1).carrier,((Q 0).descendant col.1).carrier,      ((Q 1).descendant row.2).carrier,((Q 1).descendant col.2).carrier]
    have hs := hβ‚‚ N ((le_max_right _ _).trans hN) Q hQ ρ hcarry m q aβ‚€ tβ‚€ a (a+n) v
      hq haβ‚€ ht (Nat.le_add_right _ _) hv S k hS lam i hsp X
    have hs' : βˆ€α΅ x βˆ‚(angularFourCellMeasure (Q 0) (Q 1) (ρ 0) (ρ 1) row col).restrict
        (angularLengthShell (a+n)), βˆ€ (o : β„•) (w : ℝ) (Ξ¨ : ℝ β†’ ℝ),
        (βˆ€ t, Ξ¨ t β‰  0 β†’ 0 < t) β†’ x 0 β‰  x 1 β†’ x 2 β‰  x 3 β†’
        angularStationarySpatialKernel (Ξ² 0) (Ξ² 1) o w Ξ¨ x β‰  0 β†’
        (x 0,x 1) ∈ good 0 ∧ (x 2,x 3) ∈ good 1 := ae_restrict_of_ae hs
    filter_upwards [hs',ae_restrict_mem (measurable_angularLengthShell (a+n))] with x hx hshell
    have hl := angularLengthShell_lengths (a+n) hshell
    have hp : 0 < 256*(2:ℝ)^(-(a+n:β„•):ℝ) := by positivity
    exact hx o v Ψ (fun t ht => lt_trans (by norm_num) (hsΨ t ht).1)
      (dist_pos.mp (hp.trans hl.1.1)) (dist_pos.mp (hp.trans hl.2.1))

end PlanarFalconer

end OAI