Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-factor ratio bound

Proved
ZeroFreeRRG.Hardcore.finite_factor_ratio_bound

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

For any finite spin set, positive one-site weights, and arbitrary interaction weights, there is a constant C at least one that bounds every ratio of one-site weights and every ratio of interaction weights having a strictly positive denominator.

Preamble
import Mathlib
set_option autoImplicit false
open scoped Classical BigOperators

Formal statement
theorem ZeroFreeRRG.Hardcore.finite_factor_ratio_bound {A : Type*} [Fintype A] (p : A → ℝ) (J : A → A → ℝ)
    (hp : ∀ a, 0 < p a) :
    ∃ C : ℝ, 1 ≤ C ∧ (∀ a b, p a ≤ C * p b) ∧
      (∀ a b c d, 0 < J c d → J a b ≤ C * J c d) := by sorry
Source
Chunyang Wang et al., 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, Appendix E.3, proof of Lemma 4.20, Step 1 (supporting argument).

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