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
|