Download data/lean/OAI/MeasureTheory/Falconer/Angular/ActualAngularRecursionBound.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.91 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Angular/ActualAngularRecursionBound.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/Falconer/Angular/ActualAngularRecursionBound.lean
-
curl -L -o ActualAngularRecursionBound.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Angular/ActualAngularRecursionBound.lean
6.91 kB
| import OAI.MeasureTheory.Falconer.Recursion.RecursiveCellInvariants | |
| import OAI.MeasureTheory.Falconer.Recursion.BranchExponent | |
| namespace OAI | |
| namespace PlanarFalconer | |
| open Set MeasureTheory | |
| open scoped ContDiff | |
| theorem AngularStateData.mul_childMaximum_le (d : AngularStateData) | |
| (k : Fin 2 β PolicyDescriptor β β) (h : Fin 2 β Plane β β) | |
| (p : β) (Ξ¨ : β β β) {c M : β} (hc : 0 < c) (hM : 0 β€ M) | |
| (hb : β row β d.children p, c*((d.successor p row).energy k h Ξ¨).toReal β€ M) : | |
| c*d.childMaximum k h p Ξ¨ β€ M := by | |
| have hh := d.childMaximum_le k h p Ξ¨ (div_nonneg hM hc.le) | |
| (fun row hr => (le_div_iffβ hc).mpr (by simpa only [mul_comm] using hb row hr)) | |
| exact (mul_le_mul_of_nonneg_left hh hc.le).trans_eq (by field_simp) | |
| theorem AngularStateData.mul_farDistanceMaximum_le (d : AngularStateData) | |
| [IsFiniteMeasure d.Ο] (b : β) {c M : β} (hc : 0 < c) (hM : 0 β€ M) | |
| (hb : β row β d.children b, β col β d.children b, | |
| angularSeparated d.Q d.Q b row col β | |
| c*((d.distanceSuccessor b).atCells row.1 col.1).coincidence.toReal β€ M β§ | |
| c*((d.distanceSuccessor b).atCells row.2 col.2).coincidence.toReal β€ M) : | |
| c*(d.farDistanceMaximum b).toReal β€ M := by | |
| have hh := d.farDistanceMaximum_le b (div_nonneg hM hc.le) (by | |
| intro row hr col hcol hs | |
| have hh := hb row hr col hcol hs | |
| exact β¨(le_div_iffβ hc).mpr (by simpa only [mul_comm] using hh.1), | |
| (le_div_iffβ hc).mpr (by simpa only [mul_comm] using hh.2)β©) | |
| exact (mul_le_mul_of_nonneg_left hh hc.le).trans_eq (by field_simp) | |
| theorem uniform_actual_angular_recursion_bound {lam sig kap eps : β} | |
| (hlam : 0 β€ lam) (hsig : 0 < sig) (hkap : 0 < kap) | |
| (hgap : sig < kap/1000) (heps : 0 < eps) (T : β) (K : β) | |
| {Ξ¨ : β β β} (hΞ¨ : ContDiff β β Ξ¨) (hpos : β x, 0 β€ Ξ¨ x) | |
| (hs : β x, Ξ¨ x β 0 β x β Ioo (1/4:β) 4) : | |
| β Nβ : β, β d : AngularStateData, | |
| d.lam = lam β d.sig = sig β d.q = sourcePolicyBlock d.N kap β | |
| d.J = sourceSmoothingLevels sig kap β Nβ β€ d.N β | |
| d.Q.side = 1 β d.Ο d.Q.carrierαΆ = 0 β | |
| d.branchState.Valid d.N d.sig β d.a+100*d.q < d.v β d.i+1 β€ d.J β | |
| d.X.length = d.a β d.Y.length = d.a β | |
| β B : β, β Ξ΄ : β, RegularizedProfileData d.Q d.Ο d.N B Ξ΄ d.lam d.mass β | |
| β k : Fin 2 β PolicyDescriptor β β, (β l, β e β d.retainedList d.a, k l e β€ K) β | |
| β h : Fin 2 β Plane β β, (β l, Measurable (h l)) β (β l x, βh l xβ β€ 1) β | |
| β M : β, 0 β€ M β | |
| (β p l, BranchStep d.profile d.N d.q d.sig d.branchState l (.H d.aβ d.tβ p d.v d.i) β | |
| β row β d.children p, | |
| ((2:β)^d.N)^(branchExponent d.profile lam sig eps d.branchState l (.H d.aβ d.tβ p d.v d.i)) * | |
| ((d.successor p row).energy k h Ξ¨).toReal β€ M) β | |
| (β b, BranchStep d.profile d.N d.q d.sig d.branchState .far (.D b d.v (d.i+1)) β | |
| β row β d.children b, β col β d.children b, angularSeparated d.Q d.Q b row col β | |
| ((2:β)^d.N)^(branchExponent d.profile lam sig eps d.branchState .far (.D b d.v (d.i+1))) * | |
| ((d.distanceSuccessor b).atCells row.1 col.1).coincidence.toReal β€ M β§ | |
| ((2:β)^d.N)^(branchExponent d.profile lam sig eps d.branchState .far (.D b d.v (d.i+1))) * | |
| ((d.distanceSuccessor b).atCells row.2 col.2).coincidence.toReal β€ M) β | |
| d.energy k h Ξ¨ β β€ β§ | |
| (d.energy k h Ξ¨).toReal β€ ((d.N:β)+1)*M+((2:β)^d.N)^(-T) := by | |
| obtain β¨Nβ,hββ© := source_angular_reduction hlam hsig hkap hgap heps T K hΞ¨ hpos hs | |
| refine β¨Nβ,?_β© | |
| intro d hdlam hdsig hdq hdJ hN hQ hcarry hv hw hi hX hY B Ξ΄ hprof k hk h hh hhb M hM hH hD | |
| change d.aβ β€ d.a β§ d.a β€ d.v β§ d.v β€ d.tβ β§ d.tβ β€ d.N β§ | |
| (d.tβ:β) β€ d.v+d.sig*d.N at hv | |
| have ht : (d.tβ:β) β€ d.v+sig*d.N := by simpa only [hdsig] using hv.2.2.2.2 | |
| obtain β¨hfinite,p,hap,hpv,_,_,hd | hnβ© := hβ d hdlam hdsig hdq hdJ hN hQ hcarry | |
| hv.1 hv.2.1 hv.2.2.1 hv.2.2.2.1 ht hw hi hX hY B Ξ΄ hprof k hk h hh hhb | |
| Β· obtain β¨e,rfl,he,hboundβ© := hd | |
| have hstep : BranchStep d.profile d.N d.q d.sig d.branchState .direct | |
| (.H d.aβ d.tβ (descriptorAnchor e) d.v d.i) := BranchStep.direct hw he | |
| have hm := d.mul_childMaximum_le k h (descriptorAnchor e) Ξ¨ | |
| (by positivity : 0 < ((2:β)^d.N)^(branchExponent d.profile lam sig eps d.branchState .direct | |
| (.H d.aβ d.tβ (descriptorAnchor e) d.v d.i))) hM (hH _ _ hstep) | |
| simp only [branchExponent,branchCost,BranchState.start,AngularStateData.branchState, reduceCtorEq,ite_false] at hm | |
| refine β¨hfinite,hbound.trans ?_β© | |
| nlinarith [mul_nonneg (Nat.cast_nonneg (Ξ± := β) d.N) hM] | |
| Β· obtain β¨rfl,hp5,_,hboundβ© := hn | |
| let p := d.v-2*sourceFarBuffer d.N ((d.retainedList d.a).sup descriptorLength) d.sig | |
| have hstep : BranchStep d.profile d.N d.q d.sig d.branchState .near | |
| (.H d.aβ d.tβ p d.v d.i) := BranchStep.near hw hap | |
| have hm := d.mul_childMaximum_le k h p Ξ¨ | |
| (by positivity : 0 < ((2:β)^d.N)^(branchExponent d.profile lam sig eps d.branchState .near | |
| (.H d.aβ d.tβ p d.v d.i))) hM (hH _ _ hstep) | |
| simp only [branchExponent,branchCost,BranchState.start,AngularStateData.branchState, reduceCtorEq,ite_false,add_zero] at hm | |
| have hnear : ((2:β)^d.N)^(-2*(d.profile p-d.profile d.a)+12*lam+eps)* | |
| d.childMaximum k h p Ξ¨ β€ M := by | |
| apply le_trans _ hm | |
| apply mul_le_mul_of_nonneg_right _ (d.childMaximum_nonneg k h p Ξ¨) | |
| exact Real.rpow_le_rpow_of_exponent_le (one_le_powβ (by norm_num)) (by linarith) | |
| let := hprof.probability | |
| have hfar : d.farSum p β€ (d.N:β)*M := by | |
| apply d.farSum_le_depth_factor p hp5 (hv.2.2.1.trans hv.2.2.2.1) hM | |
| intro b hb | |
| have hb' : b β Finset.Icc (d.a+9) (p+6) := Finset.mem_Icc.mpr | |
| β¨(Finset.mem_Icc.mp hb).1, by have := (Finset.mem_Icc.mp hb).2; omegaβ© | |
| have hstep : BranchStep d.profile d.N d.q d.sig d.branchState .far (.D b d.v (d.i+1)) := | |
| BranchStep.far hw hap hb' | |
| have hm := d.mul_farDistanceMaximum_le b | |
| (by positivity : 0 < ((2:β)^d.N)^(branchExponent d.profile lam sig eps d.branchState .far | |
| (.D b d.v (d.i+1)))) hM (hD b hstep) | |
| simp only [branchExponent,branchCost,BranchState.start,AngularStateData.branchState, reduceCtorEq,ite_false,add_zero] at hm | |
| apply le_trans _ hm | |
| apply mul_le_mul_of_nonneg_right _ ENNReal.toReal_nonneg | |
| apply Real.rpow_le_rpow_of_exponent_le (one_le_powβ (by norm_num)) | |
| simp only [hdlam,hdsig] | |
| linarith | |
| refine β¨hfinite,hbound.trans ?_β© | |
| change _ β€ ((d.N:β)+1)*M+_ | |
| dsimp only [p] at hnear hfar | |
| nlinarith | |
| end PlanarFalconer | |
| end OAI | |