Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite reflection-positivity claim boundary

Proved
FiniteReflectionPositivityMethodsI.claimBoundary

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

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

The finite reflection-positivity methods boundary is the conjunction of nine certified statements:

  1. the half-observable reflection binding;
  2. positive semidefiniteness for nonnegative split weights;
  3. the two-observable chessboard inequality;
  4. the exact Torus-4 DFT eigenmode equation;
  5. the typed nonnegative Torus-4 spectrum with only the constant zero mode;
  6. positive semidefiniteness of the diagonal free covariance for positive inverse temperature;
  7. the modewise infrared inequality on sources with zero constant component;
  8. the full-vertex reflection no-go control; and
  9. the zero-mode restriction control.

Equivalently, writing these gates as RP01,…,CT02\mathrm{RP01},\ldots,\mathrm{CT02}RP01,…,CT02, the goal is

RP01∧RP02∧RP03∧SP01∧SP02∧IR01∧IR02∧CT01∧CT02.\mathrm{RP01}\wedge\mathrm{RP02}\wedge\mathrm{RP03}\wedge\mathrm{SP01}\wedge\mathrm{SP02}\wedge\mathrm{IR01}\wedge\mathrm{IR02}\wedge\mathrm{CT01}\wedge\mathrm{CT02}.RP01∧RP02∧RP03∧SP01∧SP02∧IR01∧IR02∧CT01∧CT02.

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.

Preamble
import Definitions.Def_FiniteReflectionPositivityMethodsI

open FiniteReflectionPositivityMethodsI
Formal statement
theorem FiniteReflectionPositivityMethodsI.claimBoundary : ClaimBoundary := by sorry
Source
LeanProofs, ReflectionPositivityInfraredBound.lean, commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, lines 40-305: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean . The half-support and zero-mode countercontrols are mission-specific boundary corrections.
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 JJJ, a real matrix M:J×J→RM:J\times J\to\mathbb RM:J×J→R, and f:J→Rf:J\to\mathbb Rf:J→R, write QM(f)=∑i∈J∑j∈Jf(i)Mijf(j)Q_M(f)=\sum_{i\in J}\sum_{j\in J}f(i)M_{ij}f(j)QM​(f)=∑i∈J​∑j∈J​f(i)Mij​f(j). (1) For every finite type XXX, every function w:X→X→Rw:X\to X\to\mathbb Rw:X→X→R, and every l,r:X→Rl,r:X\to\mathbb Rl,r:X→R, one has ∑(x,y)∈X×Xw(x,y)l(x)r(y)=∑x∈X∑y∈Xw(x,y)l(x)r(y)\sum_{(x,y)\in X\times X}w(x,y)l(x)r(y)=\sum_{x\in X}\sum_{y\in X}w(x,y)l(x)r(y)∑(x,y)∈X×X​w(x,y)l(x)r(y)=∑x∈X​∑y∈X​w(x,y)l(x)r(y); the left side is obtained by lifting lll to the first coordinate, swapping the two coordinates, and then evaluating the similarly lifted rrr. (2) For every three finite types X,A,IX,A,IX,A,I, every pair of data c:A→Rc:A\to\mathbb Rc:A→R and u:A→X→Ru:A\to X\to\mathbb Ru:A→X→R, if c(a)≥0c(a)\ge0c(a)≥0 for every a∈Aa\in Aa∈A, then for every family v:I→X→Rv:I\to X\to\mathbb Rv:I→X→R the matrix KKK given by Kij=∑x∈X∑y∈X(∑a∈Ac(a)u(a,x)u(a,y))v(i,x)v(j,y)K_{ij}=\sum_{x\in X}\sum_{y\in X}\bigl(\sum_{a\in A}c(a)u(a,x)u(a,y)\bigr)v(i,x)v(j,y)Kij​=∑x∈X​∑y∈X​(∑a∈A​c(a)u(a,x)u(a,y))v(i,x)v(j,y) satisfies Kij=KjiK_{ij}=K_{ji}Kij​=Kji​ for all i,j∈Ii,j\in Ii,j∈I and QK(f)≥0Q_K(f)\ge0QK​(f)≥0 for every f:I→Rf:I\to\mathbb Rf:I→R. The finite types quantified in (1) and (2), including XXX, AAA, and III, may be empty, so coefficient assumptions, sums, or universal conclusions can be vacuous or empty as appropriate. (3) For every finite type III and every real matrix KKK on III, if Kij=KjiK_{ij}=K_{ji}Kij​=Kji​ for all i,j∈Ii,j\in Ii,j∈I and QK(f)≥0Q_K(f)\ge0QK​(f)≥0 for every f:I→Rf:I\to\mathbb Rf:I→R, then Kij 2≤KiiKjjK_{ij}^{\,2}\le K_{ii}K_{jj}Kij2​≤Kii​Kjj​ for every i,j∈Ii,j\in Ii,j∈I; when III 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 C=Fin(4)={0,1,2,3}C=\mathrm{Fin}(4)=\{0,1,2,3\}C=Fin(4)={0,1,2,3} and T=C×CT=C\times CT=C×C. For x∈Cx\in Cx∈C, put x+=(x+1) mod 4x^+=(x+1)\bmod4x+=(x+1)mod4 and x−=(x+3) mod 4x^-=(x+3)\bmod4x−=(x+3)mod4. Define d:C×C→Cd:C\times C\to\mathbb Cd:C×C→C by d(0,x)=1d(0,x)=1d(0,x)=1 for every xxx; (d(1,0),d(1,1),d(1,2),d(1,3))=(1,i,−1,−i)(d(1,0),d(1,1),d(1,2),d(1,3))=(1,\mathrm i,-1,-\mathrm i)(d(1,0),d(1,1),d(1,2),d(1,3))=(1,i,−1,−i); (d(2,0),d(2,1),d(2,2),d(2,3))=(1,−1,1,−1)(d(2,0),d(2,1),d(2,2),d(2,3))=(1,-1,1,-1)(d(2,0),d(2,1),d(2,2),d(2,3))=(1,−1,1,−1); and (d(3,0),d(3,1),d(3,2),d(3,3))=(1,−i,−1,i)(d(3,0),d(3,1),d(3,2),d(3,3))=(1,-\mathrm i,-1,\mathrm i)(d(3,0),d(3,1),d(3,2),d(3,3))=(1,−i,−1,i). Put e(0)=0e(0)=0e(0)=0, e(2)=4e(2)=4e(2)=4, and e(1)=e(3)=2e(1)=e(3)=2e(1)=e(3)=2; for k=(k1,k2)k=(k_1,k_2)k=(k1​,k2​) and x=(x1,x2)x=(x_1,x_2)x=(x1​,x2​) in TTT, put ϕk(x)=d(k1,x1)d(k2,x2)\phi_k(x)=d(k_1,x_1)d(k_2,x_2)ϕk​(x)=d(k1​,x1​)d(k2​,x2​) and λ(k)=e(k1)+e(k2)\lambda(k)=e(k_1)+e(k_2)λ(k)=e(k1​)+e(k2​). Then, for every k,x∈Tk,x\in Tk,x∈T, 4ϕk(x)−ϕk(x1+,x2)−ϕk(x1−,x2)−ϕk(x1,x2+)−ϕk(x1,x2−)=λ(k)ϕk(x)4\phi_k(x)-\phi_k(x_1^+,x_2)-\phi_k(x_1^-,x_2)-\phi_k(x_1,x_2^+)-\phi_k(x_1,x_2^-)=\lambda(k)\phi_k(x)4ϕk​(x)−ϕk​(x1+​,x2​)−ϕk​(x1−​,x2​)−ϕk​(x1​,x2+​)−ϕk​(x1​,x2−​)=λ(k)ϕk​(x), with the real number λ(k)\lambda(k)λ(k) regarded as a complex scalar on the right. (5) For the same explicit TTT and λ\lambdaλ, one has λ(k)≥0\lambda(k)\ge0λ(k)≥0 for every k∈Tk\in Tk∈T and λ(k)=0\lambda(k)=0λ(k)=0 if and only if k=(0,0)k=(0,0)k=(0,0); moreover, there exists a structure containing a function E:T→RE:T\to\mathbb RE:T→R together with proofs that E(k)≥0E(k)\ge0E(k)≥0 for every kkk and E(k)=0E(k)=0E(k)=0 if and only if k=(0,0)k=(0,0)k=(0,0), such that E=λE=\lambdaE=λ as functions. (6) For every finite type III equipped with decidable equality and a chosen element 0∈I0\in I0∈I, every real β\betaβ, and every structure consisting of a function E:I→RE:I\to\mathbb RE:I→R with E(k)≥0E(k)\ge0E(k)≥0 for all kkk and E(k)=0E(k)=0E(k)=0 if and only if k=0k=0k=0, if β>0\beta>0β>0, define GGG by Gkq=0G_{kq}=0Gkq​=0 when k≠qk\ne qk=q, G00=0G_{00}=0G00​=0, and Gkk=1/(βE(k))G_{kk}=1/(\beta E(k))Gkk​=1/(βE(k)) when k≠0k\ne0k=0. Then Gkq=GqkG_{kq}=G_{qk}Gkq​=Gqk​ for every k,q∈Ik,q\in Ik,q∈I and QG(f)≥0Q_G(f)\ge0QG​(f)≥0 for every f:I→Rf:I\to\mathbb Rf:I→R. The division is real division, which is a total operation, although the stated spectrum conditions and β>0\beta>0β>0 force βE(k)>0\beta E(k)>0βE(k)>0 at each k≠0k\ne0k=0. (7) For every finite type III equipped with decidable equality and a chosen element 0∈I0\in I0∈I, every β∈R\beta\in\mathbb Rβ∈R, every such spectrum function EEE with its nonnegativity and zero-set proofs, and every real matrix CCC on III, let GGG be the matrix from (6). If β>0\beta>0β>0, Cij=CjiC_{ij}=C_{ji}Cij​=Cji​ and Gij=GjiG_{ij}=G_{ji}Gij​=Gji​ for every i,j∈Ii,j\in Ii,j∈I, and QC(f)≤QG(f)Q_C(f)\le Q_G(f)QC​(f)≤QG​(f) for every f:I→Rf:I\to\mathbb Rf:I→R satisfying f(0)=0f(0)=0f(0)=0, then Ckk≤1/(βE(k))C_{kk}\le1/(\beta E(k))Ckk​≤1/(βE(k)) for every k∈Ik\in Ik∈I with k≠0k\ne0k=0. A chosen zero element makes these types nonempty, but if no element distinct from 000 exists, the final conclusion is vacuous; the form inequality still quantifies over every function vanishing at 000, including the zero function. (8) Let F=Fin(2)F=\mathrm{Fin}(2)F=Fin(2), let s(0)=1s(0)=1s(0)=1 and s(1)=0s(1)=0s(1)=0, and define Rij=1R_{ij}=1Rij​=1 when i=s(j)i=s(j)i=s(j) and Rij=0R_{ij}=0Rij​=0 otherwise. It is not the case that both Rij=RjiR_{ij}=R_{ji}Rij​=Rji​ for every i,j∈Fi,j\in Fi,j∈F and QR(f)≥0Q_R(f)\ge0QR​(f)≥0 for every f:F→Rf:F\to\mathbb Rf:F→R. (9) On the same FFF, define Dij=1D_{ij}=1Dij​=1 if i=ji=ji=j and 000 otherwise, and Zij=1Z_{ij}=1Zij​=1 if i=j≠0i=j\ne0i=j=0 and 000 otherwise. Then DDD and ZZZ are symmetric 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 with f(0)=0f(0)=0f(0)=0, but it is not the case that DDD and ZZZ are both symmetric and QD(f)≤QZ(f)Q_D(f)\le Q_Z(f)QD​(f)≤QZ​(f) for every unrestricted f:F→Rf:F\to\mathbb Rf:F→R.

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