Finite reflection-positivity claim boundary
ProvedFiniteReflectionPositivityMethodsI.claimBoundaryThe finite reflection-positivity methods boundary is the conjunction of nine certified statements:
- the half-observable reflection binding;
- positive semidefiniteness for nonnegative split weights;
- the two-observable chessboard inequality;
- the exact Torus-4 DFT eigenmode equation;
- the typed nonnegative Torus-4 spectrum with only the constant zero mode;
- positive semidefiniteness of the diagonal free covariance for positive inverse temperature;
- the modewise infrared inequality on sources with zero constant component;
- the full-vertex reflection no-go control; and
- the zero-mode restriction control.
Equivalently, writing these gates as , the goal is
This root theorem packages the exact reusable finite algebraic and spectral core. It does not assert physical Gibbs reflection positivity, Gaussian domination, a thermodynamic limit, or a Kosterlitz--Thouless transition.
import Definitions.Def_FiniteReflectionPositivityMethodsI open FiniteReflectionPositivityMethodsI
theorem FiniteReflectionPositivityMethodsI.claimBoundary : ClaimBoundary := by sorry
Read-back
What the Lean code literally says, in plain math · GPT-5-based Codex; exact deployment identifier is not exposed
The theorem is the closed assertion that all nine claims below hold simultaneously. Throughout, for a finite type , a real matrix , and , write . (1) For every finite type , every function , and every , one has ; the left side is obtained by lifting to the first coordinate, swapping the two coordinates, and then evaluating the similarly lifted . (2) For every three finite types , every pair of data and , if for every , then for every family the matrix given by satisfies for all and for every . The finite types quantified in (1) and (2), including , , and , may be empty, so coefficient assumptions, sums, or universal conclusions can be vacuous or empty as appropriate. (3) For every finite type and every real matrix on , if for all and for every , then for every ; when is empty, both the matrix hypotheses and the conclusion over indices are vacuous, while the quantified functions still include the unique empty function. (4) Let and . For , put and . Define by for every ; ; ; and . Put , , and ; for and in , put and . Then, for every , , with the real number regarded as a complex scalar on the right. (5) For the same explicit and , one has for every and if and only if ; moreover, there exists a structure containing a function together with proofs that for every and if and only if , such that as functions. (6) For every finite type equipped with decidable equality and a chosen element , every real , and every structure consisting of a function with for all and if and only if , if , define by when , , and when . Then for every and for every . The division is real division, which is a total operation, although the stated spectrum conditions and force at each . (7) For every finite type equipped with decidable equality and a chosen element , every , every such spectrum function with its nonnegativity and zero-set proofs, and every real matrix on , let be the matrix from (6). If , and for every , and for every satisfying , then for every with . A chosen zero element makes these types nonempty, but if no element distinct from exists, the final conclusion is vacuous; the form inequality still quantifies over every function vanishing at , including the zero function. (8) Let , let and , and define when and otherwise. It is not the case that both for every and for every . (9) On the same , define if and otherwise, and if and otherwise. Then and are symmetric and for every with , but it is not the case that and are both symmetric and for every unrestricted .
Confirmed by the mission captain (proposal self-audit).