File size: 5,683 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 Mathlib
import OAI.MeasureTheory.Falconer.Model
import OAI.MeasureTheory.Falconer.Recursion.PolicyDescriptors
import OAI.MeasureTheory.FalconerCompletion.Angular.AngularWordOperatorBound
namespace OAI
/-! Recursive policies and quantitative depth estimates. -/
open _root_.OAI.PlanarFalconer
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace GraphLiteralSupport
namespace CurrentFalconer.TreeND
open Set Metric MeasureTheory PlanarFalconer
open scoped ENNReal RealInnerProductSpace ContDiff Topology Classical
variable {d : β}
noncomputable def actualDescriptorSmooth (Ο : Measure (EuclideanSpace β (Fin d)))
(m : β β β) (N : β) (sig C : β) (J i : β) (P : CellPath d) (b : PolicyDescriptor) :
SmoothFunctionND (EuclideanSpace β (Fin d)) :=
β¨fun w => (actualDescriptorMask Ο m N sig C J i P b w : β),
Complex.ofRealCLM.contDiff.comp (actualDescriptorMask_smooth Ο m N sig C J i P b)β©
lemma actualEndpointSmooth_of_mem (Ο : Measure (EuclideanSpace β (Fin d)))
(m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor)
{P : CellPath d} (hP : P β dyadicPaths (descriptorAnchor b))
{x : EuclideanSpace β (Fin d)} (hx : x β treeCell P) :
actualEndpointSmooth Ο m N sig C J i b x=actualDescriptorSmooth Ο m N sig C J i P b := by
apply Subtype.ext
funext w
exact congrArg Complex.ofReal (congrFun (actualEndpointMask_of_mem Ο m N sig C J i b hP hx) w)
lemma actualEndpointSmooth_of_absent (Ο : Measure (EuclideanSpace β (Fin d)))
(m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor)
{x : EuclideanSpace β (Fin d)}
(hx : β P β dyadicPaths (descriptorAnchor b), x β treeCell P) :
actualEndpointSmooth Ο m N sig C J i b x=0 := by
apply Subtype.ext
funext w
change (actualEndpointMask Ο m N sig C J i b x w : β)=0
rw [actualEndpointMask_of_absent Ο m N sig C J i b hx]
rfl
lemma actualEndpointAngular_partition
(L : List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d)))
(Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (N : β)
(sig C : β) (J i : β) (b : PolicyDescriptor) (x : EuclideanSpace β (Fin d)) :
actualEndpointAngular L Ο m N sig C J i b x=
β P β dyadicPaths (descriptorAnchor b),
if x β treeCell P then
normalizedAngularWordND (sourceMaskScaleND (descriptorLength b) ((2:β)^N) sig) L
(actualDescriptorSmooth Ο m N sig C J i P b) else 0 := by
classical
by_cases hx : β P β dyadicPaths (descriptorAnchor b), x β treeCell P
Β· obtain β¨P,hP,hxβ© := hx
unfold actualEndpointAngular
rw [actualEndpointSmooth_of_mem Ο m N sig C J i b hP hx,Finset.sum_eq_single P]
Β· simp only [hx,ite_true]
Β· intro Q hQ hQP
have hnot : x β treeCell Q := fun hxQ =>
Set.disjoint_left.mp (treeCell_disjoint
(((mem_dyadicPaths _ _).mp hQ).trans ((mem_dyadicPaths _ _).mp hP).symm) hQP) hxQ hx
simp only [hnot,ite_false]
Β· exact fun h => (h hP).elim
Β· have hx' : β P β dyadicPaths (descriptorAnchor b), x β treeCell P := by
simpa only [not_exists,not_and] using hx
unfold actualEndpointAngular normalizedAngularWordND
rw [actualEndpointSmooth_of_absent Ο m N sig C J i b hx',map_zero,smul_zero]
exact (Finset.sum_eq_zero fun P hP => ite_eq_right (hx' P hP)).symm
lemma actualEndpointAngular_measurable
(L : List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d)))
(Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (N : β)
(sig C : β) (J i : β) (b : PolicyDescriptor) :
Measurable (fun z : EuclideanSpace β (Fin d) Γ EuclideanSpace β (Fin d) =>
(actualEndpointAngular L Ο m N sig C J i b z.1).1 z.2) := by
classical
have he : (fun z : EuclideanSpace β (Fin d) Γ EuclideanSpace β (Fin d) =>
(actualEndpointAngular L Ο m N sig C J i b z.1).1 z.2)=
fun z => β P β dyadicPaths (descriptorAnchor b), if z.1 β treeCell P then
(normalizedAngularWordND (sourceMaskScaleND (descriptorLength b) ((2:β)^N) sig) L
(actualDescriptorSmooth Ο m N sig C J i P b)).1 z.2 else 0 := by
funext z
rw [actualEndpointAngular_partition]
simp only [Submodule.coe_sum,Finset.sum_apply]
apply Finset.sum_congr rfl
intro P _hP
split_ifs <;> rfl
rw [he]
apply Finset.measurable_sum
intro P _hP
exact Measurable.ite ((measurableSet_treeCell P).preimage measurable_fst)
((smoothFunctionND_contDiff _).continuous.measurable.comp measurable_snd) measurable_const
lemma actualEndpointSmooth_even (Ο : Measure (EuclideanSpace β (Fin d)))
(m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor)
(x : EuclideanSpace β (Fin d)) : Function.Even (actualEndpointSmooth Ο m N sig C J i b x).1 := by
classical
intro w
change (actualEndpointMask Ο m N sig C J i b x (-w):β)=_
unfold actualEndpointMask
congr 1
apply Finset.sum_congr rfl
intro P _hP
split_ifs
Β· exact actualDescriptorMask_even Ο m N sig C J i P b w
Β· rfl
lemma actualEndpointAngular_even
(L : List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d)))
(Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (N : β)
(sig C : β) (J i : β) (b : PolicyDescriptor) (x : EuclideanSpace β (Fin d)) :
Function.Even (actualEndpointAngular L Ο m N sig C J i b x).1 :=
normalizedAngularWordND_even _ L _ (actualEndpointSmooth_even Ο m N sig C J i b x)
end CurrentFalconer.TreeND
end GraphLiteralSupport
end
end
end OAI
|