Factorization of the hardcore vertex derivative numerator
ProvedZeroFreeRRG.Hardcore.hardcore_gradient_factorizationFor finitely many real messages and , set , and . The numerator obtained by differentiating the hardcore vertex factor satisfies
with expanded as a finite sum in the formal statement.
Preamble
import Mathlib set_option autoImplicit false open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.hardcore_gradient_factorization (d : ℕ) (h : Fin d → ℝ) (θ : ℝ)
(hden : ∀ i, 1+θ*h i ≠ 0) :
let P := ∏ i, (1+θ*h i)
let Q := ∏ i, (1-h i)
let W := fun i => (1-h i)/(1+θ*h i)
(1+θ)*(∑ i, (∏ j ∈ Finset.univ.erase i, (1+θ*h j))*h i) + Q - P =
P*((∏ i, W i) - ∑ i, W i + d - 1) := 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, proof of Lemma 4.17, equation (25), pp. 29–31.