Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Split-weight reflection positivity

Proved
FiniteReflectionPositivityMethodsI.splitWeightReflectionPositivity

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

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

Let XXX, AAA, and III be finite types. For coefficients ca≥0c_a\ge0ca​≥0, features ϕa:X→R\phi_a:X\to\mathbb Rϕa​:X→R, and observables Fi:X→RF_i:X\to\mathbb RFi​:X→R, define

W(x,y)=∑a∈Acaϕa(x)ϕa(y),Kij=∑x,yW(x,y)Fi(x)Fj(y).W(x,y)=\sum_{a\in A}c_a\phi_a(x)\phi_a(y),\qquad K_{ij}=\sum_{x,y}W(x,y)F_i(x)F_j(y).W(x,y)=a∈A∑​ca​ϕa​(x)ϕa​(y),Kij​=x,y∑​W(x,y)Fi​(x)Fj​(y).

Then KKK is symmetric and positive semidefinite: for every u:I→Ru:I\to\mathbb Ru:I→R,

∑i,juiKijuj≥0.\sum_{i,j}u_iK_{ij}u_j\ge0.i,j∑​ui​Kij​uj​≥0.

This is the finite sum-of-squares engine of reflection positivity after a cross-plane weight has been supplied in nonnegative split form. It deliberately leaves the model-specific construction of such a feature expansion outside the claim.

Preamble
import Definitions.Def_FiniteReflectionPositivityMethodsI

open FiniteReflectionPositivityMethodsI
Formal statement
theorem FiniteReflectionPositivityMethodsI.splitWeightReflectionPositivity :
    SplitWeightReflectionPositivityGate := by sorry
Source
Finite Gram/split-weight formulation of the PSD interface in LeanProofs commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, lines 40-56: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean . Reflection-positive factorization background: Fröhlich--Israel--Lieb--Simon (1978), DOI 10.1007/BF01940327.
Read-back

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

For every possibly empty finite base-universe types XXX, AAA, and III, every coefficient function c:A→Rc:A\to\mathbb Rc:A→R, and every feature family ϕ:A→(X→R)\phi:A\to(X\to\mathbb R)ϕ:A→(X→R), assume c(a)≥0c(a)\ge0c(a)≥0 for every a∈Aa\in Aa∈A. Then, for every arbitrary observable family O:I→(X→R)O:I\to(X\to\mathbb R)O:I→(X→R), define

w(x,y)=∑a∈Ac(a)ϕa(x)ϕa(y),Kij=∑(x,y)∈X×Xw(x,y)Oi(x)Oj(y).w(x,y)=\sum_{a\in A}c(a)\phi_a(x)\phi_a(y),\qquad K_{ij}=\sum_{(x,y)\in X\times X}w(x,y)O_i(x)O_j(y).w(x,y)=a∈A∑​c(a)ϕa​(x)ϕa​(y),Kij​=(x,y)∈X×X∑​w(x,y)Oi​(x)Oj​(y).

The theorem asserts that KKK is positive semidefinite in the explicitly defined sense: Kij=KjiK_{ij}=K_{ji}Kij​=Kji​ for every i,j∈Ii,j\in Ii,j∈I, and for every function f:I→Rf:I\to\mathbb Rf:I→R,

0≤∑i∈I∑j∈If(i)Kijf(j).0\le\sum_{i\in I}\sum_{j\in I}f(i)K_{ij}f(j).0≤i∈I∑​j∈I∑​f(i)Kij​f(j).

The formula for KKK is the reflected kernel because reflection swaps (x,y)(x,y)(x,y) and the plus-lifted right observable consequently evaluates to Oj(y)O_j(y)Oj​(y). No boundedness, normalization, linear independence, or nonzero condition is imposed on the features or observables. If AAA is empty, the coefficient hypothesis is vacuous and www and KKK are zero; if XXX is empty, KKK is zero; and if III is empty, symmetry and the quadratic-form conclusion have only their empty or zero-sum content.

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