File size: 6,119 Bytes
b317718
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
128
129
130
131
132
133
134
135
136
137
138
import OAI.Probability.GaussianPropeller.ResidualBounds

namespace OAI

open MeasureTheory ProbabilityTheory
open scoped ENNReal
open scoped RealInnerProductSpace
open scoped RealInnerProductSpace
open MeasureTheory ProbabilityTheory Set
open scoped ENNReal RealInnerProductSpace
open Filter
open scoped Topology
open MeasureTheory ProbabilityTheory Set Filter
open scoped Topology
open scoped RealInnerProductSpace
open Set Filter
open scoped Topology RealInnerProductSpace
open scoped NNReal
open Set Filter
open scoped Topology RealInnerProductSpace NNReal
open MeasureTheory ProbabilityTheory Set Filter
open scoped Topology RealInnerProductSpace
open MeasureTheory Set Filter
open scoped Topology BigOperators
open MeasureTheory ProbabilityTheory Set Filter
open scoped RealInnerProductSpace Topology
open MeasureTheory ProbabilityTheory Set Filter
open scoped RealInnerProductSpace Topology ENNReal
open MeasureTheory ProbabilityTheory Set Filter
open scoped RealInnerProductSpace Topology ENNReal

namespace GaussianPropeller.Reduction

open scoped RealInnerProductSpace

lemma sqrt_value_lower {C : ℝ} (hC : 9/(8*Real.pi) < C) :
    3/(2*Real.sqrt (2*Real.pi)) < Real.sqrt C := by
  have hCp : 0 < C := (by positivity : (0:ℝ) < 9/(8*Real.pi)).trans hC
  have hs : 0 < Real.sqrt (2*Real.pi) := by positivity
  have hs2 : (Real.sqrt (2*Real.pi))^2 = 2*Real.pi := Real.sq_sqrt (by positivity)
  have hrel : (3/(2*Real.sqrt (2*Real.pi)))^2 = 9/(8*Real.pi) := by
    rw [div_pow, mul_pow, hs2]
    ring
  have ht2 := Real.sq_sqrt hCp.le
  have hn : 0 ≤ 3/(2*Real.sqrt (2*Real.pi)) := by positivity
  nlinarith only [hrel,hC,ht2,Real.sqrt_nonneg C]

lemma normalize_pair_constant {C z L M D : ℝ} (hC : 9/(8*Real.pi) < C)
    (hz : 0 ≤ z) (hL : 0 ≤ L) (hM : 0 ≤ M)
    (hD : D ≤ 9*z*L*M/(2*Real.pi*Real.sqrt (2*Real.pi))) :
    (Real.sqrt C)⁻¹*(Real.sqrt C)⁻¹*D ≤ (3/Real.pi)*(z/Real.sqrt C)*L*M := by
  have hCp : 0 < C := (by positivity : (0:ℝ) < 9/(8*Real.pi)).trans hC
  have ht : 0 < Real.sqrt C := Real.sqrt_pos.mpr hCp
  have hq : 0 < Real.sqrt (2*Real.pi) := by positivity
  have hp : 0 < Real.pi := Real.pi_pos
  have hh := le_of_lt (sqrt_value_lower hC)
  have hh' : 3 ≤ Real.sqrt C*(2*Real.sqrt (2*Real.pi)) := (div_le_iff₀ (by positivity)).mp hh
  have hb : 9/(2*Real.pi*Real.sqrt (2*Real.pi)) ≤ (3/Real.pi)*Real.sqrt C := by
    apply (div_le_iff₀ (by positivity)).mpr
    calc
      9 ≤ 3*(Real.sqrt C*(2*Real.sqrt (2*Real.pi))) := by linarith only [hh']
      _ = _ := by field_simp
  have hDb : D ≤ (3/Real.pi)*Real.sqrt C*z*L*M := by
    calc
      D ≤ (9/(2*Real.pi*Real.sqrt (2*Real.pi)))*z*L*M := by
        convert hD using 1
        ring
      _ ≤ _ := mul_le_mul_of_nonneg_right
        (mul_le_mul_of_nonneg_right (mul_le_mul_of_nonneg_right hb hz) hL) hM
  have hm := mul_le_mul_of_nonneg_left hDb
    (show 0 ≤ (Real.sqrt C)⁻¹*(Real.sqrt C)⁻¹ by positivity)
  convert hm using 1
  field_simp

variable {d k : ℕ} [NeZero k]

theorem minimal_normalized_pair {A : Fin k → Set (Space d)} (hA : MinimalOptimal A)
    (hC : 9/(8*Real.pi) < value A) {i j l : Fin k}
    (hi : gaussian d (A i) ≠ 0) (hj : gaussian d (A j) ≠ 0)
    (hl : gaussian d (A l) ≠ 0) (hij : i ≠ j) (hil : i ≠ l) :
    let z := centroid (A i)
    let r := (Real.sqrt (value A))⁻¹ • residualVector z (centroid (A j))
    let s := (Real.sqrt (value A))⁻¹ • residualVector z (centroid (A l))
    Real.sqrt (‖r‖^2*‖s‖^2-⟪r,s⟫^2) ≤
      (3/Real.pi)*(‖z‖/Real.sqrt (value A))*(1+residualCoefficient z (centroid (A j)))*
        (1+residualCoefficient z (centroid (A l))) := by
  dsimp only
  rw [GaussianPropeller.Pair.sqrt_gram_smul (by positivity) (by positivity)]
  apply normalize_pair_constant hC (norm_nonneg _)
    (le_of_lt (lt_trans (by norm_num : (0:ℝ)<1) (lt_add_of_pos_right _
      (residualCoefficient_pos (negative_inner_of_minimal hA hij hi hj)))))
    (le_of_lt (lt_trans (by norm_num : (0:ℝ)<1) (lt_add_of_pos_right _
      (residualCoefficient_pos (negative_inner_of_minimal hA hil hi hl)))))
  exact minimal_residual_pair hA ((by positivity : (0:ℝ)<9/(8*Real.pi)).trans hC) hi hj hl hij hil

omit [NeZero k] in
theorem sum_cell_probability {A : Fin k → Set (Space d)} (hA : IsPartition A) :
    ∑ i, (gaussian d).real (A i) = 1 := by
  let : IsProbabilityMeasure (gaussian d) := by unfold gaussian; infer_instance
  have hsum := integral_congr_ae (sum_indicator_eq hA (fun _ => (1:ℝ)))
  rw [integral_finsetSum] at hsum
  · simpa only [integral_indicator_const (1:ℝ) (hA.1 _), smul_eq_mul, mul_one,
      integral_const, measureReal_def, measure_univ, ENNReal.toReal_one, one_smul] using hsum
  · intro i _
    exact (integrable_const (1:ℝ)).indicator (hA.1 i)

omit [NeZero k] in
theorem sum_active_probability {A : Fin k → Set (Space d)} (hA : IsPartition A) :
    ∑ i : activeLabels A, (gaussian d).real (A i) = 1 := by
  classical
  rw [Finset.sum_coe_sort (activeLabels A) (fun i => (gaussian d).real (A i))]
  have he : ∑ i ∈ activeLabels A, (gaussian d).real (A i) = ∑ i, (gaussian d).real (A i) := by
    apply Finset.sum_subset (Finset.subset_univ _)
    intro i _ hi
    have hz : gaussian d (A i) = 0 := by simpa only [mem_activeLabels, not_not] using hi
    simp [measureReal_def,hz]
  rw [he,sum_cell_probability hA]

omit [NeZero k] in
theorem sum_active_norm_sq (A : Fin k → Set (Space d)) :
    ∑ i : activeLabels A, ‖centroid (A i)‖^2 = value A := by
  classical
  rw [Finset.sum_coe_sort (activeLabels A) (fun i => ‖centroid (A i)‖^2)]
  apply Finset.sum_subset (Finset.subset_univ _)
  intro i _ hi
  have hz : gaussian d (A i) = 0 := by simpa only [mem_activeLabels, not_not] using hi
  simp [centroid_eq_zero_of_null hz]

omit [NeZero k] in
theorem sum_active_radius_sq (A : Fin k → Set (Space d)) (hpos : 0 < value A) :
    ∑ i : activeLabels A, (‖centroid (A i)‖/Real.sqrt (value A))^2 = 1 := by
  simp only [div_pow, Real.sq_sqrt hpos.le, ← Finset.sum_div, sum_active_norm_sq]
  exact div_self hpos.ne'

end GaussianPropeller.Reduction

end OAI