Download data/lean/OAI/MeasureTheory/FalconerCompletion/Angular/EndpointMask.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.53 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/FalconerCompletion/Angular/EndpointMask.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/FalconerCompletion/Angular/EndpointMask.lean
-
curl -L -o EndpointMask.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/FalconerCompletion/Angular/EndpointMask.lean
6.53 kB
| import Mathlib | |
| import OAI.MeasureTheory.Falconer.Model | |
| import OAI.MeasureTheory.Falconer.Recursion.PolicyDescriptors | |
| import OAI.MeasureTheory.FalconerCompletion.Recursion.DescriptorGoodNeg | |
| namespace OAI | |
| /-! Angular cutoffs and derivative 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 | |
| variable {d : β} | |
| noncomputable def actualEndpointMask (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) | |
| (x w : EuclideanSpace β (Fin d)) : β := by | |
| classical | |
| exact β P β dyadicPaths (descriptorAnchor b), | |
| if x β treeCell P then actualDescriptorMask Ο m N sig C J i P b w else 0 | |
| lemma actualEndpointMask_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) : | |
| actualEndpointMask Ο m N sig C J i b x=actualDescriptorMask Ο m N sig C J i P b := by | |
| classical | |
| funext w | |
| unfold actualEndpointMask | |
| rw [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 | |
| lemma actualEndpointMask_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) : | |
| actualEndpointMask Ο m N sig C J i b x=0 := by | |
| classical | |
| funext w | |
| exact Finset.sum_eq_zero (fun P hP => ite_eq_right (hx P hP)) | |
| lemma actualEndpointMask_smooth (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) | |
| (x : EuclideanSpace β (Fin d)) : ContDiff β β (actualEndpointMask Ο m N sig C J i b x) := by | |
| classical | |
| by_cases hx : β P β dyadicPaths (descriptorAnchor b), x β treeCell P | |
| Β· obtain β¨P,hP,hxβ© := hx | |
| rw [actualEndpointMask_of_mem Ο m N sig C J i b hP hx] | |
| exact actualDescriptorMask_smooth _ _ _ _ _ _ _ _ _ | |
| Β· rw [actualEndpointMask_of_absent Ο m N sig C J i b (by simpa only [not_exists,not_and] using hx)] | |
| exact contDiff_const | |
| lemma actualEndpointMask_measurable (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) : | |
| Measurable (fun z : EuclideanSpace β (Fin d) Γ EuclideanSpace β (Fin d) => | |
| actualEndpointMask Ο m N sig C J i b z.1 z.2) := by | |
| classical | |
| unfold actualEndpointMask | |
| apply Finset.measurable_sum | |
| intro P hP | |
| exact Measurable.ite ((measurableSet_treeCell P).preimage measurable_fst) | |
| ((actualDescriptorMask_smooth Ο m N sig C J i P b).continuous.measurable.comp measurable_snd) | |
| measurable_const | |
| lemma actualEndpointMask_bounds (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) | |
| (x : EuclideanSpace β (Fin d)) {w : EuclideanSpace β (Fin d)} (hw : βwββ€1) : | |
| 0β€actualEndpointMask Ο m N sig C J i b x w β§ actualEndpointMask Ο m N sig C J i b x w β€ 1 := by | |
| classical | |
| by_cases hx : β P β dyadicPaths (descriptorAnchor b), x β treeCell P | |
| Β· obtain β¨P,hP,hxβ© := hx | |
| rw [actualEndpointMask_of_mem Ο m N sig C J i b hP hx] | |
| exact actualDescriptorMask_bounds _ _ _ _ _ _ _ _ _ hw | |
| Β· rw [actualEndpointMask_of_absent Ο m N sig C J i b (by simpa only [not_exists,not_and] using hx)] | |
| simp | |
| lemma actualEndpointMask_one (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) | |
| {x w : EuclideanSpace β (Fin d)} | |
| (hx : β P β dyadicPaths (descriptorAnchor b), x β treeCell P) | |
| (hg : (x,w) β endpointGood Ο m N sig C J i b) : | |
| actualEndpointMask Ο m N sig C J i b x w=1 := by | |
| obtain β¨P,hP,hxβ© := hx | |
| rw [actualEndpointMask_of_mem Ο m N sig C J i b hP hx] | |
| exact actualDescriptorMask_one Ο m N sig C J i P b (hg P hP hx) | |
| lemma uniform_actualEndpointMask_support {sig : β} (hsig : 0<sig) {J : β} (hJ : 0<J) : | |
| β Nβ : β, β N β₯ Nβ, β (Ο : Measure (EuclideanSpace β (Fin d))), IsFiniteMeasure Ο β | |
| β (m : β β β) (C : β) (i : β) (b : PolicyDescriptor), ValidDescriptor N b β | |
| β (k : β) (x w : EuclideanSpace β (Fin d)), βwβ=1 β | |
| w β tsupport (iteratedFDeriv β k (actualEndpointMask Ο m N sig C J i b x)) β | |
| (x,w) β endpointGood Ο m N sig C J (i+1) b := by | |
| obtain β¨Nβ,hββ© := uniform_actualDescriptorMask_support (d := d) hsig hJ | |
| refine β¨Nβ,?_β© | |
| intro N hN Ο hf m C i b hb k x w hw hs P hP hx | |
| rw [actualEndpointMask_of_mem Ο m N sig C J i b hP hx] at hs | |
| exact hβ N hN Ο hf m C i b hb P ((mem_dyadicPaths _ _).mp hP) k w hw hs | |
| lemma actualEndpointMask_derivatives (d B : β) : | |
| β Cβ : β, 0 β€ Cβ β§ β (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) | |
| (k : β), k β€ B β β x w, | |
| βiteratedFDeriv β k (actualEndpointMask Ο m N sig C J i b x) wβ β€ | |
| Cβ*(sourceMaskScaleND (descriptorLength b) ((2:β)^N) sig)^k := by | |
| classical | |
| obtain β¨Cβ,hC,hββ© := actualDescriptorMask_derivatives d B | |
| refine β¨Cβ,hC,?_β© | |
| intro Ο m N sig C J i b k hk x w | |
| by_cases hx : β P β dyadicPaths (descriptorAnchor b), x β treeCell P | |
| Β· obtain β¨P,hP,hxβ© := hx | |
| rw [actualEndpointMask_of_mem Ο m N sig C J i b hP hx] | |
| exact hβ Ο m N sig C J i P b k hk w | |
| Β· rw [actualEndpointMask_of_absent Ο m N sig C J i b (by simpa only [not_exists,not_and] using hx)] | |
| change βiteratedFDeriv β k (fun _ : EuclideanSpace β (Fin d) => (0:β)) wβ β€ _ | |
| simp only [iteratedFDeriv_fun_zero,Pi.zero_apply,norm_zero] | |
| exact mul_nonneg hC (pow_nonneg (sourceMaskScaleND_pos _ _ _).le k) | |
| end CurrentFalconer.TreeND | |
| end GraphLiteralSupport | |
| end | |
| end | |
| end OAI | |