Two-observable chessboard inequality
ProvedFiniteReflectionPositivityMethodsI.chessboarddiscrete-fourier-transformfinite-dimensionalinfrared-boundreflection-positivitystatistical-mechanics
Let be finite and let be symmetric with nonnegative quadratic form on every real vector. Then, for all ,
This is the two-observable finite Cauchy--Schwarz, or two-block chessboard, consequence consumed after reflection positivity has produced a positive-semidefinite kernel.
Preamble
import Definitions.Def_FiniteReflectionPositivityMethodsI open FiniteReflectionPositivityMethodsI
Formal statement
theorem FiniteReflectionPositivityMethodsI.chessboard : ChessboardGate := by sorry
Source
LeanProofs, ReflectionPositivityInfraredBound.lean, commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, lines 40-44 and 83-137: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean
Read-back
What the Lean code literally says, in plain math · GPT-5 Codex (exact deployment identifier not exposed)
For every possibly empty finite base-universe type and every real matrix , assume both that for every and that
for every function . Then, for every , the theorem asserts
No distinctness assumption is placed on and , so the conclusion includes the diagonal case ; if is empty, the conclusion is vacuous.
Human review
Confirmed by the mission captain (proposal self-audit).