Full-vertex reflection no-go control
ProvedFiniteReflectionPositivityMethodsI.fullVertexReflectionNoGoOn the two-element index set, let the unreflected correlation be the identity matrix and let reflection exchange the two indices. The resulting reflected full-vertex kernel is
and it is not positive semidefinite. This finite counterfixture records that reflection positivity must specify an appropriate half-observable algebra; it cannot be replaced by positive semidefiniteness of every reflected two-point matrix indexed by all vertices.
import Definitions.Def_FiniteReflectionPositivityMethodsI open FiniteReflectionPositivityMethodsI
theorem FiniteReflectionPositivityMethodsI.fullVertexReflectionNoGo :
FullVertexReflectionNoGo := by sorryRead-back
What the Lean code literally says, in plain math · GPT-5-based Codex; exact deployment identifier is not exposed
Let . Define by and , define when and otherwise, and define the real matrix by , equivalently exactly when and otherwise. The theorem is the closed assertion that is not positive semidefinite in the specified sense: it is not the case that both for every and for every function . The universal quantifier over includes every real-valued function on the two-element set, including the zero function.
Confirmed by the mission captain (proposal self-audit).