Download data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyStep.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.61 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyStep.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyStep.lean
-
curl -L -o GreedyStep.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyStep.lean
6.61 kB
| import Mathlib | |
| import OAI.Probability.SKBarriers.Dynamics.Crossing | |
| import OAI.Probability.SKBarriers.Dynamics.ConflictSuffix | |
| import OAI.Probability.SKBarriers.Dynamics.ProtectedStep | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open scoped BigOperators | |
| open MeasureTheory ProbabilityTheory Filter Set | |
| namespace SK.Analytic | |
| theorem greedy_locking_step {n : β} (hn : 0 < n) (ΞΌ : ProbabilityMeasure β) | |
| (v : β β Config n) (w : Config n) (x : β β Config n) (A : Finset β) | |
| (r : β β β) (B H j u : β) (t Ο E d b b' q : β) | |
| (hj : 0 < j) (hB : 0 < B) (hHB : H < B) (hH : β2/b^2ββ β€ H) | |
| (ht : 0 < t) (hΟ : 0 < Ο) (hE : 0 β€ E) (hd : 0 β€ d) (hb : 0 < b) | |
| (hpack : 3*t < b^2/2) (hcsmall : 3*t < b) (hEst : E < t) | |
| (hsmall' : 2*t+E+2*(n:β)^(-(1:β)/100) < b') | |
| (hsep' : 2*E+4*(n:β)^(-(1:β)/100) < 3*Ο) | |
| (hwidth : Ο^8 < t/2) | |
| (hsmall : E+2*(n:β)^(-(1:β)/100)+Ο^20+d/2 < Ο^8) | |
| (hsep : E+2*(n:β)^(-(1:β)/100)+Ο^20+3*d/2 β€ 2*Ο) | |
| (hd' : d/2 β€ Ο^20) (heta : 2*(n:β)^(-(1:β)/100) < 2*Ο^20) | |
| (hq : 2*t+E+2*(n:β)^(-(1:β)/100)+2*Ο^20 < q) | |
| (hr : β i β€ j, r i β Icc t (2*t)) | |
| (hspacing : β i k, i < k β k β€ j β 3*Ο β€ r k-r i) | |
| (hmass : β i < j, (ΞΌ : Measure β).real (Icc (r i-2*Ο^8) (r i+2*Ο^8)) β€ Ο^4) | |
| (hA : β i β A, i < j) (hblock : BlockProtected B j A) | |
| (hpath : β i β A, |overlap (v i) (x u)-r i| β€ E) | |
| (hpair : β i β A, β k β A, i < k β |overlap (v i) (v k)-r i| β€ E) | |
| (hanchor : q β€ overlap (v 0) (x 0)) (htarget : q β€ overlap w (x u)) | |
| (hcell : j%B β 0 β |overlap (v (j-1)) w| β€ 3*t) | |
| (hjump : β z k, k < u β |overlap z (x (k+1))-overlap z (x k)| β€ d) | |
| (hsigned : β i β A, (![v i,w,x u] : ReplicaConfig n 3) β signedLockingSet n q b) | |
| (hbank : β i β A, β k β A, i < k β | |
| (![v k,v i,w] : ReplicaConfig n 3) β signedLockingSet n b b' β§ | |
| (![v k,v i,flip w] : ReplicaConfig n 3) β signedLockingSet n b b') | |
| (hnarrow : β i β A, β k β€ u, | |
| (![v i,x k,w] : ReplicaConfig n 3) β narrowLockingSet n ΞΌ t Ο) : | |
| let D := A.filter (fun i => b < |overlap (v i) w|) | |
| let C := A\D | |
| let Ο := lastCrossing (fun k => overlap w (x k)) (r j) u | |
| IsRetainedSuffix A D β§ D.card β€ H β§ BlockProtected B (j+1) (insert j C) β§ | |
| 0 β C β§ Ο β€ u β§ overlap w (x Ο) β Icc (r j-d) (r j) β§ | |
| (β i β C, |overlap (v i) w-r i| β€ E+2*(n:β)^(-(1:β)/100)) β§ | |
| (β i β C, |overlap (v i) (x Ο)-r i| β€ E+2*(n:β)^(-(1:β)/100)+2*Ο^20) := by | |
| classical | |
| let F := 2*(n:β)^(-(1:β)/100) | |
| have hF : 0 β€ F := by dsimp [F]; positivity | |
| let D := A.filter (fun i => b < |overlap (v i) w|) | |
| let C := A\D | |
| have hc (i : β) (hi : i β C) : i β A β§ |overlap (v i) w| β€ b := by | |
| have H := Finset.mem_sdiff.mp hi | |
| exact β¨H.1,le_of_not_gt (fun hh => H.2 (Finset.mem_filter.mpr β¨H.1,hhβ©))β© | |
| have htransfer (i : β) (hi : i β A) (hcomp : |overlap (v i) w| β€ b) : | |
| |overlap (v i) w-overlap (v i) (x u)| β€ F := by | |
| apply signed_locking_of_not_mem (v i) w (x u) q b htarget hcomp _ (hsigned i hi) | |
| have hh := abs_add_le (overlap (v i) (x u)-r i) (r i) | |
| have hri := hr i (hA i hi).le | |
| rw [sub_add_cancel,abs_of_pos (ht.trans_le hri.1)] at hh | |
| linarith only [hh,hpath i hi,hri.2,hEst,hcsmall] | |
| have href (i : β) (hi : i β A) (hcomp : |overlap (v i) w| β€ b) : | |
| |overlap (v i) w-r i| β€ E+F := by | |
| have hh := abs_add_le (overlap (v i) w-overlap (v i) (x u)) (overlap (v i) (x u)-r i) | |
| rw [sub_add_sub_cancel] at hh | |
| linarith only [hh,htransfer i hi hcomp,hpath i hi] | |
| have hs : IsRetainedSuffix A D := by | |
| apply conflicts_are_suffix A v w r b b' t E F Ο hE ht.le hsmall' (by dsimp [F]; linarith only [hsep']) | |
| (fun i hi => hr i (hA i hi).le) (fun i hi k hk hik => hspacing i k hik (hA k hk).le) hpair href _ hF | |
| intro i hi k hk hik hconf hki hkw | |
| exact magnitude_locking_of_signed_avoid (v k) (v i) w b b' hconf.le hki hkw | |
| (hbank i hi k hk hik).1 (hbank i hi k hk hik).2 | |
| have hcard : D.card β€ H := by | |
| apply (conflict_filter_card hn A v w b (3*t) hb (by positivity) hpack _).trans hH | |
| intro i hi k hk hik | |
| have HH : |overlap (v i) (v k)-r (min i k)| β€ E := by | |
| rcases lt_or_gt_of_ne hik with h | h | |
| Β· simpa only [min_eq_left h.le] using hpair i hi k hk h | |
| Β· simpa only [min_eq_right h.le,overlap_comm (v k) (v i)] using hpair k hk i hi h | |
| have hm : min i k β€ j := (min_le_left _ _).trans (hA i hi).le | |
| have hh := abs_add_le (overlap (v i) (v k)-r (min i k)) (r (min i k)) | |
| rw [sub_add_cancel,abs_of_pos (ht.trans_le (hr _ hm).1)] at hh | |
| linarith only [hh,HH,(hr _ hm).2,hEst] | |
| have hp := protected_block_step B H j hB hHB A D hA hblock hs hcard (by | |
| intro hmod hmem | |
| have hh := (Finset.mem_filter.mp hmem).2 | |
| linarith only [hh,hcell hmod,hcsmall]) | |
| have hzero : 0 β C := hp.2 hj | |
| have hqj : r j < overlap w (x u) := by | |
| have hpow : 0 β€ Ο^20 := by positivity | |
| dsimp [F] at hF | |
| linarith only [(hr j le_rfl).2,htarget,hq,hE,hF,hpow] | |
| have hsend (i : β) (hi : i β C) : |overlap (v i) (x u)-overlap (v i) w| < 2*Ο^20 := by | |
| rw [abs_sub_comm] | |
| exact (htransfer i (hc i hi).1 (hc i hi).2).trans_lt heta | |
| have hex := anchored_backwards_crossing ΞΌ (v 0) w x t Ο (E+F) d (r 0) (r j) q u | |
| ht hΟ (hr 0 (by omega)) (hspacing 0 j hj le_rfl) hwidth hsmall hsep hd hd' | |
| (by dsimp [F]; linarith only [(hr 0 (by omega)).2,hq]) (hmass 0 hj) | |
| (href 0 (hc 0 hzero).1 (hc 0 hzero).2) hanchor hqj (hsend 0 hzero) hjump | |
| (hnarrow 0 (hc 0 hzero).1) | |
| have hlu := lastCrossing_le (fun k => overlap w (x k)) (r j) u | |
| refine β¨hs,hcard,hp.1,hzero,hlu,lastCrossing_band _ _ _ _ hqj hex (hjump w),?_,?_β© | |
| Β· intro i hi | |
| exact href i (hc i hi).1 (hc i hi).2 | |
| Β· intro i hi | |
| have hiA := (hc i hi).1 | |
| have Hn := narrow_backwards_transfer ΞΌ (v i) w x t Ο (E+F) d (r i) (r j) hlu | |
| ht hΟ (hr i (hA i hiA).le) (hspacing i j (hA i hiA) le_rfl) hwidth hsmall hsep hd' | |
| (hmass i (hA i hiA)) (href i hiA (hc i hi).2) (hsend i hi) | |
| (fun k _ hk => hjump (v i) k hk) | |
| (lastCrossing_search _ _ _ _ hd hqj (hjump w)) | |
| (fun k _ hk => hnarrow i hiA k hk) _ le_rfl hlu | |
| have HH := abs_add_le (overlap (v i) (x (lastCrossing (fun k => overlap w (x k)) (r j) u))-overlap (v i) w) | |
| (overlap (v i) w-r i) | |
| rw [sub_add_sub_cancel] at HH | |
| have HH2 := href i hiA (hc i hi).2 | |
| dsimp [F] at HH2 | |
| linarith only [HH,Hn,HH2] | |
| end SK.Analytic | |
| end | |
| end | |
| end OAI | |