Download data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/SourceSymbol.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 15 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/SourceSymbol.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/SourceSymbol.lean
-
curl -L -o SourceSymbol.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/SourceSymbol.lean
15 kB
| import Mathlib | |
| import OAI.MeasureTheory.Falconer.Model | |
| import OAI.MeasureTheory.Falconer.Recursion.PolicyDescriptors | |
| import OAI.MeasureTheory.FalconerCompletion.Angular.SymbolMulDerivativeBound | |
| import OAI.MeasureTheory.FalconerCompletion.Recursion.PolicyAngular | |
| 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 Filter | |
| open scoped ENNReal RealInnerProductSpace ContDiff Topology Classical | |
| variable {d : β} | |
| noncomputable def actualSourceSymbol | |
| (A : β β β) (N q a t : β) | |
| (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| (f : EuclideanSpace β (Fin d) β β) (Q : SmoothFunctionND (EuclideanSpace β (Fin d))) | |
| (x : EuclideanSpace β (Fin d)) : SmoothFunctionND (EuclideanSpace β (Fin d)) := | |
| β¨fun w => f x*(Q.1 w*(actualPolicyAngular A N q a t L Ο m sig C J i x).1 w), | |
| contDiff_const.mul ((show ContDiff β β Q.1 from Q.2).mul (show ContDiff β β (actualPolicyAngular A N q a t L Ο m sig C J i x).1 from (actualPolicyAngular A N q a t L Ο m sig C J i x).2))β© | |
| lemma actualSourceSymbol_measurable | |
| (A : β β β) (N q a t : β) | |
| (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| (f : EuclideanSpace β (Fin d) β β) (hf : Measurable f) | |
| (Q : SmoothFunctionND (EuclideanSpace β (Fin d))) : | |
| Measurable (fun z : EuclideanSpace β (Fin d) Γ EuclideanSpace β (Fin d) => | |
| (actualSourceSymbol A N q a t L Ο m sig C J i f Q z.1).1 z.2) := by | |
| exact (hf.comp measurable_fst).mul (((show ContDiff β β Q.1 from Q.2).continuous.measurable.comp measurable_snd).mul | |
| (actualPolicyAngular_measurable A N q a t L Ο m sig C J i)) | |
| lemma actualSourceSymbol_support | |
| (A : β β β) (N q a t : β) | |
| (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| (f : EuclideanSpace β (Fin d) β β) (Q : SmoothFunctionND (EuclideanSpace β (Fin d))) | |
| (k : β) (x : EuclideanSpace β (Fin d)) : | |
| tsupport (iteratedFDeriv β k (actualSourceSymbol A N q a t L Ο m sig C J i f Q x).1) β | |
| tsupport (actualPolicyAngular A N q a t L Ο m sig C J i x).1 := | |
| (tsupport_iteratedFDeriv_subset k).trans (tsupport_mul_subset_right.trans tsupport_mul_subset_right) | |
| noncomputable def actualPolicyAmbientGood | |
| (A : β β β) (N q a t : β) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| (x : EuclideanSpace β (Fin d)) : Set (EuclideanSpace β (Fin d)) := | |
| {w | βwββ 1 β¨ β bβpolicyDescriptorList A N q a t, (x,w)βendpointGood Ο m N sig C J i b} | |
| lemma actualPolicyAmbientGood_even | |
| (A : β β β) (N q a t : β) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| (x : EuclideanSpace β (Fin d)) {w : EuclideanSpace β (Fin d)} | |
| (hw : wβactualPolicyAmbientGood A N q a t Ο m sig C J i x) : | |
| -wβactualPolicyAmbientGood A N q a t Ο m sig C J i x := by | |
| rcases hw with hn | hg | |
| Β· exact Or.inl (by simpa only [norm_neg] using hn) | |
| Β· right | |
| intro b hb P hP hx | |
| exact descriptorGood_neg Ο m N sig C J i P b (hg b hb P hP hx) | |
| lemma actualPolicyAmbientGood_measurable | |
| (A : β β β) (N q a t : β) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) [IsFiniteMeasure Ο] | |
| (m : β β β) (sig C : β) (J i : β) : | |
| MeasurableSet {z : EuclideanSpace β (Fin d) Γ EuclideanSpace β (Fin d) | | |
| z.2βactualPolicyAmbientGood A N q a t Ο m sig C J i z.1} := by | |
| change MeasurableSet ({z | βz.2ββ 1} βͺ {z | β bβpolicyDescriptorList A N q a t, | |
| zβendpointGood Ο m N sig C J i b}) | |
| refine ((measurable_snd.norm (measurableSet_singleton 1)).compl).union ?_ | |
| simp only [ofPred_forall] | |
| exact Finset.measurableSet_biInter _ (fun b hb => measurable_endpointGood Ο m N sig C J i b) | |
| lemma uniform_actualSourceSymbol_support {sig : β} (hsig : 0<sig) {J : β} (hJ : 0<J) : | |
| β Nβ : β, β N β₯ Nβ, β (Ο : Measure (EuclideanSpace β (Fin d))), IsFiniteMeasure Ο β | |
| β (A : β β β) (q a t : β), 0<q β tβ€N β | |
| β (m : β β β) (C : β) (i : β) | |
| (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (f : EuclideanSpace β (Fin d) β β) (Q : SmoothFunctionND (EuclideanSpace β (Fin d))) | |
| (k : β) (x : EuclideanSpace β (Fin d)), | |
| tsupport (iteratedFDeriv β k (actualSourceSymbol A N q a t L Ο m sig C J i f Q x).1) β | |
| actualPolicyAmbientGood A N q a t Ο m sig C J (i+1) x := by | |
| obtain β¨Nβ,hββ© := uniform_actualPolicyAngular_support (d:=d) hsig hJ | |
| refine β¨Nβ,?_β© | |
| intro N hN Ο hf A q a t hq ht m C i L f Q k x w hw | |
| by_cases hn : βwβ=1 | |
| Β· right | |
| have hs := actualSourceSymbol_support A N q a t L Ο m sig C J i f Q k x hw | |
| have hts : tsupport (iteratedFDeriv β 0 (actualPolicyAngular A N q a t L Ο m sig C J i x).1)= | |
| tsupport (actualPolicyAngular A N q a t L Ο m sig C J i x).1 := by | |
| apply congrArg closure | |
| ext z | |
| simp only [Function.mem_support] | |
| rw [β norm_ne_zero_iff,norm_iteratedFDeriv_zero,norm_ne_zero_iff] | |
| apply hβ N hN Ο hf A q a t hq ht m C i L 0 x w hn | |
| rwa [hts] | |
| Β· exact Or.inl hn | |
| lemma uniform_actualSourceSymbol_derivatives | |
| (W : Finset (List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d)))) | |
| (M B total : β) (hW : β L β W, L.length β€ B) (sig : β) (hsig : 0<sig) | |
| (Cq : β) (hCq : 0β€Cq) : | |
| β E : β, 0β€E β§ βαΆ N : β in atTop, β (A : β β β) (q a t : β), 0<q β | |
| β (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (C : β) (J i : β) | |
| (f : EuclideanSpace β (Fin d) β β) (Q : SmoothFunctionND (EuclideanSpace β (Fin d))), | |
| (β b β policyDescriptorList A N q a t, L b β W) β | |
| (β b β policyDescriptorList A N q a t, (L b).length β€ total) β | |
| (β x, βf xββ€1) β (β jβ€M, β w, βwβ=1 β βiteratedFDeriv β j Q.1 wββ€Cq) β | |
| β (x : EuclideanSpace β (Fin d)), β j β€ M, β w, βwβ=1 β | |
| βiteratedFDeriv β j (actualSourceSymbol A N q a t L Ο m sig C J i f Q x).1 wβ β€ | |
| E*(((2:β)^N)^sig* | |
| sourceMaskScaleND ((policyDescriptorList A N q a t).sup descriptorLength) ((2:β)^N) sig)^j := by | |
| obtain β¨D,hD,hDbβ© := uniform_actualPolicyAngular_derivatives W M B total hW sig hsig | |
| refine β¨Cq*D^total*2^M,by positivity,?_β© | |
| filter_upwards [hDb] with N hDb | |
| intro A q a t hq L Ο m C J i f Q hL htotal hf hQ x j hj w hw | |
| let Z := actualPolicyAngular A N q a t L Ο m sig C J i x | |
| let scale := ((2:β)^N)^sig*sourceMaskScaleND | |
| ((policyDescriptorList A N q a t).sup descriptorLength) ((2:β)^N) sig | |
| have hscale : 1 β€ scale := one_le_mul_of_one_le_of_one_le | |
| (Real.one_le_rpow (one_le_powβ (by norm_num : (1:β)β€2)) hsig.le) | |
| (sourceMaskScaleND_one_le _ _ _) | |
| have hb := symbol_mul_derivative_boundND Q Z j hCq (pow_nonneg (zero_le_one.trans hD) total) | |
| (zero_le_one.trans hscale) w (fun k hk => | |
| (hQ k (hk.trans hj) w hw).trans (le_mul_of_one_le_right hCq (one_le_powβ hscale))) | |
| (fun k hk => hDb A q a t hq L Ο m C J i hL htotal x k (hk.trans hj) w hw) | |
| have hh := symbol_const_mul_derivative_boundND (smoothMulND Q Z) (f x) (hf x) j w | |
| apply hh.trans (hb.trans ?_) | |
| rw [mul_pow] | |
| change Cq*D^total*(2^j*scale^j) β€ Cq*D^total*2^M*scale^j | |
| rw [mul_assoc (Cq*D^total) (2^M)] | |
| exact mul_le_mul_of_nonneg_left | |
| (mul_le_mul_of_nonneg_right (pow_le_pow_rightβ (by norm_num : (1:β)β€2) hj) | |
| (pow_nonneg (zero_le_one.trans hscale) j)) (mul_nonneg hCq (pow_nonneg (zero_le_one.trans hD) total)) | |
| end CurrentFalconer.TreeND | |
| end GraphLiteralSupport | |
| end | |
| end | |
| 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 : β} | |
| lemma actualEndpointSmooth_reached (Ο : Measure (EuclideanSpace β (Fin d))) | |
| (m : β β β) (N : β) (sig C : β) (J i : β) (b : PolicyDescriptor) | |
| {P : CellPath d} (ha : descriptorAnchor b β€ P.length) | |
| {x y : EuclideanSpace β (Fin d)} (hx : xβtreeCell P) (hy : yβtreeCell P) : | |
| actualEndpointSmooth Ο m N sig C J i b x = actualEndpointSmooth Ο m N sig C J i b y := by | |
| have hP : P.take (descriptorAnchor b) β dyadicPaths (descriptorAnchor b) := by | |
| simp only [mem_dyadicPaths,List.length_take,Nat.min_eq_left ha] | |
| rw [actualEndpointSmooth_of_mem Ο m N sig C J i b hP (treeCell_subset_take P _ hx), | |
| actualEndpointSmooth_of_mem Ο m N sig C J i b hP (treeCell_subset_take P _ hy)] | |
| lemma actualEndpointAngular_reached | |
| (L : List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (N : β) (sig C : β) | |
| (J i : β) (b : PolicyDescriptor) {P : CellPath d} (ha : descriptorAnchor b β€ P.length) | |
| {x y : EuclideanSpace β (Fin d)} (hx : xβtreeCell P) (hy : yβtreeCell P) : | |
| actualEndpointAngular L Ο m N sig C J i b x = actualEndpointAngular L Ο m N sig C J i b y := by | |
| unfold actualEndpointAngular | |
| rw [actualEndpointSmooth_reached Ο m N sig C J i b ha hx hy] | |
| lemma actualAngularProduct_reached {ΞΉ : Type*} [DecidableEq ΞΉ] | |
| (S : Finset ΞΉ) (b : ΞΉ β PolicyDescriptor) | |
| (L : ΞΉ β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (N : β) (sig C : β) | |
| (J i : β) {P : CellPath d} (ha : β eβS, descriptorAnchor (b e) β€ P.length) | |
| {x y : EuclideanSpace β (Fin d)} (hx : xβtreeCell P) (hy : yβtreeCell P) : | |
| actualAngularProduct S b L Ο m N sig C J i x = actualAngularProduct S b L Ο m N sig C J i y := by | |
| apply Subtype.ext | |
| funext w | |
| apply Finset.prod_congr rfl | |
| intro e he | |
| exact congrArg (fun f : SmoothFunctionND (EuclideanSpace β (Fin d)) => f.1 w) | |
| (actualEndpointAngular_reached (L e) Ο m N sig C J i (b e) (ha e he) hx hy) | |
| noncomputable def reachedDescriptorList (A : β β β) (N q a t r : β) : Finset PolicyDescriptor := | |
| (policyDescriptorList A N q a t).filter (fun b => descriptorAnchor bβ€r) | |
| noncomputable def unreachedDescriptorList (A : β β β) (N q a t r : β) : Finset PolicyDescriptor := | |
| (policyDescriptorList A N q a t).filter (fun b => r<descriptorAnchor b) | |
| lemma actualPolicyAngular_reached_factorization | |
| (A : β β β) (N q a t r : β) | |
| (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| (x : EuclideanSpace β (Fin d)) : | |
| actualPolicyAngular A N q a t L Ο m sig C J i x = | |
| smoothMulND | |
| (actualAngularProduct (reachedDescriptorList A N q a t r) id L Ο m N sig C J i x) | |
| (actualAngularProduct (unreachedDescriptorList A N q a t r) id L Ο m N sig C J i x) := by | |
| apply Subtype.ext | |
| funext w | |
| change (β bβpolicyDescriptorList A N q a t, (actualEndpointAngular (L b) Ο m N sig C J i b x).1 w) = _ | |
| simpa only [reachedDescriptorList,unreachedDescriptorList,actualAngularProduct,smoothMulND,smoothFinsetProductND, | |
| id_eq, not_le] using (Finset.prod_filter_mul_prod_filter_not | |
| (policyDescriptorList A N q a t) (fun b => descriptorAnchor bβ€r) | |
| (fun b => (actualEndpointAngular (L b) Ο m N sig C J i b x).1 w)).symm | |
| lemma reachedSymbol_constant_on_cell | |
| (A : β β β) (N q a t : β) | |
| (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (sig C : β) (J i : β) | |
| {P : CellPath d} {x y : EuclideanSpace β (Fin d)} (hx : xβtreeCell P) (hy : yβtreeCell P) : | |
| actualAngularProduct (reachedDescriptorList A N q a t P.length) id L Ο m N sig C J i x = | |
| actualAngularProduct (reachedDescriptorList A N q a t P.length) id L Ο m N sig C J i y := | |
| actualAngularProduct_reached _ _ _ _ _ _ _ _ _ _ | |
| (fun _ hb => (Finset.mem_filter.mp hb).2) hx hy | |
| lemma uniform_reachedSymbol_bound | |
| (W : Finset (List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d)))) | |
| (B total : β) (hW : β LβW, L.lengthβ€B) (sig : β) (hsig : 0<sig) : | |
| β D : β, 1β€D β§ βαΆ N : β in Filter.atTop, β (A : β β β) (q a t r : β), 0<q β | |
| β (L : PolicyDescriptor β List (EuclideanSpace β (Fin d) βL[β] EuclideanSpace β (Fin d))) | |
| (Ο : Measure (EuclideanSpace β (Fin d))) (m : β β β) (C : β) (J i : β), | |
| (β b β policyDescriptorList A N q a t, L bβW) β | |
| (β bβpolicyDescriptorList A N q a t, (L b).length β€ total) β | |
| β (x w : EuclideanSpace β (Fin d)), βwβ=1 β | |
| β(actualAngularProduct (reachedDescriptorList A N q a t r) id L Ο m N sig C J i x).1 wβ β€ D^total := by | |
| obtain β¨D,hD,hDbβ© := uniform_actualAngularProduct_derivatives | |
| (ΞΉ:=PolicyDescriptor) W 0 B total 3 hW 8 sig hsig | |
| refine β¨D,hD,?_β© | |
| filter_upwards [hDb,Filter.eventually_ge_atTop 1] with N hDb hN | |
| intro A q a t r hq L Ο m C J i hL htotal x w hw | |
| have hsub : reachedDescriptorList A N q a t r β policyDescriptorList A N q a t := Finset.filter_subset _ _ | |
| have hcard : ((reachedDescriptorList A N q a t r).card:β)β€8*(N:β)^3 := by | |
| calc | |
| _ β€ ((policyDescriptorList A N q a t).card:β) := by exact_mod_cast Finset.card_le_card hsub | |
| _ β€ _ := actualPolicy_card_bound A hN hq | |
| have hsum : β bβreachedDescriptorList A N q a t r, (L b).length β€ total := | |
| (Finset.sum_le_sum_of_subset_of_nonneg hsub (by intros; exact Nat.zero_le _)).trans htotal | |
| have hh := hDb (reachedDescriptorList A N q a t r) id L Ο m C J i | |
| ((policyDescriptorList A N q a t).sup descriptorLength) hcard | |
| (fun b hb => hL b (hsub hb)) hsum (fun b hb => Finset.le_sup (f:=descriptorLength) (hsub hb)) x 0 le_rfl w hw | |
| simpa only [norm_iteratedFDeriv_zero,pow_zero,mul_one] using hh | |
| end CurrentFalconer.TreeND | |
| end GraphLiteralSupport | |
| end | |
| end | |
| end OAI | |