File size: 6,050 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 | 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
|