Planted two-replica revealed-event change of measure
ProvedZeroFreeRRG.Hardcore.planted_reveal_change_measureFor the planted graph with two Gibbs replicas and a Bernoulli reveal set, assume the product-prior probability of a revealed-pattern event is at most . The planted joint probability of that event together with the condition that the two pinned log-likelihoods sum to at most is at most . The formula retains all finite matching, spin, and reveal-set sums.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_BetheFunctional import Definitions.Def_ZeroFreeRRG_Hardcore_Moments set_option backward.isDefEq.respectTransparency false set_option backward.isDefEq.respectTransparency.types false set_option autoImplicit false open Set Filter MeasureTheory AFIsingKS ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.planted_reveal_change_measure (m : Model) (hm : m.Valid) (t s : ℝ) (ht : m.PosParam t)
(hs : 0 ≤ s) (hs1 : s ≤ 1) (d n : ℕ) [Nonempty (Matching n d)] (a₀ : m.Spin) (B R : ℝ)
(H : ∀ U : Finset (Fin n), ({v : Fin n // v ∈ U} → m.Spin) →
({v : Fin n // v ∈ U} → m.Spin) → Prop)
(hreference : (∑ U : Finset (Fin n), revealProb s U *
∑ y : ({v : Fin n // v ∈ U} → m.Spin), ∑ y' : ({v : Fin n // v ∈ U} → m.Spin),
if H U y y' then
(∏ v : {v : Fin n // v ∈ U}, m.pi t (y v)) *
(∏ v : {v : Fin n // v ∈ U}, m.pi t (y' v)) else 0) ≤ R) :
(∑ M : Matching n d, ∑ σ : Fin n → m.Spin, ∑ σ' : Fin n → m.Spin, ∑ U : Finset (Fin n),
planted m t M σ * gibbs m t M σ' * revealProb s U *
(if H U (fun v => σ v.1) (fun v => σ' v.1) ∧
pinnedLL m t M σ U + pinnedLL m t M σ' U ≤ B then 1 else 0)) ≤ Real.exp B * R := 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, pp. 39–40, proof of Lemma 5.6.