Download data/lean/OAI/Probability/MatroidProphet/ProductRestriction.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.35 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/ProductRestriction.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/MatroidProphet/ProductRestriction.lean
-
curl -L -o ProductRestriction.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidProphet/ProductRestriction.lean
2.35 kB
| import OAI.Probability.MatroidProphet.FiniteBits | |
| namespace OAI | |
| namespace MatroidProphet | |
| open Finset | |
| variable {Ξ± : Type*} [DecidableEq Ξ±] | |
| theorem bitsExpectation_restrict (q : Ξ± β β) (W V : Finset Ξ±) (hV : V β W) | |
| (f : Finset Ξ± β β) | |
| (hf : β S S', (β e β V, e β S β e β S') β f S = f S') : | |
| bitsExpectation q W f = bitsExpectation q V f := by | |
| induction W using Finset.strongInductionOn with | |
| | _ W ih => | |
| by_cases hW : W β V | |
| Β· rw [subset_antisymm hW hV] | |
| Β· obtain β¨e, heW, heVβ© := Finset.not_subset.mp hW | |
| have hVerase : V β W.erase e := by | |
| intro x hx | |
| exact mem_erase.mpr β¨fun h => heV (h βΈ hx), hV hxβ© | |
| have heq : bitsExpectation q (W.erase e) (fun S => f (insert e S)) = | |
| bitsExpectation q (W.erase e) f := by | |
| apply bitsExpectation_congr | |
| intro S _ | |
| apply hf | |
| intro x hx | |
| have hxe : x β e := fun h => heV (h βΈ hx) | |
| simp [hxe] | |
| have hs := bitsExpectation_insert q (W.erase e) e (notMem_erase e W) f | |
| rw [insert_erase heW, heq, ih (W.erase e) (erase_ssubset heW) hVerase] at hs | |
| linarith | |
| lemma bitsExpectation_sum {ΞΉ : Type*} (q : Ξ± β β) (V : Finset Ξ±) (I : Finset ΞΉ) | |
| (f : ΞΉ β Finset Ξ± β β) : | |
| bitsExpectation q V (fun S => β e β I, f e S) = β e β I, bitsExpectation q V (f e) := by | |
| simp only [bitsExpectation, mul_sum] | |
| rw [sum_comm] | |
| lemma bitsExpectation_mem (q : Ξ± β β) (V : Finset Ξ±) (e : Ξ±) (he : e β V) : | |
| bitsExpectation q V (fun S => if e β S then 1 else 0) = q e := by | |
| rw [bitsExpectation_restrict q V {e} (singleton_subset_iff.mpr he) | |
| (fun S => if e β S then 1 else 0) (by | |
| intro S S' h | |
| simp only [h e (mem_singleton_self e)])] | |
| rw [show ({e} : Finset Ξ±) = insert e β from rfl, | |
| bitsExpectation_insert q β e (notMem_empty e)] | |
| simp [bitsExpectation_empty] | |
| lemma bitsExpectation_card_inter (q : Ξ± β β) (V K : Finset Ξ±) (hKV : K β V) : | |
| bitsExpectation q V (fun S => ((K β© S).card : β)) = β e β K, q e := by | |
| have hsum (S : Finset Ξ±) : ((K β© S).card : β) = | |
| β e β K, if e β S then (1 : β) else 0 := by | |
| simp | |
| simp_rw [hsum] | |
| rw [bitsExpectation_sum] | |
| exact sum_congr rfl (fun e he => bitsExpectation_mem q V e (hKV he)) | |
| end MatroidProphet | |
| end OAI | |