Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Zero-mode restriction control

Proved
FiniteReflectionPositivityMethodsI.zeroModeRestrictionControl

by lisamegawatts · Sep 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

discrete-fourier-transformfinite-dimensionalinfrared-boundreflection-positivitystatistical-mechanics

On the two-mode index set, let CCC be the identity matrix and let G=diag⁡(0,1)G=\operatorname{diag}(0,1)G=diag(0,1) remove the distinguished zero mode. Then

QC(f)≤QG(f)for every f with f(0)=0,Q_C(f)\le Q_G(f)\quad\text{for every }f\text{ with }f(0)=0,QC​(f)≤QG​(f)for every f with f(0)=0,

while full kernel domination of CCC by GGG 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.

Preamble
import Definitions.Def_FiniteReflectionPositivityMethodsI

open FiniteReflectionPositivityMethodsI
Formal statement
theorem FiniteReflectionPositivityMethodsI.zeroModeRestrictionControl :
    ZeroModeRestrictionControl := by sorry
Source
Mission-specific counterfixture correcting unrestricted zero-mode domination in LeanProofs, ReflectionPositivityInfraredBound.lean, commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, lines 141-212: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean
Read-back

What the Lean code literally says, in plain math · GPT-5-based Codex; exact deployment identifier is not exposed

Let F=Fin(2)={0,1}F=\mathrm{Fin}(2)=\{0,1\}F=Fin(2)={0,1}, let DDD be the real matrix with Dij=1D_{ij}=1Dij​=1 if i=ji=ji=j and Dij=0D_{ij}=0Dij​=0 otherwise, and let ZZZ be the real matrix with Zij=1Z_{ij}=1Zij​=1 if i=ji=ji=j and i≠0i\ne0i=0, and Zij=0Z_{ij}=0Zij​=0 otherwise. For any real matrix MMM on FFF and any f:F→Rf:F\to\mathbb Rf:F→R, write QM(f)=∑i∈F∑j∈Ff(i)Mijf(j)Q_M(f)=\sum_{i\in F}\sum_{j\in F}f(i)M_{ij}f(j)QM​(f)=∑i∈F​∑j∈F​f(i)Mij​f(j). The theorem is the conjunction of two assertions: first, Dij=DjiD_{ij}=D_{ji}Dij​=Dji​ and Zij=ZjiZ_{ij}=Z_{ji}Zij​=Zji​ for every i,j∈Fi,j\in Fi,j∈F, and QD(f)≤QZ(f)Q_D(f)\le Q_Z(f)QD​(f)≤QZ​(f) for every f:F→Rf:F\to\mathbb Rf:F→R satisfying f(0)=0f(0)=0f(0)=0; second, it is not the case that DDD and ZZZ are both symmetric and that QD(f)≤QZ(f)Q_D(f)\le Q_Z(f)QD​(f)≤QZ​(f) for every unrestricted function f:F→Rf:F\to\mathbb Rf:F→R. The restricted quantifier includes the zero function, while the unrestricted quantifier permits an arbitrary value at 000.

Human review
  • Endorsed by Shuze Chen · Sep 18, 2026

  • Endorsed by lisamegawatts · Sep 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me