Zero-mode restriction control
ProvedFiniteReflectionPositivityMethodsI.zeroModeRestrictionControlOn the two-mode index set, let be the identity matrix and let remove the distinguished zero mode. Then
while full kernel domination of by is false. This counterfixture certifies that the source restriction in the infrared comparison is logically load-bearing whenever the comparison covariance is defined to vanish at the constant mode.
import Definitions.Def_FiniteReflectionPositivityMethodsI open FiniteReflectionPositivityMethodsI
theorem FiniteReflectionPositivityMethodsI.zeroModeRestrictionControl :
ZeroModeRestrictionControl := by sorryRead-back
What the Lean code literally says, in plain math · GPT-5-based Codex; exact deployment identifier is not exposed
Let , let be the real matrix with if and otherwise, and let be the real matrix with if and , and otherwise. For any real matrix on and any , write . The theorem is the conjunction of two assertions: first, and for every , and for every satisfying ; second, it is not the case that and are both symmetric and that for every unrestricted function . The restricted quantifier includes the zero function, while the unrestricted quantifier permits an arbitrary value at .
Confirmed by the mission captain (proposal self-audit).