Download data/lean/OAI/Probability/Perceptron/Interpolation/OverlapBlock.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 13.8 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/Perceptron/Interpolation/OverlapBlock.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/Perceptron/Interpolation/OverlapBlock.lean
-
curl -L -o OverlapBlock.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/Perceptron/Interpolation/OverlapBlock.lean
13.8 kB
| import Mathlib | |
| import OAI.Probability.Perceptron.Model | |
| namespace OAI | |
| noncomputable section | |
| open MeasureTheory ProbabilityTheory Filter Set | |
| open scoped ENNReal NNReal Topology BigOperators BoundedContinuousFunction | |
| namespace SphericalPerceptronFreeEnergy | |
| section Positivity | |
| variable {Ī© : Type*} [MeasurableSpace Ī©] | |
| abbrev OverlapBlock (n : ā) := Fin n ā Fin n ā ā | |
| def overlapBlock (R : Ī© ā ā ā ā ā ā) (n : ā) (Ļ : Ī©) : OverlapBlock n := | |
| fun i j => R Ļ i j | |
| def GhirlandaGuerra (μ : Measure Ī©) (R : Ī© ā ā ā ā ā ā) : Prop := | |
| ā (n : ā), 2 ⤠n ā ā (i : Fin n) (s : Set (OverlapBlock n)), MeasurableSet s ā | |
| ā t : Set ā, MeasurableSet t ā | |
| μ.real ((overlapBlock R n) ā»Ā¹' s ā© {Ļ | R Ļ i n ā t}) = | |
| μ.real ((overlapBlock R n) ā»Ā¹' s) * μ.real {Ļ | R Ļ 0 1 ā t} / n + | |
| (ā j ā (Finset.univ.erase i), | |
| μ.real ((overlapBlock R n) ā»Ā¹' s ā© {Ļ | R Ļ i j ā t})) / n | |
| def negativeMatrices (n : ā) (Ī“ : ā) : Set (OverlapBlock n) := | |
| {q | ā i j : Fin n, i < j ā q i j < -Ī“} | |
| def negativeClique (R : Ī© ā ā ā ā ā ā) (n : ā) (Ī“ : ā) : Set Ī© := | |
| (overlapBlock R n) ā»Ā¹' negativeMatrices n Ī“ | |
| lemma negativeMatrices_measurable (n : ā) (Ī“ : ā) : | |
| MeasurableSet (negativeMatrices n Ī“) := by | |
| unfold negativeMatrices | |
| simp only [ofPred_forall] | |
| apply MeasurableSet.iInter | |
| intro i | |
| apply MeasurableSet.iInter | |
| intro j | |
| apply MeasurableSet.iInter | |
| intro _h | |
| exact measurableSet_lt ((measurable_pi_apply j).comp (measurable_pi_apply i)) measurable_const | |
| lemma overlapBlock_measurable {R : Ī© ā ā ā ā ā ā} | |
| (hR : ā i j, Measurable (fun Ļ => R Ļ i j)) (n : ā) : | |
| Measurable (overlapBlock R n) := by | |
| apply Measurable.of_eval | |
| intro i | |
| apply Measurable.of_eval | |
| intro j | |
| exact hR i j | |
| lemma negativeClique_measurable {R : Ī© ā ā ā ā ā ā} | |
| (hR : ā i j, Measurable (fun Ļ => R Ļ i j)) (n : ā) (Ī“ : ā) : | |
| MeasurableSet (negativeClique R n Ī“) := | |
| (negativeMatrices_measurable n Ī“).preimage (overlapBlock_measurable hR n) | |
| omit [MeasurableSpace Ī©] in | |
| lemma mem_negativeClique {R : Ī© ā ā ā ā ā ā} {n : ā} {Ī“ : ā} {Ļ : Ī©} : | |
| Ļ ā negativeClique R n Ī“ ā ā i j : Fin n, i < j ā R Ļ i j < -Ī“ := Iff.rfl | |
| omit [MeasurableSpace Ī©] in | |
| lemma negativeClique_succ (R : Ī© ā ā ā ā ā ā) (n : ā) (Ī“ : ā) : | |
| negativeClique R (n + 1) Ī“ = negativeClique R n Ī“ ā© | |
| ā i : Fin n, {Ļ | R Ļ i n < -Ī“} := by | |
| ext Ļ | |
| simp only [mem_inter_iff, mem_iInter, mem_ofPred] | |
| constructor | |
| Ā· intro h | |
| refine �_, ?_⩠| |
| Ā· intro i j hij | |
| exact h i.castSucc j.castSucc (by exact hij) | |
| Ā· intro i | |
| exact h i.castSucc (Fin.last n) (by simp) | |
| Ā· rintro āØhold, hnewā© i j hij | |
| by_cases hj : j.val < n | |
| Ā· exact hold āØi, lt_trans hij hjā© āØj, hjā© hij | |
| Ā· have jeq : (j : ā) = n := by omega | |
| have hi : (i : ā) < n := by omega | |
| simpa only [overlapBlock, jeq] using hnew āØi, hiā© | |
| omit [MeasurableSpace Ī©] in | |
| lemma negativeClique_two (R : Ī© ā ā ā ā ā ā) (Ī“ : ā) : | |
| negativeClique R 2 Ī“ = {Ļ | R Ļ 0 1 < -Ī“} := by | |
| ext Ļ | |
| constructor | |
| Ā· intro h | |
| exact h 0 1 (by decide) | |
| Ā· intro h i j hij | |
| have hi : (i : ā) = 0 := by omega | |
| have hj : (j : ā) = 1 := by omega | |
| change R Ļ 0 1 < -Ī“ at h | |
| simpa only [overlapBlock, hi, hj] using h | |
| lemma measureReal_inter_iInter_lower (μ : Measure Ω) [IsProbabilityMeasure μ] | |
| {ι : Type*} [Fintype ι] {E : Set Ī©} {T : ι ā Set Ī©} | |
| (hT : ā i, MeasurableSet (T i)) : | |
| μ.real E - ā i, μ.real (E \ T i) ⤠μ.real (E ā© ā i, T i) := by | |
| classical | |
| have hu : E \ (ā i, T i) = ā i ā (Finset.univ : Finset ι), E \ T i := by | |
| ext Ļ | |
| simp | |
| have hbound : μ.real (E \ ā i, T i) ⤠ā i, μ.real (E \ T i) := by | |
| rw [hu] | |
| exact measureReal_biUnion_finset_le _ _ | |
| have hsum := measureReal_inter_add_sdiff (μ := μ) (s := E) (MeasurableSet.iInter hT) | |
| linarith | |
| lemma gg_negativeClique_extension (μ : Measure Ω) [IsProbabilityMeasure μ] | |
| {R : Ī© ā ā ā ā ā ā} (hR : ā i j, Measurable (fun Ļ => R Ļ i j)) | |
| (hsym : āįµ Ļ āμ, ā i j, R Ļ i j = R Ļ j i) | |
| (hGG : GhirlandaGuerra μ R) {n : ā} (hn : 2 ⤠n) (Ī“ : ā) : | |
| μ.real {Ļ | R Ļ 0 1 < -Ī“} * μ.real (negativeClique R n Ī“) ⤠| |
| μ.real (negativeClique R (n + 1) Γ) := by | |
| classical | |
| let b := μ.real {Ļ | R Ļ 0 1 < -Ī“} | |
| let p := μ.real (negativeClique R n Γ) | |
| have hnpos : (0 : ā) < n := by exact_mod_cast (by omega : 0 < n) | |
| have htail (i : Fin n) : | |
| μ.real (negativeClique R n Ī“ ā© {Ļ | R Ļ i n < -Ī“}) = p * (b + (n - 1)) / n := by | |
| have h := hGG n hn i (negativeMatrices n Ī“) (negativeMatrices_measurable n Ī“) | |
| (Iio (-Ī“)) measurableSet_Iio | |
| have hpair (j : Fin n) (hji : j ā i) : | |
| μ.real (negativeClique R n Ī“ ā© {Ļ | R Ļ i j < -Ī“}) = p := by | |
| apply congrArg ENNReal.toReal | |
| apply measure_congr | |
| filter_upwards [hsym] with Ļ hĻ | |
| apply propext | |
| constructor | |
| Ā· exact fun h => h.1 | |
| Ā· intro h | |
| refine āØh, ?_ā© | |
| change R Ļ i j < -Ī“ | |
| rcases lt_or_gt_of_ne (Ne.symm hji) with hij | hij | |
| Ā· exact h i j hij | |
| Ā· rw [hĻ i j] | |
| exact h j i hij | |
| change μ.real (negativeClique R n Ī“ ā© {Ļ | R Ļ i n < -Ī“}) = | |
| p * b / n + (ā j ā Finset.univ.erase i, | |
| μ.real (negativeClique R n Ī“ ā© {Ļ | R Ļ i j < -Ī“})) / n at h | |
| rw [Finset.sum_congr rfl (fun j hj => hpair j (Finset.ne_of_mem_erase hj))] at h | |
| have hcard : ((Finset.univ.erase i).card : ā) = (n : ā) - 1 := by | |
| simp only [Finset.card_erase_of_mem (Finset.mem_univ i), Finset.card_univ, Fintype.card_fin] | |
| rw [Nat.cast_sub (by omega)] | |
| norm_num | |
| simp only [Finset.sum_const, nsmul_eq_mul, hcard] at h | |
| rw [h] | |
| ring | |
| have hbad (i : Fin n) : | |
| μ.real (negativeClique R n Ī“ \ {Ļ | R Ļ i n < -Ī“}) = p * (1 - b) / n := by | |
| have h := measureReal_inter_add_sdiff (μ := μ) (s := negativeClique R n Γ) | |
| (t := {Ļ | R Ļ i n < -Ī“}) (measurableSet_lt (hR i n) measurable_const) | |
| rw [htail i] at h | |
| change _ + _ = p at h | |
| apply (eq_div_iff (ne_of_gt hnpos)).mpr | |
| field_simp at h | |
| nlinarith | |
| rw [negativeClique_succ] | |
| have h := measureReal_inter_iInter_lower μ (E := negativeClique R n Γ) | |
| (T := fun i : Fin n => {Ļ | R Ļ i n < -Ī“}) | |
| (fun i => measurableSet_lt (hR i n) measurable_const) | |
| simp_rw [hbad] at h | |
| simp only [Finset.sum_const, Finset.card_univ, Fintype.card_fin, nsmul_eq_mul] at h | |
| have he : p - (n : ā) * (p * (1 - b) / n) = b * p := by | |
| field_simp | |
| ring | |
| rwa [he] at h | |
| lemma negative_gram_sum_bound {n : ā} {Q : Fin n ā Fin n ā ā} {Ī“ : ā} | |
| (hsym : ā i j, Q i j = Q j i) (hdiag : ā i, Q i i ⤠1) | |
| (hneg : ā i j, i < j ā Q i j < -Ī“) : | |
| (ā i, ā j, Q i j) ⤠(n : ā) * (1 - Ī“ * ((n : ā) - 1)) := by | |
| classical | |
| have hrow (i : Fin n) : (ā j, Q i j) ⤠1 - Ī“ * ((n : ā) - 1) := by | |
| have hpair (j : Fin n) (hji : j ā i) : Q i j ⤠-Ī“ := by | |
| rcases lt_or_gt_of_ne (Ne.symm hji) with hij | hij | |
| Ā· exact (hneg i j hij).le | |
| Ā· rw [hsym i j] | |
| exact (hneg j i hij).le | |
| have hs : (ā j ā Finset.univ.erase i, Q i j) ⤠| |
| ā _j ā Finset.univ.erase i, -Ī“ := | |
| Finset.sum_le_sum fun j hj => hpair j (Finset.ne_of_mem_erase hj) | |
| have hc : ((Finset.univ.erase i).card : ā) = (n : ā) - 1 := by | |
| simp only [Finset.card_erase_of_mem (Finset.mem_univ i), Finset.card_univ, Fintype.card_fin] | |
| rw [Nat.cast_sub (by have := i.isLt; omega)] | |
| norm_num | |
| simp only [Finset.sum_const, nsmul_eq_mul, hc] at hs | |
| have ht := Finset.sum_erase_add Finset.univ (Q i) (Finset.mem_univ i) | |
| nlinarith [hdiag i] | |
| calc | |
| _ ⤠ā _i : Fin n, (1 - Ī“ * ((n : ā) - 1)) := Finset.sum_le_sum fun i _ => hrow i | |
| _ = _ := by simp; ring | |
| lemma negativeClique_null (μ : Measure Ω) [IsProbabilityMeasure μ] | |
| {R : Ī© ā ā ā ā ā ā} | |
| (hsym : āįµ Ļ āμ, ā i j, R Ļ i j = R Ļ j i) | |
| (hdiag : āįµ Ļ āμ, ā i, R Ļ i i ⤠1) | |
| (hpos : ā n : ā, āįµ Ļ āμ, 0 ⤠ā i : Fin n, ā j : Fin n, R Ļ i j) | |
| {n : ā} {Ī“ : ā} (hn : 0 < n) (hĪ“ : 1 < Ī“ * ((n : ā) - 1)) : | |
| μ (negativeClique R n Γ) = 0 := by | |
| have hnot : āįµ Ļ āμ, Ļ ā negativeClique R n Ī“ := by | |
| filter_upwards [hsym, hdiag, hpos n] with Ļ hĻs hĻd hĻp | |
| intro hĻn | |
| have hb := negative_gram_sum_bound | |
| (Q := fun i j : Fin n => R Ļ i j) | |
| (fun i j => hĻs i j) (fun i => hĻd i) hĻn | |
| have hn' : (0 : ā) < n := by exact_mod_cast hn | |
| have : (n : ā) * (1 - Ī“ * ((n : ā) - 1)) < 0 := | |
| mul_neg_of_pos_of_neg hn' (by linarith) | |
| linarith | |
| simpa only [not_not, ofPred_mem_eq] using ae_iff.mp hnot | |
| theorem gg_negative_threshold_null (μ : Measure Ω) [IsProbabilityMeasure μ] | |
| {R : Ī© ā ā ā ā ā ā} (hR : ā i j, Measurable (fun Ļ => R Ļ i j)) | |
| (hsym : āįµ Ļ āμ, ā i j, R Ļ i j = R Ļ j i) | |
| (hdiag : āįµ Ļ āμ, ā i, R Ļ i i ⤠1) | |
| (hpos : ā n : ā, āįµ Ļ āμ, 0 ⤠ā i : Fin n, ā j : Fin n, R Ļ i j) | |
| (hGG : GhirlandaGuerra μ R) {Ī“ : ā} (hĪ“ : 0 < Ī“) : | |
| μ {Ļ | R Ļ 0 1 < -Ī“} = 0 := by | |
| apply (measureReal_eq_zero_iff (μ := μ)).mp | |
| apply le_antisymm _ measureReal_nonneg | |
| by_contra hb | |
| have hbpos : 0 < μ.real {Ļ | R Ļ 0 1 < -Ī“} := lt_of_not_ge hb | |
| have hcpos (k : ā) : 0 < μ.real (negativeClique R (k + 2) Ī“) := by | |
| induction k with | |
| | zero => simpa only [zero_add, negativeClique_two] using hbpos | |
| | succ k hk => | |
| have he := gg_negativeClique_extension μ hR hsym hGG (n := k + 2) (by omega) Γ | |
| exact (mul_pos hbpos hk).trans_le he | |
| obtain āØk, hkā© := exists_nat_gt (1 / Ī“) | |
| have hkĪ“ : 1 < (k : ā) * Ī“ := (div_lt_iffā hĪ“).mp hk | |
| have he : 1 < Ī“ * (((k + 2 : ā) : ā) - 1) := by | |
| push_cast | |
| nlinarith | |
| have hz := negativeClique_null μ hsym hdiag hpos (n := k + 2) (by omega) he | |
| have hz' : μ.real (negativeClique R (k + 2) Γ) = 0 := (measureReal_eq_zero_iff (μ := μ)).mpr hz | |
| linarith [hcpos k] | |
| theorem gg_overlap_nonnegative (μ : Measure Ω) [IsProbabilityMeasure μ] | |
| {R : Ī© ā ā ā ā ā ā} (hR : ā i j, Measurable (fun Ļ => R Ļ i j)) | |
| (hsym : āįµ Ļ āμ, ā i j, R Ļ i j = R Ļ j i) | |
| (hdiag : āįµ Ļ āμ, ā i, R Ļ i i ⤠1) | |
| (hpos : ā n : ā, āįµ Ļ āμ, 0 ⤠ā i : Fin n, ā j : Fin n, R Ļ i j) | |
| (hGG : GhirlandaGuerra μ R) : | |
| āįµ Ļ āμ, 0 ⤠R Ļ 0 1 := by | |
| have ht (k : ā) : āįµ Ļ āμ, -(1 / ((k : ā) + 1)) ⤠R Ļ 0 1 := by | |
| rw [ae_iff] | |
| simpa only [not_le] using gg_negative_threshold_null μ hR hsym hdiag hpos hGG | |
| (Ī“ := 1 / ((k : ā) + 1)) (by positivity) | |
| filter_upwards [ae_all_iff.mpr ht] with Ļ hĻ | |
| have hlim : Tendsto (fun k : ā => -(1 / ((k : ā) + 1))) atTop (š (0 : ā)) := by | |
| simpa using (tendsto_one_div_add_atTop_nhds_zero_nat (š := ā)).neg | |
| exact le_of_tendsto hlim (Eventually.of_forall hĻ) | |
| end Positivity | |
| lemma gg_star_growth_impossible {a : ā ā ā} {N ζ : ā} | |
| (hN : 2 ⤠N) (hζ : 0 < ζ) (ha : ā k, 0 ⤠a k) (hzero : 0 < a 0) | |
| (hrec : ā k, (N + k) * a (k + 1) = (N + k - 1 + ζ) * a k) | |
| (hbound : ā k : ā, (k + 1 : ā) * a k ⤠1) : False := by | |
| let b : ā ā ā := fun k => (N + k - 1) * a k | |
| have hbzero : 0 < b 0 := by dsimp [b]; nlinarith | |
| have hdiff (k : ā) : b (k + 1) = b k + ζ * a k := by | |
| dsimp [b] | |
| push_cast | |
| nlinarith [hrec k] | |
| have hbmono : Monotone b := monotone_nat_of_le_succ fun k => by | |
| rw [hdiff] | |
| exact le_add_of_nonneg_right (mul_nonneg hζ.le (ha k)) | |
| have hblower (k : ā) : b 0 ⤠b k := hbmono (Nat.zero_le k) | |
| have hbupper (k : ā) : b k ⤠N := by | |
| have hk : (0 : ā) ⤠k := Nat.cast_nonneg k | |
| calc | |
| b k ⤠N * ((k + 1 : ā) * a k) := by | |
| dsimp [b] | |
| have : N + (k : ā) - 1 ⤠N * (k + 1) := by nlinarith | |
| nlinarith [mul_le_mul_of_nonneg_right this (ha k)] | |
| _ ⤠N := by nlinarith [hbound k] | |
| have hsum (k : ā) : ζ * ā j ā Finset.range k, a j = b k - b 0 := by | |
| induction k with | |
| | zero => simp | |
| | succ k ih => rw [Finset.sum_range_succ, mul_add, ih, hdiff]; ring | |
| have hasum : Summable a := by | |
| apply summable_of_sum_range_le ha (c := N / ζ) | |
| intro k | |
| apply (le_div_iffā hζ).mpr | |
| nlinarith [hsum k, hbupper k] | |
| have hdom (k : ā) : (1 / (k + 1 : ā)) ⤠(N / b 0) * a k := by | |
| have hk : (0 : ā) < k + 1 := by positivity | |
| rw [div_le_iffā hk] | |
| have : b 0 ⤠N * ((k + 1 : ā) * a k) := by | |
| calc b 0 ⤠b k := hblower k | |
| _ ⤠N * ((k + 1 : ā) * a k) := by | |
| dsimp [b] | |
| have hknonneg : (0 : ā) ⤠k := Nat.cast_nonneg k | |
| have : N + (k : ā) - 1 ⤠N * (k + 1) := by nlinarith | |
| nlinarith [mul_le_mul_of_nonneg_right this (ha k)] | |
| have hn : N * ((k + 1 : ā) * a k) / b 0 ā„ 1 := | |
| (le_div_iffā hbzero).mpr (by simpa using this) | |
| calc 1 ⤠N * ((k + 1 : ā) * a k) / b 0 := hn | |
| _ = (N / b 0) * a k * (k + 1 : ā) := by ring | |
| have hharm : Summable (fun k : ā => 1 / (k + 1 : ā)) := | |
| Summable.of_nonneg_of_le (fun _ => by positivity) hdom (hasum.mul_left (N / b 0)) | |
| have hharm' : Summable (fun k : ā => 1 / ((k + 1 : ā) : ā)) := by | |
| simpa only [Nat.cast_add, Nat.cast_one] using hharm | |
| exact Real.not_summable_one_div_natCast ((summable_nat_add_iff 1).mp hharm') | |
| end SphericalPerceptronFreeEnergy | |
| end | |
| end OAI | |