Small planted reveal log-likelihood under Condition 1
OpenZeroFreeRRG.Hardcore.overlap_likelihood_smallUnder Condition 1 for either positive-parameter hardcore or Potts model, for every there is a reveal probability such that the planted expected pinned log-likelihood divided by is at most for all sufficiently large admissible . This is the small-mean estimate used at the start of the proof of the exponential overlap bound.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_BetheFunctional import Definitions.Def_ZeroFreeRRG_Hardcore_Moments set_option autoImplicit false open Set Filter MeasureTheory AFIsingKS ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.overlap_likelihood_small (m : Model) (hm : m.Valid) (d : ℕ) (hd : 3 ≤ d) (t : ℝ) (ht : m.PosParam t)
(hC1 : Condition1 m d t) :
∀ ε : ℝ, 0 < ε → ∃ s : ℝ, 0 < s ∧ s < 1 ∧ ∃ N : ℕ,
∀ n ≥ N, Even (n*d) →
(1:ℝ)/n * plantedPinnedE m t s d n (fun M σ U => pinnedLL m t M σ U) ≤ ε*s := by sorrySource
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. 39, proof of Lemma 5.6, from equation (29).