Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Revealed two-replica density bound with zero marginals

Proved
ZeroFreeRRG.Hardcore.replica_reveal_density_bound_nonnegative

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

If the Gibbs weights are nonnegative, the spin marginal probabilities are positive, and the sum of pinned log-likelihoods is at most BBB, then the product of the two revealed Gibbs marginals is at most eBe^BeB times their product-prior mass. The conclusion includes revealed patterns with zero Gibbs marginal.

Preamble
import Mathlib
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.replica_reveal_density_bound_nonnegative (m : Model) (t : ℝ) (d n : ℕ) (M : Matching n d)
    (σ σ' : Fin n → m.Spin) (U : Finset (Fin n)) (B : ℝ)
    (hπ : ∀ a, 0 < m.pi t a) (hnonneg : ∀ τ, 0 ≤ gibbs m t M τ)
    (hgood : pinnedLL m t M σ U + pinnedLL m t M σ' U ≤ B) :
    gibbsMarg m t M σ U * gibbsMarg m t M σ' U ≤
      Real.exp B * ((∏ v ∈ U, m.pi t (σ v)) * (∏ v ∈ U, m.pi t (σ' v))) := by sorry
Source
Auxiliary revealed-density bound in 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me