math / data /lean /OAI /Probability /InvariantIsing /Pressure /LocalizedAlmostSure.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.09 kB
import OAI.Probability.InvariantIsing.Pressure.AlmostSure
namespace OAI
/-! Eventual local exponential tails imply almost-sure convergence whenever
the localizing random bound is eventually finite. -/
noncomputable section
open MeasureTheory Filter Set
open scoped Topology
namespace InvariantIsing
lemma exponential_tail_extend_initial {Ξ© : Type*} [MeasurableSpace Ξ©]
(P : Measure Ξ©) [IsProbabilityMeasure P] (E : β„• β†’ Set Ξ©)
{C a : ℝ} (hC : 0 ≀ C) (ha : 0 < a) (Nβ‚€ : β„•)
(hE : βˆ€ n, Nβ‚€ ≀ n β†’ P.real (E n) ≀ C*Real.exp (-a*(n : ℝ))) :
βˆƒ D : ℝ, 0 ≀ D ∧ βˆ€ n, P.real (E n) ≀ D*Real.exp (-a*(n : ℝ)) := by
let D := C+Real.exp (a*(Nβ‚€ : ℝ))
have hCD : C ≀ D := le_add_of_nonneg_right (Real.exp_pos _).le
refine ⟨D,by dsimp [D]; positivity,fun n => ?_⟩
by_cases hn : Nβ‚€ ≀ n
Β· exact (hE n hn).trans (mul_le_mul_of_nonneg_right hCD (Real.exp_pos _).le)
Β· have hle : (n : ℝ) ≀ Nβ‚€ := by exact_mod_cast (show n ≀ Nβ‚€ by omega)
have he : 1 ≀ Real.exp (a*(Nβ‚€ : ℝ))*Real.exp (-a*(n : ℝ)) := by
rw [← Real.exp_add,Real.one_le_exp_iff]
nlinarith
have hED : Real.exp (a*(Nβ‚€ : ℝ)) ≀ D := by dsimp [D]; linarith
exact (measureReal_le_one : P.real (E n) ≀ 1).trans
(he.trans (mul_le_mul_of_nonneg_right hED (Real.exp_pos _).le))
lemma ae_tendsto_zero_of_localized_exponential_tail {Ξ© : Type*} [MeasurableSpace Ξ©]
(P : Measure Ξ©) [IsProbabilityMeasure P] (X Z : β„• β†’ Ξ© β†’ ℝ)
(htail : βˆ€ K Ξ΅ : ℝ, 0 < K β†’ 0 < Ξ΅ β†’
βˆƒ C a : ℝ, 0 ≀ C ∧ 0 < a ∧ βˆƒ Nβ‚€ : β„•,
βˆ€ n, Nβ‚€ ≀ n β†’ P.real {Ο‰ | Ξ΅ ≀ |X n Ο‰| ∧ Z n Ο‰ ≀ K} ≀ C*Real.exp (-a*(n : ℝ)))
(hbound : βˆ€α΅ Ο‰ βˆ‚P, βˆƒ K : ℝ, βˆ€αΆ  n in atTop, Z n Ο‰ ≀ K) :
βˆ€α΅ Ο‰ βˆ‚P, Tendsto (fun n => X n Ο‰) atTop (𝓝 0) := by
let T := fun k n Ο‰ => if Z n Ο‰ ≀ (k+1 : ℝ) then X n Ο‰ else 0
have hT (k : β„•) : βˆ€α΅ Ο‰ βˆ‚P, Tendsto (fun n => T k n Ο‰) atTop (𝓝 0) := by
apply ae_tendsto_zero_of_exponential_tail
intro Ξ΅ hΞ΅
obtain ⟨C,a,hC,ha,Nβ‚€,hNβ‚€βŸ© := htail (k+1) Ξ΅ (by positivity) hΞ΅
obtain ⟨D,hD,hDE⟩ := exponential_tail_extend_initial P
(fun n => {Ο‰ | Ξ΅ ≀ |X n Ο‰| ∧ Z n Ο‰ ≀ (k+1 : ℝ)}) hC ha Nβ‚€ hNβ‚€
refine ⟨D,a,hD,ha,fun n => ?_⟩
have he : {Ο‰ | Ξ΅ ≀ |T k n Ο‰|}={Ο‰ | Ξ΅ ≀ |X n Ο‰| ∧ Z n Ο‰ ≀ (k+1 : ℝ)} := by
ext Ο‰
by_cases hh : Z n Ο‰ ≀ (k+1 : ℝ)
Β· simp only [T,hh,ite_true,mem_ofPred_eq,and_true]
Β· simp only [T,hh,ite_false,abs_zero,mem_ofPred_eq,and_false,not_le_of_gt hΞ΅]
rw [he]
exact hDE n
filter_upwards [ae_all_iff.mpr hT,hbound] with ω hω hb
obtain ⟨K,hK⟩ := hb
obtain ⟨k,hk⟩ := exists_nat_gt K
have he : (fun n => T k n Ο‰)=αΆ [atTop] (fun n => X n Ο‰) := by
filter_upwards [hK] with n hn
have hn' : Z n Ο‰ ≀ (k+1 : ℝ) := hn.trans (by exact le_trans hk.le (by linarith))
simp only [T,ite_eq_left hn']
exact (hω k).congr' he
end InvariantIsing
end
end OAI