File size: 3,088 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 | 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
|