Download data/lean/OAI/Combinatorics/BalancedRyser/Local/InjectionExposure.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 9.7 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/BalancedRyser/Local/InjectionExposure.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/BalancedRyser/Local/InjectionExposure.lean
-
curl -L -o InjectionExposure.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/BalancedRyser/Local/InjectionExposure.lean
9.7 kB
| import Mathlib.Data.Fintype.Pi | |
| import Mathlib.Probability.Distributions.Uniform | |
| namespace OAI | |
| namespace Balanced.InjectionExposure | |
| variable {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J] | |
| noncomputable def completions (K : Finset I) (base : I βͺ J) : Finset (I βͺ J) := | |
| Finset.univ.filter (fun e => β j β K, e j = base j) | |
| def remaining (K : Finset I) (base : I βͺ J) : Finset J := | |
| Finset.univ \ K.image base | |
| @[simp] theorem mem_completions (K : Finset I) (base e : I βͺ J) : | |
| e β completions K base β β j β K, e j = base j := by | |
| simp [completions] | |
| omit [Fintype I] [DecidableEq I] in | |
| @[simp] theorem mem_remaining (K : Finset I) (base : I βͺ J) (a : J) : | |
| a β remaining K base β a β K.image base := by | |
| simp [remaining] | |
| theorem completions_nonempty (K : Finset I) (base : I βͺ J) : | |
| (completions K base).Nonempty := by | |
| exact β¨base, by simpβ© | |
| theorem value_mem_remaining (K : Finset I) (base e : I βͺ J) | |
| (he : e β completions K base) (i : I) (hi : i β K) : | |
| e i β remaining K base := by | |
| rw [mem_remaining] | |
| intro h | |
| obtain β¨j, hj, hjiβ© := Finset.mem_image.mp h | |
| have hsame : e j = e i := (mem_completions K base e).mp he j hj |>.trans hji | |
| exact hi (e.injective hsame βΈ hj) | |
| theorem base_mem_remaining (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) : base i β remaining K base := | |
| value_mem_remaining K base base (by simp) i hi | |
| omit [Fintype I] [DecidableEq I] in | |
| theorem card_remaining (K : Finset I) (base : I βͺ J) : | |
| (remaining K base).card = Fintype.card J - K.card := by | |
| rw [remaining, Finset.card_sdiff, Finset.inter_univ, Finset.card_univ, | |
| Finset.card_image_of_injective _ base.injective] | |
| theorem swap_mem_completions (K : Finset I) (base e : I βͺ J) | |
| (he : e β completions K base) (a b : J) | |
| (ha : a β remaining K base) (hb : b β remaining K base) : | |
| e.trans (Equiv.swap a b).toEmbedding β completions K base := by | |
| rw [mem_completions] at he β’ | |
| intro j hj | |
| change Equiv.swap a b (e j) = base j | |
| rw [he j hj] | |
| apply Equiv.swap_apply_of_ne_of_ne | |
| Β· intro h | |
| exact (mem_remaining K base a).mp ha (Finset.mem_image.mpr β¨j, hj, hβ©) | |
| Β· intro h | |
| exact (mem_remaining K base b).mp hb (Finset.mem_image.mpr β¨j, hj, hβ©) | |
| theorem fibre_card_eq (K : Finset I) (base : I βͺ J) (i : I) | |
| (a b : J) (ha : a β remaining K base) (hb : b β remaining K base) : | |
| ((completions K base).filter (fun e => e i = a)).card = | |
| ((completions K base).filter (fun e => e i = b)).card := by | |
| let swapOutput : (I βͺ J) β (I βͺ J) := | |
| fun e => e.trans (Equiv.swap a b).toEmbedding | |
| have hinv (e : I βͺ J) : swapOutput (swapOutput e) = e := by | |
| ext j | |
| exact Equiv.swap_apply_self a b (e j) | |
| have hmap (e : I βͺ J) | |
| (he : e β (completions K base).filter (fun e => e i = a)) : | |
| swapOutput e β (completions K base).filter (fun e => e i = b) := by | |
| obtain β¨he, heiβ© := Finset.mem_filter.mp he | |
| refine Finset.mem_filter.mpr β¨swap_mem_completions K base e he a b ha hb, ?_β© | |
| change Equiv.swap a b (e i) = b | |
| rw [hei, Equiv.swap_apply_left] | |
| have hmap' (e : I βͺ J) | |
| (he : e β (completions K base).filter (fun e => e i = b)) : | |
| swapOutput e β (completions K base).filter (fun e => e i = a) := by | |
| obtain β¨he, heiβ© := Finset.mem_filter.mp he | |
| refine Finset.mem_filter.mpr β¨swap_mem_completions K base e he a b ha hb, ?_β© | |
| change Equiv.swap a b (e i) = a | |
| rw [hei, Equiv.swap_apply_right] | |
| exact Finset.card_bij' (fun e _ => swapOutput e) (fun e _ => swapOutput e) | |
| hmap hmap' (fun e _ => hinv e) (fun e _ => hinv e) | |
| theorem card_completions_eq (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) (a : J) (ha : a β remaining K base) : | |
| (completions K base).card = (remaining K base).card * | |
| ((completions K base).filter (fun e => e i = a)).card := by | |
| calc | |
| (completions K base).card = | |
| β b β remaining K base, | |
| ((completions K base).filter (fun e => e i = b)).card := | |
| Finset.card_eq_sum_card_fiberwise (fun e he => | |
| value_mem_remaining K base e he i hi) | |
| _ = β _b β remaining K base, | |
| ((completions K base).filter (fun e => e i = a)).card := by | |
| apply Finset.sum_congr rfl | |
| intro b hb | |
| exact fibre_card_eq K base i b a hb ha | |
| _ = _ := by simp | |
| theorem next_value_probability (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) (a : J) (ha : a β remaining K base) : | |
| ((PMF.uniformOfFinset (completions K base) (completions_nonempty K base)).toOuterMeasure | |
| {e | e i = a}).toReal = 1 / ((remaining K base).card : β) := by | |
| classical | |
| have hC : 0 < ((completions K base).card : β) := by | |
| exact_mod_cast Finset.card_pos.mpr (completions_nonempty K base) | |
| have hR : 0 < ((remaining K base).card : β) := by | |
| exact_mod_cast Finset.card_pos.mpr (show (remaining K base).Nonempty from β¨a, haβ©) | |
| have hfactor : ((completions K base).card : β) = | |
| ((remaining K base).card : β) * | |
| (((completions K base).filter (fun e => e i = a)).card : β) := by | |
| exact_mod_cast card_completions_eq K base i hi a ha | |
| rw [PMF.toOuterMeasure_uniformOfFinset_apply] | |
| simp only [ENNReal.toReal_div, ENNReal.toReal_natCast, Set.mem_ofPred_eq] | |
| apply (div_eq_div_iff (ne_of_gt hC) (ne_of_gt hR)).mpr | |
| nlinarith | |
| theorem next_value_probability_card (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) (a : J) (ha : a β remaining K base) : | |
| ((PMF.uniformOfFinset (completions K base) (completions_nonempty K base)).toOuterMeasure | |
| {e | e i = a}).toReal = 1 / ((Fintype.card J - K.card : β) : β) := by | |
| rw [next_value_probability K base i hi a ha, card_remaining] | |
| theorem event_card_eq (K : Finset I) (base : I βͺ J) (i : I) (hi : i β K) | |
| (P : J β Prop) [DecidablePred P] : | |
| ((completions K base).filter (fun e => P (e i))).card = | |
| ((remaining K base).filter P).card * | |
| ((completions K base).filter (fun e => e i = base i)).card := by | |
| calc | |
| ((completions K base).filter (fun e => P (e i))).card = | |
| β b β (remaining K base).filter P, | |
| (((completions K base).filter (fun e => P (e i))).filter | |
| (fun e => e i = b)).card := by | |
| apply Finset.card_eq_sum_card_fiberwise | |
| intro e he | |
| obtain β¨he, hPeβ© := Finset.mem_filter.mp he | |
| exact Finset.mem_filter.mpr β¨value_mem_remaining K base e he i hi, hPeβ© | |
| _ = β _b β (remaining K base).filter P, | |
| ((completions K base).filter (fun e => e i = base i)).card := by | |
| apply Finset.sum_congr rfl | |
| intro b hb | |
| obtain β¨hb, hPbβ© := Finset.mem_filter.mp hb | |
| have hfibre : ((completions K base).filter (fun e => P (e i))).filter | |
| (fun e => e i = b) = (completions K base).filter (fun e => e i = b) := by | |
| ext e | |
| simp only [Finset.mem_filter] | |
| constructor | |
| Β· exact fun h => β¨h.1.1, h.2β© | |
| Β· intro h | |
| exact β¨β¨h.1, h.2 βΈ hPbβ©, h.2β© | |
| rw [hfibre] | |
| exact fibre_card_eq K base i b (base i) hb (base_mem_remaining K base i hi) | |
| _ = _ := by simp | |
| theorem next_event_probability (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) (P : J β Prop) [DecidablePred P] : | |
| ((PMF.uniformOfFinset (completions K base) (completions_nonempty K base)).toOuterMeasure | |
| {e | P (e i)}).toReal = | |
| (((remaining K base).filter P).card : β) / ((remaining K base).card : β) := by | |
| classical | |
| have hC : 0 < ((completions K base).card : β) := by | |
| exact_mod_cast Finset.card_pos.mpr (completions_nonempty K base) | |
| have hR : 0 < ((remaining K base).card : β) := by | |
| exact_mod_cast Finset.card_pos.mpr | |
| (show (remaining K base).Nonempty from β¨base i, base_mem_remaining K base i hiβ©) | |
| have hfactor : ((completions K base).card : β) = | |
| ((remaining K base).card : β) * | |
| (((completions K base).filter (fun e => e i = base i)).card : β) := by | |
| exact_mod_cast card_completions_eq K base i hi (base i) (base_mem_remaining K base i hi) | |
| have hevent : (((completions K base).filter (fun e => P (e i))).card : β) = | |
| (((remaining K base).filter P).card : β) * | |
| (((completions K base).filter (fun e => e i = base i)).card : β) := by | |
| exact_mod_cast event_card_eq K base i hi P | |
| rw [PMF.toOuterMeasure_uniformOfFinset_apply] | |
| simp only [ENNReal.toReal_div, ENNReal.toReal_natCast, Set.mem_ofPred_eq] | |
| apply (div_eq_div_iff (ne_of_gt hC) (ne_of_gt hR)).mpr | |
| rw [hfactor, hevent] | |
| ring | |
| theorem next_event_probability_le (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) (P : J β Prop) [DecidablePred P] | |
| (hP : ((remaining K base).filter P).card β€ 1) : | |
| ((PMF.uniformOfFinset (completions K base) (completions_nonempty K base)).toOuterMeasure | |
| {e | P (e i)}).toReal β€ 1 / ((remaining K base).card : β) := by | |
| rw [next_event_probability K base i hi P] | |
| exact div_le_div_of_nonneg_right (by exact_mod_cast hP) (Nat.cast_nonneg _) | |
| theorem next_event_probability_le_budget (K : Finset I) (base : I βͺ J) | |
| (i : I) (hi : i β K) (P : J β Prop) [DecidablePred P] | |
| (hP : ((remaining K base).filter P).card β€ 1) | |
| (N : β) (hK : K.card β€ N) (hN : N < Fintype.card J) : | |
| ((PMF.uniformOfFinset (completions K base) (completions_nonempty K base)).toOuterMeasure | |
| {e | P (e i)}).toReal β€ 1 / ((Fintype.card J - N : β) : β) := by | |
| apply (next_event_probability_le K base i hi P hP).trans | |
| rw [card_remaining] | |
| apply one_div_le_one_div_of_le | |
| Β· exact_mod_cast Nat.sub_pos_of_lt hN | |
| Β· exact_mod_cast Nat.sub_le_sub_left hK (Fintype.card J) | |
| end Balanced.InjectionExposure | |
| end OAI | |