File size: 3,472 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
import Mathlib
import OAI.MeasureTheory.FalconerCompletion.Graphs.GraphDescendants

namespace OAI

/-! Recursive policies and quantitative depth estimates. -/

section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer.TreeND
open Set MeasureTheory
open scoped ENNReal
variable {d : β„•}
abbrev blockDepth (N B i : β„•) : β„• := N-i*B

structure RegularizedProfileData (Ξ½ : Measure (EuclideanSpace ℝ (Fin d)))
    (N B : β„•) (s lam : ℝ) (m : ℝ β†’ ℝ) : Prop where
  probability : IsProbabilityMeasure Ξ½
  continuous : Continuous m
  zero : m 0 = 0
  slope : βˆ€ u v : ℝ, 0 ≀ u β†’ u ≀ v β†’ v ≀ N β†’
    0 ≀ m v-m u ∧ m v-m u ≀ d*(v-u)/(N:ℝ)
  affine : βˆ€ i < N/B+1, βˆƒ a b : ℝ, βˆ€ u : ℝ,
    (blockDepth N B (i+1):ℝ) ≀ u β†’ u ≀ (blockDepth N B i:ℝ) β†’ m u = a*u+b
  cells : βˆ€ n ≀ N, βˆ€ P : CellPath d, P.length = n β†’ 0 < Ξ½ (treeCell P) β†’
    ((2:ℝ)^N)^(-(d+1:ℝ)*lam)*((2:ℝ)^N)^(-m n) ≀ (Ξ½ (treeCell P)).toReal ∧
    (Ξ½ (treeCell P)).toReal ≀ ((2:ℝ)^N)^((d+1:ℝ)*lam)*((2:ℝ)^N)^(-m n)
  envelope : βˆ€ n ≀ N, s*(n:ℝ)/(N:ℝ)-(d+3:ℝ)*lam ≀ m n ∧ m n ≀ d*(n:ℝ)/(N:ℝ)
  adjusted : βˆ€ u v : ℝ, 0 ≀ u β†’ u ≀ N β†’ 0 ≀ v β†’ v ≀ N β†’
    |(m v-(d:ℝ)/2*v/(N:ℝ))-(m u-(d:ℝ)/2*u/(N:ℝ))| ≀ (d:ℝ)/2*|v-u|/(N:ℝ)
  packing : βˆ€ g p : β„•, g ≀ p β†’ p ≀ N β†’ βˆ€ x : EuclideanSpace ℝ (Fin d), βˆ€ Cβ‚€ : ℝ, 0 ≀ Cβ‚€ β†’
    ((occupiedCenterCells Ξ½ p x (Cβ‚€/(2:ℝ)^g)).card:ℝ) ≀
      (2*Cβ‚€+2*(d:ℝ)+7)^d*((2:ℝ)^N)^(m p-m g+2*(d+1:ℝ)*lam)

lemma RegularizedProfileData.profile_nonneg
    {ρ : Measure (EuclideanSpace ℝ (Fin d))} {N B : β„•} {s sig : ℝ} {m : ℝ β†’ ℝ}
    (h : RegularizedProfileData ρ N B s sig m) {n : β„•} (hn : n ≀ N) : 0 ≀ m n := by
  have hh := (h.slope 0 n le_rfl (by positivity) (by exact_mod_cast hn)).1
  simpa only [h.zero,sub_zero] using hh

lemma RegularizedProfileData.profile_le_dim
    {ρ : Measure (EuclideanSpace ℝ (Fin d))} {N B : β„•} {s sig : ℝ} {m : ℝ β†’ ℝ}
    (h : RegularizedProfileData ρ N B s sig m) (hN : 0 < N) {n : β„•} (hn : n ≀ N) : m n ≀ d := by
  apply (h.envelope n hn).2.trans
  rw [div_le_iffβ‚€ (by positivity : (0:ℝ) < N)]
  exact mul_le_mul_of_nonneg_left (by exact_mod_cast hn) (by positivity)

lemma RegularizedProfileData.graph_child_lower
    {ρ : Measure (EuclideanSpace ℝ (Fin d))} {N B : β„•} {s sig : ℝ} {m : ℝ β†’ ℝ}
    (h : RegularizedProfileData ρ N B s sig m) {a p : β„•} (hp : p ≀ N)
    {X P : CellPath d} (hP : P ∈ graphChildren ρ a p X) :
    ((2:ℝ)^N)^(-m p-(d+1:ℝ)*sig) ≀ ρ.real (treeCell P) := by
  have hm := (h.cells p hp P (graphChildren_length hP) (Finset.mem_filter.mp hP).2).1
  rw [←Real.rpow_add (by positivity : (0:ℝ) < 2^N)] at hm
  convert hm using 1 <;> congr 1
  ring

lemma RegularizedProfileData.graph_parent_upper
    {ρ : Measure (EuclideanSpace ℝ (Fin d))} {N B : β„•} {s sig : ℝ} {m : ℝ β†’ ℝ}
    (h : RegularizedProfileData ρ N B s sig m) {a : β„•} (ha : a ≀ N)
    {X : CellPath d} (hX : X ∈ dyadicPaths a) (hocc : 0 < ρ (treeCell X)) :
    ρ.real (treeCell X) ≀ ((2:ℝ)^N)^(-m a+(d+1:ℝ)*sig) := by
  have hm := (h.cells a ha X ((mem_dyadicPaths _ _).mp hX) hocc).2
  rw [←Real.rpow_add (by positivity : (0:ℝ) < 2^N)] at hm
  convert hm using 1 <;> congr 1
  ring
end CurrentFalconer.TreeND
end
end

end OAI