Download data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchErrorBounds.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.55 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchErrorBounds.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchErrorBounds.lean
-
curl -L -o BranchErrorBounds.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchErrorBounds.lean
5.55 kB
| import OAI.MeasureTheory.Falconer.Recursion.BranchExponent | |
| import OAI.MeasureTheory.Falconer.Angular.AngularUniformAbsorption | |
| namespace OAI | |
| namespace PlanarFalconer | |
| theorem DiscreteProfileLipschitz.increment_le_one {A : β β β} {N i j : β} | |
| (hA : DiscreteProfileLipschitz A N) (hN : 0 < N) (hi : i β€ N) (hj : j β€ N) : | |
| |A i-A j| β€ 1 := by | |
| apply (hA i hi j hj).trans | |
| apply (div_le_one (Nat.cast_pos.mpr hN)).mpr | |
| apply abs_le.mpr | |
| have hi' : (i:β) β€ N := Nat.cast_le.mpr hi | |
| have hj' : (j:β) β€ N := Nat.cast_le.mpr hj | |
| constructor <;> linarith [Nat.cast_nonneg (Ξ± := β) i,Nat.cast_nonneg (Ξ± := β) j] | |
| theorem DiscreteProfileLipschitz.abs_le_one {A : β β β} {N i : β} | |
| (hA : DiscreteProfileLipschitz A N) (hN : 0 < N) (hzero : A 0 = 0) (hi : i β€ N) : | |
| |A i| β€ 1 := by | |
| simpa only [hzero,sub_zero] using hA.increment_le_one hN hi (Nat.zero_le N) | |
| theorem DiscreteProfileLipschitz.minimum_cost_le_one {A : β β β} {N a t i : β} | |
| (hA : DiscreteProfileLipschitz A N) (hN : 0 < N) | |
| (hat : a β€ t) (ht : t β€ N) (hi : i β€ N) : | |
| A i-intervalMin A a t β€ 1 := by | |
| obtain β¨j,_,hjt,hminβ© := intervalMin_attained A hat | |
| rw [hmin] | |
| exact (le_abs_self _).trans (hA.increment_le_one hN hi (hjt.trans ht)) | |
| theorem BranchStep.cost_le_one {A : β β β} {N q : β} {sig : β} | |
| (hA : DiscreteProfileLipschitz A N) (hN : 0 < N) (hq : 0 < q) | |
| {s u : BranchState} {l : BranchLabel} (h : BranchStep A N q sig s l u) | |
| (hs : s.Valid N sig) (hu : u.Valid N sig) : branchCost A s l u β€ 1 := by | |
| have hn := h.nested hq hs | |
| have hsd := BranchState.valid_depths hs | |
| have hud := BranchState.valid_depths hu | |
| cases h <;> simp only [branchCost] | |
| Β· exact hA.minimum_cost_le_one hN hn.2 hsd.2 (hud.2.trans (le_refl _)) | |
| Β· norm_num | |
| Β· exact hA.minimum_cost_le_one hN hn.1 (hud.1.trans hud.2) (hud.1.trans hud.2) | |
| Β· norm_num | |
| Β· norm_num | |
| Β· exact hA.minimum_cost_le_one hN hn.1 (hud.1.trans hud.2) (hud.1.trans hud.2) | |
| theorem BranchStep.exponent_le_four {A : β β β} {N q : β} {lam sig eps : β} | |
| (hA : DiscreteProfileLipschitz A N) (hN : 0 < N) (hq : 0 < q) | |
| (hloss : 4000*(lam+sig) β€ 1) | |
| {s u : BranchState} {l : BranchLabel} (h : BranchStep A N q sig s l u) | |
| (hs : s.Valid N sig) (hu : u.Valid N sig) : | |
| branchExponent A lam sig eps s l u β€ 4+eps := by | |
| have hc := h.cost_le_one hA hN hq hs hu | |
| have hsd := BranchState.valid_depths hs | |
| have hud := BranchState.valid_depths hu | |
| have hi := abs_le.mp (hA.increment_le_one hN (hud.1.trans hud.2) (hsd.1.trans hsd.2)) | |
| unfold branchExponent | |
| split_ifs <;> linarith | |
| theorem PolicyBranch.ancestor_exponent_bound {A : β β β} {N q n : β} {lam sig eps : β} | |
| (b : PolicyBranch A N q sig n) (hA : DiscreteProfileLipschitz A N) | |
| (hN : 0 < N) (hq : 0 < q) (hloss : 4000*(lam+sig) β€ 1) : | |
| (β j β Finset.range n, branchExponent A lam sig eps (b.state j) (b.label j) (b.state (j+1))) β€ | |
| (n:β)*(4+eps) := by | |
| calc | |
| _ β€ β _j β Finset.range n, (4+eps) := by | |
| apply Finset.sum_le_sum | |
| intro j hj | |
| have hj := Finset.mem_range.mp hj | |
| exact (b.step j hj).exponent_le_four hA hN hq hloss (b.valid j hj.le) | |
| (b.valid (j+1) (by omega)) | |
| _ = _ := by simp only [Finset.sum_const,Finset.card_range,nsmul_eq_mul] | |
| theorem source_error_exponent {sig kap T eps n : β} | |
| (hsig : 0 < sig) (hkap : 0 < kap) (hn : 0 β€ n) | |
| (hdepth : n β€ 20/kap+1/sig) (heps : eps β€ 1) | |
| (hT : 1000*(1/sig+1/kap)+1000 < T) : -T+n*(4+eps) < -10 := by | |
| have hstep : n*(4+eps) β€ 5*n := by nlinarith | |
| have hk : 0 < 1/kap := by positivity | |
| have hs : 0 < 1/sig := by positivity | |
| have he : 20/kap = 20*(1/kap) := by ring | |
| rw [he] at hdepth | |
| linarith | |
| theorem uniform_source_error_branch {lam sig kap T eps : β} | |
| (hsig : 0 < sig) (hkap : 0 < kap) (hkap1 : kap β€ 1) (hgap : sig < kap/1000) | |
| (hloss : 4000*(lam+sig) β€ 1) (heps : eps β€ 1) | |
| (hT : 1000*(1/sig+1/kap)+1000 < T) : | |
| β Nβ : β, 0 < Nβ β§ β N β₯ Nβ, β A : β β β, | |
| DiscreteProfileLipschitz A N β β n : β, | |
| β b : PolicyBranch A N (sourcePolicyBlock N kap) sig n, | |
| (b.state 0).index = 0 β | |
| ((2:β)^N)^(-T+(β j β Finset.range n, | |
| branchExponent A lam sig eps (b.state j) (b.label j) (b.state (j+1)))) β€ | |
| ((2:β)^N)^(-10:β) := by | |
| obtain β¨Nβ,hNβ,hββ© := uniform_source_branch_depth hsig hkap hkap1 hgap | |
| refine β¨Nβ,hNβ,?_β© | |
| intro N hN A hA n b hi | |
| have hNp : 0 < N := hNβ.trans_le hN | |
| have hc := b.ancestor_exponent_bound (eps := eps) hA hNp (sourcePolicyBlock_pos hNp hkap) hloss | |
| have hd := (hβ N hN A n b hi).2.2.1 | |
| have he := source_error_exponent hsig hkap (Nat.cast_nonneg n) hd heps hT | |
| apply Real.rpow_le_rpow_of_exponent_le (one_le_powβ (by norm_num)) | |
| linarith | |
| theorem source_profile_exponent_lower {A : β β β} {N a t Q : β} | |
| (hA : DiscreteProfileLipschitz A N) (hN : 0 < N) (hzero : A 0 = 0) | |
| (hQ : 0 < Q) (hw : a+Q β€ t) (ht : t β€ N) : | |
| -4 β€ 2*A a-potential A a t Q := by | |
| have ha := abs_le.mp (hA.abs_le_one hN hzero (show a β€ N by omega)) | |
| have hb := abs_le.mp (hA.abs_le_one hN hzero (show a+Q β€ N by omega)) | |
| have hp := potential_le A (Q := Q) (le_refl a) (by omega : a < a+Q) hw (le_refl _) | |
| linarith | |
| theorem uniform_recursion_count_subpower (D : β) {eta : β} (heta : 0 < eta) : | |
| β Nβ : β, β N β₯ Nβ, (4*(N:β)+1)^D β€ ((2:β)^N)^eta := | |
| fixed_polynomial_subpower D heta | |
| end PlanarFalconer | |
| end OAI | |