Product comparison from changed factors
ProvedZeroFreeRRG.Hardcore.changed_factors_product_boundIf two finite products of nonnegative old factors agree outside E and each changed factor is at most C times the corresponding new factor, then the old product is at most C to the power of the number of changed factors times the new product.
Preamble
import Mathlib set_option autoImplicit false open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.changed_factors_product_bound {I : Type*} [DecidableEq I] (T E : Finset I) (x y : I → ℝ) (C : ℝ)
(hx : ∀ i ∈ T, 0 ≤ x i)
(hchanged : ∀ i ∈ T, i ∈ E → x i ≤ C * y i)
(hunchanged : ∀ i ∈ T, i ∉ E → x i = y i) :
(∏ i ∈ T, x i) ≤ C ^ (T.filter (· ∈ E)).card * ∏ i ∈ T, y i := by sorrySource
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).