Half-observable reflection binding
ProvedFiniteReflectionPositivityMethodsI.halfObservableBindingLet be a finite type, let be a weight, and let be observables. A full configuration is , reflection exchanges the coordinates, and the plus-half lift of an observable reads its first coordinate. Then the reflected pairing is exactly
This theorem fixes the half-supported observable convention used by every subsequent reflection-positive kernel; it does not assert positivity of an arbitrary full-vertex correlation matrix.
import Definitions.Def_FiniteReflectionPositivityMethodsI open FiniteReflectionPositivityMethodsI
theorem FiniteReflectionPositivityMethodsI.halfObservableBinding :
HalfObservableBindingGate := 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 type , every arbitrary real-valued weight , and every arbitrary pair of functions , let a full configuration be , let reflection send to , and let the plus lift of be . The theorem asserts
Here the left side is exactly the defined reflected pairing: its right observable is first plus-lifted, then evaluated after reflection, which produces . There are no symmetry, positivity, normalization, or nonemptiness assumptions on , , , or ; if is empty, both sums are zero.
Confirmed by the mission captain (proposal self-audit).