Limsup comparison under a vanishing lower perturbation
ProvedZeroFreeRRG.Hardcore.limsup_vanishing_lowerIf tends to zero along a nontrivial filter and eventually, then the extended-real limsup of is at most that of .
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_Moments set_option autoImplicit false open Set Filter Topology MeasureTheory AFIsingKS ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.limsup_vanishing_lower {α : Type} (F : Filter α) [F.NeBot] (A B g : α → ℝ)
(hg : Tendsto g F (𝓝 0)) (hbound : ∀ᶠ x in F, A x + g x ≤ B x) :
limsup (fun x => (A x : EReal)) F ≤ limsup (fun x => (B x : EReal)) F := by sorrySource
Auxiliary step for Chen–Wang–Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/1461.pdf, p. 31, Lemma 4.20, equation (29).