Download data/lean/OAI/MeasureTheory/Falconer/Recursion/ActualDistanceRecursionBound.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.05 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/ActualDistanceRecursionBound.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/Falconer/Recursion/ActualDistanceRecursionBound.lean
-
curl -L -o ActualDistanceRecursionBound.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/ActualDistanceRecursionBound.lean
6.05 kB
| import OAI.MeasureTheory.Falconer.Angular.ActualAngularRecursionBound | |
| namespace OAI | |
| namespace PlanarFalconer | |
| open Set MeasureTheory | |
| open scoped ContDiff | |
| theorem PositiveDistanceData.mul_prefixLowMaximum_le (d : PositiveDistanceData) | |
| {c M : β} (hc : 0 < c) (hM : 0 β€ M) | |
| (hb : β v β d.prefixLowDepths, | |
| c*({d with t := v,i := d.i+1} : PositiveDistanceData).coincidence.toReal β€ M) : | |
| c*d.prefixLowMaximum β€ M := by | |
| have hh := d.prefixLowMaximum_le (div_nonneg hM hc.le) | |
| (fun v hv => (le_div_iffβ hc).mpr (by simpa only [mul_comm] using hb v hv)) | |
| exact (mul_le_mul_of_nonneg_left hh hc.le).trans_eq (by field_simp) | |
| theorem uniform_actual_distance_recursion_bound {lam sig kap eps T : β} | |
| (hlam : 0 β€ lam) (hsig : 0 < sig) (hkap : 0 < kap) | |
| (hgap : sig < kap/1000) (heps : 0 < eps) (hT : 0 < T) | |
| {Ξ¨ : β β β} (hΞ¨ : ContDiff β β Ξ¨) (hpos : β x, 0 β€ Ξ¨ x) | |
| (hs : β x, Ξ¨ x β 0 β x β Ioo (1/4:β) 4) | |
| (hone : β x β Icc (1/2:β) 2, 1 β€ Ξ¨ x) : | |
| β Kinv Nβ : β, β K β₯ Kinv, β d : PositiveDistanceData, | |
| 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.RecursiveCells β | |
| d.branchState.Valid d.N d.sig β d.a+100*d.q < d.t β d.i+1 β€ d.J β | |
| β B : β, β Ξ΄ : β, RegularizedProfileData d.Q d.Ο d.N B Ξ΄ d.lam d.mass β | |
| β M : β, 0 β€ M β ((2:β)^d.N)^(12*lam+eps) β€ M β | |
| (β t i l, BranchStep d.branchProfile d.N d.q d.sig d.branchState l (.D d.a t i) β | |
| ((2:β)^d.N)^(branchExponent d.branchProfile lam sig eps d.branchState l (.D d.a t i)) * | |
| ({d with t := t,i := i} : PositiveDistanceData).coincidence.toReal β€ M) β | |
| (β p v, β row β sourceProductVertices d.Q d.Q d.Ο d.Ο d.X d.Y (p-d.a), | |
| BranchStep d.branchProfile d.N d.q d.sig d.branchState .high (.H d.a d.t p v d.i) β | |
| β k : Fin 2 β PolicyDescriptor β β, (β l, β e β d.prefixRemainingList p, k l e β€ K) β | |
| β h : Fin 2 β Plane β β, (β l, Measurable (h l)) β (β l x, βh l xβ β€ 1) β | |
| ((2:β)^d.N)^(branchExponent d.branchProfile lam sig eps d.branchState .high (.H d.a d.t p v d.i)) * | |
| ((d.angularSuccessor p v row).energy k h Ξ¨).toReal β€ M) β | |
| d.coincidence β β€ β§ d.coincidence.toReal β€ 3*M+((2:β)^d.N)^(eps-T) := by | |
| obtain β¨Nβ,hββ© := source_positive_distance_suffix hlam hsig hkap heps | |
| obtain β¨Kinv,Nβ,hββ© := source_positive_distance_prefix hlam hsig hkap hgap heps hT hΞ¨ hpos hs hone | |
| refine β¨Kinv,max Nβ Nβ,?_β© | |
| intro K hK d hdlam hdsig hdq hdJ hN hQ hcarry hcells hv hw hi B Ξ΄ hprof M hM hfloor hD hH | |
| let := hprof.probability | |
| have hfinite := d.coincidence_ne_top | |
| change d.a β€ d.t β§ d.t β€ d.N at hv | |
| let p := policyDepth d.branchProfile d.N d.q d.a d.t | |
| have hRp : 0 < (2:β)^d.N := by positivity | |
| by_cases hp : d.a+d.t < 2*p | |
| Β· have hbound := hβ d hdlam hdsig hdq hdJ (by omega) hQ | |
| (hcells.stronglySeparated hQ) hcells.1 hcells.2.1 B Ξ΄ hprof hw hv.2 hi hp | |
| have hstep : BranchStep d.branchProfile d.N d.q d.sig d.branchState .suffix (.D d.a p (d.i+1)) := | |
| BranchStep.suffix hw hp | |
| have hm := hD p (d.i+1) .suffix hstep | |
| have hboundR := ENNReal.toReal_mono | |
| (ENNReal.mul_ne_top ENNReal.ofReal_ne_top | |
| ({d with t := p,i := d.i+1} : PositiveDistanceData).coincidence_ne_top) hbound | |
| rw [ENNReal.toReal_mul,ENNReal.toReal_ofReal (by positivity)] at hboundR | |
| simp only [branchExponent,branchCost,PositiveDistanceData.branchState,BranchState.start,BranchState.finish, | |
| sub_self,mul_zero,zero_add,reduceCtorEq,ite_false] at hm | |
| have hboundM : d.coincidence.toReal β€ M := hboundR.trans hm | |
| refine β¨hfinite,hboundM.trans ?_β© | |
| linarith [Real.rpow_pos_of_pos hRp (eps-T)] | |
| Β· have hp' : 2*p β€ d.a+d.t := by omega | |
| have hbound := hβ d hdlam hdsig hdq hdJ (by omega) hQ hcarry hcells.1 hcells.2.1 | |
| hcells.2.2.1 hcells.2.2.2 B Ξ΄ hprof hw hv.2 hi hp' | |
| have hlow : ((2:β)^d.N)^eps*d.prefixLowMaximum β€ M := by | |
| apply d.mul_prefixLowMaximum_le (by positivity) hM | |
| intro v hv | |
| have hm := hD v (d.i+1) .low (d.low_branch_transition hw hv) | |
| simpa only [branchExponent,branchCost,PositiveDistanceData.branchState,BranchState.start,sub_self,mul_zero, | |
| neg_zero,zero_add,ite_true] using hm | |
| let E := -2*(d.branchProfile p-d.branchProfile d.a)+height d.branchProfile d.a p+4000*(lam+sig) | |
| have hhigh : ((2:β)^d.N)^(E+eps)*d.prefixSuccessorSupremum Kinv p Ξ¨ β€ M := by | |
| have hsup := d.prefixSuccessorSupremum_le Kinv p Ξ¨ | |
| (div_nonneg hM (by positivity : 0 β€ ((2:β)^d.N)^(E+eps))) (by | |
| intro v hv hg row hr k hk h hh hhb | |
| have hm := hH p v row hr (d.high_branch_transition hw hp' hv hg row) k | |
| (fun l => (hk l).trans hK) h hh hhb | |
| apply (le_div_iffβ (by positivity : 0 < ((2:β)^d.N)^(E+eps))).mpr | |
| simpa only [branchExponent,branchCost,PositiveDistanceData.branchState,BranchState.start, | |
| reduceCtorEq,ite_false,E,mul_comm] using hm) | |
| exact (mul_le_mul_of_nonneg_left hsup (by positivity)).trans_eq (by field_simp) | |
| have hfloor' : ((2:β)^d.N)^eps*((2:β)^d.N)^(12*lam) β€ M := by | |
| rw [β Real.rpow_add hRp,add_comm eps] | |
| exact hfloor | |
| have hhigh' : ((2:β)^d.N)^eps*(((2:β)^d.N)^E*d.prefixSuccessorSupremum Kinv p Ξ¨) β€ M := by | |
| rw [β mul_assoc,β Real.rpow_add hRp,add_comm eps] | |
| exact hhigh | |
| have herr : ((2:β)^d.N)^eps*((2:β)^d.N)^(-T) = ((2:β)^d.N)^(eps-T) := by | |
| rw [β Real.rpow_add hRp,sub_eq_add_neg] | |
| refine β¨hfinite,hbound.trans ?_β© | |
| change ((2:β)^d.N)^eps * (((2:β)^d.N)^(12*lam)+d.prefixLowMaximum+ | |
| ((2:β)^d.N)^E*d.prefixSuccessorSupremum Kinv p Ξ¨+((2:β)^d.N)^(-T)) β€ _ | |
| simp only [mul_add] | |
| rw [herr] | |
| linarith | |
| end PlanarFalconer | |
| end OAI | |