Coloring vertex factor has mean one
ProvedZeroFreeRRG.Hardcore.coloring_vertex_factor_mean_oneFor , , and independent messages from a coloring cavity law, the expected vertex factor equals one. Thus it is the density of a probability law relative to the product cavity law, as used in the entropy representation in Lemma 4.27.
Preamble
import Definitions.Def_ZeroFreeRRG_Hardcore_BetheFunctional open MeasureTheory
Formal statement
namespace ZeroFreeRRG.Hardcore
theorem coloring_vertex_factor_mean_one (q d : ℕ) (hq : 3 ≤ q) (ν : ProbabilityMeasure (Fin q → ℝ))
(hν : ν ∈ cavityLaws (.potts q) 0) :
(∫ xs, vertexFactor (.potts q) 0 d xs
∂(Measure.pi fun _ : Fin d => (ν : Measure (Fin q → ℝ)))) = 1 := by sorry
end ZeroFreeRRG.HardcoreSource
Chen, Wang, and Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1461.pdf, proof of Lemma 4.27, printed p. 34.