math / data /lean /OAI /Probability /SKBarriers /Coverage /CoverageScale.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.63 kB
import Mathlib
import OAI.Probability.SKBarriers.Coverage.CoverageTheorem
namespace OAI
section
section
noncomputable section
open scoped BigOperators
open MeasureTheory ProbabilityTheory Filter Set
namespace SK.Analytic
open scoped Topology
theorem stretchedLogScale_tendsto :
Tendsto (fun n : β„• => (n:ℝ)^kappa) atTop atTop :=
(tendsto_rpow_atTop (by norm_num [kappa])).comp tendsto_natCast_atTop_atTop
theorem stretchedLogScale_sublinear :
Tendsto (fun n : β„• => (n:ℝ)^kappa/(n:ℝ)) atTop (𝓝 0) := by
have H := (tendsto_rpow_neg_atTop (by norm_num [kappa] : 0 < 1-kappa)).comp
(tendsto_natCast_atTop_atTop (R := ℝ))
apply H.congr'
filter_upwards [eventually_gt_atTop (0:β„•)] with n hn
have hn' : (0:ℝ) < n := by exact_mod_cast hn
change (n:ℝ)^(-(1-kappa)) = (n:ℝ)^kappa/(n:ℝ)
rw [show -(1-kappa) = kappa-1 by ring,Real.rpow_sub hn',Real.rpow_one]
theorem stretched_uniform_coverage {Ξ² : ℝ} (hΞ² : 1 < Ξ²) :
βˆƒ q : ℝ, 0 < q ∧ q < 1 ∧ βˆ€ D : ℝ, 0 < D β†’ βˆƒ D₃ : ℝ, 0 < D₃ ∧
βˆƒ C : (n : β„•) β†’ Set (Disorder n), (βˆ€ n, MeasurableSet (C n)) ∧
Tendsto (fun n => (disorderLaw n).real (C n)) atTop (𝓝 1) ∧
βˆ€ n J, J ∈ C n β†’ βˆ€ S : Finset (Config n),
finiteMass (gibbs Ξ² J) (S.filter (fun x =>
finiteMass (gibbs Ξ² J) (S.filter (fun y => q ≀ |overlap x y|)) <
Real.exp (-D₃*((n:ℝ)^kappa)))) < Real.exp (-D*((n:ℝ)^kappa)) :=
uniform_coverage hΞ² (fun n => (n:ℝ)^kappa) stretchedLogScale_tendsto stretchedLogScale_sublinear
end SK.Analytic
end
end
end
end OAI