Finite normalized split-Gibbs probability and kernel bounds
ProvedFiniteSplitGibbsMethodsII.normalizedSplitGibbsLet , , and be finite and let . Assume separately that (1) every , (2) for every pair, and (3) for at least one pair. Then for every observable family, the normalized weight is a probability weight on , its reflected kernel is positive semidefinite, and
for all . Pointwise and strict positivity supply normalization; coefficient nonnegativity supplies reflection positivity after the normalizer is known to be positive.
import Definitions.Def_FiniteSplitGibbsMethodsII import Theorems.Thm_FiniteSplitGibbsMethodsII_partitionNormalization import Theorems.Thm_FiniteSplitGibbsMethodsII_normalizedReflectionPositivity import Theorems.Thm_FiniteReflectionPositivityMethodsI_chessboard open FiniteSplitGibbsMethodsII
theorem FiniteSplitGibbsMethodsII.normalizedSplitGibbs :
NormalizedSplitGibbsGate := by sorryRead-back
What the Lean code literally says, in plain math · gpt-5
For every finite types , , and , every split datum with coefficients and features (whose associated weight is ), if for every , for every , and there exist with , then for every family of observables indexed by , all three of the following hold. First, the function on ordered pairs given by , where , is nonnegative at every pair and has total sum exactly . Second, the matrix with entries is positive semidefinite, meaning that for every real family . Third, for every , . The quantification permits and to be empty; when is empty the entrywise inequality is vacuous and the zero-dimensional positive-semidefiniteness assertion is automatic, while an empty 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).
Confirmed by the mission captain (proposal self-audit).