Download data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyRecursion.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.27 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyRecursion.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyRecursion.lean
-
curl -L -o GreedyRecursion.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SKBarriers/Dynamics/GreedyRecursion.lean
4.27 kB
| import Mathlib | |
| import OAI.Probability.SKBarriers.Dynamics.Crossing | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open scoped BigOperators | |
| open MeasureTheory ProbabilityTheory Filter Set | |
| namespace SK.Analytic | |
| structure GreedyRecord (n : β) where | |
| refs : β β Config n | |
| time : β | |
| kept : Finset β | |
| def greedyRun {n : β} (base : β β Config n) | |
| (pick : β β (β β Config n) β β β Config n) | |
| (x : β β Config n) (r : β β β) (b : β) (m : β) : β β GreedyRecord n | |
| | 0 => β¨base,0,β β© | |
| | j+1 => | |
| let s := greedyRun base pick x r b m j | |
| let w := pick j s.refs s.time | |
| β¨Function.update s.refs j w, | |
| if j=0 then firstCrossing (fun k => overlap w (x k)) (r j) m | |
| else lastCrossing (fun k => overlap w (x k)) (r j) s.time, | |
| insert j (s.kept\s.kept.filter (fun i => b < |overlap (s.refs i) w|))β© | |
| def greedyReference {n : β} (base : β β Config n) | |
| (pick : β β (β β Config n) β β β Config n) | |
| (x : β β Config n) (r : β β β) (b : β) (m j : β) : Config n := | |
| pick j (greedyRun base pick x r b m j).refs (greedyRun base pick x r b m j).time | |
| theorem greedyRun_predictable {n : β} (base : β β Config n) | |
| (pick : β β (β β Config n) β β β Config n) | |
| (x : β β Config n) (r s : β β β) (b : β) (m j : β) | |
| (h : β i < j, r i=s i) : greedyRun base pick x r b m j=greedyRun base pick x s b m j := by | |
| induction j with | |
| | zero => rfl | |
| | succ j ih => | |
| have hp := ih (fun i hi => h i (by omega)) | |
| simp only [greedyRun,hp,h j (by omega)] | |
| theorem greedyReference_predictable {n : β} (base : β β Config n) | |
| (pick : β β (β β Config n) β β β Config n) | |
| (x : β β Config n) (r s : β β β) (b : β) (m j : β) | |
| (h : β i < j, r i=s i) : greedyReference base pick x r b m j=greedyReference base pick x s b m j := by | |
| unfold greedyReference | |
| rw [greedyRun_predictable base pick x r s b m j h] | |
| theorem greedyRun_refs {n : β} (base : β β Config n) | |
| (pick : β β (β β Config n) β β β Config n) | |
| (x : β β Config n) (r : β β β) (b : β) (m j i : β) (hi : i < j) : | |
| (greedyRun base pick x r b m j).refs i=greedyReference base pick x r b m i := by | |
| induction j with | |
| | zero => omega | |
| | succ j ih => | |
| by_cases he : i=j | |
| Β· subst i | |
| simp only [greedyRun,Function.update_self] | |
| rfl | |
| Β· simpa only [greedyRun,Function.update_of_ne he] using ih (by omega) | |
| theorem greedyRun_range {n : β} (base : β β Config n) | |
| (pick : β β (β β Config n) β β β Config n) | |
| (x : β β Config n) (r : β β β) (b : β) (m j : β) : | |
| β i β (greedyRun base pick x r b m j).kept, i < j := by | |
| induction j with | |
| | zero => simp [greedyRun] | |
| | succ j ih => | |
| intro i hi | |
| simp only [greedyRun,Finset.mem_insert] at hi | |
| rcases hi with rfl | hi | |
| Β· omega | |
| Β· have := ih i (Finset.mem_sdiff.mp hi).1 | |
| omega | |
| def bankPick {n : β} (pool : β β Finset (Config n)) (fallback : β β Config n) | |
| (B : β) (x : β β Config n) (t q : β) | |
| (j : β) (v : β β Config n) (u : β) : Config n := | |
| if h : β w β pool j, q β€ overlap w (x u) β§ | |
| β i, j/B*B β€ i β i < j β |overlap (v i) w| β€ 3*t | |
| then h.choose else fallback j | |
| theorem bankPick_mem {n : β} (pool : β β Finset (Config n)) (fallback : β β Config n) | |
| (hf : β j, fallback j β pool j) (B : β) (x : β β Config n) (t q : β) | |
| (j : β) (v : β β Config n) (u : β) : bankPick pool fallback B x t q j v u β pool j := by | |
| unfold bankPick | |
| split_ifs with h | |
| Β· exact h.choose_spec.1 | |
| Β· exact hf j | |
| theorem bankPick_spec {n : β} (pool : β β Finset (Config n)) (fallback : β β Config n) | |
| (B : β) (x : β β Config n) (t q : β) | |
| (j : β) (v : β β Config n) (u : β) | |
| (h : β w β pool j, q β€ overlap w (x u) β§ | |
| β i, j/B*B β€ i β i < j β |overlap (v i) w| β€ 3*t) : | |
| q β€ overlap (bankPick pool fallback B x t q j v u) (x u) β§ | |
| β i, j/B*B β€ i β i < j β |overlap (v i) (bankPick pool fallback B x t q j v u)| β€ 3*t := by | |
| rw [bankPick,dite_eq_left h] | |
| exact h.choose_spec.2 | |
| end SK.Analytic | |
| end | |
| end | |
| end OAI | |