Split-weight reflection positivity
ProvedFiniteReflectionPositivityMethodsI.splitWeightReflectionPositivityLet , , and be finite types. For coefficients , features , and observables , define
Then is symmetric and positive semidefinite: for every ,
This is the finite sum-of-squares engine of reflection positivity after a cross-plane weight has been supplied in nonnegative split form. It deliberately leaves the model-specific construction of such a feature expansion outside the claim.
import Definitions.Def_FiniteReflectionPositivityMethodsI open FiniteReflectionPositivityMethodsI
theorem FiniteReflectionPositivityMethodsI.splitWeightReflectionPositivity :
SplitWeightReflectionPositivityGate := by sorryRead-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 types , , and , every coefficient function , and every feature family , assume for every . Then, for every arbitrary observable family , define
The theorem asserts that is positive semidefinite in the explicitly defined sense: for every , and for every function ,
The formula for is the reflected kernel because reflection swaps and the plus-lifted right observable consequently evaluates to . No boundedness, normalization, linear independence, or nonzero condition is imposed on the features or observables. If is empty, the coefficient hypothesis is vacuous and and are zero; if is empty, is zero; and if is empty, symmetry and the quadratic-form conclusion have only their empty or zero-sum content.
Confirmed by the mission captain (proposal self-audit).