Logarithmic Jensen inequality under finite size bias
ProvedZeroFreeRRG.Hardcore.size_biased_log_jensenFor any nonempty finite collection of positive values, the average of their logarithms under size-biased weights is at least the logarithm of their ordinary arithmetic mean.
Preamble
import Mathlib set_option autoImplicit false open Set open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.size_biased_log_jensen {I : Type} [Fintype I] [Nonempty I] (x : I → ℝ) (hx : ∀ i, 0 < x i) :
Real.log ((∑ i, x i) / (Fintype.card I : ℝ)) ≤
(∑ i, x i * Real.log (x i)) / (∑ i, x i) := by sorrySource
Auxiliary convexity inequality for 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, p. 31 and Appendix E.3, Lemma 4.20.