Download data/lean/OAI/Probability/MatroidProphet/Pivots/Greedy.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.61 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/Pivots/Greedy.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/MatroidProphet/Pivots/Greedy.lean
-
curl -L -o Greedy.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/Pivots/Greedy.lean
5.61 kB
| import OAI.Probability.MatroidProphet.RankAccounting | |
| namespace OAI | |
| namespace MatroidProphet | |
| namespace Pivots | |
| open Set Finset | |
| variable {Ξ± : Type*} [Fintype Ξ±] | |
| def oldPrefix (b : β β Ξ±) (k : β) : Set Ξ± := {x | β i < k, b i = x} | |
| @[simp] lemma oldPrefix_zero | |
| {Ξ± : Type u_1} [Fintype Ξ±] (b : β β Ξ±) : oldPrefix b 0 = β := by | |
| ext x | |
| simp [oldPrefix] | |
| lemma oldPrefix_succ | |
| {Ξ± : Type u_1} [Fintype Ξ±] (b : β β Ξ±) (k : β) : | |
| oldPrefix b (k + 1) = insert (b k) (oldPrefix b k) := by | |
| ext x | |
| constructor | |
| Β· rintro β¨i, hi, rflβ© | |
| rcases Nat.lt_succ_iff_lt_or_eq.mp hi with hi | rfl | |
| Β· exact Or.inr β¨i, hi, rflβ© | |
| Β· exact Or.inl rfl | |
| Β· rintro (rfl | β¨i, hi, rflβ©) | |
| Β· exact β¨k, Nat.lt_succ_self k, rflβ© | |
| Β· exact β¨i, Nat.lt_trans hi (Nat.lt_succ_self k), rflβ© | |
| lemma oldPrefix_mono | |
| {Ξ± : Type u_1} [Fintype Ξ±] (b : β β Ξ±) : Monotone (oldPrefix b) := by | |
| intro j k hjk x hx | |
| obtain β¨i, hi, rflβ© := hx | |
| exact β¨i, lt_of_lt_of_le hi hjk, rflβ© | |
| lemma conditionalRank_singleton_of_notMem_closure (M : Matroid Ξ±) | |
| (P : Set Ξ±) {e : Ξ±} (he : e β M.E) (hne : e β M.closure P) : | |
| conditionalRank M {e} P = 1 := by | |
| unfold conditionalRank natRank | |
| rw [Set.singleton_union, M.eRk_insert_eq_add_one β¨he, hneβ©, | |
| ENat.toNat_add (rank_ne_top M P) (by simp)] | |
| simp | |
| lemma conditionalRank_singleton_of_mem_closure | |
| {Ξ± : Type u_1} [Fintype Ξ±] (M : Matroid Ξ±) | |
| (P : Set Ξ±) {e : Ξ±} (he : e β M.closure P) : | |
| conditionalRank M {e} P = 0 := by | |
| have h := congrArg (natRank M) (M.closure_insert_eq_of_mem_closure he) | |
| simp only [natRank_closure] at h | |
| simp only [conditionalRank, Set.singleton_union, h, Nat.sub_self] | |
| noncomputable def omittable (M : Matroid Ξ±) (b : β β Ξ±) (A : Set Ξ±) (r : β) : Finset β := by | |
| classical | |
| exact (Finset.range r).filter (fun k => b k β M.closure (oldPrefix b k βͺ A)) | |
| lemma omittable_drop (M : Matroid Ξ±) (b : β β Ξ±) (A : Set Ξ±) (k : β) | |
| (he : b k β M.E) (hind : b k β M.closure (oldPrefix b k)) | |
| (homit : b k β M.closure (oldPrefix b k βͺ A)) : | |
| conditionalRank M A (oldPrefix b (k + 1)) + 1 = | |
| conditionalRank M A (oldPrefix b k) := by | |
| have hex := conditionalRank_exchange M {b k} A (oldPrefix b k) | |
| rw [conditionalRank_singleton_of_notMem_closure M _ he hind, | |
| conditionalRank_singleton_of_mem_closure M _ homit] at hex | |
| rw [oldPrefix_succ, Set.union_singleton] at * | |
| omega | |
| lemma card_omittable_le_rank (M : Matroid Ξ±) (b : β β Ξ±) (A : Set Ξ±) (r : β) | |
| (he : β k < r, b k β M.E) | |
| (hind : β k < r, b k β M.closure (oldPrefix b k)) : | |
| (omittable M b A r).card β€ natRank M A := by | |
| classical | |
| let p := fun k => conditionalRank M A (oldPrefix b k) | |
| have hp : β k < r, p (k + 1) β€ p k := by | |
| intro k _ | |
| exact conditionalRank_antitone M A (oldPrefix_mono b (Nat.le_succ k)) | |
| have hdrop := sum_potential_drop_le p r hp | |
| have hsum : (omittable M b A r).card β€ β k β range r, (p k - p (k + 1)) := by | |
| rw [Finset.card_eq_sum_ones] | |
| calc | |
| (β k β omittable M b A r, 1) β€ | |
| β k β omittable M b A r, (p k - p (k + 1)) := by | |
| apply Finset.sum_le_sum | |
| intro k hk | |
| have hk' := Finset.mem_filter.mp hk | |
| have hkr := Finset.mem_range.mp hk'.1 | |
| have hd := omittable_drop M b A k (he k hkr) (hind k hkr) hk'.2 | |
| change p (k + 1) + 1 = p k at hd | |
| omega | |
| _ β€ β k β range r, (p k - p (k + 1)) := by | |
| apply Finset.sum_le_sum_of_subset_of_nonneg | |
| Β· exact Finset.filter_subset _ _ | |
| Β· intro _ _ _ | |
| exact Nat.zero_le _ | |
| have hzero : p 0 = natRank M A := by simp [p, conditionalRank] | |
| omega | |
| lemma notMem_closure_before_nonomittable | |
| {Ξ± : Type u_1} [Fintype Ξ±] (M : Matroid Ξ±) (b : β β Ξ±) | |
| (A P : Set Ξ±) (r k : β) (hk : k < r) | |
| (hkeep : k β omittable M b A r) (hP : P β oldPrefix b k βͺ A) : | |
| b k β M.closure P := by | |
| classical | |
| intro he | |
| apply hkeep | |
| exact Finset.mem_filter.mpr β¨Finset.mem_range.mpr hk, | |
| M.closure_subset_closure hP heβ© | |
| noncomputable def vulnerable (M : Matroid Ξ±) (b : β β Ξ±) (A : Set Ξ±) (r : β) : Finset β := by | |
| classical | |
| exact (Finset.range r).filter (fun k => | |
| b k β M.closure (oldPrefix b k) β§ b k β M.closure (oldPrefix b k βͺ A)) | |
| lemma card_vulnerable_le_rank (M : Matroid Ξ±) (b : β β Ξ±) (A : Set Ξ±) (r : β) | |
| (he : β k < r, b k β M.E) : | |
| (vulnerable M b A r).card β€ natRank M A := by | |
| classical | |
| let p := fun k => conditionalRank M A (oldPrefix b k) | |
| have hp : β k < r, p (k + 1) β€ p k := by | |
| intro k _ | |
| exact conditionalRank_antitone M A (oldPrefix_mono b (Nat.le_succ k)) | |
| have hdrop := sum_potential_drop_le p r hp | |
| have hsum : (vulnerable M b A r).card β€ β k β range r, (p k - p (k + 1)) := by | |
| rw [Finset.card_eq_sum_ones] | |
| calc | |
| (β k β vulnerable M b A r, 1) β€ | |
| β k β vulnerable M b A r, (p k - p (k + 1)) := by | |
| apply Finset.sum_le_sum | |
| intro k hk | |
| have hk' := Finset.mem_filter.mp hk | |
| have hkr := Finset.mem_range.mp hk'.1 | |
| have hd := omittable_drop M b A k (he k hkr) hk'.2.1 hk'.2.2 | |
| change p (k + 1) + 1 = p k at hd | |
| omega | |
| _ β€ β k β range r, (p k - p (k + 1)) := by | |
| apply Finset.sum_le_sum_of_subset_of_nonneg | |
| Β· exact Finset.filter_subset _ _ | |
| Β· intro _ _ _ | |
| exact Nat.zero_le _ | |
| have hzero : p 0 = natRank M A := by simp [p, conditionalRank] | |
| omega | |
| end Pivots | |
| end MatroidProphet | |
| end OAI | |