Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Torus-4 DFT Laplacian eigenmodes

Proved
FiniteReflectionPositivityMethodsI.torus4Eigenmode

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

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

Let Torus4=(Fin 4)2\mathrm{Torus4}=(\mathrm{Fin}\,4)^2Torus4=(Fin4)2. For the explicitly tabulated four-point characters ψk\psi_kψk​ and the nearest-neighbor periodic graph Laplacian ΔT4\Delta_{\mathrm{T4}}ΔT4​, every frequency kkk and site xxx satisfy the pointwise identity

(ΔT4ψk)(x)=λkψk(x),(\Delta_{\mathrm{T4}}\psi_k)(x)=\lambda_k\psi_k(x),(ΔT4​ψk​)(x)=λk​ψk​(x),

where λk\lambda_kλk​ is the sum of the two registered four-cycle eigenvalues. This theorem exposes an eigenvalue equation, not merely a commuting-square or pseudospectral multiplier, for direct use by the infrared API.

Preamble
import Definitions.Def_FiniteReflectionPositivityMethodsI

open FiniteReflectionPositivityMethodsI
Formal statement
theorem FiniteReflectionPositivityMethodsI.torus4Eigenmode :
    Torus4EigenmodeGate := by sorry
Source
LeanProofs, ReflectionPositivityInfraredBound.lean, commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, lines 216-288: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean
Read-back

What the Lean code literally says, in plain math · gpt-5

For every k=(k1,k2)k=(k_1,k_2)k=(k1​,k2​) and x=(x1,x2)x=(x_1,x_2)x=(x1​,x2​) in T=(Fin⁡4)2T=(\operatorname{Fin}4)^2T=(Fin4)2, whose coordinates have values in {0,1,2,3}\{0,1,2,3\}{0,1,2,3}, let n(r)=(r+1) mod 4n(r)=(r+1)\bmod 4n(r)=(r+1)mod4 and p(r)=(r+3) mod 4p(r)=(r+3)\bmod 4p(r)=(r+3)mod4. Define the four complex-valued mode rows, listed in order at x=0,1,2,3x=0,1,2,3x=0,1,2,3, by m0=(1,1,1,1)m_0=(1,1,1,1)m0​=(1,1,1,1), m1=(1,i,−1,−i)m_1=(1,i,-1,-i)m1​=(1,i,−1,−i), m2=(1,−1,1,−1)m_2=(1,-1,1,-1)m2​=(1,−1,1,−1), and m3=(1,−i,−1,i)m_3=(1,-i,-1,i)m3​=(1,−i,−1,i); define ϕk(x)=mk1(x1)mk2(x2)\phi_k(x)=m_{k_1}(x_1)m_{k_2}(x_2)ϕk​(x)=mk1​​(x1​)mk2​​(x2​); and define λC(0)=0\lambda_C(0)=0λC​(0)=0, λC(2)=4\lambda_C(2)=4λC​(2)=4, and λC(1)=λC(3)=2\lambda_C(1)=\lambda_C(3)=2λC​(1)=λC​(3)=2, with λT(k)=λC(k1)+λC(k2)\lambda_T(k)=\lambda_C(k_1)+\lambda_C(k_2)λT​(k)=λC​(k1​)+λC​(k2​). The assertion is the complex-number equality

4ϕk(x)−ϕk(n(x1),x2)−ϕk(p(x1),x2)−ϕk(x1,n(x2))−ϕk(x1,p(x2))=λT(k)ϕk(x),4\phi_k(x)-\phi_k(n(x_1),x_2)-\phi_k(p(x_1),x_2)-\phi_k(x_1,n(x_2))-\phi_k(x_1,p(x_2))=\lambda_T(k)\phi_k(x),4ϕk​(x)−ϕk​(n(x1​),x2​)−ϕk​(p(x1​),x2​)−ϕk​(x1​,n(x2​))−ϕk​(x1​,p(x2​))=λT​(k)ϕk​(x),

where the real scalar λT(k)\lambda_T(k)λT​(k) is viewed as a complex scalar.

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