Download data/lean/OAI/Probability/MatroidProphet/RankAccounting.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.64 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/RankAccounting.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/MatroidProphet/RankAccounting.lean
-
curl -L -o RankAccounting.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/RankAccounting.lean
4.64 kB
| import OAI.Probability.MatroidProphet.Density.Basic | |
| import Mathlib.Algebra.Order.BigOperators.Group.Finset | |
| namespace OAI | |
| namespace MatroidProphet | |
| open Set Finset | |
| variable {Ξ± : Type*} [Fintype Ξ±] | |
| noncomputable def conditionalRank (M : Matroid Ξ±) (S P : Set Ξ±) : β := | |
| natRank M (S βͺ P) - natRank M P | |
| lemma conditionalRank_add_base (M : Matroid Ξ±) (S P : Set Ξ±) : | |
| conditionalRank M S P + natRank M P = natRank M (S βͺ P) := by | |
| exact Nat.sub_add_cancel (natRank_mono M subset_union_right) | |
| lemma conditionalRank_antitone (M : Matroid Ξ±) (S : Set Ξ±) | |
| {P Q : Set Ξ±} (hPQ : P β Q) : | |
| conditionalRank M S Q β€ conditionalRank M S P := by | |
| have hsub := natRank_submod M (S βͺ P) Q | |
| have hi := natRank_mono M (show P β (S βͺ P) β© Q from | |
| fun x hx => β¨Or.inr hx, hPQ hxβ©) | |
| have hu : (S βͺ P) βͺ Q = S βͺ Q := by | |
| ext x | |
| simp only [mem_union] | |
| constructor | |
| Β· rintro ((h | h) | h) | |
| Β· exact Or.inl h | |
| Β· exact Or.inr (hPQ h) | |
| Β· exact Or.inr h | |
| Β· rintro (h | h) | |
| Β· exact Or.inl (Or.inl h) | |
| Β· exact Or.inr h | |
| rw [hu] at hsub | |
| have hP := conditionalRank_add_base M S P | |
| have hQ := conditionalRank_add_base M S Q | |
| omega | |
| lemma conditionalRank_exchange (M : Matroid Ξ±) (S J A : Set Ξ±) : | |
| conditionalRank M S A + conditionalRank M J (A βͺ S) = | |
| conditionalRank M J A + conditionalRank M S (A βͺ J) := by | |
| have hSA := conditionalRank_add_base M S A | |
| have hJA := conditionalRank_add_base M J A | |
| have hJAS := conditionalRank_add_base M J (A βͺ S) | |
| have hSAJ := conditionalRank_add_base M S (A βͺ J) | |
| have hUS : S βͺ A = A βͺ S := union_comm _ _ | |
| have hUJ : J βͺ A = A βͺ J := union_comm _ _ | |
| have hU : J βͺ (A βͺ S) = S βͺ (A βͺ J) := by | |
| ext x | |
| simp only [mem_union] | |
| tauto | |
| rw [hUS] at hSA | |
| rw [hUJ] at hJA | |
| rw [hU] at hJAS | |
| omega | |
| omit [Fintype Ξ±] in | |
| lemma conditionalRank_closure (M : Matroid Ξ±) (S P : Set Ξ±) : | |
| conditionalRank M S (M.closure P) = conditionalRank M S P := by | |
| simp only [conditionalRank, natRank, M.eRk_union_closure_right_eq, | |
| M.eRk_closure_eq] | |
| lemma conditionalRank_le_rank (M : Matroid Ξ±) (J A : Set Ξ±) : | |
| conditionalRank M J A β€ natRank M J := by | |
| have h := conditionalRank_antitone M J (empty_subset A) | |
| simpa [conditionalRank] using h | |
| lemma rankCost_step (M : Matroid Ξ±) (J S A B X Y : Set Ξ±) | |
| (hXA : X β A) (hAB : A β B) | |
| (hB : B β M.closure (A βͺ J)) (hY : A βͺ S β Y) : | |
| conditionalRank M S A - conditionalRank M S B β€ | |
| conditionalRank M J X - conditionalRank M J Y := by | |
| have hSJ := conditionalRank_antitone M S hB | |
| rw [conditionalRank_closure] at hSJ | |
| have hSA := conditionalRank_antitone M S hAB | |
| have hJA := conditionalRank_antitone M J hXA | |
| have hJY := conditionalRank_antitone M J hY | |
| have heq := conditionalRank_exchange M S J A | |
| omega | |
| lemma sum_potential_drop_le (p : β β β) (m : β) | |
| (hp : β k < m, p (k + 1) β€ p k) : | |
| (β k β range m, (p k - p (k + 1))) β€ p 0 := by | |
| suffices h : (β k β range m, (p k - p (k + 1))) + p m = p 0 by omega | |
| induction m with | |
| | zero => simp | |
| | succ m ih => | |
| rw [sum_range_succ] | |
| have hprev := ih (fun k hk => hp k (Nat.lt_trans hk (Nat.lt_succ_self m))) | |
| have hlast := hp m (Nat.lt_succ_self m) | |
| omega | |
| lemma rankCost_chain (M : Matroid Ξ±) (J : Set Ξ±) (m : β) | |
| (X A B S : β β Set Ξ±) | |
| (hXA : β k < m, X k β A k) | |
| (hAB : β k < m, A k β B k) | |
| (hB : β k < m, B k β M.closure (A k βͺ J)) | |
| (hY : β k < m, A k βͺ S k β X (k + 1)) : | |
| (β k β range m, conditionalRank M (S k) (A k)) β€ | |
| (β k β range m, conditionalRank M (S k) (B k)) + natRank M J := by | |
| have hmono : β k < m, X k β X (k + 1) := by | |
| intro k hk | |
| exact (hXA k hk).trans (subset_union_left.trans (hY k hk)) | |
| have hp : β k < m, conditionalRank M J (X (k + 1)) β€ | |
| conditionalRank M J (X k) := fun k hk => conditionalRank_antitone M J (hmono k hk) | |
| have hdrop := sum_potential_drop_le (fun k => conditionalRank M J (X k)) m hp | |
| have hsum : (β k β range m, conditionalRank M (S k) (A k)) β€ | |
| β k β range m, (conditionalRank M (S k) (B k) + | |
| (conditionalRank M J (X k) - conditionalRank M J (X (k + 1)))) := by | |
| apply sum_le_sum | |
| intro k hk | |
| have hk' := mem_range.1 hk | |
| have hs := rankCost_step M J (S k) (A k) (B k) (X k) (X (k + 1)) | |
| (hXA k hk') (hAB k hk') (hB k hk') (hY k hk') | |
| have ha := conditionalRank_antitone M (S k) (hAB k hk') | |
| omega | |
| rw [sum_add_distrib] at hsum | |
| have hbound := conditionalRank_le_rank M J (X 0) | |
| omega | |
| end MatroidProphet | |
| end OAI | |