File size: 2,417 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 | import Mathlib.Combinatorics.Matroid.Closure
namespace OAI
namespace MatroidProphet
namespace Pivots
open Set
variable {Ξ± : Type*} {M : Matroid Ξ±} {I J : Set Ξ±} {e : Ξ±}
def support (M : Matroid Ξ±) (I : Set Ξ±) (e : Ξ±) : Set Ξ± :=
ββ {J | J β I β§ e β M.closure J}
lemma support_subset (he : e β M.closure I) : support M I e β I :=
Set.sInter_subset_of_mem β¨Subset.rfl, heβ©
lemma support_subset_of_mem_closure (hJI : J β I) (he : e β M.closure J) :
support M I e β J :=
Set.sInter_subset_of_mem β¨hJI, heβ©
lemma mem_closure_support (hI : M.Indep I) (he : e β M.closure I) :
e β M.closure (support M I e) := by
rw [support, hI.closure_sInter_eq_biInter_closure_of_forall_subset
(Js := {J | J β I β§ e β M.closure J})
β¨I, Subset.rfl, heβ© (fun _ hJ => hJ.1)]
exact Set.mem_iInterβ.mpr (fun _ hJ => hJ.2)
lemma mem_closure_iff_support_subset (hI : M.Indep I)
(he : e β M.closure I) (hJI : J β I) :
e β M.closure J β support M I e β J := by
constructor
Β· exact support_subset_of_mem_closure hJI
Β· intro h
exact M.closure_subset_closure h (mem_closure_support hI he)
lemma support_nonempty (hI : M.Indep I) (he : e β M.closure I)
(hne : e β M.closure β
) : (support M I e).Nonempty := by
by_contra h
have hem := mem_closure_support hI he
rw [Set.not_nonempty_iff_eq_empty.mp h] at hem
exact hne hem
lemma support_unique (hI : M.Indep I) (he : e β M.closure I)
(hJI : J β I) (hJe : e β M.closure J)
(hmin : β K β I, e β M.closure K β J β K) : J = support M I e := by
exact Set.Subset.antisymm
(hmin _ (support_subset he) (mem_closure_support hI he))
(support_subset_of_mem_closure hJI hJe)
lemma old_redundant_after_insertions (he : e β M.closure I) (A : Set Ξ±) :
M.closure (insert e (I βͺ A)) = M.closure (I βͺ A) := by
exact M.closure_insert_eq_of_mem_closure
(M.closure_subset_closure Set.subset_union_left he)
lemma mem_closure_prefix_iff (hI : M.Indep I) (he : e β M.closure I)
(time : Ξ± β β) (k : β) :
e β M.closure {x | x β I β§ time x β€ k} β
β x β support M I e, time x β€ k := by
rw [mem_closure_iff_support_subset hI he (fun _ hx => hx.1)]
constructor
Β· intro h x hx
exact (h hx).2
Β· intro h x hx
exact β¨support_subset he hx, h x hxβ©
end Pivots
end MatroidProphet
end OAI
|