Download data/lean/OAI/Probability/MatroidProphet/LayerOnline.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.59 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/LayerOnline.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/MatroidProphet/LayerOnline.lean
-
curl -L -o LayerOnline.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/LayerOnline.lean
6.59 kB
| import OAI.Probability.MatroidProphet.Rounding | |
| import OAI.Probability.MatroidProphet.LayerGreedy | |
| namespace OAI | |
| namespace MatroidProphet | |
| open Set Finset | |
| noncomputable def assignedEligible {n : β} {K : Type*} | |
| (assign : Fin n β K β Option β€) (v : Fin n β K) : Finset (Fin n) := by | |
| classical | |
| exact univ.filter fun e => assign e (v e) β none | |
| def assignedLayer {n : β} {K : Type*} | |
| (assign : Fin n β K β Option β€) (v : Fin n β K) (e : Fin n) : β€ := | |
| (assign e (v e)).getD 0 | |
| noncomputable def layerKeyDecision {n : β} {K : Type*} | |
| (M : Matroid (Fin n)) (base : β€ β Set (Fin n)) | |
| (assign : Fin n β K β Option β€) (k : Fin n) | |
| (hist : Fin (k.val+1) β Fin n Γ K) : Bool := by | |
| classical | |
| let current := hist β¨k.val, Nat.lt_succ_self _β© | |
| exact match assign current.1 current.2 with | |
| | none => false | |
| | some b => decide (current.1 β M.closure (base b βͺ | |
| {f | β j : Fin (k.val+1), j.val < k.val β§ (hist j).1 = f β§ | |
| assign (hist j).1 (hist j).2 = some b})) | |
| def keyHistory {n : β} {K : Type*} (v : Fin n β K) | |
| (Ο : ArrivalOrder n) (k : Fin n) : Fin (k.val+1) β Fin n Γ K := | |
| fun j => (Ο (prefixIndex k j), v (Ο (prefixIndex k j))) | |
| lemma keyHistory_current {n : β} {K : Type*} (v : Fin n β K) | |
| (Ο : ArrivalOrder n) (k : Fin n) : | |
| keyHistory v Ο k β¨k.val, Nat.lt_succ_self _β© = (Ο k, v (Ο k)) := by | |
| rfl | |
| lemma keyHistory_prior {n : β} {K : Type*} (v : Fin n β K) | |
| (assign : Fin n β K β Option β€) (Ο : ArrivalOrder n) (k : Fin n) (b : β€) : | |
| {f | β j : Fin (k.val+1), j.val < k.val β§ (keyHistory v Ο k j).1 = f β§ | |
| assign (keyHistory v Ο k j).1 (keyHistory v Ο k j).2 = some b} = | |
| layerPrior (assignedEligible assign v) (assignedLayer assign v) | |
| (fun e => (Ο.symm e).val) b k.val := by | |
| classical | |
| ext f | |
| have hel : f β assignedEligible assign v β§ assignedLayer assign v f = b β | |
| assign f (v f) = some b := by | |
| cases h : assign f (v f) <;> simp [assignedEligible, assignedLayer, h] | |
| constructor | |
| Β· rintro β¨j, hj, rfl, hbβ© | |
| simp only [keyHistory] at * | |
| refine β¨?_, ?_, ?_β© | |
| Β· simp [assignedEligible, hb] | |
| Β· simp [assignedLayer, hb] | |
| Β· simpa [prefixIndex] using hj | |
| Β· rintro β¨he, hb, htβ© | |
| change (Ο.symm f).val < k.val at ht | |
| have hass := hel.mp β¨he, hbβ© | |
| let j : Fin (k.val+1) := β¨(Ο.symm f).val, by omegaβ© | |
| have hidx : prefixIndex k j = Ο.symm f := by rfl | |
| refine β¨j, ht, ?_, ?_β© | |
| Β· simp [keyHistory, hidx] | |
| Β· simpa [keyHistory, hidx] using hass | |
| theorem layerKeyDecision_eq_greedy {n : β} {K : Type*} | |
| (M : Matroid (Fin n)) (base : β€ β Set (Fin n)) | |
| (assign : Fin n β K β Option β€) (v : Fin n β K) | |
| (Ο : ArrivalOrder n) (k : Fin n) : | |
| layerKeyDecision M base assign k (keyHistory v Ο k) = true β | |
| Ο k β layerGreedy M (assignedEligible assign v) base (assignedLayer assign v) | |
| (fun e => (Ο.symm e).val) := by | |
| classical | |
| unfold layerKeyDecision | |
| rw [keyHistory_current] | |
| dsimp only | |
| cases h : assign (Ο k) (v (Ο k)) with | |
| | none => simp [assignedEligible, layerGreedy, h] | |
| | some b => | |
| dsimp only | |
| rw [keyHistory_prior] | |
| simp [layerGreedy, assignedEligible, assignedLayer, h] | |
| noncomputable def layerOnlineRule {n bits : β} {K : Type*} [Countable K] | |
| [MeasurableSpace K] [MeasurableSingletonClass K] | |
| (M : Matroid (Fin n)) (key : β β K) (hkey : Measurable key) | |
| (base : Seed bits β (Fin n β K) β β€ β Set (Fin n)) | |
| (assign : Seed bits β (Fin n β K) β Fin n β K β Option β€) : OnlineRule n bits := | |
| discreteOnlineRule key hkey fun k r s hist => | |
| layerKeyDecision M (base r s) (assign r s) k hist | |
| theorem layerOnlineRule_accepted {n bits : β} {K : Type*} [Countable K] | |
| [MeasurableSpace K] [MeasurableSingletonClass K] | |
| (M : Matroid (Fin n)) (key : β β K) (hkey : Measurable key) | |
| (base : Seed bits β (Fin n β K) β β€ β Set (Fin n)) | |
| (assign : Seed bits β (Fin n β K) β Fin n β K β Option β€) | |
| (r : Seed bits) (s v : Weights n) (Ο : ArrivalOrder n) : | |
| accepted (layerOnlineRule M key hkey base assign) r s v Ο = | |
| layerGreedy M (assignedEligible (assign r (fun e => key (s e))) (fun e => key (v e))) | |
| (base r (fun e => key (s e))) | |
| (assignedLayer (assign r (fun e => key (s e))) (fun e => key (v e))) | |
| (fun e => (Ο.symm e).val) := by | |
| classical | |
| ext e | |
| simp only [accepted, acceptedThrough, mem_filter, Finset.mem_univ, true_and, | |
| (Ο.symm e).isLt] | |
| change layerKeyDecision M (base r (fun e => key (s e))) (assign r (fun e => key (s e))) | |
| (Ο.symm e) (keyHistory (fun f => key (v f)) Ο (Ο.symm e)) = true β _ | |
| simpa only [Equiv.apply_symm_apply] using | |
| layerKeyDecision_eq_greedy M (base r (fun e => key (s e))) | |
| (assign r (fun e => key (s e))) (fun e => key (v e)) Ο (Ο.symm e) | |
| lemma acceptedThrough_subset_accepted {n bits : β} (A : OnlineRule n bits) | |
| (r : Seed bits) (s v : Weights n) (Ο : ArrivalOrder n) (t : β) : | |
| acceptedThrough A r s v Ο t β accepted A r s v Ο := by | |
| classical | |
| intro e he | |
| have hd := (mem_filter.mp he).2.2 | |
| exact mem_filter.mpr β¨mem_univ e, (Ο.symm e).isLt, hdβ© | |
| theorem layerOnlineRule_feasible {n bits : β} {K : Type*} [Countable K] | |
| [MeasurableSpace K] [MeasurableSingletonClass K] | |
| (M : Matroid (Fin n)) (hE : M.E = Set.univ) (key : β β K) (hkey : Measurable key) | |
| (base : Seed bits β (Fin n β K) β β€ β Set (Fin n)) | |
| (assign : Seed bits β (Fin n β K) β Fin n β K β Option β€) | |
| (hlower : β r s v, β e β assignedEligible (assign r s) v, | |
| β f β assignedEligible (assign r s) v, | |
| assignedLayer (assign r s) v e < assignedLayer (assign r s) v f β | |
| e β base r s (assignedLayer (assign r s) v f)) : | |
| Feasible M (layerOnlineRule M key hkey base assign) := by | |
| intro r s v Ο t _ _ | |
| have htime : Function.Injective (fun e => (Ο.symm e).val) := by | |
| intro e f h | |
| exact Ο.symm.injective (Fin.ext h) | |
| have hi := layerGreedy_indep M | |
| (assignedEligible (assign r (fun e => key (s e))) (fun e => key (v e))) | |
| (base r (fun e => key (s e))) | |
| (assignedLayer (assign r (fun e => key (s e))) (fun e => key (v e))) | |
| (fun e => (Ο.symm e).val) hE htime | |
| (hlower r (fun e => key (s e)) (fun e => key (v e))) | |
| apply hi.subset | |
| intro e he | |
| have hm := acceptedThrough_subset_accepted (layerOnlineRule M key hkey base assign) | |
| r s v Ο t he | |
| rwa [layerOnlineRule_accepted] at hm | |
| end MatroidProphet | |
| end OAI | |