Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite normalized split-Gibbs probability and kernel bounds

Proved
FiniteSplitGibbsMethodsII.normalizedSplitGibbs

by lisamegawatts · Sep 19, 2026 · Mathlib c5ea003 (Lean v4.30.0)

chessboard-inequalityfinite-probabilitygibbs-weightsnormalizationpositive-semidefinitereflection-positivity

Let XXX, AAA, and III be finite and let W(x,y)=∑a∈Acaϕa(x)ϕa(y)W(x,y)=\sum_{a\in A}c_a\phi_a(x)\phi_a(y)W(x,y)=∑a∈A​ca​ϕa​(x)ϕa​(y). Assume separately that (1) every ca≥0c_a\ge0ca​≥0, (2) W(x,y)≥0W(x,y)\ge0W(x,y)≥0 for every pair, and (3) W(x,y)>0W(x,y)>0W(x,y)>0 for at least one pair. Then for every observable family, the normalized weight is a probability weight on X×XX\times XX×X, its reflected kernel KKK is positive semidefinite, and

Kij2≤KiiKjjK_{ij}^{2}\le K_{ii}K_{jj}Kij2​≤Kii​Kjj​

for all i,ji,ji,j. Pointwise and strict positivity supply normalization; coefficient nonnegativity supplies reflection positivity after the normalizer is known to be positive.

Preamble
import Definitions.Def_FiniteSplitGibbsMethodsII
import Theorems.Thm_FiniteSplitGibbsMethodsII_partitionNormalization
import Theorems.Thm_FiniteSplitGibbsMethodsII_normalizedReflectionPositivity
import Theorems.Thm_FiniteReflectionPositivityMethodsI_chessboard

open FiniteSplitGibbsMethodsII
Formal statement
theorem FiniteSplitGibbsMethodsII.normalizedSplitGibbs :
    NormalizedSplitGibbsGate := by sorry
Source
Finite normalized split-Gibbs corollary authored for this sequel. It composes the local normalization and normalized-RP gates with published Prove2Me theorem FiniteReflectionPositivityMethodsI.chessboard, id 2350f552-ee7a-4011-8ac9-3dbaf1536361; source: LeanProofs commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, ReflectionPositivityInfraredBound.lean, lines 40--44 and 83--137: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean . Exact local gate: NormalizedSplitGibbsGate.
Read-back

What the Lean code literally says, in plain math · gpt-5

For every finite types XXX, AAA, and III, every split datum DDD with coefficients cac_aca​ and features fa:X→Rf_a:X\to\mathbb Rfa​:X→R (whose associated weight is wD(x,y)=∑a∈Acafa(x)fa(y)w_D(x,y)=\sum_{a\in A}c_a f_a(x)f_a(y)wD​(x,y)=∑a∈A​ca​fa​(x)fa​(y)), if ca≥0c_a\ge 0ca​≥0 for every a∈Aa\in Aa∈A, wD(x,y)≥0w_D(x,y)\ge 0wD​(x,y)≥0 for every x,y∈Xx,y\in Xx,y∈X, and there exist x,y∈Xx,y\in Xx,y∈X with wD(x,y)>0w_D(x,y)>0wD​(x,y)>0, then for every family of observables Oi:X→RO_i:X\to\mathbb ROi​:X→R indexed by i∈Ii\in Ii∈I, all three of the following hold. First, the function on ordered pairs (x,y)∈X×X(x,y)\in X\times X(x,y)∈X×X given by p(x,y)=wD(x,y)/ZDp(x,y)=w_D(x,y)/Z_Dp(x,y)=wD​(x,y)/ZD​, where ZD=∑(u,v)∈X×XwD(u,v)Z_D=\sum_{(u,v)\in X\times X}w_D(u,v)ZD​=∑(u,v)∈X×X​wD​(u,v), is nonnegative at every pair and has total sum exactly 111. Second, the matrix KKK with entries Kij=∑x,y∈XOi(x)p(x,y)Oj(y)K_{ij}=\sum_{x,y\in X}O_i(x)p(x,y)O_j(y)Kij​=∑x,y∈X​Oi​(x)p(x,y)Oj​(y) is positive semidefinite, meaning that ∑i,j∈IqiKijqj≥0\sum_{i,j\in I}q_iK_{ij}q_j\ge 0∑i,j∈I​qi​Kij​qj​≥0 for every real family (qi)i∈I(q_i)_{i\in I}(qi​)i∈I​. Third, for every i,j∈Ii,j\in Ii,j∈I, Kij2≤KiiKjjK_{ij}^2\le K_{ii}K_{jj}Kij2​≤Kii​Kjj​. The quantification permits AAA and III to be empty; when III is empty the entrywise inequality is vacuous and the zero-dimensional positive-semidefiniteness assertion is automatic, while an empty XXX cannot satisfy the required existential positive-weight hypothesis, so that case is true only vacuously (and any other failure of a preceding hypothesis likewise makes the implication vacuous).

Human review
  • Endorsed by Shuze Chen · Sep 23, 2026

  • Endorsed by lisamegawatts · Sep 23, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me