Torus-4 DFT Laplacian eigenmodes
ProvedFiniteReflectionPositivityMethodsI.torus4Eigenmodediscrete-fourier-transformfinite-dimensionalinfrared-boundreflection-positivitystatistical-mechanics
Let . For the explicitly tabulated four-point characters and the nearest-neighbor periodic graph Laplacian , every frequency and site satisfy the pointwise identity
where 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 sorrySource
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 and in , whose coordinates have values in , let and . Define the four complex-valued mode rows, listed in order at , by , , , and ; define ; and define , , and , with . The assertion is the complex-number equality
where the real scalar is viewed as a complex scalar.
Human review
Confirmed by the mission captain (proposal self-audit).