Download data/lean/OAI/Probability/SATVariance/IsolatedSupports.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.72 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SATVariance/IsolatedSupports.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/SATVariance/IsolatedSupports.lean
-
curl -L -o IsolatedSupports.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SATVariance/IsolatedSupports.lean
5.72 kB
| import OAI.Probability.SATVariance.InsertionVariance | |
| namespace OAI | |
| noncomputable section | |
| open MeasureTheory ProbabilityTheory | |
| namespace RandomKSAT | |
| open scoped Classical ENNReal | |
| lemma avoidance_probability_lower {n k : β} (hkn : k β€ n) (hn : 0 < n) | |
| (c : Clause n k) : | |
| 1-(k:β)^2/n β€ favg (fun d : Clause n k => if Disjoint c.1.1 d.1.1 then (1:β) else 0) := by | |
| let := clause_nonempty n k hkn | |
| have hn0 : (n:β) β 0 := by exact_mod_cast (Nat.ne_of_gt hn) | |
| have hp (v : Fin n) : favg (fun d : Clause n k => if v β d.1.1 then (1:β) else 0) = (k:β)/n := by | |
| apply (eq_div_iff hn0).mpr | |
| nlinarith [support_probability_scaled hkn v] | |
| calc | |
| _ = favg (fun d : Clause n k => 1-β v β c.1.1, if v β d.1.1 then (1:β) else 0) := by | |
| rw [favg_sub,favg_const,favg_sum] | |
| simp only [hp,Finset.sum_const,c.1.2,nsmul_eq_mul] | |
| ring | |
| _ β€ _ := favg_mono (fun d => by | |
| by_cases h : Disjoint c.1.1 d.1.1 | |
| Β· rw [ite_eq_left h] | |
| have hs : (β v β c.1.1, if v β d.1.1 then (1:β) else 0) = 0 := by | |
| apply Finset.sum_eq_zero | |
| intro v hv | |
| simp [Finset.disjoint_left.mp h hv] | |
| rw [hs] | |
| norm_num | |
| Β· rw [ite_eq_right h] | |
| obtain β¨v,hv,hdβ© := Finset.not_disjoint_iff.mp h | |
| have hh := Finset.single_le_sum (f := fun v : Fin n => if v β d.1.1 then (1:β) else 0) | |
| (fun _ _ => by positivity) hv | |
| rw [ite_eq_left hd] at hh | |
| linarith) | |
| lemma log_one_sub_lower {x : β} (hx : 0 β€ x) (hx' : x β€ 1/2) : | |
| -2*x β€ Real.log (1-x) := by | |
| have hp : 0 < 1-x := by linarith | |
| have hi : (1-x)β»ΒΉ β€ 1+2*x := by | |
| rw [inv_eq_one_div] | |
| apply (div_le_iffβ hp).mpr | |
| nlinarith | |
| linarith [Real.one_sub_inv_le_log_of_pos hp] | |
| lemma slow_geometric_lower {x : β} (hx : 0 β€ x) (hx' : x β€ 1/2) (J : β) : | |
| Real.exp (-2*x*J) β€ (1-x)^J := by | |
| have hp : 0 < 1-x := by linarith | |
| rw [βReal.exp_log hp,βReal.exp_nat_mul] | |
| apply Real.exp_le_exp.mpr | |
| have := mul_le_mul_of_nonneg_right (log_one_sub_lower hx hx') (show (0:β) β€ J by positivity) | |
| nlinarith | |
| def isolated {n k M : β} (w : Fin M β Clause n k) (i : Fin M) : Prop := | |
| β j, j β i β Disjoint (w i).1.1 (w j).1.1 | |
| def isolateSet {n k M : β} (w : Fin M β Clause n k) : Finset (Fin M) := | |
| Finset.univ.filter (isolated w) | |
| lemma isolated_insertNth {n k M : β} (i : Fin (M+1)) (c : Clause n k) (w : Fin M β Clause n k) : | |
| isolated (i.insertNth c w) i β β j : Fin M, Disjoint c.1.1 (w j).1.1 := by | |
| unfold isolated | |
| rw [Fin.forall_iff_succAbove i] | |
| simp only [Fin.insertNth_apply_same, ne_eq, not_true_eq_false, false_implies, true_and, | |
| Fin.succAbove_ne, not_false_eq_true,true_implies,Fin.insertNth_apply_succAbove] | |
| lemma favg_all.{u_1, u_2} {ΞΉ : Type u_1} {Ξ± : Type u_2} [Fintype ΞΉ] [DecidableEq ΞΉ] [Fintype Ξ±] (p : Ξ± β Prop) : | |
| favg (fun w : ΞΉ β Ξ± => if β i, p (w i) then (1:β) else 0) = | |
| (favg (fun a => if p a then (1:β) else 0))^(Fintype.card ΞΉ) := by | |
| have he (w : ΞΉ β Ξ±) : (if β i, p (w i) then (1:β) else 0) = | |
| β i, if p (w i) then (1:β) else 0 := by simp only [Finset.prod_boole,Finset.mem_univ,true_implies] | |
| simp only [he] | |
| rw [favg_pi_product (fun _ a => if p a then (1:β) else 0)] | |
| simp | |
| lemma isolate_probability_lower {n k M R : β} (hk : 1 β€ k) (hkn : k β€ n) | |
| (hn : 2*k^2 β€ n) (hM : M β€ 2*R*n) (i : Fin (M+1)) : | |
| Real.exp (-4*(R:β)*k^2) β€ favg (fun w : Fin (M+1) β Clause n k => if isolated w i then (1:β) else 0) := by | |
| let := clause_nonempty n k hkn | |
| have hn' : 0 < n := by omega | |
| have hnR : (0:β) < n := by exact_mod_cast hn' | |
| have hx : 0 β€ (k:β)^2/n := by positivity | |
| have hx' : (k:β)^2/n β€ 1/2 := by | |
| apply (div_le_iffβ hnR).mpr | |
| have hnR' : 2*(k:β)^2 β€ n := by exact_mod_cast hn | |
| linarith | |
| have he : Real.exp (-4*(R:β)*k^2) β€ (1-(k:β)^2/n)^M := by | |
| apply le_trans ?_ (slow_geometric_lower hx hx' M) | |
| apply Real.exp_le_exp.mpr | |
| have hMR : (M:β) β€ 2*R*n := by exact_mod_cast hM | |
| have hh := mul_le_mul_of_nonneg_right hMR hx | |
| have hd : (2*(R:β)*n)*((k:β)^2/n) = 2*R*k^2 := by field_simp | |
| rw [hd] at hh | |
| nlinarith | |
| rw [favg_insertNth i] | |
| simp only [isolated_insertNth] | |
| have hm (c : Clause n k) : | |
| favg (fun w : Fin M β Clause n k => if β j, Disjoint c.1.1 (w j).1.1 then (1:β) else 0) = | |
| (favg (fun d : Clause n k => if Disjoint c.1.1 d.1.1 then (1:β) else 0))^M := by | |
| have hh := favg_all (ΞΉ := Fin M) (fun d : Clause n k => Disjoint c.1.1 d.1.1) | |
| simp only [Fintype.card_fin] at hh | |
| convert hh using 1 | |
| Β· congr 1 | |
| funext w | |
| by_cases h : β j : Fin M, Disjoint c.1.1 (w j).1.1 <;> simp [h] | |
| Β· congr 2 | |
| funext d | |
| by_cases h : Disjoint c.1.1 d.1.1 <;> simp [h] | |
| simp only [hm] | |
| rw [βfavg_const (Ξ± := Clause n k) (Real.exp (-4*(R:β)*k^2))] | |
| exact favg_mono (fun c => he.trans (pow_le_pow_leftβ (by linarith) | |
| (avoidance_probability_lower hkn hn' c) M)) | |
| lemma isolate_count_lower {n k M R : β} (hk : 1 β€ k) (hkn : k β€ n) | |
| (hn : 2*k^2 β€ n) (hM : M β€ 2*R*n) : | |
| (M:β)*Real.exp (-4*(R:β)*k^2) β€ | |
| favg (fun w : Fin M β Clause n k => ((isolateSet w).card:β)) := by | |
| have he (w : Fin M β Clause n k) : ((isolateSet w).card:β) = | |
| β i, if isolated w i then (1:β) else 0 := by simp [isolateSet] | |
| simp only [he] | |
| rw [favg_sum] | |
| calc | |
| _ = β _ : Fin M, Real.exp (-4*(R:β)*k^2) := by simp | |
| _ β€ _ := Finset.sum_le_sum (fun i _ => by | |
| cases M with | |
| | zero => exact i.elim0 | |
| | succ M => exact isolate_probability_lower hk hkn hn (by omega) i) | |
| end RandomKSAT | |
| end | |
| end OAI | |